%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC325-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 : n006.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:57 PM UTC 2026
% Result : Unsatisfiable 0.22s 0.56s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 51 ( 17 unt; 5 nHn; 51 RR)
% Number of literals : 111 ( 44 equ; 63 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( app(X2,X1) != sk1
| app(X1,X2) != sk2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
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(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
cnf(co1_8,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_9,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_0_15,negated_conjecture,
( app(X2,X1) != sk1
| app(X1,X2) != sk2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_16,negated_conjecture,
( app(X2,X1) != sk1
| app(X1,X2) != sk2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_15 ).
cnf(c_0_17,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_18,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_21,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X2,X1) != sk4
| app(X1,X2) != sk3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_19 ).
cnf(c_0_25,axiom,
ssList(nil),
clause8 ).
cnf(c_0_26,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_27,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_20 ).
cnf(c_0_29,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
c_0_21 ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_22 ).
cnf(c_0_31,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_32,negated_conjecture,
app(sk3,nil) != sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])])]),c_0_26])]) ).
cnf(c_0_33,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_27 ).
cnf(c_0_34,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_28])]),c_0_25])]) ).
cnf(c_0_35,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_36,negated_conjecture,
( ssList(sk6)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_25])]) ).
cnf(c_0_37,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_39,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_40,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk3 ),
c_0_35 ).
cnf(c_0_41,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk4 ),
c_0_38 ).
cnf(c_0_43,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_39 ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ neq(sk4,nil) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_40]),c_0_41])]),c_0_42]) ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_46,negated_conjecture,
( ssItem(sk5)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_30]),c_0_31]),c_0_25])]) ).
cnf(c_0_47,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_30]),c_0_31]),c_0_25])]),c_0_37]) ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_45 ).
cnf(c_0_49,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_46,c_0_37]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC325-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.17/0.44 % Computer : n006.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 08:15:42 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.22/0.56 % Version: 3.5.1
% 0.22/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 % Starting sh5l with 300s (1) cores
% 0.22/0.56 % new_bool_1 with pid 2400904 completed with status 0
% 0.22/0.56 % Result found by new_bool_1
% 0.22/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.56 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.22/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.56 % SubtermCWHack with pid 2400906 completed with status 0
% 0.22/0.56 % Result found by SubtermCWHack
% 0.22/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.56 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.22/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.56 % Preprocessing time : 0.002 s
% 0.22/0.56
% 0.22/0.56 % Proof found!
% 0.22/0.56 % SZS status Unsatisfiable
% 0.22/0.56 % SZS output start CNFRefutation
% See solution above
% 0.22/0.56 % Parsed axioms : 197
% 0.22/0.56 % Removed by relevancy pruning/SinE : 164
% 0.22/0.56 % Initial clauses : 33
% 0.22/0.56 % Removed in clause preprocessing : 0
% 0.22/0.56 % Initial clauses in saturation : 33
% 0.22/0.56 % Processed clauses : 82
% 0.22/0.56 % ...of these trivial : 0
% 0.22/0.56 % ...subsumed : 18
% 0.22/0.56 % ...remaining for further processing : 64
% 0.22/0.56 % Other redundant clauses eliminated : 10
% 0.22/0.56 % Clauses deleted for lack of memory : 0
% 0.22/0.56 % Backward-subsumed : 9
% 0.22/0.56 % Backward-rewritten : 5
% 0.22/0.56 % Generated clauses : 108
% 0.22/0.56 % ...of the previous two non-redundant : 82
% 0.22/0.56 % ...aggressively subsumed : 0
% 0.22/0.56 % Contextual simplify-reflections : 1
% 0.22/0.56 % Paramodulations : 93
% 0.22/0.56 % Factorizations : 0
% 0.22/0.56 % NegExts : 0
% 0.22/0.56 % Equation resolutions : 14
% 0.22/0.56 % Disequality decompositions : 0
% 0.22/0.56 % Total rewrite steps : 109
% 0.22/0.56 % ...of those cached : 100
% 0.22/0.56 % Propositional unsat checks : 0
% 0.22/0.56 % Propositional check models : 0
% 0.22/0.56 % Propositional check unsatisfiable : 0
% 0.22/0.56 % Propositional clauses : 0
% 0.22/0.56 % Propositional clauses after purity: 0
% 0.22/0.56 % Propositional unsat core size : 0
% 0.22/0.56 % Propositional preprocessing time : 0.000
% 0.22/0.56 % Propositional encoding time : 0.000
% 0.22/0.56 % Propositional solver time : 0.000
% 0.22/0.56 % Success case prop preproc time : 0.000
% 0.22/0.56 % Success case prop encoding time : 0.000
% 0.22/0.56 % Success case prop solver time : 0.000
% 0.22/0.56 % Current number of processed clauses : 45
% 0.22/0.56 % Positive orientable unit clauses : 9
% 0.22/0.56 % Positive unorientable unit clauses: 0
% 0.22/0.56 % Negative unit clauses : 8
% 0.22/0.56 % Non-unit-clauses : 28
% 0.22/0.56 % Current number of unprocessed clauses: 26
% 0.22/0.56 % ...number of literals in the above : 130
% 0.22/0.56 % Current number of archived formulas : 0
% 0.22/0.56 % Current number of archived clauses : 16
% 0.22/0.56 % Clause-clause subsumption calls (NU) : 186
% 0.22/0.56 % Rec. Clause-clause subsumption calls : 108
% 0.22/0.56 % Non-unit clause-clause subsumptions : 20
% 0.22/0.56 % Unit Clause-clause subsumption calls : 61
% 0.22/0.56 % Rewrite failures with RHS unbound : 0
% 0.22/0.56 % BW rewrite match attempts : 5
% 0.22/0.56 % BW rewrite match successes : 5
% 0.22/0.56 % Condensation attempts : 0
% 0.22/0.56 % Condensation successes : 0
% 0.22/0.56 % Termbank termtop insertions : 4215
% 0.22/0.56 % Search garbage collected termcells : 932
% 0.22/0.56
% 0.22/0.56 % -------------------------------------------------
% 0.22/0.56 % User time : 0.007 s
% 0.22/0.56 % System time : 0.003 s
% 0.22/0.56 % Total time : 0.010 s
% 0.22/0.56 % Maximum resident set size: 3812 pages
% 0.22/0.56
% 0.22/0.56 % -------------------------------------------------
% 0.22/0.56 % User time : 0.012 s
% 0.22/0.56 % System time : 0.007 s
% 0.22/0.56 % Total time : 0.019 s
% 0.22/0.56 % Maximum resident set size: 5120 pages
% 0.22/0.56 % E exiting
%------------------------------------------------------------------------------