%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC229-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 : n015.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:33 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.57s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of clauses : 60 ( 21 unt; 3 nHn; 58 RR)
% Number of literals : 140 ( 38 equ; 90 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 53 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_11,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X3,sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(co1_14,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause127,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause127) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_8,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause56,axiom,
( ~ ssList(X1)
| segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(c_0_18,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_19,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X3,sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_20,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_18 ).
cnf(c_0_21,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X3,sk5(X3,X2,X1)) ),
c_0_19 ).
cnf(c_0_22,axiom,
ssList(nil),
clause8 ).
cnf(c_0_23,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssItem(sk5(nil,X1,X2))
| app(app(X1,cons(X2,nil)),nil) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
c_0_23 ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| app(app(X1,cons(X2,nil)),nil) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22])]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_26 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_30,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| app(cons(X1,nil),nil) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22])]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_29 ).
cnf(c_0_33,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_34,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
c_0_30 ).
cnf(c_0_35,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[clause127]) ).
cnf(c_0_37,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_38,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_39,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(X1)
| ~ singletonP(X1)
| app(X1,nil) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_41,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk1) ),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
c_0_36 ).
cnf(c_0_45,negated_conjecture,
segmentP(sk4,sk1),
inference(rw,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_46,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk1,nil) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_43 ).
cnf(c_0_49,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_50,negated_conjecture,
( ~ segmentP(sk1,sk4)
| sk4 = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_42])]) ).
cnf(c_0_51,negated_conjecture,
( app(sk1,nil) != sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_46]),c_0_22])]) ).
cnf(c_0_52,negated_conjecture,
nil != sk1,
c_0_49 ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_54,negated_conjecture,
( ~ segmentP(sk1,nil)
| app(sk1,nil) != sk1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_53 ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_57,negated_conjecture,
app(sk1,nil) != sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_42])]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_56 ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC229-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 08:10:07 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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
% 0.15/0.57 % Version: 3.5.1
% 0.15/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.57 % Starting sh5l with 300s (1) cores
% 0.15/0.57 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1002658 completed with status 0
% 0.15/0.57 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.57 % No SInE strategy applied
% 0.15/0.57 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.15/0.57 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.57 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.15/0.57 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.15/0.57 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.57 % G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with pid 1002664 completed with status 0
% 0.15/0.57 % Result found by G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 0.15/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.57 % No SInE strategy applied
% 0.15/0.57 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.15/0.57 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.57 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.15/0.57 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.15/0.57 % Preprocessing time : 0.005 s
% 0.15/0.57 % Presaturation interreduction done
% 0.15/0.57
% 0.15/0.57 % Proof found!
% 0.15/0.57 % SZS status Unsatisfiable
% 0.15/0.57 % SZS output start CNFRefutation
% See solution above
% 0.15/0.57 % Parsed axioms : 199
% 0.15/0.57 % Removed by relevancy pruning/SinE : 0
% 0.15/0.57 % Initial clauses : 199
% 0.15/0.57 % Removed in clause preprocessing : 0
% 0.15/0.57 % Initial clauses in saturation : 199
% 0.15/0.57 % Processed clauses : 427
% 0.15/0.57 % ...of these trivial : 2
% 0.15/0.57 % ...subsumed : 11
% 0.15/0.57 % ...remaining for further processing : 414
% 0.15/0.57 % Other redundant clauses eliminated : 82
% 0.15/0.57 % Clauses deleted for lack of memory : 0
% 0.15/0.57 % Backward-subsumed : 5
% 0.15/0.57 % Backward-rewritten : 0
% 0.15/0.57 % Generated clauses : 878
% 0.15/0.57 % ...of the previous two non-redundant : 714
% 0.15/0.57 % ...aggressively subsumed : 0
% 0.15/0.57 % Contextual simplify-reflections : 4
% 0.15/0.57 % Paramodulations : 778
% 0.15/0.57 % Factorizations : 0
% 0.15/0.57 % NegExts : 0
% 0.15/0.57 % Equation resolutions : 100
% 0.15/0.57 % Disequality decompositions : 0
% 0.15/0.57 % Total rewrite steps : 710
% 0.15/0.57 % ...of those cached : 601
% 0.15/0.57 % Propositional unsat checks : 0
% 0.15/0.57 % Propositional check models : 0
% 0.15/0.57 % Propositional check unsatisfiable : 0
% 0.15/0.57 % Propositional clauses : 0
% 0.15/0.57 % Propositional clauses after purity: 0
% 0.15/0.57 % Propositional unsat core size : 0
% 0.15/0.57 % Propositional preprocessing time : 0.000
% 0.15/0.57 % Propositional encoding time : 0.000
% 0.15/0.57 % Propositional solver time : 0.000
% 0.15/0.57 % Success case prop preproc time : 0.000
% 0.15/0.57 % Success case prop encoding time : 0.000
% 0.15/0.57 % Success case prop solver time : 0.000
% 0.15/0.57 % Current number of processed clauses : 211
% 0.15/0.57 % Positive orientable unit clauses : 57
% 0.15/0.57 % Positive unorientable unit clauses: 0
% 0.15/0.57 % Negative unit clauses : 4
% 0.15/0.57 % Non-unit-clauses : 150
% 0.15/0.58 % Current number of unprocessed clauses: 679
% 0.15/0.58 % ...number of literals in the above : 4379
% 0.15/0.58 % Current number of archived formulas : 0
% 0.15/0.58 % Current number of archived clauses : 198
% 0.15/0.58 % Clause-clause subsumption calls (NU) : 10743
% 0.15/0.58 % Rec. Clause-clause subsumption calls : 1350
% 0.15/0.58 % Non-unit clause-clause subsumptions : 15
% 0.15/0.58 % Unit Clause-clause subsumption calls : 15
% 0.15/0.58 % Rewrite failures with RHS unbound : 0
% 0.15/0.58 % BW rewrite match attempts : 0
% 0.15/0.58 % BW rewrite match successes : 0
% 0.15/0.58 % Condensation attempts : 0
% 0.15/0.58 % Condensation successes : 0
% 0.15/0.58 % Termbank termtop insertions : 26759
% 0.15/0.58 % Search garbage collected termcells : 556
% 0.15/0.58
% 0.15/0.58 % -------------------------------------------------
% 0.15/0.58 % User time : 0.071 s
% 0.15/0.58 % System time : 0.011 s
% 0.15/0.58 % Total time : 0.082 s
% 0.15/0.58 % Maximum resident set size: 4068 pages
% 0.15/0.58
% 0.15/0.58 % -------------------------------------------------
% 0.15/0.58 % User time : 0.287 s
% 0.15/0.58 % System time : 0.040 s
% 0.15/0.58 % Total time : 0.327 s
% 0.15/0.58 % Maximum resident set size: 4864 pages
% 0.15/0.58 % E exiting
%------------------------------------------------------------------------------