%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN576-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:39 PM UTC 2026
% Result : Unsatisfiable 258.95s 38.31s
% Output : CNFRefutation 258.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 48 ( 24 unt; 4 nHn; 29 RR)
% Number of literals : 99 ( 0 equ; 50 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 105 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p12_22,negated_conjecture,
( ~ p11(f10(X2),f10(X3))
| ~ p12(X2,f6(X1))
| ~ p12(X3,f6(X1))
| p12(f7(f9(X1,c14,f3(X2,X3)),f3(X2,X3)),f6(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12_22) ).
cnf(p11_7,negated_conjecture,
( p11(X2,X1)
| p11(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p11_7) ).
cnf(p12_6,negated_conjecture,
p12(c16,f6(c13)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12_6) ).
cnf(not_p12_17,negated_conjecture,
~ p12(f7(f9(c13,c14,f3(c15,c16)),f3(c15,c16)),f6(c13)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p12_17) ).
cnf(p12_5,negated_conjecture,
p12(c15,f6(c13)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12_5) ).
cnf(p12_16,negated_conjecture,
( ~ p12(X3,X4)
| ~ p5(X4,X2)
| ~ p2(X3,X1)
| p12(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12_16) ).
cnf(p2_19,negated_conjecture,
( ~ p2(X2,X4)
| ~ p2(X1,X3)
| p2(f7(X1,X2),f7(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_19) ).
cnf(p2_20,negated_conjecture,
( ~ p2(X3,X6)
| ~ p8(X2,X5)
| ~ p4(X1,X4)
| p2(f9(X1,X2,X3),f9(X4,X5,X6)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_20) ).
cnf(p5_4,negated_conjecture,
p5(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p5_4) ).
cnf(p2_8,negated_conjecture,
p2(f3(X1,X2),f3(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_8) ).
cnf(p8_1,negated_conjecture,
p8(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_1) ).
cnf(p2_2,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_2) ).
cnf(p4_3,negated_conjecture,
p4(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p4_3) ).
cnf(c_0_13,negated_conjecture,
( ~ p11(f10(X2),f10(X3))
| ~ p12(X2,f6(X1))
| ~ p12(X3,f6(X1))
| p12(f7(f9(X1,c14,f3(X2,X3)),f3(X2,X3)),f6(X1)) ),
inference(fof_simplification,[status(thm)],[p12_22]) ).
cnf(c_0_14,negated_conjecture,
( ~ p11(f10(X2),f10(X3))
| ~ p12(X2,f6(X1))
| ~ p12(X3,f6(X1))
| p12(f7(f9(X1,c14,f3(X2,X3)),f3(X2,X3)),f6(X1)) ),
c_0_13 ).
cnf(c_0_15,negated_conjecture,
( p11(X2,X1)
| p11(X1,X2) ),
p11_7 ).
cnf(c_0_16,negated_conjecture,
( ~ p12(X2,f6(X3))
| ~ p12(X1,f6(X3))
| p12(f7(f9(X3,c14,f3(X2,X1)),f3(X2,X1)),f6(X3))
| p11(f10(X1),f10(X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
p12(c16,f6(c13)),
p12_6 ).
cnf(c_0_18,negated_conjecture,
~ p12(f7(f9(c13,c14,f3(c15,c16)),f3(c15,c16)),f6(c13)),
inference(fof_simplification,[status(thm)],[not_p12_17]) ).
cnf(c_0_19,negated_conjecture,
( ~ p12(X1,f6(c13))
| p12(f7(f9(c13,c14,f3(X1,c16)),f3(X1,c16)),f6(c13))
| p11(f10(c16),f10(X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
p12(c15,f6(c13)),
p12_5 ).
cnf(c_0_21,negated_conjecture,
~ p12(f7(f9(c13,c14,f3(c15,c16)),f3(c15,c16)),f6(c13)),
c_0_18 ).
cnf(c_0_22,negated_conjecture,
( ~ p12(X3,X4)
| ~ p5(X4,X2)
| ~ p2(X3,X1)
| p12(X1,X2) ),
inference(fof_simplification,[status(thm)],[p12_16]) ).
cnf(c_0_23,negated_conjecture,
p11(f10(c16),f10(c15)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( ~ p2(X2,X4)
| ~ p2(X1,X3)
| p2(f7(X1,X2),f7(X3,X4)) ),
inference(fof_simplification,[status(thm)],[p2_19]) ).
cnf(c_0_25,negated_conjecture,
( ~ p2(X3,X6)
| ~ p8(X2,X5)
| ~ p4(X1,X4)
| p2(f9(X1,X2,X3),f9(X4,X5,X6)) ),
inference(fof_simplification,[status(thm)],[p2_20]) ).
cnf(c_0_26,negated_conjecture,
( ~ p12(X3,X4)
| ~ p5(X4,X2)
| ~ p2(X3,X1)
| p12(X1,X2) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
p5(X1,X1),
p5_4 ).
cnf(c_0_28,negated_conjecture,
( ~ p12(c16,f6(X1))
| ~ p12(c15,f6(X1))
| p12(f7(f9(X1,c14,f3(c16,c15)),f3(c16,c15)),f6(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( ~ p2(X2,X4)
| ~ p2(X1,X3)
| p2(f7(X1,X2),f7(X3,X4)) ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
p2(f3(X1,X2),f3(X2,X1)),
p2_8 ).
cnf(c_0_31,negated_conjecture,
( ~ p2(X3,X6)
| ~ p8(X2,X5)
| ~ p4(X1,X4)
| p2(f9(X1,X2,X3),f9(X4,X5,X6)) ),
c_0_25 ).
cnf(c_0_32,negated_conjecture,
p8(X1,X1),
p8_1 ).
cnf(c_0_33,negated_conjecture,
( ~ p2(X3,X1)
| ~ p12(X3,X2)
| p12(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
p12(f7(f9(c13,c14,f3(c16,c15)),f3(c16,c15)),f6(c13)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_17])]) ).
cnf(c_0_35,negated_conjecture,
( ~ p2(X1,X4)
| p2(f7(X1,f3(X2,X3)),f7(X4,f3(X3,X2))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
p2(X1,X1),
p2_2 ).
cnf(c_0_37,negated_conjecture,
( ~ p2(X3,X5)
| ~ p4(X1,X4)
| p2(f9(X1,X2,X3),f9(X4,X2,X5)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
p4(X1,X1),
p4_3 ).
cnf(c_0_39,negated_conjecture,
( ~ p2(f7(f9(c13,c14,f3(c16,c15)),f3(c16,c15)),X1)
| p12(X1,f6(c13)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
p2(f7(X1,f3(X2,X3)),f7(X1,f3(X3,X2))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( ~ p2(X3,X4)
| p2(f9(X1,X2,X3),f9(X1,X2,X4)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
p12(f7(f9(c13,c14,f3(c16,c15)),f3(c15,c16)),f6(c13)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( ~ p2(X1,X3)
| p2(f7(X1,X2),f7(X3,X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
p2(f9(X1,X2,f3(X3,X4)),f9(X1,X2,f3(X4,X3))),
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
cnf(c_0_45,negated_conjecture,
( ~ p2(f7(f9(c13,c14,f3(c16,c15)),f3(c15,c16)),X1)
| p12(X1,f6(c13)) ),
inference(spm,[status(thm)],[c_0_33,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
p2(f7(f9(X1,X2,f3(X3,X4)),X5),f7(f9(X1,X2,f3(X4,X3)),X5)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN576-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.38 % Computer : n015.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Mon Sep 21 11:12:11 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 258.95/38.31 % Version: 3.5.1
% 258.95/38.31 % Preprocessing class: FSMSSMSSSSSNFFN.
% 258.95/38.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 258.95/38.31 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 258.95/38.31 % Starting new_bool_3 with 300s (1) cores
% 258.95/38.31 % Starting new_bool_1 with 300s (1) cores
% 258.95/38.31 % Starting sh5l with 300s (1) cores
% 258.95/38.31 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1325699 completed with status 0
% 258.95/38.31 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 258.95/38.31 % Preprocessing class: FSMSSMSSSSSNFFN.
% 258.95/38.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 258.95/38.31 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 258.95/38.31 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 258.95/38.31 % No SInE strategy applied
% 258.95/38.31 % Search class: FGUNM-FFMF31-MFFFFFNN
% 258.95/38.31 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 258.95/38.31 % Starting SubtermCWHack with 136s (1) cores
% 258.95/38.31 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 258.95/38.31 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 258.95/38.31 % Starting new_bool_3 with 136s (1) cores
% 258.95/38.31 % Starting new_bool_1 with 136s (1) cores
% 258.95/38.31 % new_bool_3 with pid 1325708 completed with status 0
% 258.95/38.31 % Result found by new_bool_3
% 258.95/38.31 % Preprocessing class: FSMSSMSSSSSNFFN.
% 258.95/38.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 258.95/38.31 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 258.95/38.31 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 258.95/38.31 % No SInE strategy applied
% 258.95/38.31 % Search class: FGUNM-FFMF31-MFFFFFNN
% 258.95/38.31 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 258.95/38.31 % Starting SubtermCWHack with 136s (1) cores
% 258.95/38.31 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 258.95/38.31 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 258.95/38.31 % Starting new_bool_3 with 136s (1) cores
% 258.95/38.31 % Preprocessing time : 0.001 s
% 258.95/38.31 % Presaturation interreduction done
% 258.95/38.31
% 258.95/38.31 % Proof found!
% 258.95/38.31 % SZS status Unsatisfiable
% 258.95/38.31 % SZS output start CNFRefutation
% See solution above
% 258.95/38.31 % Parsed axioms : 22
% 258.95/38.31 % Removed by relevancy pruning/SinE : 0
% 258.95/38.31 % Initial clauses : 22
% 258.95/38.31 % Removed in clause preprocessing : 0
% 258.95/38.31 % Initial clauses in saturation : 22
% 258.95/38.31 % Processed clauses : 15989
% 258.95/38.31 % ...of these trivial : 955
% 258.95/38.31 % ...subsumed : 5190
% 258.95/38.31 % ...remaining for further processing : 9844
% 258.95/38.31 % Other redundant clauses eliminated : 0
% 258.95/38.31 % Clauses deleted for lack of memory : 0
% 258.95/38.31 % Backward-subsumed : 7
% 258.95/38.31 % Backward-rewritten : 7
% 258.95/38.31 % Generated clauses : 1166921
% 258.95/38.31 % ...of the previous two non-redundant : 1159235
% 258.95/38.31 % ...aggressively subsumed : 0
% 258.95/38.31 % Contextual simplify-reflections : 0
% 258.95/38.31 % Paramodulations : 1166773
% 258.95/38.31 % Factorizations : 148
% 258.95/38.31 % NegExts : 0
% 258.95/38.31 % Equation resolutions : 0
% 258.95/38.31 % Disequality decompositions : 0
% 258.95/38.31 % Total rewrite steps : 7316
% 258.95/38.31 % ...of those cached : 3771
% 258.95/38.31 % Propositional unsat checks : 1
% 258.95/38.31 % Propositional check models : 1
% 258.95/38.31 % Propositional check unsatisfiable : 0
% 258.95/38.31 % Propositional clauses : 0
% 258.95/38.31 % Propositional clauses after purity: 0
% 258.95/38.31 % Propositional unsat core size : 0
% 258.95/38.31 % Propositional preprocessing time : 0.000
% 258.95/38.31 % Propositional encoding time : 0.387
% 258.95/38.31 % Propositional solver time : 0.014
% 258.95/38.31 % Success case prop preproc time : 0.000
% 258.95/38.31 % Success case prop encoding time : 0.000
% 258.95/38.31 % Success case prop solver time : 0.000
% 258.95/38.31 % Current number of processed clauses : 9808
% 258.95/38.31 % Positive orientable unit clauses : 1040
% 258.95/38.31 % Positive unorientable unit clauses: 0
% 258.95/38.31 % Negative unit clauses : 1
% 258.95/38.31 % Non-unit-clauses : 8767
% 258.95/38.31 % Current number of unprocessed clauses: 1141460
% 258.95/38.31 % ...number of literals in the above : 3835908
% 258.95/38.31 % Current number of archived formulas : 0
% 258.95/38.31 % Current number of archived clauses : 36
% 258.95/38.31 % Clause-clause subsumption calls (NU) : 21471523
% 258.95/38.31 % Rec. Clause-clause subsumption calls : 4617303
% 258.95/38.31 % Non-unit clause-clause subsumptions : 5195
% 258.95/38.31 % Unit Clause-clause subsumption calls : 1366199
% 258.95/38.31 % Rewrite failures with RHS unbound : 0
% 258.95/38.31 % BW rewrite match attempts : 47250
% 258.95/38.31 % BW rewrite match successes : 3
% 258.95/38.31 % Condensation attempts : 0
% 258.95/38.31 % Condensation successes : 0
% 258.95/38.31 % Termbank termtop insertions : 169140946
% 258.95/38.31 % Search garbage collected termcells : 73
% 258.95/38.31
% 258.95/38.31 % -------------------------------------------------
% 258.95/38.31 % User time : 31.584 s
% 258.95/38.31 % System time : 0.847 s
% 258.95/38.31 % Total time : 32.430 s
% 258.95/38.31 % Maximum resident set size: 3652 pages
% 258.95/38.31
% 258.95/38.31 % -------------------------------------------------
% 258.95/38.31 % User time : 158.340 s
% 258.95/38.31 % System time : 4.224 s
% 258.95/38.31 % Total time : 162.564 s
% 258.95/38.31 % Maximum resident set size: 4864 pages
% 258.95/38.31 % E exiting
%------------------------------------------------------------------------------