%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC389-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 : n014.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:12 PM UTC 2026
% Result : Unsatisfiable 0.20s 5.64s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 19
% Syntax : Number of clauses : 66 ( 17 unt; 22 nHn; 66 RR)
% Number of literals : 149 ( 54 equ; 72 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 38 ( 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(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(co1_22,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_22) ).
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(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(clause79,axiom,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(co1_21,negated_conjecture,
( ~ segmentP(sk2,sk1)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).
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(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_19,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_20,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_21,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_22]) ).
cnf(c_0_22,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_19 ).
cnf(c_0_23,negated_conjecture,
( nil = sk3
| app(app(sk6,sk3),sk7) = sk4 ),
co1_18 ).
cnf(c_0_24,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_25,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_26,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_27,negated_conjecture,
( nil = sk3
| ssList(sk6) ),
co1_15 ).
cnf(c_0_28,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
co1_16 ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_20 ).
cnf(c_0_30,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
co1_17 ).
cnf(c_0_31,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
co1_8 ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_33,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
co1_11 ).
cnf(c_0_34,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
c_0_21 ).
cnf(c_0_35,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_22]) ).
cnf(c_0_36,negated_conjecture,
( nil = sk1
| app(app(sk6,sk1),sk7) = sk4 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_38,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_39,negated_conjecture,
( ssList(sk6)
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_40,negated_conjecture,
( ssList(sk7)
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_41,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_42,negated_conjecture,
( nil = sk1
| cons(sk5,nil) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_24]),c_0_24]) ).
cnf(c_0_43,negated_conjecture,
( ssItem(sk5)
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_31,c_0_24]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_45,negated_conjecture,
( ~ segmentP(sk2,sk1)
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_21]) ).
cnf(c_0_46,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_32 ).
cnf(c_0_47,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk1 ),
inference(rw,[status(thm)],[c_0_33,c_0_24]) ).
cnf(c_0_48,axiom,
ssList(nil),
clause8 ).
cnf(c_0_49,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
co1_7 ).
cnf(c_0_50,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk4,sk1) ),
inference(rw,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_51,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_35,c_0_36]),c_0_37]),c_0_38])]),c_0_39]),c_0_40]) ).
cnf(c_0_52,negated_conjecture,
( singletonP(sk1)
| nil = sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_38])]),c_0_43]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
c_0_44 ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_55,negated_conjecture,
( ~ segmentP(sk2,sk1)
| neq(sk2,nil) ),
c_0_45 ).
cnf(c_0_56,negated_conjecture,
( nil != sk1
| nil = sk4 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),c_0_49]) ).
cnf(c_0_57,negated_conjecture,
nil = sk1,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_58,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_53]),c_0_48])]) ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_54 ).
cnf(c_0_60,negated_conjecture,
( ~ segmentP(sk4,sk1)
| neq(sk4,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_26]),c_0_26]) ).
cnf(c_0_61,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_57])]) ).
cnf(c_0_62,plain,
segmentP(sk1,sk1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_57]),c_0_57]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_59]) ).
cnf(c_0_64,negated_conjecture,
neq(sk1,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_57]),c_0_61]),c_0_61]),c_0_62])]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC389-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.42 % Computer : n014.cluster.edu
% 0.16/5.42 % Model : x86_64 x86_64
% 0.16/5.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.42 % Memory : 8046.5625MB
% 0.16/5.42 % OS : Linux 6.8.0-71-generic
% 0.16/5.42 % CPULimit : 300
% 0.16/5.42 % WCLimit : 300
% 0.16/5.42 % DateTime : Mon Sep 21 08:21:11 UTC 2026
% 0.16/5.42 % CPUTime :
% 0.16/5.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.49 Running first-order theorem proving
% 0.16/5.49 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.20/5.64 % Version: 3.5.1
% 0.20/5.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/5.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/5.64 % Starting new_bool_3 with 300s (1) cores
% 0.20/5.64 % Starting new_bool_1 with 300s (1) cores
% 0.20/5.64 % Starting sh5l with 300s (1) cores
% 0.20/5.64 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3628136 completed with status 0
% 0.20/5.64 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/5.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/5.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/5.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/5.64 % No SInE strategy applied
% 0.20/5.64 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/5.64 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/5.64 % Starting SubtermCWHack with 136s (1) cores
% 0.20/5.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/5.64 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/5.64 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.20/5.64 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.20/5.64 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 3628145 completed with status 0
% 0.20/5.64 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.20/5.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/5.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/5.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/5.64 % No SInE strategy applied
% 0.20/5.64 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/5.64 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/5.64 % Starting SubtermCWHack with 136s (1) cores
% 0.20/5.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/5.64 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/5.64 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.20/5.64 % Preprocessing time : 0.006 s
% 0.20/5.64
% 0.20/5.64 % Proof found!
% 0.20/5.64 % SZS status Unsatisfiable
% 0.20/5.64 % SZS output start CNFRefutation
% See solution above
% 0.20/5.64 % Parsed axioms : 207
% 0.20/5.64 % Removed by relevancy pruning/SinE : 0
% 0.20/5.64 % Initial clauses : 207
% 0.20/5.64 % Removed in clause preprocessing : 0
% 0.20/5.64 % Initial clauses in saturation : 207
% 0.20/5.64 % Processed clauses : 268
% 0.20/5.64 % ...of these trivial : 9
% 0.20/5.64 % ...subsumed : 9
% 0.20/5.64 % ...remaining for further processing : 250
% 0.20/5.64 % Other redundant clauses eliminated : 58
% 0.20/5.64 % Clauses deleted for lack of memory : 0
% 0.20/5.64 % Backward-subsumed : 0
% 0.20/5.64 % Backward-rewritten : 69
% 0.20/5.64 % Generated clauses : 624
% 0.20/5.64 % ...of the previous two non-redundant : 571
% 0.20/5.64 % ...aggressively subsumed : 0
% 0.20/5.64 % Contextual simplify-reflections : 17
% 0.20/5.64 % Paramodulations : 562
% 0.20/5.64 % Factorizations : 0
% 0.20/5.64 % NegExts : 0
% 0.20/5.64 % Equation resolutions : 63
% 0.20/5.64 % Disequality decompositions : 0
% 0.20/5.64 % Total rewrite steps : 524
% 0.20/5.64 % ...of those cached : 462
% 0.20/5.64 % Propositional unsat checks : 0
% 0.20/5.64 % Propositional check models : 0
% 0.20/5.64 % Propositional check unsatisfiable : 0
% 0.20/5.64 % Propositional clauses : 0
% 0.20/5.64 % Propositional clauses after purity: 0
% 0.20/5.64 % Propositional unsat core size : 0
% 0.20/5.64 % Propositional preprocessing time : 0.000
% 0.20/5.64 % Propositional encoding time : 0.000
% 0.20/5.64 % Propositional solver time : 0.000
% 0.20/5.64 % Success case prop preproc time : 0.000
% 0.20/5.64 % Success case prop encoding time : 0.000
% 0.20/5.64 % Success case prop solver time : 0.000
% 0.20/5.64 % Current number of processed clauses : 158
% 0.20/5.64 % Positive orientable unit clauses : 61
% 0.20/5.64 % Positive unorientable unit clauses: 0
% 0.20/5.64 % Negative unit clauses : 2
% 0.20/5.64 % Non-unit-clauses : 95
% 0.20/5.64 % Current number of unprocessed clauses: 508
% 0.20/5.64 % ...number of literals in the above : 2499
% 0.20/5.64 % Current number of archived formulas : 0
% 0.20/5.64 % Current number of archived clauses : 69
% 0.20/5.64 % Clause-clause subsumption calls (NU) : 5779
% 0.20/5.64 % Rec. Clause-clause subsumption calls : 719
% 0.20/5.64 % Non-unit clause-clause subsumptions : 23
% 0.20/5.64 % Unit Clause-clause subsumption calls : 168
% 0.20/5.64 % Rewrite failures with RHS unbound : 0
% 0.20/5.64 % BW rewrite match attempts : 2
% 0.20/5.64 % BW rewrite match successes : 2
% 0.20/5.64 % Condensation attempts : 0
% 0.20/5.64 % Condensation successes : 0
% 0.20/5.64 % Termbank termtop insertions : 18998
% 0.20/5.64 % Search garbage collected termcells : 551
% 0.20/5.64
% 0.20/5.64 % -------------------------------------------------
% 0.20/5.64 % User time : 0.035 s
% 0.20/5.64 % System time : 0.010 s
% 0.20/5.64 % Total time : 0.045 s
% 0.20/5.64 % Maximum resident set size: 4072 pages
% 0.20/5.64
% 0.20/5.64 % -------------------------------------------------
% 0.20/5.64 % User time : 0.228 s
% 0.20/5.64 % System time : 0.036 s
% 0.20/5.64 % Total time : 0.264 s
% 0.20/5.64 % Maximum resident set size: 4864 pages
% 0.20/5.64 % E exiting
%------------------------------------------------------------------------------