%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC271+1 : TPTP v9.3.1. Released v2.4.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:45:39 PM UTC 2026
% Result : Theorem 214.99s 42.08s
% Output : CNFRefutation 214.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 205 ( 21 equ)
% Maximal formula atoms : 30 ( 7 avg)
% Number of connectives : 265 ( 89 ~; 103 |; 39 &)
% ( 4 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 8 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn 43 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( totalorderedP(X1)
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X3)
& frontsegP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ strictorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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)
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X3)
& frontsegP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ strictorderedP(X3)
| ~ frontsegP(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)
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X3)
& frontsegP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ strictorderedP(X3)
| ~ frontsegP(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,
! [X255] :
( ~ totalorderedP(esk48_0)
& ( ~ strictorderedP(X255)
| ~ segmentP(X255,esk50_0)
| ~ frontsegP(esk51_0,X255)
| ~ neq(esk50_0,X255)
| ~ ssList(X255) )
& strictorderedP(esk50_0)
& frontsegP(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(shift_quantors,[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),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,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_22,plain,
( ~ ssList(X1)
| ~ leq(esk25_1(X1),esk26_1(X1))
| totalorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
~ totalorderedP(esk50_0),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,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_20,c_0_21]),c_0_13]),c_0_14]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
strictorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[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_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC271+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/10.38 % Computer : n010.cluster.edu
% 0.09/10.38 % Model : x86_64 x86_64
% 0.09/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.38 % Memory : 8046.5625MB
% 0.09/10.38 % OS : Linux 6.8.0-71-generic
% 0.09/10.38 % CPULimit : 300
% 0.09/10.38 % WCLimit : 300
% 0.09/10.38 % DateTime : Mon Sep 21 08:11:25 UTC 2026
% 0.09/10.38 % CPUTime :
% 0.09/10.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.43 Running first-order theorem proving
% 0.15/10.43 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
% 214.99/42.08 % Version: 3.5.1
% 214.99/42.08 % Preprocessing class: FSLSSMSSSSSNFFN.
% 214.99/42.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 214.99/42.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 214.99/42.08 % Starting new_bool_3 with 300s (1) cores
% 214.99/42.08 % Starting new_bool_1 with 300s (1) cores
% 214.99/42.08 % Starting sh5l with 300s (1) cores
% 214.99/42.08 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 439753 completed with status 0
% 214.99/42.08 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 214.99/42.08 % Preprocessing class: FSLSSMSSSSSNFFN.
% 214.99/42.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 214.99/42.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 214.99/42.08 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 214.99/42.08 % No SInE strategy applied
% 214.99/42.08 % Search class: FGHSF-FSLM21-MFFFFFNN
% 214.99/42.08 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 214.99/42.08 % Starting SubtermCWHack with 136s (1) cores
% 214.99/42.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 214.99/42.08 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 214.99/42.08 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 214.99/42.08 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 214.99/42.08 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 439762 completed with status 0
% 214.99/42.08 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 214.99/42.08 % Preprocessing class: FSLSSMSSSSSNFFN.
% 214.99/42.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 214.99/42.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 214.99/42.08 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 214.99/42.08 % No SInE strategy applied
% 214.99/42.08 % Search class: FGHSF-FSLM21-MFFFFFNN
% 214.99/42.08 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 214.99/42.08 % Starting SubtermCWHack with 136s (1) cores
% 214.99/42.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 214.99/42.08 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 214.99/42.08 % Preprocessing time : 0.002 s
% 214.99/42.08
% 214.99/42.08 % Proof found!
% 214.99/42.08 % SZS status Theorem
% 214.99/42.08 % SZS output start CNFRefutation
% See solution above
% 214.99/42.08 % Parsed axioms : 96
% 214.99/42.08 % Removed by relevancy pruning/SinE : 0
% 214.99/42.08 % Initial clauses : 200
% 214.99/42.08 % Removed in clause preprocessing : 2
% 214.99/42.08 % Initial clauses in saturation : 198
% 214.99/42.08 % Processed clauses : 66264
% 214.99/42.08 % ...of these trivial : 250
% 214.99/42.08 % ...subsumed : 54954
% 214.99/42.08 % ...remaining for further processing : 11060
% 214.99/42.08 % Other redundant clauses eliminated : 3012
% 214.99/42.08 % Clauses deleted for lack of memory : 0
% 214.99/42.08 % Backward-subsumed : 786
% 214.99/42.08 % Backward-rewritten : 622
% 214.99/42.08 % Generated clauses : 1490764
% 214.99/42.08 % ...of the previous two non-redundant : 1447140
% 214.99/42.08 % ...aggressively subsumed : 0
% 214.99/42.08 % Contextual simplify-reflections : 5823
% 214.99/42.08 % Paramodulations : 1486381
% 214.99/42.08 % Factorizations : 0
% 214.99/42.08 % NegExts : 0
% 214.99/42.08 % Equation resolutions : 4383
% 214.99/42.08 % Disequality decompositions : 0
% 214.99/42.08 % Total rewrite steps : 1196690
% 214.99/42.08 % ...of those cached : 1196224
% 214.99/42.08 % Propositional unsat checks : 0
% 214.99/42.08 % Propositional check models : 0
% 214.99/42.08 % Propositional check unsatisfiable : 0
% 214.99/42.08 % Propositional clauses : 0
% 214.99/42.08 % Propositional clauses after purity: 0
% 214.99/42.08 % Propositional unsat core size : 0
% 214.99/42.08 % Propositional preprocessing time : 0.000
% 214.99/42.08 % Propositional encoding time : 0.000
% 214.99/42.08 % Propositional solver time : 0.000
% 214.99/42.08 % Success case prop preproc time : 0.000
% 214.99/42.08 % Success case prop encoding time : 0.000
% 214.99/42.08 % Success case prop solver time : 0.000
% 214.99/42.08 % Current number of processed clauses : 9646
% 214.99/42.08 % Positive orientable unit clauses : 426
% 214.99/42.08 % Positive unorientable unit clauses: 0
% 214.99/42.08 % Negative unit clauses : 4
% 214.99/42.08 % Non-unit-clauses : 9216
% 214.99/42.08 % Current number of unprocessed clauses: 1379069
% 214.99/42.08 % ...number of literals in the above : 10692505
% 214.99/42.08 % Current number of archived formulas : 0
% 214.99/42.08 % Current number of archived clauses : 1408
% 214.99/42.08 % Clause-clause subsumption calls (NU) : 16888229
% 214.99/42.08 % Rec. Clause-clause subsumption calls : 5284014
% 214.99/42.08 % Non-unit clause-clause subsumptions : 60647
% 214.99/42.08 % Unit Clause-clause subsumption calls : 138745
% 214.99/42.08 % Rewrite failures with RHS unbound : 0
% 214.99/42.08 % BW rewrite match attempts : 1191
% 214.99/42.08 % BW rewrite match successes : 225
% 214.99/42.08 % Condensation attempts : 0
% 214.99/42.08 % Condensation successes : 0
% 214.99/42.08 % Termbank termtop insertions : 41752660
% 214.99/42.08 % Search garbage collected termcells : 4265
% 214.99/42.08
% 214.99/42.08 % -------------------------------------------------
% 214.99/42.08 % User time : 29.998 s
% 214.99/42.08 % System time : 0.915 s
% 214.99/42.08 % Total time : 30.913 s
% 214.99/42.08 % Maximum resident set size: 4272 pages
% 214.99/42.08
% 214.99/42.08 % -------------------------------------------------
% 214.99/42.08 % User time : 147.817 s
% 214.99/42.08 % System time : 4.287 s
% 214.99/42.08 % Total time : 152.104 s
% 214.99/42.08 % Maximum resident set size: 4864 pages
% 214.99/42.08 % E exiting
%------------------------------------------------------------------------------