%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN554-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 : 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:36 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.60s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 15 unt; 2 nHn; 27 RR)
% Number of literals : 59 ( 0 equ; 32 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p4_8,negated_conjecture,
( ~ p2(X4,X1)
| ~ p4(X4,X3)
| ~ p2(X3,X2)
| p4(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_8) ).
cnf(p2_6,negated_conjecture,
( ~ p2(X3,X1)
| ~ p2(X3,X2)
| p2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_6) ).
cnf(p2_1,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_1) ).
cnf(not_p4_2,negated_conjecture,
~ p4(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p4_2) ).
cnf(p2_4,negated_conjecture,
p2(f3(c5,c6),f3(c5,c7)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_4) ).
cnf(p4_7,negated_conjecture,
( ~ p4(X1,X2)
| p4(f3(c5,X1),f3(c5,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_7) ).
cnf(not_p2_3,negated_conjecture,
~ p2(c6,c7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p2_3) ).
cnf(p2_5,negated_conjecture,
( p4(X2,X1)
| p4(X1,X2)
| p2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_5) ).
cnf(c_0_8,negated_conjecture,
( ~ p2(X4,X1)
| ~ p4(X4,X3)
| ~ p2(X3,X2)
| p4(X1,X2) ),
inference(fof_simplification,[status(thm)],[p4_8]) ).
cnf(c_0_9,negated_conjecture,
( ~ p2(X3,X1)
| ~ p2(X3,X2)
| p2(X1,X2) ),
inference(fof_simplification,[status(thm)],[p2_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ p2(X4,X1)
| ~ p4(X4,X3)
| ~ p2(X3,X2)
| p4(X1,X2) ),
c_0_8 ).
cnf(c_0_11,negated_conjecture,
p2(X1,X1),
p2_1 ).
cnf(c_0_12,negated_conjecture,
( ~ p2(X3,X1)
| ~ p2(X3,X2)
| p2(X1,X2) ),
c_0_9 ).
cnf(c_0_13,negated_conjecture,
~ p4(X1,X1),
inference(fof_simplification,[status(thm)],[not_p4_2]) ).
cnf(c_0_14,negated_conjecture,
( ~ p2(X3,X2)
| ~ p4(X1,X3)
| p4(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
p2(f3(c5,c6),f3(c5,c7)),
p2_4 ).
cnf(c_0_16,negated_conjecture,
( ~ p2(X2,X1)
| p2(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
~ p4(X1,X1),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
( ~ p4(X1,f3(c5,c6))
| p4(X1,f3(c5,c7)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( ~ p4(X1,X2)
| p4(f3(c5,X1),f3(c5,X2)) ),
inference(fof_simplification,[status(thm)],[p4_7]) ).
cnf(c_0_20,negated_conjecture,
p2(f3(c5,c7),f3(c5,c6)),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
~ p4(f3(c5,c7),f3(c5,c6)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( ~ p4(X1,X2)
| p4(f3(c5,X1),f3(c5,X2)) ),
c_0_19 ).
cnf(c_0_23,negated_conjecture,
~ p2(c6,c7),
inference(fof_simplification,[status(thm)],[not_p2_3]) ).
cnf(c_0_24,negated_conjecture,
( ~ p4(X1,f3(c5,c7))
| p4(X1,f3(c5,c6)) ),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ p4(c7,c6),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( p4(X2,X1)
| p4(X1,X2)
| p2(X1,X2) ),
p2_5 ).
cnf(c_0_27,negated_conjecture,
~ p2(c6,c7),
c_0_23 ).
cnf(c_0_28,negated_conjecture,
( ~ p4(X1,c7)
| p4(f3(c5,X1),f3(c5,c6)) ),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
p4(c6,c7),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN554-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n015.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 11:11:22 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.54 Running first-order theorem proving
% 0.25/0.54 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.25/0.60 % Version: 3.5.1
% 0.25/0.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.60 % Starting sh5l with 300s (1) cores
% 0.25/0.60 % new_bool_1 with pid 1323527 completed with status 0
% 0.25/0.60 % Result found by new_bool_1
% 0.25/0.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.60 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.25/0.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.60 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.60 % SubtermCWHack with pid 1323531 completed with status 0
% 0.25/0.60 % Result found by SubtermCWHack
% 0.25/0.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.60 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.25/0.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.60 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.60 % Preprocessing time : 0.002 s
% 0.25/0.60
% 0.25/0.60 % Proof found!
% 0.25/0.60 % SZS status Unsatisfiable
% 0.25/0.60 % SZS output start CNFRefutation
% See solution above
% 0.25/0.60 % Parsed axioms : 9
% 0.25/0.60 % Removed by relevancy pruning/SinE : 0
% 0.25/0.60 % Initial clauses : 9
% 0.25/0.60 % Removed in clause preprocessing : 0
% 0.25/0.60 % Initial clauses in saturation : 9
% 0.25/0.60 % Processed clauses : 21
% 0.25/0.60 % ...of these trivial : 1
% 0.25/0.60 % ...subsumed : 1
% 0.25/0.60 % ...remaining for further processing : 19
% 0.25/0.60 % Other redundant clauses eliminated : 0
% 0.25/0.60 % Clauses deleted for lack of memory : 0
% 0.25/0.60 % Backward-subsumed : 0
% 0.25/0.60 % Backward-rewritten : 0
% 0.25/0.60 % Generated clauses : 31
% 0.25/0.60 % ...of the previous two non-redundant : 17
% 0.25/0.60 % ...aggressively subsumed : 0
% 0.25/0.60 % Contextual simplify-reflections : 0
% 0.25/0.60 % Paramodulations : 29
% 0.25/0.60 % Factorizations : 2
% 0.25/0.60 % NegExts : 0
% 0.25/0.60 % Equation resolutions : 0
% 0.25/0.60 % Disequality decompositions : 0
% 0.25/0.60 % Total rewrite steps : 12
% 0.25/0.60 % ...of those cached : 4
% 0.25/0.60 % Propositional unsat checks : 0
% 0.25/0.60 % Propositional check models : 0
% 0.25/0.60 % Propositional check unsatisfiable : 0
% 0.25/0.60 % Propositional clauses : 0
% 0.25/0.60 % Propositional clauses after purity: 0
% 0.25/0.60 % Propositional unsat core size : 0
% 0.25/0.60 % Propositional preprocessing time : 0.000
% 0.25/0.60 % Propositional encoding time : 0.000
% 0.25/0.60 % Propositional solver time : 0.000
% 0.25/0.60 % Success case prop preproc time : 0.000
% 0.25/0.60 % Success case prop encoding time : 0.000
% 0.25/0.60 % Success case prop solver time : 0.000
% 0.25/0.60 % Current number of processed clauses : 19
% 0.25/0.60 % Positive orientable unit clauses : 4
% 0.25/0.60 % Positive unorientable unit clauses: 0
% 0.25/0.60 % Negative unit clauses : 4
% 0.25/0.60 % Non-unit-clauses : 11
% 0.25/0.60 % Current number of unprocessed clauses: 5
% 0.25/0.60 % ...number of literals in the above : 15
% 0.25/0.60 % Current number of archived formulas : 0
% 0.25/0.60 % Current number of archived clauses : 0
% 0.25/0.60 % Clause-clause subsumption calls (NU) : 8
% 0.25/0.60 % Rec. Clause-clause subsumption calls : 8
% 0.25/0.60 % Non-unit clause-clause subsumptions : 0
% 0.25/0.60 % Unit Clause-clause subsumption calls : 1
% 0.25/0.60 % Rewrite failures with RHS unbound : 0
% 0.25/0.60 % BW rewrite match attempts : 0
% 0.25/0.60 % BW rewrite match successes : 0
% 0.25/0.60 % Condensation attempts : 0
% 0.25/0.60 % Condensation successes : 0
% 0.25/0.60 % Termbank termtop insertions : 560
% 0.25/0.60 % Search garbage collected termcells : 25
% 0.25/0.60
% 0.25/0.60 % -------------------------------------------------
% 0.25/0.60 % User time : 0.005 s
% 0.25/0.60 % System time : 0.003 s
% 0.25/0.60 % Total time : 0.008 s
% 0.25/0.60 % Maximum resident set size: 3636 pages
% 0.25/0.60
% 0.25/0.60 % -------------------------------------------------
% 0.25/0.60 % User time : 0.005 s
% 0.25/0.60 % System time : 0.012 s
% 0.25/0.60 % Total time : 0.017 s
% 0.25/0.60 % Maximum resident set size: 4608 pages
% 0.25/0.60 % E exiting
%------------------------------------------------------------------------------