%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC252-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 : n003.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:40 PM UTC 2026
% Result : Unsatisfiable 2.03s 0.91s
% Output : CNFRefutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 54 ( 12 unt; 4 nHn; 54 RR)
% Number of literals : 153 ( 44 equ; 103 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 83 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_17,negated_conjecture,
( nil = sk3
| cons(sk6,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_12,negated_conjecture,
( ~ leq(X1,sk5(X3,X2,X1))
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause103,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause103) ).
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/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_11,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| lt(X1,sk5(X3,X2,X1)) ),
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(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(c_0_16,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_17,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_18,negated_conjecture,
( nil = sk3
| cons(sk6,nil) = sk3 ),
co1_17 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
nil != sk1,
c_0_16 ).
cnf(c_0_21,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
co1_14 ).
cnf(c_0_22,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_17 ).
cnf(c_0_25,negated_conjecture,
cons(sk6,nil) = sk1,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_20]) ).
cnf(c_0_26,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_19]),c_0_20]) ).
cnf(c_0_27,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_29,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_22 ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_23 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(X1)
| cons(sk6,X1) = app(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_33,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_27 ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
( ~ leq(X1,sk5(X3,X2,X1))
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_36,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause103]) ).
cnf(c_0_37,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_38,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| lt(X1,sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(cons(sk6,X1),X2) = app(sk1,app(X1,X2)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26])]),c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( ~ leq(X1,sk5(X3,X2,X1))
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
c_0_35 ).
cnf(c_0_42,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
c_0_36 ).
cnf(c_0_43,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
c_0_37 ).
cnf(c_0_44,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| lt(X1,sk5(X3,X2,X1)) ),
c_0_38 ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(nil,app(X1,app(X2,X3))) = app(X1,app(X2,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_34]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(X1)
| app(sk1,app(nil,X1)) = cons(sk6,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_40]),c_0_26]),c_0_31])]) ).
cnf(c_0_47,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2)
| app(app(X1,cons(X2,nil)),X3) != sk1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(X1)
| app(nil,cons(sk6,X1)) = cons(sk6,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_31])]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_25]),c_0_26]),c_0_31])]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_50 ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_31]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC252-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n003.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 08:10:15 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.55 Running first-order theorem proving
% 0.25/0.55 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
% 2.03/0.91 % Version: 3.5.1
% 2.03/0.91 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.03/0.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.03/0.91 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.03/0.91 % Starting new_bool_3 with 300s (1) cores
% 2.03/0.91 % Starting new_bool_1 with 300s (1) cores
% 2.03/0.91 % Starting sh5l with 300s (1) cores
% 2.03/0.91 % new_bool_3 with pid 3822770 completed with status 0
% 2.03/0.91 % Result found by new_bool_3
% 2.03/0.91 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.03/0.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.03/0.91 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.03/0.91 % Starting new_bool_3 with 300s (1) cores
% 2.03/0.91 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.03/0.91 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.03/0.91 % Search class: FGHSF-FFMM32-MFFFFFNN
% 2.03/0.91 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.03/0.91 % Starting SubtermCWHack with 31s (1) cores
% 2.03/0.91 % SubtermCWHack with pid 3822778 completed with status 0
% 2.03/0.91 % Result found by SubtermCWHack
% 2.03/0.91 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.03/0.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.03/0.91 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.03/0.91 % Starting new_bool_3 with 300s (1) cores
% 2.03/0.91 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.03/0.91 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.03/0.91 % Search class: FGHSF-FFMM32-MFFFFFNN
% 2.03/0.91 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.03/0.91 % Starting SubtermCWHack with 31s (1) cores
% 2.03/0.91 % Preprocessing time : 0.003 s
% 2.03/0.91
% 2.03/0.91 % Proof found!
% 2.03/0.91 % SZS status Unsatisfiable
% 2.03/0.91 % SZS output start CNFRefutation
% See solution above
% 2.03/0.91 % Parsed axioms : 203
% 2.03/0.91 % Removed by relevancy pruning/SinE : 149
% 2.03/0.91 % Initial clauses : 54
% 2.03/0.91 % Removed in clause preprocessing : 0
% 2.03/0.91 % Initial clauses in saturation : 54
% 2.03/0.91 % Processed clauses : 2344
% 2.03/0.91 % ...of these trivial : 12
% 2.03/0.91 % ...subsumed : 1886
% 2.03/0.91 % ...remaining for further processing : 446
% 2.03/0.91 % Other redundant clauses eliminated : 19
% 2.03/0.91 % Clauses deleted for lack of memory : 0
% 2.03/0.91 % Backward-subsumed : 32
% 2.03/0.91 % Backward-rewritten : 2
% 2.03/0.91 % Generated clauses : 9611
% 2.03/0.91 % ...of the previous two non-redundant : 8082
% 2.03/0.91 % ...aggressively subsumed : 0
% 2.03/0.91 % Contextual simplify-reflections : 122
% 2.03/0.91 % Paramodulations : 9575
% 2.03/0.91 % Factorizations : 0
% 2.03/0.91 % NegExts : 0
% 2.03/0.91 % Equation resolutions : 37
% 2.03/0.91 % Disequality decompositions : 0
% 2.03/0.91 % Total rewrite steps : 10497
% 2.03/0.91 % ...of those cached : 10468
% 2.03/0.91 % Propositional unsat checks : 0
% 2.03/0.91 % Propositional check models : 0
% 2.03/0.91 % Propositional check unsatisfiable : 0
% 2.03/0.91 % Propositional clauses : 0
% 2.03/0.91 % Propositional clauses after purity: 0
% 2.03/0.91 % Propositional unsat core size : 0
% 2.03/0.91 % Propositional preprocessing time : 0.000
% 2.03/0.91 % Propositional encoding time : 0.000
% 2.03/0.91 % Propositional solver time : 0.000
% 2.03/0.91 % Success case prop preproc time : 0.000
% 2.03/0.91 % Success case prop encoding time : 0.000
% 2.03/0.91 % Success case prop solver time : 0.000
% 2.03/0.91 % Current number of processed clauses : 408
% 2.03/0.91 % Positive orientable unit clauses : 31
% 2.03/0.91 % Positive unorientable unit clauses: 0
% 2.03/0.91 % Negative unit clauses : 14
% 2.03/0.91 % Non-unit-clauses : 363
% 2.03/0.91 % Current number of unprocessed clauses: 5770
% 2.03/0.91 % ...number of literals in the above : 29246
% 2.03/0.91 % Current number of archived formulas : 0
% 2.03/0.91 % Current number of archived clauses : 34
% 2.03/0.91 % Clause-clause subsumption calls (NU) : 37345
% 2.03/0.91 % Rec. Clause-clause subsumption calls : 16441
% 2.03/0.91 % Non-unit clause-clause subsumptions : 1481
% 2.03/0.91 % Unit Clause-clause subsumption calls : 40
% 2.03/0.91 % Rewrite failures with RHS unbound : 0
% 2.03/0.91 % BW rewrite match attempts : 22
% 2.03/0.91 % BW rewrite match successes : 2
% 2.03/0.91 % Condensation attempts : 0
% 2.03/0.91 % Condensation successes : 0
% 2.03/0.91 % Termbank termtop insertions : 172356
% 2.03/0.91 % Search garbage collected termcells : 911
% 2.03/0.91
% 2.03/0.91 % -------------------------------------------------
% 2.03/0.91 % User time : 0.268 s
% 2.03/0.91 % System time : 0.015 s
% 2.03/0.91 % Total time : 0.283 s
% 2.03/0.91 % Maximum resident set size: 4072 pages
% 2.03/0.91
% 2.03/0.91 % -------------------------------------------------
% 2.03/0.91 % User time : 0.275 s
% 2.03/0.91 % System time : 0.023 s
% 2.03/0.91 % Total time : 0.298 s
% 2.03/0.91 % Maximum resident set size: 4864 pages
% 2.03/0.91 % E exiting
%------------------------------------------------------------------------------