%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC336-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 : n019.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:59 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.47s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of clauses : 58 ( 18 unt; 22 nHn; 58 RR)
% Number of literals : 116 ( 45 equ; 44 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(co1_21,negated_conjecture,
( ~ totalorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).
cnf(co1_18,negated_conjecture,
( nil = sk3
| app(app(sk6,sk3),sk7) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_15,negated_conjecture,
( nil = sk3
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_16,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause67,axiom,
( ~ ssItem(X1)
| totalorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause67) ).
cnf(co1_17,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_8,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_7,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause4,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause4) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_18,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_19,negated_conjecture,
( ~ totalorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_21]) ).
cnf(c_0_20,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_18 ).
cnf(c_0_21,negated_conjecture,
( nil = sk3
| app(app(sk6,sk3),sk7) = sk4 ),
co1_18 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,negated_conjecture,
( nil = sk3
| ssList(sk6) ),
co1_15 ).
cnf(c_0_26,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
co1_16 ).
cnf(c_0_27,plain,
( ~ ssItem(X1)
| totalorderedP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause67]) ).
cnf(c_0_28,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
co1_17 ).
cnf(c_0_29,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
co1_8 ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_31,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
co1_11 ).
cnf(c_0_32,negated_conjecture,
( ~ totalorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
c_0_19 ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_34,negated_conjecture,
( nil = sk1
| app(app(sk6,sk1),sk7) = sk4 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).
cnf(c_0_35,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_37,negated_conjecture,
( ssList(sk6)
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_38,negated_conjecture,
( ssList(sk7)
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_39,plain,
( ~ ssItem(X1)
| totalorderedP(cons(X1,nil)) ),
c_0_27 ).
cnf(c_0_40,negated_conjecture,
( nil = sk1
| cons(sk5,nil) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_22]),c_0_22]) ).
cnf(c_0_41,negated_conjecture,
( ssItem(sk5)
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_30 ).
cnf(c_0_43,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk1 ),
inference(rw,[status(thm)],[c_0_31,c_0_22]) ).
cnf(c_0_44,axiom,
ssList(nil),
clause8 ).
cnf(c_0_45,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
co1_7 ).
cnf(c_0_46,negated_conjecture,
( ~ totalorderedP(sk1)
| ~ segmentP(sk4,sk1) ),
inference(rw,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_47,negated_conjecture,
( segmentP(sk4,sk1)
| nil = sk1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]),c_0_37]),c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( totalorderedP(sk1)
| nil = sk1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_49,negated_conjecture,
( nil != sk1
| nil = sk4 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_45]) ).
cnf(c_0_50,negated_conjecture,
nil = sk1,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_51,axiom,
totalorderedP(nil),
clause4 ).
cnf(c_0_52,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_50])]) ).
cnf(c_0_53,plain,
totalorderedP(sk1),
inference(rw,[status(thm)],[c_0_51,c_0_50]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_55,negated_conjecture,
~ segmentP(sk1,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_52]),c_0_53])]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_54 ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC336-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.11/0.36 % Computer : n019.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 08:16:36 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.47 % Version: 3.5.1
% 0.11/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.47 % Starting sh5l with 300s (1) cores
% 0.11/0.47 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2115539 completed with status 0
% 0.11/0.47 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.11/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.47 % No SInE strategy applied
% 0.11/0.47 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.11/0.47 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.11/0.47 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.11/0.47 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.11/0.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.11/0.47 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 2115548 completed with status 0
% 0.11/0.47 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.11/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.47 % No SInE strategy applied
% 0.11/0.47 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.11/0.47 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.11/0.47 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.11/0.47 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.11/0.47 % Preprocessing time : 0.004 s
% 0.11/0.47
% 0.11/0.47 % Proof found!
% 0.11/0.47 % SZS status Unsatisfiable
% 0.11/0.47 % SZS output start CNFRefutation
% See solution above
% 0.11/0.47 % Parsed axioms : 206
% 0.11/0.47 % Removed by relevancy pruning/SinE : 0
% 0.11/0.47 % Initial clauses : 206
% 0.11/0.47 % Removed in clause preprocessing : 0
% 0.11/0.47 % Initial clauses in saturation : 206
% 0.11/0.47 % Processed clauses : 254
% 0.11/0.47 % ...of these trivial : 2
% 0.11/0.47 % ...subsumed : 8
% 0.11/0.47 % ...remaining for further processing : 244
% 0.11/0.47 % Other redundant clauses eliminated : 58
% 0.11/0.47 % Clauses deleted for lack of memory : 0
% 0.11/0.47 % Backward-subsumed : 0
% 0.11/0.47 % Backward-rewritten : 69
% 0.11/0.47 % Generated clauses : 595
% 0.11/0.47 % ...of the previous two non-redundant : 545
% 0.11/0.47 % ...aggressively subsumed : 0
% 0.11/0.47 % Contextual simplify-reflections : 19
% 0.11/0.47 % Paramodulations : 533
% 0.11/0.47 % Factorizations : 0
% 0.11/0.47 % NegExts : 0
% 0.11/0.47 % Equation resolutions : 63
% 0.11/0.47 % Disequality decompositions : 0
% 0.11/0.47 % Total rewrite steps : 440
% 0.11/0.47 % ...of those cached : 390
% 0.11/0.47 % Propositional unsat checks : 0
% 0.11/0.47 % Propositional check models : 0
% 0.11/0.47 % Propositional check unsatisfiable : 0
% 0.11/0.47 % Propositional clauses : 0
% 0.11/0.47 % Propositional clauses after purity: 0
% 0.11/0.47 % Propositional unsat core size : 0
% 0.11/0.47 % Propositional preprocessing time : 0.000
% 0.11/0.47 % Propositional encoding time : 0.000
% 0.11/0.47 % Propositional solver time : 0.000
% 0.11/0.47 % Success case prop preproc time : 0.000
% 0.11/0.47 % Success case prop encoding time : 0.000
% 0.11/0.47 % Success case prop solver time : 0.000
% 0.11/0.47 % Current number of processed clauses : 152
% 0.11/0.47 % Positive orientable unit clauses : 57
% 0.11/0.47 % Positive unorientable unit clauses: 0
% 0.11/0.47 % Negative unit clauses : 3
% 0.11/0.47 % Non-unit-clauses : 92
% 0.11/0.47 % Current number of unprocessed clauses: 497
% 0.11/0.47 % ...number of literals in the above : 2372
% 0.11/0.47 % Current number of archived formulas : 0
% 0.11/0.47 % Current number of archived clauses : 69
% 0.11/0.47 % Clause-clause subsumption calls (NU) : 5302
% 0.11/0.47 % Rec. Clause-clause subsumption calls : 733
% 0.11/0.47 % Non-unit clause-clause subsumptions : 25
% 0.11/0.47 % Unit Clause-clause subsumption calls : 175
% 0.11/0.47 % Rewrite failures with RHS unbound : 0
% 0.11/0.47 % BW rewrite match attempts : 2
% 0.11/0.47 % BW rewrite match successes : 2
% 0.11/0.47 % Condensation attempts : 0
% 0.11/0.47 % Condensation successes : 0
% 0.11/0.47 % Termbank termtop insertions : 18087
% 0.11/0.47 % Search garbage collected termcells : 550
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.029 s
% 0.11/0.47 % System time : 0.007 s
% 0.11/0.47 % Total time : 0.037 s
% 0.11/0.47 % Maximum resident set size: 4072 pages
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.145 s
% 0.11/0.47 % System time : 0.028 s
% 0.11/0.47 % Total time : 0.173 s
% 0.11/0.47 % Maximum resident set size: 5120 pages
% 0.11/0.47 % E exiting
%------------------------------------------------------------------------------