%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV001-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 02:53:27 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 7 unt; 7 nHn; 26 RR)
% Number of literals : 73 ( 0 equ; 42 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 54 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_4,axiom,
( ~ q3(X1,X2,X3)
| q4(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_2,axiom,
( ~ q1(X1,X2,X3)
| q3(X1,X2,X3)
| less_or_equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_3,axiom,
( ~ q2(X1,X2,X3)
| q4(X1,X2,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_1,axiom,
( ~ less_or_equalish(X1,X2)
| ~ q1(X1,X2,X3)
| q2(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_6,negated_conjecture,
( ~ less_or_equalish(X1,a)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(a,X1)
| ~ q4(a,b,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_5,negated_conjecture,
q1(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(less_or_equal_reflexivity,axiom,
less_or_equalish(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_reflexivity) ).
cnf(all_less_or_equal,axiom,
( less_or_equalish(X2,X1)
| less_or_equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_less_or_equal) ).
cnf(clause_7,negated_conjecture,
( ~ less_or_equalish(X1,b)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(a,X1)
| ~ q4(a,b,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(c_0_9,plain,
( ~ q3(X1,X2,X3)
| q4(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_10,plain,
( ~ q1(X1,X2,X3)
| q3(X1,X2,X3)
| less_or_equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_11,plain,
( ~ q3(X1,X2,X3)
| q4(X1,X2,X1) ),
c_0_9 ).
cnf(c_0_12,plain,
( ~ q1(X1,X2,X3)
| q3(X1,X2,X3)
| less_or_equalish(X1,X2) ),
c_0_10 ).
cnf(c_0_13,plain,
( ~ q2(X1,X2,X3)
| q4(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_14,plain,
( ~ less_or_equalish(X1,X2)
| ~ q1(X1,X2,X3)
| q2(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_15,negated_conjecture,
( ~ less_or_equalish(X1,a)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(a,X1)
| ~ q4(a,b,X1) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_16,plain,
( ~ q1(X1,X2,X3)
| less_or_equalish(X1,X2)
| q4(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
q1(a,b,c),
clause_5 ).
cnf(c_0_18,plain,
( ~ q2(X1,X2,X3)
| q4(X1,X2,X2) ),
c_0_13 ).
cnf(c_0_19,plain,
( ~ less_or_equalish(X1,X2)
| ~ q1(X1,X2,X3)
| q2(X1,X2,X3) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
( ~ less_or_equalish(X1,a)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(a,X1)
| ~ q4(a,b,X1) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
( less_or_equalish(a,b)
| q4(a,b,a) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
less_or_equalish(X1,X1),
less_or_equal_reflexivity ).
cnf(c_0_23,axiom,
( less_or_equalish(X2,X1)
| less_or_equalish(X1,X2) ),
all_less_or_equal ).
cnf(c_0_24,negated_conjecture,
( ~ less_or_equalish(X1,b)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(a,X1)
| ~ q4(a,b,X1) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_25,plain,
( ~ less_or_equalish(X1,X2)
| ~ q1(X1,X2,X3)
| q4(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
less_or_equalish(a,b),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( ~ less_or_equalish(X1,b)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(a,X1)
| ~ q4(a,b,X1) ),
c_0_24 ).
cnf(c_0_28,negated_conjecture,
q4(a,b,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.35 % Computer : n010.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Mon Sep 21 08:26:55 UTC 2026
% 0.11/0.35 % CPUTime :
% 0.11/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.39 Running first-order theorem proving
% 0.15/0.39 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.15/0.41 % Version: 3.5.1
% 0.15/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 % Starting sh5l with 300s (1) cores
% 0.15/0.41 % new_bool_1 with pid 474279 completed with status 0
% 0.15/0.41 % Result found by new_bool_1
% 0.15/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.15/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.41 % SubtermCWHack with pid 474281 completed with status 0
% 0.15/0.41 % Result found by SubtermCWHack
% 0.15/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.15/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.41 % Preprocessing time : 0.001 s
% 0.15/0.41
% 0.15/0.41 % Proof found!
% 0.15/0.41 % SZS status Unsatisfiable
% 0.15/0.41 % SZS output start CNFRefutation
% See solution above
% 0.15/0.41 % Parsed axioms : 14
% 0.15/0.41 % Removed by relevancy pruning/SinE : 4
% 0.15/0.41 % Initial clauses : 10
% 0.15/0.41 % Removed in clause preprocessing : 0
% 0.15/0.41 % Initial clauses in saturation : 10
% 0.15/0.41 % Processed clauses : 40
% 0.15/0.41 % ...of these trivial : 0
% 0.15/0.41 % ...subsumed : 16
% 0.15/0.41 % ...remaining for further processing : 24
% 0.15/0.41 % Other redundant clauses eliminated : 0
% 0.15/0.41 % Clauses deleted for lack of memory : 0
% 0.15/0.41 % Backward-subsumed : 0
% 0.15/0.41 % Backward-rewritten : 1
% 0.15/0.41 % Generated clauses : 85
% 0.15/0.41 % ...of the previous two non-redundant : 65
% 0.15/0.41 % ...aggressively subsumed : 0
% 0.15/0.41 % Contextual simplify-reflections : 1
% 0.15/0.41 % Paramodulations : 75
% 0.15/0.41 % Factorizations : 10
% 0.15/0.41 % NegExts : 0
% 0.15/0.41 % Equation resolutions : 0
% 0.15/0.41 % Disequality decompositions : 0
% 0.15/0.41 % Total rewrite steps : 27
% 0.15/0.41 % ...of those cached : 17
% 0.15/0.41 % Propositional unsat checks : 0
% 0.15/0.41 % Propositional check models : 0
% 0.15/0.41 % Propositional check unsatisfiable : 0
% 0.15/0.41 % Propositional clauses : 0
% 0.15/0.41 % Propositional clauses after purity: 0
% 0.15/0.41 % Propositional unsat core size : 0
% 0.15/0.41 % Propositional preprocessing time : 0.000
% 0.15/0.41 % Propositional encoding time : 0.000
% 0.15/0.41 % Propositional solver time : 0.000
% 0.15/0.41 % Success case prop preproc time : 0.000
% 0.15/0.41 % Success case prop encoding time : 0.000
% 0.15/0.41 % Success case prop solver time : 0.000
% 0.15/0.41 % Current number of processed clauses : 23
% 0.15/0.41 % Positive orientable unit clauses : 4
% 0.15/0.41 % Positive unorientable unit clauses: 0
% 0.15/0.41 % Negative unit clauses : 0
% 0.15/0.41 % Non-unit-clauses : 19
% 0.15/0.41 % Current number of unprocessed clauses: 34
% 0.15/0.41 % ...number of literals in the above : 142
% 0.15/0.41 % Current number of archived formulas : 0
% 0.15/0.41 % Current number of archived clauses : 1
% 0.15/0.41 % Clause-clause subsumption calls (NU) : 149
% 0.15/0.41 % Rec. Clause-clause subsumption calls : 140
% 0.15/0.41 % Non-unit clause-clause subsumptions : 17
% 0.15/0.41 % Unit Clause-clause subsumption calls : 0
% 0.15/0.41 % Rewrite failures with RHS unbound : 0
% 0.15/0.41 % BW rewrite match attempts : 2
% 0.15/0.41 % BW rewrite match successes : 1
% 0.15/0.41 % Condensation attempts : 0
% 0.15/0.41 % Condensation successes : 0
% 0.15/0.41 % Termbank termtop insertions : 1202
% 0.15/0.41 % Search garbage collected termcells : 44
% 0.15/0.41
% 0.15/0.41 % -------------------------------------------------
% 0.15/0.41 % User time : 0.005 s
% 0.15/0.41 % System time : 0.000 s
% 0.15/0.41 % Total time : 0.005 s
% 0.15/0.41 % Maximum resident set size: 3636 pages
% 0.15/0.41
% 0.15/0.41 % -------------------------------------------------
% 0.15/0.41 % User time : 0.006 s
% 0.15/0.41 % System time : 0.005 s
% 0.15/0.41 % Total time : 0.011 s
% 0.15/0.41 % Maximum resident set size: 4608 pages
% 0.15/0.41 % E exiting
%------------------------------------------------------------------------------