%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN572-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 : n019.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:25:38 PM UTC 2026
% Result : Unsatisfiable 10.93s 2.09s
% Output : CNFRefutation 10.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 50 ( 26 unt; 0 nHn; 26 RR)
% Number of literals : 91 ( 0 equ; 44 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 113 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p2_12,negated_conjecture,
( ~ p2(X3,X2)
| ~ p2(X3,X1)
| p2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_12) ).
cnf(p2_1,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_1) ).
cnf(p2_20,negated_conjecture,
( ~ p2(X2,X4)
| ~ p2(X1,X3)
| p2(f3(X1,X2),f3(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_20) ).
cnf(p2_11,negated_conjecture,
p2(f3(X1,f9(X1)),f5(f7(f8(c13)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_11) ).
cnf(p12_18,negated_conjecture,
( ~ p12(X3,X4)
| ~ p4(X4,X2)
| ~ p4(X3,X1)
| p12(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_18) ).
cnf(p4_19,negated_conjecture,
( ~ p4(X2,X4)
| ~ p4(X1,X3)
| p4(f11(X1,X2),f11(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_19) ).
cnf(p12_15,negated_conjecture,
p12(f10(f3(X1,X2)),f11(f10(X1),f10(X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_15) ).
cnf(p4_4,negated_conjecture,
p4(f10(f9(X1)),f10(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_4) ).
cnf(p2_5,negated_conjecture,
p2(f3(X1,f5(f7(f8(c13)))),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_5) ).
cnf(p4_3,negated_conjecture,
p4(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_3) ).
cnf(p4_9,negated_conjecture,
( ~ p2(X1,X2)
| p4(f10(X1),f10(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_9) ).
cnf(p2_17,negated_conjecture,
p2(f3(X1,f3(X2,X3)),f3(f3(X1,X2),X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_17) ).
cnf(not_p12_16,negated_conjecture,
~ p12(f10(c14),f11(f10(f3(c14,c15)),f10(c15))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p12_16) ).
cnf(c_0_13,negated_conjecture,
( ~ p2(X3,X2)
| ~ p2(X3,X1)
| p2(X1,X2) ),
inference(fof_simplification,[status(thm)],[p2_12]) ).
cnf(c_0_14,negated_conjecture,
( ~ p2(X3,X2)
| ~ p2(X3,X1)
| p2(X1,X2) ),
c_0_13 ).
cnf(c_0_15,negated_conjecture,
p2(X1,X1),
p2_1 ).
cnf(c_0_16,negated_conjecture,
( ~ p2(X2,X4)
| ~ p2(X1,X3)
| p2(f3(X1,X2),f3(X3,X4)) ),
inference(fof_simplification,[status(thm)],[p2_20]) ).
cnf(c_0_17,negated_conjecture,
( ~ p2(X2,X1)
| p2(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
p2(f3(X1,f9(X1)),f5(f7(f8(c13)))),
p2_11 ).
cnf(c_0_19,negated_conjecture,
( ~ p12(X3,X4)
| ~ p4(X4,X2)
| ~ p4(X3,X1)
| p12(X1,X2) ),
inference(fof_simplification,[status(thm)],[p12_18]) ).
cnf(c_0_20,negated_conjecture,
( ~ p4(X2,X4)
| ~ p4(X1,X3)
| p4(f11(X1,X2),f11(X3,X4)) ),
inference(fof_simplification,[status(thm)],[p4_19]) ).
cnf(c_0_21,negated_conjecture,
( ~ p2(X2,X4)
| ~ p2(X1,X3)
| p2(f3(X1,X2),f3(X3,X4)) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
p2(f5(f7(f8(c13))),f3(X1,f9(X1))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( ~ p12(X3,X4)
| ~ p4(X4,X2)
| ~ p4(X3,X1)
| p12(X1,X2) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
p12(f10(f3(X1,X2)),f11(f10(X1),f10(X2))),
p12_15 ).
cnf(c_0_25,negated_conjecture,
( ~ p4(X2,X4)
| ~ p4(X1,X3)
| p4(f11(X1,X2),f11(X3,X4)) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
p4(f10(f9(X1)),f10(X1)),
p4_4 ).
cnf(c_0_27,negated_conjecture,
p2(f3(X1,f5(f7(f8(c13)))),X1),
p2_5 ).
cnf(c_0_28,negated_conjecture,
( ~ p2(X1,X2)
| p2(f3(X1,f5(f7(f8(c13)))),f3(X2,f3(X3,f9(X3)))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ p4(f10(f3(X3,X4)),X1)
| ~ p4(f11(f10(X3),f10(X4)),X2)
| p12(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
p4(X1,X1),
p4_3 ).
cnf(c_0_31,negated_conjecture,
( ~ p4(X1,X3)
| p4(f11(X1,f10(f9(X2))),f11(X3,f10(X2))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( ~ p2(f3(X2,f5(f7(f8(c13)))),X1)
| p2(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
p2(f3(X1,f5(f7(f8(c13)))),f3(X1,f3(X2,f9(X2)))),
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
cnf(c_0_34,negated_conjecture,
( ~ p4(f11(f10(X1),f10(X2)),X3)
| p12(f10(f3(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
p4(f11(X1,f10(f9(X2))),f11(X1,f10(X2))),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
p2(f3(X1,f3(X2,f9(X2))),X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
p12(f10(f3(X1,f9(X2))),f11(f10(X1),f10(X2))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( ~ p2(X1,X2)
| p4(f10(X1),f10(X2)) ),
inference(fof_simplification,[status(thm)],[p4_9]) ).
cnf(c_0_39,negated_conjecture,
( ~ p2(f3(X2,f3(X3,f9(X3))),X1)
| p2(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
p2(f3(X1,f3(X2,X3)),f3(f3(X1,X2),X3)),
p2_17 ).
cnf(c_0_41,negated_conjecture,
( ~ p4(f10(f3(X3,f9(X4))),X1)
| ~ p4(f11(f10(X3),f10(X4)),X2)
| p12(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( ~ p2(X1,X2)
| p4(f10(X1),f10(X2)) ),
c_0_38 ).
cnf(c_0_43,negated_conjecture,
p2(f3(f3(X1,X2),f9(X2)),X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
~ p12(f10(c14),f11(f10(f3(c14,c15)),f10(c15))),
inference(fof_simplification,[status(thm)],[not_p12_16]) ).
cnf(c_0_45,negated_conjecture,
( ~ p4(f10(f3(X2,f9(X3))),X1)
| p12(X1,f11(f10(X2),f10(X3))) ),
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
cnf(c_0_46,negated_conjecture,
p4(f10(f3(f3(X1,X2),f9(X2))),f10(X1)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
~ p12(f10(c14),f11(f10(f3(c14,c15)),f10(c15))),
c_0_44 ).
cnf(c_0_48,negated_conjecture,
p12(f10(X1),f11(f10(f3(X1,X2)),f10(X2))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN572-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.09/0.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 11:09:06 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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
% 10.93/2.09 % Version: 3.5.1
% 10.93/2.09 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.93/2.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.93/2.09 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.93/2.09 % Starting new_bool_3 with 300s (1) cores
% 10.93/2.09 % Starting new_bool_1 with 300s (1) cores
% 10.93/2.09 % Starting sh5l with 300s (1) cores
% 10.93/2.09 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2414145 completed with status 0
% 10.93/2.09 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.93/2.09 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.93/2.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.93/2.09 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.93/2.09 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.93/2.09 % No SInE strategy applied
% 10.93/2.09 % Search class: FHUNM-FFSF21-MFFFFFNN
% 10.93/2.09 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 10.93/2.09 % Starting SubtermCWHack with 136s (1) cores
% 10.93/2.09 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.93/2.09 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 10.93/2.09 % Starting new_bool_3 with 136s (1) cores
% 10.93/2.09 % Starting new_bool_1 with 136s (1) cores
% 10.93/2.09 % new_bool_3 with pid 2414155 completed with status 0
% 10.93/2.09 % Result found by new_bool_3
% 10.93/2.09 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.93/2.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.93/2.09 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.93/2.09 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.93/2.09 % No SInE strategy applied
% 10.93/2.09 % Search class: FHUNM-FFSF21-MFFFFFNN
% 10.93/2.09 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 10.93/2.09 % Starting SubtermCWHack with 136s (1) cores
% 10.93/2.09 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.93/2.09 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 10.93/2.09 % Starting new_bool_3 with 136s (1) cores
% 10.93/2.09 % Preprocessing time : 0.002 s
% 10.93/2.09 % Presaturation interreduction done
% 10.93/2.09
% 10.93/2.09 % Proof found!
% 10.93/2.09 % SZS status Unsatisfiable
% 10.93/2.09 % SZS output start CNFRefutation
% See solution above
% 10.93/2.09 % Parsed axioms : 20
% 10.93/2.09 % Removed by relevancy pruning/SinE : 0
% 10.93/2.09 % Initial clauses : 20
% 10.93/2.09 % Removed in clause preprocessing : 0
% 10.93/2.09 % Initial clauses in saturation : 20
% 10.93/2.09 % Processed clauses : 3290
% 10.93/2.09 % ...of these trivial : 1229
% 10.93/2.09 % ...subsumed : 474
% 10.93/2.09 % ...remaining for further processing : 1587
% 10.93/2.09 % Other redundant clauses eliminated : 0
% 10.93/2.09 % Clauses deleted for lack of memory : 0
% 10.93/2.09 % Backward-subsumed : 4
% 10.93/2.09 % Backward-rewritten : 5
% 10.93/2.09 % Generated clauses : 91451
% 10.93/2.09 % ...of the previous two non-redundant : 85140
% 10.93/2.09 % ...aggressively subsumed : 0
% 10.93/2.09 % Contextual simplify-reflections : 0
% 10.93/2.09 % Paramodulations : 91451
% 10.93/2.09 % Factorizations : 0
% 10.93/2.09 % NegExts : 0
% 10.93/2.09 % Equation resolutions : 0
% 10.93/2.09 % Disequality decompositions : 0
% 10.93/2.09 % Total rewrite steps : 7544
% 10.93/2.09 % ...of those cached : 5534
% 10.93/2.09 % Propositional unsat checks : 0
% 10.93/2.09 % Propositional check models : 0
% 10.93/2.09 % Propositional check unsatisfiable : 0
% 10.93/2.09 % Propositional clauses : 0
% 10.93/2.09 % Propositional clauses after purity: 0
% 10.93/2.09 % Propositional unsat core size : 0
% 10.93/2.09 % Propositional preprocessing time : 0.000
% 10.93/2.09 % Propositional encoding time : 0.000
% 10.93/2.09 % Propositional solver time : 0.000
% 10.93/2.09 % Success case prop preproc time : 0.000
% 10.93/2.09 % Success case prop encoding time : 0.000
% 10.93/2.09 % Success case prop solver time : 0.000
% 10.93/2.09 % Current number of processed clauses : 1558
% 10.93/2.09 % Positive orientable unit clauses : 738
% 10.93/2.09 % Positive unorientable unit clauses: 0
% 10.93/2.09 % Negative unit clauses : 0
% 10.93/2.09 % Non-unit-clauses : 820
% 10.93/2.09 % Current number of unprocessed clauses: 81890
% 10.93/2.09 % ...number of literals in the above : 91940
% 10.93/2.09 % Current number of archived formulas : 0
% 10.93/2.09 % Current number of archived clauses : 29
% 10.93/2.09 % Clause-clause subsumption calls (NU) : 109472
% 10.93/2.09 % Rec. Clause-clause subsumption calls : 78400
% 10.93/2.09 % Non-unit clause-clause subsumptions : 478
% 10.93/2.09 % Unit Clause-clause subsumption calls : 616
% 10.93/2.09 % Rewrite failures with RHS unbound : 0
% 10.93/2.09 % BW rewrite match attempts : 17298
% 10.93/2.09 % BW rewrite match successes : 5
% 10.93/2.09 % Condensation attempts : 0
% 10.93/2.09 % Condensation successes : 0
% 10.93/2.09 % Termbank termtop insertions : 1885305
% 10.93/2.09 % Search garbage collected termcells : 47
% 10.93/2.09
% 10.93/2.09 % -------------------------------------------------
% 10.93/2.09 % User time : 1.292 s
% 10.93/2.09 % System time : 0.070 s
% 10.93/2.09 % Total time : 1.362 s
% 10.93/2.09 % Maximum resident set size: 3648 pages
% 10.93/2.09
% 10.93/2.09 % -------------------------------------------------
% 10.93/2.09 % User time : 6.903 s
% 10.93/2.09 % System time : 0.351 s
% 10.93/2.09 % Total time : 7.254 s
% 10.93/2.09 % Maximum resident set size: 4864 pages
% 10.93/2.09 % E exiting
%------------------------------------------------------------------------------