%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC322-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 : n008.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:56 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.54s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of clauses : 62 ( 12 unt; 6 nHn; 62 RR)
% Number of literals : 142 ( 88 equ; 80 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_15,negated_conjecture,
( nil != sk1
| app(sk6,cons(sk5,nil)) = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
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_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_10,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_16,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
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(co1_7,negated_conjecture,
( app(X2,cons(X1,nil)) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( nil = sk2
| app(sk6,cons(sk5,nil)) = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_9,negated_conjecture,
( nil = sk2
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_11,negated_conjecture,
( nil = sk2
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_13,negated_conjecture,
( app(cons(sk5,nil),sk6) != sk1
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(c_0_17,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_19,negated_conjecture,
( nil != sk1
| app(sk6,cons(sk5,nil)) = sk2 ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_20,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_21,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_18 ).
cnf(c_0_25,negated_conjecture,
( nil != sk1
| app(sk6,cons(sk5,nil)) = sk2 ),
c_0_19 ).
cnf(c_0_26,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
c_0_20 ).
cnf(c_0_27,negated_conjecture,
( sk2 != nil
| sk1 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk2 != nil
| sk6 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_28 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssItem(sk5)
| sk2 != nil
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
c_0_32 ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_36,negated_conjecture,
( sk2 != nil
| sk6 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_27]) ).
cnf(c_0_37,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_35 ).
cnf(c_0_40,negated_conjecture,
( sk2 != nil
| app(nil,cons(sk5,nil)) = sk2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_36]),c_0_27]) ).
cnf(c_0_41,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) != sk1 ),
c_0_37 ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_38 ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk2 != nil
| cons(sk5,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_31])]) ).
cnf(c_0_44,negated_conjecture,
( sk1 != nil
| cons(sk5,sk6) != sk1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_26]),c_0_34]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssItem(sk5)
| sk2 != nil
| cons(sk5,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_30]),c_0_31])]) ).
cnf(c_0_46,negated_conjecture,
( app(X2,cons(X1,nil)) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_47,negated_conjecture,
( sk2 != nil
| cons(sk5,nil) != sk1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_36]),c_0_27]) ).
cnf(c_0_48,negated_conjecture,
( sk2 != nil
| cons(sk5,nil) = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_34]),c_0_27]) ).
cnf(c_0_49,negated_conjecture,
( app(X2,cons(X1,nil)) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = sk3 ),
c_0_46 ).
cnf(c_0_50,negated_conjecture,
( nil = sk2
| app(sk6,cons(sk5,nil)) = sk2 ),
co1_12 ).
cnf(c_0_51,negated_conjecture,
sk2 != nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_27]) ).
cnf(c_0_52,negated_conjecture,
( nil = sk2
| ssItem(sk5) ),
co1_9 ).
cnf(c_0_53,negated_conjecture,
( nil = sk2
| ssList(sk6) ),
co1_11 ).
cnf(c_0_54,negated_conjecture,
( app(cons(sk5,nil),sk6) != sk1
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) != sk2
| app(cons(X1,nil),X2) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_22]),c_0_23]) ).
cnf(c_0_56,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk2,
inference(sr,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_53,c_0_51]) ).
cnf(c_0_59,negated_conjecture,
( app(cons(sk5,nil),sk6) != sk1
| nil = sk2 ),
c_0_54 ).
cnf(c_0_60,negated_conjecture,
app(cons(sk5,nil),sk6) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC322-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.40 % Computer : n008.cluster.edu
% 0.16/0.40 % Model : x86_64 x86_64
% 0.16/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.40 % Memory : 8046.5625MB
% 0.16/0.40 % OS : Linux 6.8.0-71-generic
% 0.16/0.40 % CPULimit : 300
% 0.16/0.40 % WCLimit : 300
% 0.16/0.40 % DateTime : Mon Sep 21 08:15:54 UTC 2026
% 0.16/0.41 % CPUTime :
% 0.16/0.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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.25/0.54 % Version: 3.5.1
% 0.25/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.54 % Starting sh5l with 300s (1) cores
% 0.25/0.54 % new_bool_3 with pid 557816 completed with status 0
% 0.25/0.54 % Result found by new_bool_3
% 0.25/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.54 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.25/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.54 % SubtermCWHack with pid 557821 completed with status 0
% 0.25/0.54 % Result found by SubtermCWHack
% 0.25/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.54 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.25/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.54 % Preprocessing time : 0.003 s
% 0.25/0.54
% 0.25/0.54 % Proof found!
% 0.25/0.54 % SZS status Unsatisfiable
% 0.25/0.54 % SZS output start CNFRefutation
% See solution above
% 0.25/0.54 % Parsed axioms : 201
% 0.25/0.54 % Removed by relevancy pruning/SinE : 168
% 0.25/0.54 % Initial clauses : 33
% 0.25/0.54 % Removed in clause preprocessing : 0
% 0.25/0.54 % Initial clauses in saturation : 33
% 0.25/0.54 % Processed clauses : 90
% 0.25/0.54 % ...of these trivial : 0
% 0.25/0.54 % ...subsumed : 21
% 0.25/0.54 % ...remaining for further processing : 69
% 0.25/0.54 % Other redundant clauses eliminated : 6
% 0.25/0.54 % Clauses deleted for lack of memory : 0
% 0.25/0.54 % Backward-subsumed : 17
% 0.25/0.54 % Backward-rewritten : 4
% 0.25/0.54 % Generated clauses : 209
% 0.25/0.54 % ...of the previous two non-redundant : 145
% 0.25/0.54 % ...aggressively subsumed : 0
% 0.25/0.54 % Contextual simplify-reflections : 12
% 0.25/0.54 % Paramodulations : 197
% 0.25/0.54 % Factorizations : 0
% 0.25/0.54 % NegExts : 0
% 0.25/0.54 % Equation resolutions : 10
% 0.25/0.54 % Disequality decompositions : 0
% 0.25/0.54 % Total rewrite steps : 130
% 0.25/0.54 % ...of those cached : 120
% 0.25/0.54 % Propositional unsat checks : 0
% 0.25/0.54 % Propositional check models : 0
% 0.25/0.54 % Propositional check unsatisfiable : 0
% 0.25/0.54 % Propositional clauses : 0
% 0.25/0.54 % Propositional clauses after purity: 0
% 0.25/0.54 % Propositional unsat core size : 0
% 0.25/0.54 % Propositional preprocessing time : 0.000
% 0.25/0.54 % Propositional encoding time : 0.000
% 0.25/0.54 % Propositional solver time : 0.000
% 0.25/0.54 % Success case prop preproc time : 0.000
% 0.25/0.54 % Success case prop encoding time : 0.000
% 0.25/0.54 % Success case prop solver time : 0.000
% 0.25/0.54 % Current number of processed clauses : 44
% 0.25/0.54 % Positive orientable unit clauses : 10
% 0.25/0.54 % Positive unorientable unit clauses: 0
% 0.25/0.54 % Negative unit clauses : 2
% 0.25/0.54 % Non-unit-clauses : 32
% 0.25/0.54 % Current number of unprocessed clauses: 74
% 0.25/0.54 % ...number of literals in the above : 398
% 0.25/0.54 % Current number of archived formulas : 0
% 0.25/0.54 % Current number of archived clauses : 24
% 0.25/0.54 % Clause-clause subsumption calls (NU) : 269
% 0.25/0.54 % Rec. Clause-clause subsumption calls : 171
% 0.25/0.54 % Non-unit clause-clause subsumptions : 37
% 0.25/0.54 % Unit Clause-clause subsumption calls : 44
% 0.25/0.54 % Rewrite failures with RHS unbound : 0
% 0.25/0.54 % BW rewrite match attempts : 6
% 0.25/0.54 % BW rewrite match successes : 6
% 0.25/0.54 % Condensation attempts : 0
% 0.25/0.54 % Condensation successes : 0
% 0.25/0.54 % Termbank termtop insertions : 5794
% 0.25/0.54 % Search garbage collected termcells : 938
% 0.25/0.54
% 0.25/0.54 % -------------------------------------------------
% 0.25/0.54 % User time : 0.011 s
% 0.25/0.54 % System time : 0.008 s
% 0.25/0.54 % Total time : 0.019 s
% 0.25/0.54 % Maximum resident set size: 3812 pages
% 0.25/0.54
% 0.25/0.54 % -------------------------------------------------
% 0.25/0.54 % User time : 0.017 s
% 0.25/0.54 % System time : 0.016 s
% 0.25/0.54 % Total time : 0.033 s
% 0.25/0.54 % Maximum resident set size: 5120 pages
% 0.25/0.54 % E exiting
%------------------------------------------------------------------------------