%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN656-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:35:27 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 13 unt; 3 nHn; 22 RR)
% Number of literals : 64 ( 0 equ; 32 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p25_46,negated_conjecture,
( ~ p25(f5(f7(c28,X1),X4),X3)
| ~ p25(f5(X1,X2),X4)
| p25(f5(f7(c28,X1),X2),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p25_46) ).
cnf(p25_31,negated_conjecture,
p25(f5(c29,f13(c31,f15(c32,X1))),f13(c31,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p25_31) ).
cnf(p3_22,negated_conjecture,
( ~ p3(X3,X2)
| ~ p3(X3,X1)
| p3(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_22) ).
cnf(not_p25_45,negated_conjecture,
~ p25(f5(f7(c28,c29),f13(c31,f15(c32,f15(f17(c33,c34),c35)))),f13(c31,c34)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p25_45) ).
cnf(p3_49,negated_conjecture,
( p25(f5(f7(c28,c29),f13(c31,f15(f17(c33,c34),X1))),f13(c31,c34))
| p3(f13(c31,c34),f13(c31,f15(f17(c33,c34),X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_49) ).
cnf(p25_35,negated_conjecture,
( ~ p25(X4,X3)
| ~ p4(X4,X1)
| ~ p3(X3,X2)
| p25(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p25_35) ).
cnf(p3_6,negated_conjecture,
p3(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_6) ).
cnf(p4_5,negated_conjecture,
p4(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_5) ).
cnf(p25_32,negated_conjecture,
( ~ p25(f5(X1,X2),X3)
| p25(f5(f7(c28,X1),X2),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p25_32) ).
cnf(c_0_9,negated_conjecture,
( ~ p25(f5(f7(c28,X1),X4),X3)
| ~ p25(f5(X1,X2),X4)
| p25(f5(f7(c28,X1),X2),X3) ),
inference(fof_simplification,[status(thm)],[p25_46]) ).
cnf(c_0_10,negated_conjecture,
( ~ p25(f5(f7(c28,X1),X4),X3)
| ~ p25(f5(X1,X2),X4)
| p25(f5(f7(c28,X1),X2),X3) ),
c_0_9 ).
cnf(c_0_11,negated_conjecture,
p25(f5(c29,f13(c31,f15(c32,X1))),f13(c31,X1)),
p25_31 ).
cnf(c_0_12,negated_conjecture,
( ~ p3(X3,X2)
| ~ p3(X3,X1)
| p3(X1,X2) ),
inference(fof_simplification,[status(thm)],[p3_22]) ).
cnf(c_0_13,negated_conjecture,
~ p25(f5(f7(c28,c29),f13(c31,f15(c32,f15(f17(c33,c34),c35)))),f13(c31,c34)),
inference(fof_simplification,[status(thm)],[not_p25_45]) ).
cnf(c_0_14,negated_conjecture,
( ~ p25(f5(f7(c28,c29),f13(c31,X1)),X2)
| p25(f5(f7(c28,c29),f13(c31,f15(c32,X1))),X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( p25(f5(f7(c28,c29),f13(c31,f15(f17(c33,c34),X1))),f13(c31,c34))
| p3(f13(c31,c34),f13(c31,f15(f17(c33,c34),X1))) ),
p3_49 ).
cnf(c_0_16,negated_conjecture,
( ~ p25(X4,X3)
| ~ p4(X4,X1)
| ~ p3(X3,X2)
| p25(X1,X2) ),
inference(fof_simplification,[status(thm)],[p25_35]) ).
cnf(c_0_17,negated_conjecture,
( ~ p3(X3,X2)
| ~ p3(X3,X1)
| p3(X1,X2) ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
p3(X1,X1),
p3_6 ).
cnf(c_0_19,negated_conjecture,
~ p25(f5(f7(c28,c29),f13(c31,f15(c32,f15(f17(c33,c34),c35)))),f13(c31,c34)),
c_0_13 ).
cnf(c_0_20,negated_conjecture,
( p3(f13(c31,c34),f13(c31,f15(f17(c33,c34),X1)))
| p25(f5(f7(c28,c29),f13(c31,f15(c32,f15(f17(c33,c34),X1)))),f13(c31,c34)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( ~ p25(X4,X3)
| ~ p4(X4,X1)
| ~ p3(X3,X2)
| p25(X1,X2) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
p4(X1,X1),
p4_5 ).
cnf(c_0_23,negated_conjecture,
( ~ p3(X2,X1)
| p3(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
p3(f13(c31,c34),f13(c31,f15(f17(c33,c34),c35))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ p25(f5(X1,X2),X3)
| p25(f5(f7(c28,X1),X2),X3) ),
inference(fof_simplification,[status(thm)],[p25_32]) ).
cnf(c_0_26,negated_conjecture,
( ~ p3(X3,X2)
| ~ p25(X1,X3)
| p25(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
p3(f13(c31,f15(f17(c33,c34),c35)),f13(c31,c34)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( ~ p25(f5(X1,X2),X3)
| p25(f5(f7(c28,X1),X2),X3) ),
c_0_25 ).
cnf(c_0_29,negated_conjecture,
( ~ p25(X1,f13(c31,f15(f17(c33,c34),c35)))
| p25(X1,f13(c31,c34)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
p25(f5(f7(c28,c29),f13(c31,f15(c32,X1))),f13(c31,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_11]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN656-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 11:12:02 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.15/0.46 % Version: 3.5.1
% 0.15/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2783138 completed with status 0
% 0.15/0.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46 % No SInE strategy applied
% 0.15/0.46 % Search class: FGUNM-FFMF22-MFFFFFNN
% 0.15/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.46 % new_bool_1 with pid 2783146 completed with status 0
% 0.15/0.46 % Result found by new_bool_1
% 0.15/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46 % No SInE strategy applied
% 0.15/0.46 % Search class: FGUNM-FFMF22-MFFFFFNN
% 0.15/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.46 % Preprocessing time : 0.001 s
% 0.15/0.46 % Presaturation interreduction done
% 0.15/0.46
% 0.15/0.46 % Proof found!
% 0.15/0.46 % SZS status Unsatisfiable
% 0.15/0.46 % SZS output start CNFRefutation
% See solution above
% 0.15/0.47 % Parsed axioms : 49
% 0.15/0.47 % Removed by relevancy pruning/SinE : 0
% 0.15/0.47 % Initial clauses : 49
% 0.15/0.47 % Removed in clause preprocessing : 0
% 0.15/0.47 % Initial clauses in saturation : 49
% 0.15/0.47 % Processed clauses : 163
% 0.15/0.47 % ...of these trivial : 4
% 0.15/0.47 % ...subsumed : 1
% 0.15/0.47 % ...remaining for further processing : 158
% 0.15/0.47 % Other redundant clauses eliminated : 0
% 0.15/0.47 % Clauses deleted for lack of memory : 0
% 0.15/0.47 % Backward-subsumed : 0
% 0.15/0.47 % Backward-rewritten : 0
% 0.15/0.47 % Generated clauses : 227
% 0.15/0.47 % ...of the previous two non-redundant : 152
% 0.15/0.47 % ...aggressively subsumed : 0
% 0.15/0.47 % Contextual simplify-reflections : 0
% 0.15/0.47 % Paramodulations : 227
% 0.15/0.47 % Factorizations : 0
% 0.15/0.47 % NegExts : 0
% 0.15/0.47 % Equation resolutions : 0
% 0.15/0.47 % Disequality decompositions : 0
% 0.15/0.47 % Total rewrite steps : 62
% 0.15/0.47 % ...of those cached : 20
% 0.15/0.47 % Propositional unsat checks : 0
% 0.15/0.47 % Propositional check models : 0
% 0.15/0.47 % Propositional check unsatisfiable : 0
% 0.15/0.47 % Propositional clauses : 0
% 0.15/0.47 % Propositional clauses after purity: 0
% 0.15/0.47 % Propositional unsat core size : 0
% 0.15/0.47 % Propositional preprocessing time : 0.000
% 0.15/0.47 % Propositional encoding time : 0.000
% 0.15/0.47 % Propositional solver time : 0.000
% 0.15/0.47 % Success case prop preproc time : 0.000
% 0.15/0.47 % Success case prop encoding time : 0.000
% 0.15/0.47 % Success case prop solver time : 0.000
% 0.15/0.47 % Current number of processed clauses : 110
% 0.15/0.47 % Positive orientable unit clauses : 33
% 0.15/0.47 % Positive unorientable unit clauses: 0
% 0.15/0.47 % Negative unit clauses : 2
% 0.15/0.47 % Non-unit-clauses : 75
% 0.15/0.47 % Current number of unprocessed clauses: 86
% 0.15/0.47 % ...number of literals in the above : 132
% 0.15/0.47 % Current number of archived formulas : 0
% 0.15/0.47 % Current number of archived clauses : 48
% 0.15/0.47 % Clause-clause subsumption calls (NU) : 1105
% 0.15/0.47 % Rec. Clause-clause subsumption calls : 1075
% 0.15/0.47 % Non-unit clause-clause subsumptions : 1
% 0.15/0.47 % Unit Clause-clause subsumption calls : 15
% 0.15/0.47 % Rewrite failures with RHS unbound : 0
% 0.15/0.47 % BW rewrite match attempts : 145
% 0.15/0.47 % BW rewrite match successes : 0
% 0.15/0.47 % Condensation attempts : 0
% 0.15/0.47 % Condensation successes : 0
% 0.15/0.47 % Termbank termtop insertions : 8623
% 0.15/0.47 % Search garbage collected termcells : 152
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.014 s
% 0.15/0.47 % System time : 0.002 s
% 0.15/0.47 % Total time : 0.016 s
% 0.15/0.47 % Maximum resident set size: 3428 pages
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.076 s
% 0.15/0.47 % System time : 0.017 s
% 0.15/0.47 % Total time : 0.093 s
% 0.15/0.47 % Maximum resident set size: 4608 pages
% 0.15/0.47 % E exiting
%------------------------------------------------------------------------------