%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC226-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 : n007.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:32 PM UTC 2026
% Result : Unsatisfiable 202.95s 30.38s
% Output : CNFRefutation 202.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 19
% Syntax : Number of clauses : 62 ( 24 unt; 12 nHn; 62 RR)
% Number of literals : 153 ( 53 equ; 92 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 67 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_9,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X2,sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_8,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_8) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause123,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(co1_14,negated_conjecture,
app(sk3,sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_13,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
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(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(c_0_19,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_20,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X2,sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_21,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_19 ).
cnf(c_0_22,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X2,sk5(X3,X2,X1)) ),
c_0_20 ).
cnf(c_0_23,axiom,
ssList(nil),
clause8 ).
cnf(c_0_24,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_8]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(sk5(X2,nil,X1))
| app(app(nil,cons(X1,nil)),X2) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
c_0_24 ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(app(nil,cons(X1,nil)),X2) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_23])]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_27 ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_32,negated_conjecture,
app(sk3,sk6) = sk4,
co1_14 ).
cnf(c_0_33,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_34,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| app(cons(X1,nil),X2) != sk1 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_30 ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
c_0_31 ).
cnf(c_0_41,negated_conjecture,
app(sk1,sk6) = sk4,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_42,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_43,negated_conjecture,
ssList(sk6),
co1_13 ).
cnf(c_0_44,negated_conjecture,
nil != sk1,
c_0_34 ).
cnf(c_0_45,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_46,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_35 ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| cons(X1,X2) != sk1 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_38 ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_39 ).
cnf(c_0_52,negated_conjecture,
hd(sk4) = hd(sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]),c_0_44]) ).
cnf(c_0_53,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_54,negated_conjecture,
sk4 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_41]),c_0_43]),c_0_42])]),c_0_44]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_23])]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_50 ).
cnf(c_0_57,negated_conjecture,
ssItem(hd(sk1)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),c_0_54]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_59,negated_conjecture,
~ ssList(tl(sk1)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56])]),c_0_57]),c_0_42])]),c_0_44]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_58 ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_42])]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC226-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n007.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 08:03:50 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.42 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
% 202.95/30.37 % Version: 3.5.1
% 202.95/30.37 % Preprocessing class: FSLSSMSMSSSNFFN.
% 202.95/30.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 202.95/30.37 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 202.95/30.37 % Starting new_bool_3 with 300s (1) cores
% 202.95/30.37 % Starting new_bool_1 with 300s (1) cores
% 202.95/30.37 % Starting sh5l with 300s (1) cores
% 202.95/30.37 % sh5l with pid 603575 completed with status 0
% 202.95/30.37 % Result found by sh5l
% 202.95/30.37 % Preprocessing class: FSLSSMSMSSSNFFN.
% 202.95/30.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 202.95/30.37 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 202.95/30.37 % Starting new_bool_3 with 300s (1) cores
% 202.95/30.37 % Starting new_bool_1 with 300s (1) cores
% 202.95/30.37 % Starting sh5l with 300s (1) cores
% 202.95/30.37 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 202.95/30.37 % SinE strategy is gf500_gu_R04_F100_L20000
% 202.95/30.37 % Search class: FGHSM-FSLM31-MFFFFFNN
% 202.95/30.37 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 202.95/30.37 % Starting SubtermCWHack with 28s (1) cores
% 202.95/30.37 % SubtermCWHack with pid 603581 completed with status 8
% 202.95/30.37 % Starting sh5l with 31s (1) cores
% 202.95/30.38 % sh5l with pid 604003 completed with status 0
% 202.95/30.38 % Result found by sh5l
% 202.95/30.38 % Preprocessing class: FSLSSMSMSSSNFFN.
% 202.95/30.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 202.95/30.38 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 202.95/30.38 % Starting new_bool_3 with 300s (1) cores
% 202.95/30.38 % Starting new_bool_1 with 300s (1) cores
% 202.95/30.38 % Starting sh5l with 300s (1) cores
% 202.95/30.38 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 202.95/30.38 % SinE strategy is gf500_gu_R04_F100_L20000
% 202.95/30.38 % Search class: FGHSM-FSLM31-MFFFFFNN
% 202.95/30.38 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 202.95/30.38 % Starting SubtermCWHack with 28s (1) cores
% 202.95/30.38 % SubtermCWHack with pid 603581 completed with status 8
% 202.95/30.38 % Starting sh5l with 31s (1) cores
% 202.95/30.38 % Preprocessing time : 0.005 s
% 202.95/30.38 % Presaturation interreduction done
% 202.95/30.38
% 202.95/30.38 % Proof found!
% 202.95/30.38 % SZS status Unsatisfiable
% 202.95/30.38 % SZS output start CNFRefutation
% See solution above
% 202.95/30.38 % Parsed axioms : 202
% 202.95/30.38 % Removed by relevancy pruning/SinE : 58
% 202.95/30.38 % Initial clauses : 144
% 202.95/30.38 % Removed in clause preprocessing : 0
% 202.95/30.38 % Initial clauses in saturation : 144
% 202.95/30.38 % Processed clauses : 617
% 202.95/30.38 % ...of these trivial : 22
% 202.95/30.38 % ...subsumed : 159
% 202.95/30.38 % ...remaining for further processing : 436
% 202.95/30.38 % Other redundant clauses eliminated : 34
% 202.95/30.38 % Clauses deleted for lack of memory : 0
% 202.95/30.38 % Backward-subsumed : 37
% 202.95/30.38 % Backward-rewritten : 1
% 202.95/30.38 % Generated clauses : 991
% 202.95/30.38 % ...of the previous two non-redundant : 825
% 202.95/30.38 % ...aggressively subsumed : 0
% 202.95/30.38 % Contextual simplify-reflections : 10
% 202.95/30.38 % Paramodulations : 951
% 202.95/30.38 % Factorizations : 0
% 202.95/30.38 % NegExts : 0
% 202.95/30.38 % Equation resolutions : 41
% 202.95/30.38 % Disequality decompositions : 0
% 202.95/30.38 % Total rewrite steps : 740
% 202.95/30.38 % ...of those cached : 703
% 202.95/30.38 % Propositional unsat checks : 0
% 202.95/30.38 % Propositional check models : 0
% 202.95/30.38 % Propositional check unsatisfiable : 0
% 202.95/30.38 % Propositional clauses : 0
% 202.95/30.38 % Propositional clauses after purity: 0
% 202.95/30.38 % Propositional unsat core size : 0
% 202.95/30.38 % Propositional preprocessing time : 0.000
% 202.95/30.38 % Propositional encoding time : 0.000
% 202.95/30.38 % Propositional solver time : 0.000
% 202.95/30.38 % Success case prop preproc time : 0.000
% 202.95/30.38 % Success case prop encoding time : 0.000
% 202.95/30.38 % Success case prop solver time : 0.000
% 202.95/30.38 % Current number of processed clauses : 249
% 202.95/30.38 % Positive orientable unit clauses : 48
% 202.95/30.38 % Positive unorientable unit clauses: 0
% 202.95/30.38 % Negative unit clauses : 6
% 202.95/30.38 % Non-unit-clauses : 195
% 202.95/30.38 % Current number of unprocessed clauses: 478
% 202.95/30.38 % ...number of literals in the above : 2869
% 202.95/30.38 % Current number of archived formulas : 0
% 202.95/30.38 % Current number of archived clauses : 173
% 202.95/30.38 % Clause-clause subsumption calls (NU) : 12078
% 202.95/30.38 % Rec. Clause-clause subsumption calls : 2842
% 202.95/30.38 % Non-unit clause-clause subsumptions : 155
% 202.95/30.38 % Unit Clause-clause subsumption calls : 415
% 202.95/30.38 % Rewrite failures with RHS unbound : 0
% 202.95/30.38 % BW rewrite match attempts : 1
% 202.95/30.38 % BW rewrite match successes : 1
% 202.95/30.38 % Condensation attempts : 617
% 202.95/30.38 % Condensation successes : 0
% 202.95/30.38 % Termbank termtop insertions : 29828
% 202.95/30.38 % Search garbage collected termcells : 696
% 202.95/30.38
% 202.95/30.38 % -------------------------------------------------
% 202.95/30.38 % User time : 27.366 s
% 202.95/30.38 % System time : 0.823 s
% 202.95/30.38 % Total time : 28.189 s
% 202.95/30.38 % Maximum resident set size: 4072 pages
% 202.95/30.38
% 202.95/30.38 % -------------------------------------------------
% 202.95/30.38 % User time : 27.375 s
% 202.95/30.38 % System time : 0.826 s
% 202.95/30.38 % Total time : 28.201 s
% 202.95/30.38 % Maximum resident set size: 4864 pages
% 202.95/30.38 % E exiting
%------------------------------------------------------------------------------