%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN582-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 : n014.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:40 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.42s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 13 unt; 0 nHn; 21 RR)
% Number of literals : 48 ( 0 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p11_21,negated_conjecture,
( ~ p11(X3,X4)
| ~ p2(X4,X2)
| ~ p2(X3,X1)
| p11(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p11_21) ).
cnf(p2_2,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_2) ).
cnf(p2_14,negated_conjecture,
( ~ p2(X1,X2)
| p2(f4(X1),f4(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_14) ).
cnf(not_p11_9,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p11_9) ).
cnf(p11_7,negated_conjecture,
p11(f4(f6(c15,c13)),c16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p11_7) ).
cnf(p2_23,negated_conjecture,
( ~ p5(X1,X3)
| ~ p2(X2,X4)
| p2(f6(X1,X2),f6(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_23) ).
cnf(p5_3,negated_conjecture,
p5(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p5_3) ).
cnf(p2_5,negated_conjecture,
p2(c13,c18),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_5) ).
cnf(c_0_8,negated_conjecture,
( ~ p11(X3,X4)
| ~ p2(X4,X2)
| ~ p2(X3,X1)
| p11(X1,X2) ),
inference(fof_simplification,[status(thm)],[p11_21]) ).
cnf(c_0_9,negated_conjecture,
( ~ p11(X3,X4)
| ~ p2(X4,X2)
| ~ p2(X3,X1)
| p11(X1,X2) ),
c_0_8 ).
cnf(c_0_10,negated_conjecture,
p2(X1,X1),
p2_2 ).
cnf(c_0_11,negated_conjecture,
( ~ p2(X1,X2)
| p2(f4(X1),f4(X2)) ),
inference(fof_simplification,[status(thm)],[p2_14]) ).
cnf(c_0_12,negated_conjecture,
( ~ p2(X3,X1)
| ~ p11(X3,X2)
| p11(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ p2(X1,X2)
| p2(f4(X1),f4(X2)) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
inference(fof_simplification,[status(thm)],[not_p11_9]) ).
cnf(c_0_15,negated_conjecture,
( ~ p2(X3,X1)
| ~ p11(f4(X3),X2)
| p11(f4(X1),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
p11(f4(f6(c15,c13)),c16),
p11_7 ).
cnf(c_0_17,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
c_0_14 ).
cnf(c_0_18,negated_conjecture,
( ~ p2(f6(c15,c13),X1)
| p11(f4(X1),c16) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ~ p5(X1,X3)
| ~ p2(X2,X4)
| p2(f6(X1,X2),f6(X3,X4)) ),
inference(fof_simplification,[status(thm)],[p2_23]) ).
cnf(c_0_20,negated_conjecture,
~ p2(f6(c15,c13),f6(c15,c18)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ p5(X1,X3)
| ~ p2(X2,X4)
| p2(f6(X1,X2),f6(X3,X4)) ),
c_0_19 ).
cnf(c_0_22,negated_conjecture,
p5(X1,X1),
p5_3 ).
cnf(c_0_23,negated_conjecture,
p2(c13,c18),
p2_5 ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN582-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.09/0.36 % Computer : n014.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:04 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.39 Running first-order theorem proving
% 0.09/0.39 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
% 0.09/0.42 % Version: 3.5.1
% 0.09/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.42 % Starting sh5l with 300s (1) cores
% 0.09/0.42 % new_bool_3 with pid 3916317 completed with status 0
% 0.09/0.42 % Result found by new_bool_3
% 0.09/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.42 % Search class: FGUNS-FFMS21-SFFFFFNN
% 0.09/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.42 % SubtermCWHack with pid 3916322 completed with status 0
% 0.09/0.42 % Result found by SubtermCWHack
% 0.09/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.42 % Search class: FGUNS-FFMS21-SFFFFFNN
% 0.09/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.42 % Preprocessing time : 0.001 s
% 0.09/0.42
% 0.09/0.42 % Proof found!
% 0.09/0.42 % SZS status Unsatisfiable
% 0.09/0.42 % SZS output start CNFRefutation
% See solution above
% 0.09/0.42 % Parsed axioms : 25
% 0.09/0.42 % Removed by relevancy pruning/SinE : 0
% 0.09/0.42 % Initial clauses : 25
% 0.09/0.42 % Removed in clause preprocessing : 0
% 0.09/0.42 % Initial clauses in saturation : 25
% 0.09/0.42 % Processed clauses : 197
% 0.09/0.42 % ...of these trivial : 3
% 0.09/0.42 % ...subsumed : 69
% 0.09/0.42 % ...remaining for further processing : 125
% 0.09/0.42 % Other redundant clauses eliminated : 0
% 0.09/0.42 % Clauses deleted for lack of memory : 0
% 0.09/0.42 % Backward-subsumed : 1
% 0.09/0.42 % Backward-rewritten : 0
% 0.09/0.42 % Generated clauses : 415
% 0.09/0.42 % ...of the previous two non-redundant : 375
% 0.09/0.42 % ...aggressively subsumed : 0
% 0.09/0.42 % Contextual simplify-reflections : 0
% 0.09/0.42 % Paramodulations : 415
% 0.09/0.42 % Factorizations : 0
% 0.09/0.42 % NegExts : 0
% 0.09/0.42 % Equation resolutions : 0
% 0.09/0.42 % Disequality decompositions : 0
% 0.09/0.42 % Total rewrite steps : 64
% 0.09/0.42 % ...of those cached : 45
% 0.09/0.42 % Propositional unsat checks : 0
% 0.09/0.42 % Propositional check models : 0
% 0.09/0.42 % Propositional check unsatisfiable : 0
% 0.09/0.42 % Propositional clauses : 0
% 0.09/0.42 % Propositional clauses after purity: 0
% 0.09/0.42 % Propositional unsat core size : 0
% 0.09/0.42 % Propositional preprocessing time : 0.000
% 0.09/0.42 % Propositional encoding time : 0.000
% 0.09/0.42 % Propositional solver time : 0.000
% 0.09/0.42 % Success case prop preproc time : 0.000
% 0.09/0.42 % Success case prop encoding time : 0.000
% 0.09/0.42 % Success case prop solver time : 0.000
% 0.09/0.42 % Current number of processed clauses : 124
% 0.09/0.42 % Positive orientable unit clauses : 17
% 0.09/0.42 % Positive unorientable unit clauses: 0
% 0.09/0.42 % Negative unit clauses : 4
% 0.09/0.42 % Non-unit-clauses : 103
% 0.09/0.42 % Current number of unprocessed clauses: 203
% 0.09/0.42 % ...number of literals in the above : 671
% 0.09/0.42 % Current number of archived formulas : 0
% 0.09/0.42 % Current number of archived clauses : 1
% 0.09/0.42 % Clause-clause subsumption calls (NU) : 1343
% 0.09/0.42 % Rec. Clause-clause subsumption calls : 1164
% 0.09/0.42 % Non-unit clause-clause subsumptions : 67
% 0.09/0.42 % Unit Clause-clause subsumption calls : 89
% 0.09/0.42 % Rewrite failures with RHS unbound : 0
% 0.09/0.42 % BW rewrite match attempts : 2
% 0.09/0.42 % BW rewrite match successes : 0
% 0.09/0.42 % Condensation attempts : 0
% 0.09/0.42 % Condensation successes : 0
% 0.09/0.42 % Termbank termtop insertions : 5600
% 0.09/0.42 % Search garbage collected termcells : 76
% 0.09/0.42
% 0.09/0.42 % -------------------------------------------------
% 0.09/0.42 % User time : 0.007 s
% 0.09/0.42 % System time : 0.002 s
% 0.09/0.42 % Total time : 0.009 s
% 0.09/0.42 % Maximum resident set size: 3600 pages
% 0.09/0.42
% 0.09/0.42 % -------------------------------------------------
% 0.09/0.42 % User time : 0.007 s
% 0.09/0.42 % System time : 0.007 s
% 0.09/0.42 % Total time : 0.014 s
% 0.09/0.42 % Maximum resident set size: 4608 pages
% 0.09/0.42 % E exiting
%------------------------------------------------------------------------------