%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC249+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 : n001.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:43:39 PM UTC 2026
% Result : Theorem 0.66s 0.49s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 199 ( 44 equ)
% Maximal formula atoms : 39 ( 5 avg)
% Number of connectives : 265 ( 102 ~; 98 |; 42 &)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 73 ( 0 sgn 34 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ! [X9] :
( ssItem(X9)
=> ( leq(X6,X9)
| ~ lt(X6,X9)
| ~ memberP(X8,X9)
| ~ memberP(X7,X9) ) )
& app(app(X7,cons(X6,nil)),X8) = X1
& ssList(X8) )
& ssList(X7) )
& ssItem(X6) )
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X3)
& frontsegP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| nil = X1
| ~ strictorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ! [X9] :
( ssItem(X9)
=> ( leq(X6,X9)
| ~ lt(X6,X9)
| ~ memberP(X8,X9)
| ~ memberP(X7,X9) ) )
& app(app(X7,cons(X6,nil)),X8) = X1
& ssList(X8) )
& ssList(X7) )
& ssItem(X6) )
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X3)
& frontsegP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| nil = X1
| ~ strictorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_8,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ! [X9] :
( ssItem(X9)
=> ( leq(X6,X9)
| ~ lt(X6,X9)
| ~ memberP(X8,X9)
| ~ memberP(X7,X9) ) )
& app(app(X7,cons(X6,nil)),X8) = X1
& ssList(X8) )
& ssList(X7) )
& ssItem(X6) )
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X3)
& frontsegP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| nil = X1
| ~ strictorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X160] :
( ~ memberP(nil,X160)
| ~ ssItem(X160) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,negated_conjecture,
! [X258,X259,X260,X261] :
( ( ~ ssItem(X259)
| ~ ssList(X260)
| app(app(X260,cons(X259,nil)),X261) != esk48_0
| ~ ssList(X261)
| ~ leq(X259,esk52_3(X259,X260,X261)) )
& ( ~ ssItem(X259)
| ~ ssList(X260)
| app(app(X260,cons(X259,nil)),X261) != esk48_0
| ~ ssList(X261)
| lt(X259,esk52_3(X259,X260,X261)) )
& ( ~ ssItem(X259)
| ~ ssList(X260)
| app(app(X260,cons(X259,nil)),X261) != esk48_0
| ~ ssList(X261)
| memberP(X261,esk52_3(X259,X260,X261)) )
& ( ~ ssItem(X259)
| ~ ssList(X260)
| app(app(X260,cons(X259,nil)),X261) != esk48_0
| ~ ssList(X261)
| memberP(X260,esk52_3(X259,X260,X261)) )
& ( ~ ssItem(X259)
| ~ ssList(X260)
| app(app(X260,cons(X259,nil)),X261) != esk48_0
| ~ ssList(X261)
| ssItem(esk52_3(X259,X260,X261)) )
& ( ~ strictorderedP(X258)
| ~ segmentP(X258,esk50_0)
| ~ frontsegP(esk51_0,X258)
| ~ neq(esk50_0,X258)
| ~ ssList(X258) )
& nil != esk48_0
& 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(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)],[c_0_9])])])])])]) ).
cnf(c_0_12,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| memberP(X1,esk52_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_15,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(esk52_3(X1,nil,X2))
| ~ ssList(X2)
| app(app(nil,cons(X1,nil)),X2) != esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_16,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ssItem(esk52_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X138] :
( app(nil,X138) = X138
| ~ ssList(X138) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(nil,cons(X1,nil)),X2) != esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14])]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X223,X224] :
( cons(X224,X223) = app(cons(X224,nil),X223)
| ~ ssItem(X224)
| ~ ssList(X223) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| app(cons(X1,nil),X2) != esk48_0 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X114,X115] :
( ssList(cons(X115,X114))
| ~ ssItem(X115)
| ~ ssList(X114) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| cons(X1,X2) != esk48_0 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_26,plain,
! [X122] :
( ( ~ ssList(X122)
| nil = X122
| cons(esk45_1(X122),esk44_1(X122)) = X122 )
& ( ~ ssList(X122)
| nil = X122
| ssItem(esk45_1(X122)) )
& ( ~ ssList(X122)
| nil = X122
| ssList(esk44_1(X122)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,X2) != esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14])]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk45_1(X1),esk44_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssItem(esk45_1(esk48_0))
| ~ ssList(esk44_1(esk48_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28])]),c_0_29])]),c_0_30]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk45_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
~ ssList(esk44_1(esk48_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29])]),c_0_30]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk44_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29])]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC249+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/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:14:14 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.66/0.49 % Version: 3.5.1
% 0.66/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.66/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.66/0.49 % Starting sh5l with 300s (1) cores
% 0.66/0.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2645326 completed with status 0
% 0.66/0.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.66/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.66/0.49 % No SInE strategy applied
% 0.66/0.49 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.66/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.66/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.66/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.66/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.66/0.49 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.66/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.66/0.49 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2645344 completed with status 0
% 0.66/0.49 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.66/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.66/0.49 % No SInE strategy applied
% 0.66/0.49 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.66/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.66/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.66/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.66/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.66/0.49 % Preprocessing time : 0.004 s
% 0.66/0.49 % Presaturation interreduction done
% 0.66/0.49
% 0.66/0.49 % Proof found!
% 0.66/0.49 % SZS status Theorem
% 0.66/0.49 % SZS output start CNFRefutation
% See solution above
% 0.66/0.49 % Parsed axioms : 96
% 0.66/0.49 % Removed by relevancy pruning/SinE : 0
% 0.66/0.49 % Initial clauses : 205
% 0.66/0.49 % Removed in clause preprocessing : 2
% 0.66/0.49 % Initial clauses in saturation : 203
% 0.66/0.49 % Processed clauses : 570
% 0.66/0.49 % ...of these trivial : 2
% 0.66/0.49 % ...subsumed : 89
% 0.66/0.49 % ...remaining for further processing : 479
% 0.66/0.49 % Other redundant clauses eliminated : 82
% 0.66/0.49 % Clauses deleted for lack of memory : 0
% 0.66/0.49 % Backward-subsumed : 11
% 0.66/0.49 % Backward-rewritten : 2
% 0.66/0.49 % Generated clauses : 707
% 0.66/0.49 % ...of the previous two non-redundant : 560
% 0.66/0.49 % ...aggressively subsumed : 0
% 0.66/0.49 % Contextual simplify-reflections : 32
% 0.66/0.49 % Paramodulations : 622
% 0.66/0.49 % Factorizations : 0
% 0.66/0.49 % NegExts : 0
% 0.66/0.49 % Equation resolutions : 87
% 0.66/0.49 % Disequality decompositions : 0
% 0.66/0.49 % Total rewrite steps : 283
% 0.66/0.49 % ...of those cached : 270
% 0.66/0.49 % Propositional unsat checks : 0
% 0.66/0.49 % Propositional check models : 0
% 0.66/0.49 % Propositional check unsatisfiable : 0
% 0.66/0.49 % Propositional clauses : 0
% 0.66/0.49 % Propositional clauses after purity: 0
% 0.66/0.49 % Propositional unsat core size : 0
% 0.66/0.49 % Propositional preprocessing time : 0.000
% 0.66/0.49 % Propositional encoding time : 0.000
% 0.66/0.49 % Propositional solver time : 0.000
% 0.66/0.49 % Success case prop preproc time : 0.000
% 0.66/0.49 % Success case prop encoding time : 0.000
% 0.66/0.49 % Success case prop solver time : 0.000
% 0.66/0.49 % Current number of processed clauses : 246
% 0.66/0.49 % Positive orientable unit clauses : 22
% 0.66/0.49 % Positive unorientable unit clauses: 0
% 0.66/0.49 % Negative unit clauses : 6
% 0.66/0.49 % Non-unit-clauses : 218
% 0.66/0.49 % Current number of unprocessed clauses: 390
% 0.66/0.49 % ...number of literals in the above : 2514
% 0.66/0.49 % Current number of archived formulas : 0
% 0.66/0.49 % Current number of archived clauses : 210
% 0.66/0.49 % Clause-clause subsumption calls (NU) : 23257
% 0.66/0.49 % Rec. Clause-clause subsumption calls : 5247
% 0.66/0.49 % Non-unit clause-clause subsumptions : 115
% 0.66/0.49 % Unit Clause-clause subsumption calls : 87
% 0.66/0.49 % Rewrite failures with RHS unbound : 0
% 0.66/0.49 % BW rewrite match attempts : 2
% 0.66/0.49 % BW rewrite match successes : 2
% 0.66/0.49 % Condensation attempts : 0
% 0.66/0.49 % Condensation successes : 0
% 0.66/0.49 % Termbank termtop insertions : 32410
% 0.66/0.49 % Search garbage collected termcells : 4424
% 0.66/0.49
% 0.66/0.49 % -------------------------------------------------
% 0.66/0.49 % User time : 0.063 s
% 0.66/0.49 % System time : 0.006 s
% 0.66/0.49 % Total time : 0.069 s
% 0.66/0.49 % Maximum resident set size: 4276 pages
% 0.66/0.49
% 0.66/0.49 % -------------------------------------------------
% 0.66/0.49 % User time : 0.268 s
% 0.66/0.49 % System time : 0.028 s
% 0.66/0.49 % Total time : 0.296 s
% 0.66/0.49 % Maximum resident set size: 4608 pages
% 0.66/0.49 % E exiting
%------------------------------------------------------------------------------