%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC182-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 : n011.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:21 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.57s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of clauses : 47 ( 21 unt; 3 nHn; 47 RR)
% Number of literals : 91 ( 31 equ; 44 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
nil = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_11,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_9,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_12,negated_conjecture,
( memberP(sk7,sk5)
| memberP(sk6,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(c_0_14,negated_conjecture,
sk1 = sk3,
co1_7 ).
cnf(c_0_15,negated_conjecture,
nil = sk3,
co1_5 ).
cnf(c_0_16,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_17,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
co1_11 ).
cnf(c_0_18,negated_conjecture,
sk1 = nil,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = nil,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssList(app(sk6,cons(sk5,nil)))
| sk7 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_22 ).
cnf(c_0_25,negated_conjecture,
ssList(sk6),
co1_9 ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk7 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_26 ).
cnf(c_0_29,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_32,negated_conjecture,
sk7 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_31 ).
cnf(c_0_34,negated_conjecture,
app(app(sk6,cons(sk5,nil)),nil) = nil,
inference(rw,[status(thm)],[c_0_20,c_0_32]) ).
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(app(sk6,cons(sk5,nil)))
| app(sk6,cons(sk5,nil)) = nil ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_35 ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(sk6,cons(sk5,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_24]),c_0_25])]) ).
cnf(c_0_39,negated_conjecture,
( memberP(sk7,sk5)
| memberP(sk6,sk5) ),
co1_12 ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_25])]) ).
cnf(c_0_41,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_42,negated_conjecture,
( memberP(nil,sk5)
| memberP(sk6,sk5) ),
inference(rw,[status(thm)],[c_0_39,c_0_32]) ).
cnf(c_0_43,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_44,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_41 ).
cnf(c_0_45,negated_conjecture,
memberP(nil,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC182-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.18/0.42 % Computer : n011.cluster.edu
% 0.18/0.42 % Model : x86_64 x86_64
% 0.18/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.42 % Memory : 8046.5625MB
% 0.18/0.42 % OS : Linux 6.8.0-71-generic
% 0.18/0.42 % CPULimit : 300
% 0.18/0.42 % WCLimit : 300
% 0.18/0.42 % DateTime : Mon Sep 21 08:02:25 UTC 2026
% 0.18/0.42 % CPUTime :
% 0.18/0.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 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
% 0.26/0.57 % Version: 3.5.1
% 0.26/0.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.57 % Starting sh5l with 300s (1) cores
% 0.26/0.57 % new_bool_3 with pid 1411580 completed with status 0
% 0.26/0.57 % Result found by new_bool_3
% 0.26/0.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.57 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.26/0.57 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.26/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.57 % SubtermCWHack with pid 1411583 completed with status 0
% 0.26/0.57 % Result found by SubtermCWHack
% 0.26/0.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.57 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.26/0.57 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.26/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.57 % Preprocessing time : 0.003 s
% 0.26/0.57
% 0.26/0.57 % Proof found!
% 0.26/0.57 % SZS status Unsatisfiable
% 0.26/0.57 % SZS output start CNFRefutation
% See solution above
% 0.26/0.57 % Parsed axioms : 197
% 0.26/0.57 % Removed by relevancy pruning/SinE : 160
% 0.26/0.57 % Initial clauses : 37
% 0.26/0.57 % Removed in clause preprocessing : 0
% 0.26/0.57 % Initial clauses in saturation : 37
% 0.26/0.57 % Processed clauses : 38
% 0.26/0.57 % ...of these trivial : 0
% 0.26/0.57 % ...subsumed : 1
% 0.26/0.57 % ...remaining for further processing : 37
% 0.26/0.57 % Other redundant clauses eliminated : 3
% 0.26/0.57 % Clauses deleted for lack of memory : 0
% 0.26/0.57 % Backward-subsumed : 0
% 0.26/0.57 % Backward-rewritten : 13
% 0.26/0.57 % Generated clauses : 25
% 0.26/0.57 % ...of the previous two non-redundant : 20
% 0.26/0.57 % ...aggressively subsumed : 0
% 0.26/0.57 % Contextual simplify-reflections : 0
% 0.26/0.57 % Paramodulations : 23
% 0.26/0.57 % Factorizations : 0
% 0.26/0.57 % NegExts : 0
% 0.26/0.57 % Equation resolutions : 3
% 0.26/0.57 % Disequality decompositions : 0
% 0.26/0.57 % Total rewrite steps : 46
% 0.26/0.57 % ...of those cached : 35
% 0.26/0.57 % Propositional unsat checks : 0
% 0.26/0.57 % Propositional check models : 0
% 0.26/0.57 % Propositional check unsatisfiable : 0
% 0.26/0.57 % Propositional clauses : 0
% 0.26/0.57 % Propositional clauses after purity: 0
% 0.26/0.57 % Propositional unsat core size : 0
% 0.26/0.57 % Propositional preprocessing time : 0.000
% 0.26/0.57 % Propositional encoding time : 0.000
% 0.26/0.57 % Propositional solver time : 0.000
% 0.26/0.57 % Success case prop preproc time : 0.000
% 0.26/0.57 % Success case prop encoding time : 0.000
% 0.26/0.57 % Success case prop solver time : 0.000
% 0.26/0.57 % Current number of processed clauses : 22
% 0.26/0.57 % Positive orientable unit clauses : 11
% 0.26/0.57 % Positive unorientable unit clauses: 0
% 0.26/0.57 % Negative unit clauses : 0
% 0.26/0.57 % Non-unit-clauses : 11
% 0.26/0.57 % Current number of unprocessed clauses: 19
% 0.26/0.57 % ...number of literals in the above : 82
% 0.26/0.57 % Current number of archived formulas : 0
% 0.26/0.57 % Current number of archived clauses : 13
% 0.26/0.57 % Clause-clause subsumption calls (NU) : 48
% 0.26/0.57 % Rec. Clause-clause subsumption calls : 29
% 0.26/0.57 % Non-unit clause-clause subsumptions : 1
% 0.26/0.57 % Unit Clause-clause subsumption calls : 0
% 0.26/0.57 % Rewrite failures with RHS unbound : 0
% 0.26/0.57 % BW rewrite match attempts : 5
% 0.26/0.57 % BW rewrite match successes : 5
% 0.26/0.57 % Condensation attempts : 0
% 0.26/0.57 % Condensation successes : 0
% 0.26/0.57 % Termbank termtop insertions : 3277
% 0.26/0.57 % Search garbage collected termcells : 900
% 0.26/0.57
% 0.26/0.57 % -------------------------------------------------
% 0.26/0.57 % User time : 0.007 s
% 0.26/0.57 % System time : 0.005 s
% 0.26/0.57 % Total time : 0.013 s
% 0.26/0.57 % Maximum resident set size: 4068 pages
% 0.26/0.57
% 0.26/0.57 % -------------------------------------------------
% 0.26/0.57 % User time : 0.015 s
% 0.26/0.57 % System time : 0.012 s
% 0.26/0.57 % Total time : 0.027 s
% 0.26/0.57 % Maximum resident set size: 4864 pages
% 0.26/0.57 % E exiting
%------------------------------------------------------------------------------