%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN609-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 : n010.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:43 PM UTC 2026
% Result : Unsatisfiable 13.00s 2.15s
% Output : CNFRefutation 13.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 14 unt; 0 nHn; 26 RR)
% Number of literals : 62 ( 0 equ; 36 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p17_20,negated_conjecture,
( ~ p17(X3,X4)
| ~ p2(X4,X2)
| ~ p2(X3,X1)
| p17(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p17_20) ).
cnf(p17_29,negated_conjecture,
p17(f9(f10(f14(f4(f9(c19)),c19),f15(f4(f6(f7(f8(c20))))))),f6(f7(f8(c20)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p17_29) ).
cnf(p2_12,negated_conjecture,
( ~ p3(X1,X2)
| p2(f9(X1),f9(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_12) ).
cnf(p3_19,negated_conjecture,
( ~ p3(X3,X2)
| ~ p3(X3,X1)
| p3(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_19) ).
cnf(p3_24,negated_conjecture,
( ~ p3(X2,X4)
| ~ p3(X1,X3)
| p3(f10(X1,X2),f10(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_24) ).
cnf(p3_4,negated_conjecture,
p3(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_4) ).
cnf(not_p17_28,negated_conjecture,
~ p17(f9(f10(f14(f4(f9(c19)),c19),f12(X1,c21))),f6(f7(f8(c20)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p17_28) ).
cnf(p3_27,negated_conjecture,
p3(f12(f15(f4(f6(f7(f8(c20))))),c21),f15(f4(f6(f7(f8(c20)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_27) ).
cnf(p2_2,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_2) ).
cnf(c_0_9,negated_conjecture,
( ~ p17(X3,X4)
| ~ p2(X4,X2)
| ~ p2(X3,X1)
| p17(X1,X2) ),
inference(fof_simplification,[status(thm)],[p17_20]) ).
cnf(c_0_10,negated_conjecture,
( ~ p17(X3,X4)
| ~ p2(X4,X2)
| ~ p2(X3,X1)
| p17(X1,X2) ),
c_0_9 ).
cnf(c_0_11,negated_conjecture,
p17(f9(f10(f14(f4(f9(c19)),c19),f15(f4(f6(f7(f8(c20))))))),f6(f7(f8(c20)))),
p17_29 ).
cnf(c_0_12,negated_conjecture,
( ~ p3(X1,X2)
| p2(f9(X1),f9(X2)) ),
inference(fof_simplification,[status(thm)],[p2_12]) ).
cnf(c_0_13,negated_conjecture,
( ~ p3(X3,X2)
| ~ p3(X3,X1)
| p3(X1,X2) ),
inference(fof_simplification,[status(thm)],[p3_19]) ).
cnf(c_0_14,negated_conjecture,
( ~ p2(f6(f7(f8(c20))),X2)
| ~ p2(f9(f10(f14(f4(f9(c19)),c19),f15(f4(f6(f7(f8(c20))))))),X1)
| p17(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( ~ p3(X1,X2)
| p2(f9(X1),f9(X2)) ),
c_0_12 ).
cnf(c_0_16,negated_conjecture,
( ~ p3(X2,X4)
| ~ p3(X1,X3)
| p3(f10(X1,X2),f10(X3,X4)) ),
inference(fof_simplification,[status(thm)],[p3_24]) ).
cnf(c_0_17,negated_conjecture,
( ~ p3(X3,X2)
| ~ p3(X3,X1)
| p3(X1,X2) ),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
p3(X1,X1),
p3_4 ).
cnf(c_0_19,negated_conjecture,
~ p17(f9(f10(f14(f4(f9(c19)),c19),f12(X1,c21))),f6(f7(f8(c20)))),
inference(fof_simplification,[status(thm)],[not_p17_28]) ).
cnf(c_0_20,negated_conjecture,
( ~ p2(f6(f7(f8(c20))),X2)
| ~ p3(f10(f14(f4(f9(c19)),c19),f15(f4(f6(f7(f8(c20)))))),X1)
| p17(f9(X1),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( ~ p3(X2,X4)
| ~ p3(X1,X3)
| p3(f10(X1,X2),f10(X3,X4)) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( ~ p3(X2,X1)
| p3(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
p3(f12(f15(f4(f6(f7(f8(c20))))),c21),f15(f4(f6(f7(f8(c20)))))),
p3_27 ).
cnf(c_0_24,negated_conjecture,
~ p17(f9(f10(f14(f4(f9(c19)),c19),f12(X1,c21))),f6(f7(f8(c20)))),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
( ~ p2(f6(f7(f8(c20))),X3)
| ~ p3(f14(f4(f9(c19)),c19),X1)
| ~ p3(f15(f4(f6(f7(f8(c20))))),X2)
| p17(f9(f10(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
p2(X1,X1),
p2_2 ).
cnf(c_0_27,negated_conjecture,
p3(f15(f4(f6(f7(f8(c20))))),f12(f15(f4(f6(f7(f8(c20))))),c21)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
~ p3(f15(f4(f6(f7(f8(c20))))),f12(X1,c21)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN609-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n010.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 11:10:41 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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
% 13.00/2.15 % Version: 3.5.1
% 13.00/2.15 % Preprocessing class: FSMSSMSSSSSNFFN.
% 13.00/2.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.00/2.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.00/2.15 % Starting new_bool_3 with 300s (1) cores
% 13.00/2.15 % Starting new_bool_1 with 300s (1) cores
% 13.00/2.15 % Starting sh5l with 300s (1) cores
% 13.00/2.15 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 747918 completed with status 0
% 13.00/2.15 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 13.00/2.15 % Preprocessing class: FSMSSMSSSSSNFFN.
% 13.00/2.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.00/2.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.00/2.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.00/2.15 % No SInE strategy applied
% 13.00/2.15 % Search class: FGUNS-FFMS21-DFFFFFNN
% 13.00/2.15 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.00/2.15 % Starting SubtermCWHack with 136s (1) cores
% 13.00/2.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 13.00/2.15 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 13.00/2.15 % Starting new_bool_3 with 136s (1) cores
% 13.00/2.15 % Starting new_bool_1 with 136s (1) cores
% 13.00/2.15 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 747923 completed with status 0
% 13.00/2.15 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 13.00/2.15 % Preprocessing class: FSMSSMSSSSSNFFN.
% 13.00/2.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.00/2.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.00/2.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.00/2.15 % No SInE strategy applied
% 13.00/2.15 % Search class: FGUNS-FFMS21-DFFFFFNN
% 13.00/2.15 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.00/2.15 % Starting SubtermCWHack with 136s (1) cores
% 13.00/2.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 13.00/2.15 % Preprocessing time : 0.002 s
% 13.00/2.15 % Presaturation interreduction done
% 13.00/2.15
% 13.00/2.15 % Proof found!
% 13.00/2.15 % SZS status Unsatisfiable
% 13.00/2.15 % SZS output start CNFRefutation
% See solution above
% 13.00/2.15 % Parsed axioms : 30
% 13.00/2.15 % Removed by relevancy pruning/SinE : 0
% 13.00/2.15 % Initial clauses : 30
% 13.00/2.15 % Removed in clause preprocessing : 0
% 13.00/2.15 % Initial clauses in saturation : 30
% 13.00/2.15 % Processed clauses : 11063
% 13.00/2.15 % ...of these trivial : 12
% 13.00/2.15 % ...subsumed : 8949
% 13.00/2.15 % ...remaining for further processing : 2102
% 13.00/2.15 % Other redundant clauses eliminated : 0
% 13.00/2.15 % Clauses deleted for lack of memory : 0
% 13.00/2.15 % Backward-subsumed : 77
% 13.00/2.15 % Backward-rewritten : 0
% 13.00/2.15 % Generated clauses : 99812
% 13.00/2.15 % ...of the previous two non-redundant : 94226
% 13.00/2.15 % ...aggressively subsumed : 0
% 13.00/2.15 % Contextual simplify-reflections : 14
% 13.00/2.15 % Paramodulations : 99811
% 13.00/2.15 % Factorizations : 0
% 13.00/2.15 % NegExts : 0
% 13.00/2.15 % Equation resolutions : 0
% 13.00/2.15 % Disequality decompositions : 0
% 13.00/2.15 % Total rewrite steps : 23707
% 13.00/2.15 % ...of those cached : 23659
% 13.00/2.15 % Propositional unsat checks : 0
% 13.00/2.15 % Propositional check models : 0
% 13.00/2.15 % Propositional check unsatisfiable : 0
% 13.00/2.15 % Propositional clauses : 0
% 13.00/2.15 % Propositional clauses after purity: 0
% 13.00/2.15 % Propositional unsat core size : 0
% 13.00/2.15 % Propositional preprocessing time : 0.000
% 13.00/2.15 % Propositional encoding time : 0.000
% 13.00/2.15 % Propositional solver time : 0.000
% 13.00/2.15 % Success case prop preproc time : 0.000
% 13.00/2.15 % Success case prop encoding time : 0.000
% 13.00/2.15 % Success case prop solver time : 0.000
% 13.00/2.15 % Current number of processed clauses : 1994
% 13.00/2.15 % Positive orientable unit clauses : 31
% 13.00/2.15 % Positive unorientable unit clauses: 0
% 13.00/2.15 % Negative unit clauses : 5
% 13.00/2.15 % Non-unit-clauses : 1958
% 13.00/2.15 % Current number of unprocessed clauses: 83117
% 13.00/2.15 % ...number of literals in the above : 321210
% 13.00/2.15 % Current number of archived formulas : 0
% 13.00/2.15 % Current number of archived clauses : 108
% 13.00/2.15 % Clause-clause subsumption calls (NU) : 597763
% 13.00/2.15 % Rec. Clause-clause subsumption calls : 470606
% 13.00/2.15 % Non-unit clause-clause subsumptions : 9014
% 13.00/2.15 % Unit Clause-clause subsumption calls : 1032
% 13.00/2.15 % Rewrite failures with RHS unbound : 0
% 13.00/2.15 % BW rewrite match attempts : 29
% 13.00/2.15 % BW rewrite match successes : 0
% 13.00/2.15 % Condensation attempts : 0
% 13.00/2.15 % Condensation successes : 0
% 13.00/2.15 % Termbank termtop insertions : 1676088
% 13.00/2.15 % Search garbage collected termcells : 72
% 13.00/2.15
% 13.00/2.15 % -------------------------------------------------
% 13.00/2.15 % User time : 1.621 s
% 13.00/2.15 % System time : 0.058 s
% 13.00/2.15 % Total time : 1.679 s
% 13.00/2.15 % Maximum resident set size: 3668 pages
% 13.00/2.15
% 13.00/2.15 % -------------------------------------------------
% 13.00/2.15 % User time : 8.027 s
% 13.00/2.15 % System time : 0.407 s
% 13.00/2.15 % Total time : 8.433 s
% 13.00/2.15 % Maximum resident set size: 4864 pages
% 13.00/2.15 % E exiting
%------------------------------------------------------------------------------