%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC264+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:45:38 PM UTC 2026
% Result : Theorem 242.95s 36.00s
% Output : CNFRefutation 242.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 191 ( 22 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 244 ( 88 ~; 100 |; 25 &)
% ( 4 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( totalorderedP(X1)
| ~ strictorderedP(X3)
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( totalorderedP(X1)
| ~ strictorderedP(X3)
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( totalorderedP(X1)
| ~ strictorderedP(X3)
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[ax93]) ).
fof(c_0_7,plain,
! [X25,X26,X27,X28,X29,X30] :
( ( ~ ssList(X25)
| strictorderedP(X25)
| ~ lt(esk10_1(X25),esk11_1(X25)) )
& ( ~ ssList(X25)
| strictorderedP(X25)
| app(app(esk12_1(X25),cons(esk10_1(X25),esk13_1(X25))),cons(esk11_1(X25),esk14_1(X25))) = X25 )
& ( ~ ssList(X25)
| strictorderedP(X25)
| ssList(esk14_1(X25)) )
& ( ~ ssList(X25)
| strictorderedP(X25)
| ssList(esk13_1(X25)) )
& ( ~ ssList(X25)
| strictorderedP(X25)
| ssList(esk12_1(X25)) )
& ( ~ ssList(X25)
| strictorderedP(X25)
| ssItem(esk11_1(X25)) )
& ( ~ ssList(X25)
| strictorderedP(X25)
| ssItem(esk10_1(X25)) )
& ( ~ ssList(X25)
| lt(X26,X27)
| app(app(X28,cons(X26,X29)),cons(X27,X30)) != X25
| ~ ssList(X30)
| ~ ssList(X29)
| ~ ssList(X28)
| ~ ssItem(X27)
| ~ ssItem(X26)
| ~ strictorderedP(X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax12])])])])])]) ).
fof(c_0_8,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ ssList(X11)
| totalorderedP(X11)
| ~ leq(esk5_1(X11),esk6_1(X11)) )
& ( ~ ssList(X11)
| totalorderedP(X11)
| app(app(esk7_1(X11),cons(esk5_1(X11),esk8_1(X11))),cons(esk6_1(X11),esk9_1(X11))) = X11 )
& ( ~ ssList(X11)
| totalorderedP(X11)
| ssList(esk9_1(X11)) )
& ( ~ ssList(X11)
| totalorderedP(X11)
| ssList(esk8_1(X11)) )
& ( ~ ssList(X11)
| totalorderedP(X11)
| ssList(esk7_1(X11)) )
& ( ~ ssList(X11)
| totalorderedP(X11)
| ssItem(esk6_1(X11)) )
& ( ~ ssList(X11)
| totalorderedP(X11)
| ssItem(esk5_1(X11)) )
& ( ~ ssList(X11)
| leq(X12,X13)
| app(app(X14,cons(X12,X15)),cons(X13,X16)) != X11
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssList(X14)
| ~ ssItem(X13)
| ~ ssItem(X12)
| ~ totalorderedP(X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11])])])])])]) ).
fof(c_0_9,negated_conjecture,
( ~ totalorderedP(esk1_0)
& strictorderedP(esk3_0)
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_10,plain,
! [X50,X51] :
( ( ~ ssItem(X50)
| ~ ssItem(X51)
| lt(X50,X51)
| ~ leq(X50,X51)
| X50 = X51 )
& ( ~ ssItem(X50)
| ~ ssItem(X51)
| ~ lt(X50,X51)
| leq(X50,X51) )
& ( ~ ssItem(X50)
| ~ ssItem(X51)
| ~ lt(X50,X51)
| X50 != X51 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
cnf(c_0_11,plain,
( ~ ssList(X1)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ strictorderedP(X1)
| lt(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| app(app(esk7_1(X1),cons(esk5_1(X1),esk8_1(X1))),cons(esk6_1(X1),esk9_1(X1))) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
~ totalorderedP(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk9_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssItem(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssItem(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| ~ leq(esk5_1(X1),esk6_1(X1))
| totalorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| lt(X1,X2) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_25,negated_conjecture,
app(app(esk7_1(esk1_0),cons(esk5_1(esk1_0),esk8_1(esk1_0))),cons(esk6_1(esk1_0),esk9_1(esk1_0))) = esk1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_26,negated_conjecture,
strictorderedP(esk1_0),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk9_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_14]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk8_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_13]),c_0_14]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk7_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_14]) ).
cnf(c_0_30,negated_conjecture,
ssItem(esk6_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_13]),c_0_14]) ).
cnf(c_0_31,negated_conjecture,
ssItem(esk5_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_13]),c_0_14]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ lt(esk5_1(X1),esk6_1(X1))
| totalorderedP(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_21]),c_0_20]) ).
cnf(c_0_33,negated_conjecture,
lt(esk5_1(esk1_0),esk6_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_13]),c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_13])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC264+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.38 % Computer : n016.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8046.5625MB
% 0.15/0.38 % OS : Linux 6.8.0-71-generic
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Mon Sep 21 08:15:09 UTC 2026
% 0.15/0.39 % CPUTime :
% 0.15/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 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
% 242.95/36.00 % Version: 3.5.1
% 242.95/36.00 % Preprocessing class: FSLSSMSSSSSNFFN.
% 242.95/36.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 242.95/36.00 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 242.95/36.00 % Starting new_bool_3 with 300s (1) cores
% 242.95/36.00 % Starting new_bool_1 with 300s (1) cores
% 242.95/36.00 % Starting sh5l with 300s (1) cores
% 242.95/36.00 % new_bool_3 with pid 1985565 completed with status 0
% 242.95/36.00 % Result found by new_bool_3
% 242.95/36.00 % Preprocessing class: FSLSSMSSSSSNFFN.
% 242.95/36.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 242.95/36.00 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 242.95/36.00 % Starting new_bool_3 with 300s (1) cores
% 242.95/36.00 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 242.95/36.00 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 242.95/36.00 % Search class: FGHSF-FFMM21-MFFFFFNN
% 242.95/36.00 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 242.95/36.00 % Starting SubtermCWHack with 31s (1) cores
% 242.95/36.00 % SubtermCWHack with pid 1985574 completed with status 8
% 242.95/36.00 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 242.95/36.00 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1985999 completed with status 0
% 242.95/36.00 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 242.95/36.00 % Preprocessing class: FSLSSMSSSSSNFFN.
% 242.95/36.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 242.95/36.00 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 242.95/36.00 % Starting new_bool_3 with 300s (1) cores
% 242.95/36.00 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 242.95/36.00 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 242.95/36.00 % Search class: FGHSF-FFMM21-MFFFFFNN
% 242.95/36.00 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 242.95/36.00 % Starting SubtermCWHack with 31s (1) cores
% 242.95/36.00 % SubtermCWHack with pid 1985574 completed with status 8
% 242.95/36.00 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 242.95/36.00 % Preprocessing time : 0.003 s
% 242.95/36.00 % Presaturation interreduction done
% 242.95/36.00
% 242.95/36.00 % Proof found!
% 242.95/36.00 % SZS status Theorem
% 242.95/36.00 % SZS output start CNFRefutation
% See solution above
% 242.95/36.00 % Parsed axioms : 96
% 242.95/36.00 % Removed by relevancy pruning/SinE : 52
% 242.95/36.00 % Initial clauses : 84
% 242.95/36.00 % Removed in clause preprocessing : 2
% 242.95/36.00 % Initial clauses in saturation : 82
% 242.95/36.00 % Processed clauses : 4957
% 242.95/36.00 % ...of these trivial : 173
% 242.95/36.00 % ...subsumed : 2395
% 242.95/36.00 % ...remaining for further processing : 2389
% 242.95/36.00 % Other redundant clauses eliminated : 87
% 242.95/36.00 % Clauses deleted for lack of memory : 0
% 242.95/36.00 % Backward-subsumed : 52
% 242.95/36.00 % Backward-rewritten : 89
% 242.95/36.00 % Generated clauses : 278100
% 242.95/36.00 % ...of the previous two non-redundant : 276905
% 242.95/36.00 % ...aggressively subsumed : 0
% 242.95/36.00 % Contextual simplify-reflections : 211
% 242.95/36.00 % Paramodulations : 277946
% 242.95/36.00 % Factorizations : 0
% 242.95/36.00 % NegExts : 0
% 242.95/36.00 % Equation resolutions : 155
% 242.95/36.00 % Disequality decompositions : 0
% 242.95/36.00 % Total rewrite steps : 5862
% 242.95/36.00 % ...of those cached : 5844
% 242.95/36.00 % Propositional unsat checks : 0
% 242.95/36.00 % Propositional check models : 0
% 242.95/36.00 % Propositional check unsatisfiable : 0
% 242.95/36.00 % Propositional clauses : 0
% 242.95/36.00 % Propositional clauses after purity: 0
% 242.95/36.00 % Propositional unsat core size : 0
% 242.95/36.00 % Propositional preprocessing time : 0.000
% 242.95/36.00 % Propositional encoding time : 0.000
% 242.95/36.00 % Propositional solver time : 0.000
% 242.95/36.00 % Success case prop preproc time : 0.000
% 242.95/36.00 % Success case prop encoding time : 0.000
% 242.95/36.00 % Success case prop solver time : 0.000
% 242.95/36.00 % Current number of processed clauses : 2166
% 242.95/36.00 % Positive orientable unit clauses : 22
% 242.95/36.00 % Positive unorientable unit clauses: 0
% 242.95/36.00 % Negative unit clauses : 2
% 242.95/36.00 % Non-unit-clauses : 2142
% 242.95/36.00 % Current number of unprocessed clauses: 272069
% 242.95/36.00 % ...number of literals in the above : 1123606
% 242.95/36.00 % Current number of archived formulas : 0
% 242.95/36.00 % Current number of archived clauses : 217
% 242.95/36.00 % Clause-clause subsumption calls (NU) : 262535
% 242.95/36.00 % Rec. Clause-clause subsumption calls : 100159
% 242.95/36.00 % Non-unit clause-clause subsumptions : 2654
% 242.95/36.00 % Unit Clause-clause subsumption calls : 3460
% 242.95/36.00 % Rewrite failures with RHS unbound : 0
% 242.95/36.00 % BW rewrite match attempts : 28
% 242.95/36.00 % BW rewrite match successes : 4
% 242.95/36.00 % Condensation attempts : 0
% 242.95/36.00 % Condensation successes : 0
% 242.95/36.00 % Termbank termtop insertions : 5828012
% 242.95/36.00 % Search garbage collected termcells : 2089
% 242.95/36.00
% 242.95/36.00 % -------------------------------------------------
% 242.95/36.00 % User time : 32.052 s
% 242.95/36.00 % System time : 1.379 s
% 242.95/36.00 % Total time : 33.431 s
% 242.95/36.00 % Maximum resident set size: 4012 pages
% 242.95/36.00
% 242.95/36.00 % -------------------------------------------------
% 242.95/36.00 % User time : 32.056 s
% 242.95/36.00 % System time : 1.391 s
% 242.95/36.00 % Total time : 33.446 s
% 242.95/36.00 % Maximum resident set size: 4864 pages
% 242.95/36.00 % E exiting
%------------------------------------------------------------------------------