%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC340+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 : n003.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:44:00 PM UTC 2026
% Result : Theorem 207.72s 31.02s
% Output : CNFRefutation 207.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 9 unt; 0 def)
% Number of atoms : 195 ( 22 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 250 ( 88 ~; 99 |; 29 &)
% ( 4 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( totalorderedP(X1)
& segmentP(X2,X1) )
| ~ strictorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != 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] :
( ssList(X4)
=> ( ( totalorderedP(X1)
& segmentP(X2,X1) )
| ~ strictorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( totalorderedP(X1)
& segmentP(X2,X1) )
| ~ strictorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != 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,
! [X78,X79,X80,X81,X82,X83] :
( ( ~ ssList(X78)
| strictorderedP(X78)
| ~ lt(esk30_1(X78),esk31_1(X78)) )
& ( ~ ssList(X78)
| strictorderedP(X78)
| app(app(esk32_1(X78),cons(esk30_1(X78),esk33_1(X78))),cons(esk31_1(X78),esk34_1(X78))) = X78 )
& ( ~ ssList(X78)
| strictorderedP(X78)
| ssList(esk34_1(X78)) )
& ( ~ ssList(X78)
| strictorderedP(X78)
| ssList(esk33_1(X78)) )
& ( ~ ssList(X78)
| strictorderedP(X78)
| ssList(esk32_1(X78)) )
& ( ~ ssList(X78)
| strictorderedP(X78)
| ssItem(esk31_1(X78)) )
& ( ~ ssList(X78)
| strictorderedP(X78)
| ssItem(esk30_1(X78)) )
& ( ~ ssList(X78)
| lt(X79,X80)
| app(app(X81,cons(X79,X82)),cons(X80,X83)) != X78
| ~ ssList(X83)
| ~ ssList(X82)
| ~ ssList(X81)
| ~ ssItem(X80)
| ~ ssItem(X79)
| ~ strictorderedP(X78) ) ),
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,
! [X67,X68,X69,X70,X71,X72] :
( ( ~ ssList(X67)
| totalorderedP(X67)
| ~ leq(esk25_1(X67),esk26_1(X67)) )
& ( ~ ssList(X67)
| totalorderedP(X67)
| app(app(esk27_1(X67),cons(esk25_1(X67),esk28_1(X67))),cons(esk26_1(X67),esk29_1(X67))) = X67 )
& ( ~ ssList(X67)
| totalorderedP(X67)
| ssList(esk29_1(X67)) )
& ( ~ ssList(X67)
| totalorderedP(X67)
| ssList(esk28_1(X67)) )
& ( ~ ssList(X67)
| totalorderedP(X67)
| ssList(esk27_1(X67)) )
& ( ~ ssList(X67)
| totalorderedP(X67)
| ssItem(esk26_1(X67)) )
& ( ~ ssList(X67)
| totalorderedP(X67)
| ssItem(esk25_1(X67)) )
& ( ~ ssList(X67)
| leq(X68,X69)
| app(app(X70,cons(X68,X71)),cons(X69,X72)) != X67
| ~ ssList(X72)
| ~ ssList(X71)
| ~ ssList(X70)
| ~ ssItem(X69)
| ~ ssItem(X68)
| ~ totalorderedP(X67) ) ),
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(esk48_0)
| ~ segmentP(esk49_0,esk48_0) )
& strictorderedP(esk50_0)
& segmentP(esk51_0,esk50_0)
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_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,
! [X244,X245] :
( ( ~ ssItem(X244)
| ~ ssItem(X245)
| lt(X244,X245)
| ~ leq(X244,X245)
| X244 = X245 )
& ( ~ ssItem(X244)
| ~ ssItem(X245)
| ~ lt(X244,X245)
| leq(X244,X245) )
& ( ~ ssItem(X244)
| ~ ssItem(X245)
| ~ lt(X244,X245)
| X244 != X245 ) ),
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(esk27_1(X1),cons(esk25_1(X1),esk28_1(X1))),cons(esk26_1(X1),esk29_1(X1))) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssItem(esk25_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssItem(esk26_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk27_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk28_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk29_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
segmentP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ strictorderedP(X1)
| lt(esk25_1(X1),esk26_1(X1))
| totalorderedP(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12])]),c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| ~ leq(esk25_1(X1),esk26_1(X1))
| totalorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
strictorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( ~ segmentP(esk51_0,esk48_0)
| ~ totalorderedP(esk48_0) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
segmentP(esk51_0,esk48_0),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ strictorderedP(X1)
| totalorderedP(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_13]),c_0_14]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
strictorderedP(esk48_0),
inference(rw,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,negated_conjecture,
~ totalorderedP(esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC340+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.16/0.43 % Computer : n003.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Mon Sep 21 08:18:46 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.49 Running first-order theorem proving
% 0.16/0.49 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
% 207.72/31.02 % Version: 3.5.1
% 207.72/31.02 % Preprocessing class: FSLSSMSSSSSNFFN.
% 207.72/31.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 207.72/31.02 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 207.72/31.02 % Starting new_bool_3 with 300s (1) cores
% 207.72/31.02 % Starting new_bool_1 with 300s (1) cores
% 207.72/31.02 % Starting sh5l with 300s (1) cores
% 207.72/31.02 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3835894 completed with status 0
% 207.72/31.02 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 207.72/31.02 % Preprocessing class: FSLSSMSSSSSNFFN.
% 207.72/31.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 207.72/31.02 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 207.72/31.02 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 207.72/31.02 % No SInE strategy applied
% 207.72/31.02 % Search class: FGHSF-FSLM21-MFFFFFNN
% 207.72/31.02 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 207.72/31.02 % Starting SubtermCWHack with 136s (1) cores
% 207.72/31.02 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 207.72/31.02 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 207.72/31.02 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 207.72/31.02 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 207.72/31.02 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 3835903 completed with status 0
% 207.72/31.02 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 207.72/31.02 % Preprocessing class: FSLSSMSSSSSNFFN.
% 207.72/31.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 207.72/31.02 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 207.72/31.02 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 207.72/31.02 % No SInE strategy applied
% 207.72/31.02 % Search class: FGHSF-FSLM21-MFFFFFNN
% 207.72/31.02 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 207.72/31.02 % Starting SubtermCWHack with 136s (1) cores
% 207.72/31.02 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 207.72/31.02 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 207.72/31.02 % Preprocessing time : 0.003 s
% 207.72/31.02
% 207.72/31.02 % Proof found!
% 207.72/31.02 % SZS status Theorem
% 207.72/31.02 % SZS output start CNFRefutation
% See solution above
% 207.72/31.02 % Parsed axioms : 96
% 207.72/31.02 % Removed by relevancy pruning/SinE : 0
% 207.72/31.02 % Initial clauses : 199
% 207.72/31.02 % Removed in clause preprocessing : 2
% 207.72/31.02 % Initial clauses in saturation : 197
% 207.72/31.02 % Processed clauses : 69872
% 207.72/31.02 % ...of these trivial : 167
% 207.72/31.02 % ...subsumed : 59450
% 207.72/31.02 % ...remaining for further processing : 10255
% 207.72/31.02 % Other redundant clauses eliminated : 3568
% 207.72/31.02 % Clauses deleted for lack of memory : 0
% 207.72/31.02 % Backward-subsumed : 721
% 207.72/31.02 % Backward-rewritten : 284
% 207.72/31.02 % Generated clauses : 1615807
% 207.72/31.02 % ...of the previous two non-redundant : 1579405
% 207.72/31.02 % ...aggressively subsumed : 0
% 207.72/31.02 % Contextual simplify-reflections : 6174
% 207.72/31.02 % Paramodulations : 1610899
% 207.72/31.02 % Factorizations : 0
% 207.72/31.02 % NegExts : 0
% 207.72/31.02 % Equation resolutions : 4908
% 207.72/31.02 % Disequality decompositions : 0
% 207.72/31.02 % Total rewrite steps : 1048944
% 207.72/31.02 % ...of those cached : 1048614
% 207.72/31.02 % Propositional unsat checks : 0
% 207.72/31.02 % Propositional check models : 0
% 207.72/31.02 % Propositional check unsatisfiable : 0
% 207.72/31.02 % Propositional clauses : 0
% 207.72/31.02 % Propositional clauses after purity: 0
% 207.72/31.02 % Propositional unsat core size : 0
% 207.72/31.02 % Propositional preprocessing time : 0.000
% 207.72/31.02 % Propositional encoding time : 0.000
% 207.72/31.02 % Propositional solver time : 0.000
% 207.72/31.02 % Success case prop preproc time : 0.000
% 207.72/31.02 % Success case prop encoding time : 0.000
% 207.72/31.02 % Success case prop solver time : 0.000
% 207.72/31.02 % Current number of processed clauses : 9244
% 207.72/31.02 % Positive orientable unit clauses : 321
% 207.72/31.02 % Positive unorientable unit clauses: 0
% 207.72/31.02 % Negative unit clauses : 3
% 207.72/31.02 % Non-unit-clauses : 8920
% 207.72/31.02 % Current number of unprocessed clauses: 1508464
% 207.72/31.02 % ...number of literals in the above : 11955674
% 207.72/31.02 % Current number of archived formulas : 0
% 207.72/31.02 % Current number of archived clauses : 1005
% 207.72/31.02 % Clause-clause subsumption calls (NU) : 17621373
% 207.72/31.02 % Rec. Clause-clause subsumption calls : 6241890
% 207.72/31.02 % Non-unit clause-clause subsumptions : 65734
% 207.72/31.02 % Unit Clause-clause subsumption calls : 61932
% 207.72/31.02 % Rewrite failures with RHS unbound : 0
% 207.72/31.02 % BW rewrite match attempts : 745
% 207.72/31.02 % BW rewrite match successes : 169
% 207.72/31.02 % Condensation attempts : 0
% 207.72/31.02 % Condensation successes : 0
% 207.72/31.02 % Termbank termtop insertions : 44804684
% 207.72/31.02 % Search garbage collected termcells : 4210
% 207.72/31.02
% 207.72/31.02 % -------------------------------------------------
% 207.72/31.02 % User time : 28.736 s
% 207.72/31.02 % System time : 0.841 s
% 207.72/31.02 % Total time : 29.577 s
% 207.72/31.02 % Maximum resident set size: 4268 pages
% 207.72/31.02
% 207.72/31.02 % -------------------------------------------------
% 207.72/31.02 % User time : 142.499 s
% 207.72/31.02 % System time : 4.268 s
% 207.72/31.02 % Total time : 146.767 s
% 207.72/31.02 % Maximum resident set size: 4608 pages
% 207.72/31.02 % E exiting
%------------------------------------------------------------------------------