## TSTP Solution File: SYN053-1 by E---3.0

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : E---3.0
% Problem  : SYN053-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 29 21:37:31 EDT 2022

% Result   : Unsatisfiable 0.20s 0.48s
% Output   : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   17 (   5 unt;   4 typ;   0 def)
%            Number of atoms       :   25 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  10   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    1 (   1   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   10 (  10 sgn   0   !;   0   ?;   0   :)

%------------------------------------------------------------------------------
tff(decl_22,type,
p: \$o ).

tff(decl_23,type,
big_f: \$i > \$o ).

tff(decl_24,type,
b: \$i ).

tff(decl_25,type,
a: \$i ).

cnf(clause_4,negated_conjecture,
( p
| big_f(X1)
| ~ big_f(a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_3,negated_conjecture,
~ p,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_1,negated_conjecture,
( p
| big_f(X1)
| big_f(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_5,negated_conjecture,
( ~ big_f(a)
| ~ big_f(b) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

cnf(c_0_4,negated_conjecture,
( p
| big_f(X1)
| ~ big_f(a) ),
clause_4 ).

cnf(c_0_5,negated_conjecture,
~ p,
clause_3 ).

cnf(c_0_6,negated_conjecture,
( p
| big_f(X1)
| big_f(X2) ),
clause_1 ).

cnf(c_0_7,negated_conjecture,
( ~ big_f(a)
| ~ big_f(b) ),
clause_5 ).

cnf(c_0_8,negated_conjecture,
( big_f(X1)
| ~ big_f(a) ),
inference(sr,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_9,negated_conjecture,
( big_f(X1)
| big_f(X2) ),
inference(sr,[status(thm)],[c_0_6,c_0_5]) ).

cnf(c_0_10,negated_conjecture,
~ big_f(a),
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
big_f(X1),
inference(ef,[status(thm)],[c_0_9]) ).

cnf(c_0_12,negated_conjecture,
\$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),
[proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN053-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n010.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Sep  5 01:18:27 EDT 2022
% 0.13/0.34  % CPUTime    :
% 0.20/0.47  Running first-order on 8 cores theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47  # Version: 3.0pre003
% 0.20/0.48  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48  # Starting sh5l with 300s (1) cores
% 0.20/0.48  # new_bool_1 with pid 6405 completed with status 0
% 0.20/0.48  # Result found by new_bool_1
% 0.20/0.48  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48  # ...ProofStateSinE()=5/5
% 0.20/0.48  # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.20/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48  # SAT001_MinMin_p005000_rr_RG with pid 6407 completed with status 0
% 0.20/0.48  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.48  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48  # ...ProofStateSinE()=5/5
% 0.20/0.48  # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.20/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48  # Preprocessing time       : 0.001 s
% 0.20/0.48  # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48  # Proof found!
% 0.20/0.48  # SZS status Unsatisfiable
% 0.20/0.48  # SZS output start CNFRefutation
% See solution above
% 0.20/0.48  # Parsed axioms                        : 5
% 0.20/0.48  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.48  # Initial clauses                      : 5
% 0.20/0.48  # Removed in clause preprocessing      : 0
% 0.20/0.48  # Initial clauses in saturation        : 5
% 0.20/0.48  # Processed clauses                    : 10
% 0.20/0.48  # ...of these trivial                  : 0
% 0.20/0.48  # ...subsumed                          : 0
% 0.20/0.48  # ...remaining for further processing  : 10
% 0.20/0.48  # Other redundant clauses eliminated   : 0
% 0.20/0.48  # Clauses deleted for lack of memory   : 0
% 0.20/0.48  # Backward-subsumed                    : 3
% 0.20/0.48  # Backward-rewritten                   : 1
% 0.20/0.48  # Generated clauses                    : 4
% 0.20/0.48  # ...of the previous two non-redundant : 4
% 0.20/0.48  # ...aggressively subsumed             : 0
% 0.20/0.48  # Contextual simplify-reflections      : 1
% 0.20/0.48  # Paramodulations                      : 2
% 0.20/0.48  # Factorizations                       : 2
% 0.20/0.48  # NegExts                              : 0
% 0.20/0.48  # Equation resolutions                 : 0
% 0.20/0.48  # Propositional unsat checks           : 0
% 0.20/0.48  #    Propositional check models        : 0
% 0.20/0.48  #    Propositional check unsatisfiable : 0
% 0.20/0.48  #    Propositional clauses             : 0
% 0.20/0.48  #    Propositional clauses after purity: 0
% 0.20/0.48  #    Propositional unsat core size     : 0
% 0.20/0.48  #    Propositional preprocessing time  : 0.000
% 0.20/0.48  #    Propositional encoding time       : 0.000
% 0.20/0.48  #    Propositional solver time         : 0.000
% 0.20/0.48  #    Success case prop preproc time    : 0.000
% 0.20/0.48  #    Success case prop encoding time   : 0.000
% 0.20/0.48  #    Success case prop solver time     : 0.000
% 0.20/0.48  # Current number of processed clauses  : 2
% 0.20/0.48  #    Positive orientable unit clauses  : 1
% 0.20/0.48  #    Positive unorientable unit clauses: 0
% 0.20/0.48  #    Negative unit clauses             : 1
% 0.20/0.48  #    Non-unit-clauses                  : 0
% 0.20/0.48  # Current number of unprocessed clauses: 3
% 0.20/0.48  # ...number of literals in the above   : 3
% 0.20/0.48  # Current number of archived formulas  : 0
% 0.20/0.48  # Current number of archived clauses   : 8
% 0.20/0.48  # Clause-clause subsumption calls (NU) : 2
% 0.20/0.48  # Rec. Clause-clause subsumption calls : 2
% 0.20/0.48  # Non-unit clause-clause subsumptions  : 2
% 0.20/0.48  # Unit Clause-clause subsumption calls : 2
% 0.20/0.48  # Rewrite failures with RHS unbound    : 0
% 0.20/0.48  # BW rewrite match attempts            : 3
% 0.20/0.48  # BW rewrite match successes           : 3
% 0.20/0.48  # Condensation attempts                : 0
% 0.20/0.48  # Condensation successes               : 0
% 0.20/0.48  # Termbank termtop insertions          : 136
% 0.20/0.48
% 0.20/0.48  # -------------------------------------------------
% 0.20/0.48  # User time                : 0.001 s
% 0.20/0.48  # System time              : 0.002 s
% 0.20/0.48  # Total time               : 0.003 s
% 0.20/0.48  # Maximum resident set size: 1644 pages
% 0.20/0.48
% 0.20/0.48  # -------------------------------------------------
% 0.20/0.48  # User time                : 0.002 s
% 0.20/0.48  # System time              : 0.003 s
% 0.20/0.48  # Total time               : 0.006 s
% 0.20/0.48  # Maximum resident set size: 1700 pages
%------------------------------------------------------------------------------
```