%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC378-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 : n010.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:44:09 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.46s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 50 ( 25 unt; 5 nHn; 50 RR)
% Number of literals : 117 ( 17 equ; 66 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_10,negated_conjecture,
app(sk6,sk5) = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_9,negated_conjecture,
app(sk5,sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause141,axiom,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(clause140,axiom,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(clause158,axiom,
( ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(app(X1,X2),X3)
| memberP(X1,X3)
| memberP(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause158) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_13,negated_conjecture,
( ~ memberP(sk1,sk7)
| ~ memberP(sk2,sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_12,negated_conjecture,
( memberP(sk1,sk7)
| memberP(sk2,sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_11,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(c_0_15,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_16,negated_conjecture,
app(sk6,sk5) = sk3,
co1_10 ).
cnf(c_0_17,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_18,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
app(sk6,sk5) = sk1,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_21,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_22,negated_conjecture,
app(sk5,sk6) = sk4,
co1_9 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(X1)
| app(sk6,app(sk5,X1)) = app(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
app(sk5,sk6) = sk2,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_28,plain,
( ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(app(X1,X2),X3)
| memberP(X1,X3)
| memberP(X2,X3) ),
inference(fof_simplification,[status(thm)],[clause158]) ).
cnf(c_0_29,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
app(sk6,sk2) = app(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_20])]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_32,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
c_0_27 ).
cnf(c_0_33,plain,
( ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(app(X1,X2),X3)
| memberP(X1,X3)
| memberP(X2,X3) ),
c_0_28 ).
cnf(c_0_34,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk2,X1)
| memberP(app(sk1,sk6),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_20]),c_0_31])]) ).
cnf(c_0_35,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_36,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk6,X1)
| memberP(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_19]),c_0_21]),c_0_20])]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(X1)
| app(sk5,app(sk6,X1)) = app(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_26]),c_0_21]),c_0_20])]) ).
cnf(c_0_38,negated_conjecture,
( ~ memberP(sk1,sk7)
| ~ memberP(sk2,sk7) ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk2,X1)
| memberP(sk1,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_20]),c_0_35])]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( memberP(sk1,sk7)
| memberP(sk2,sk7) ),
co1_12 ).
cnf(c_0_41,negated_conjecture,
ssItem(sk7),
co1_11 ).
cnf(c_0_42,negated_conjecture,
app(sk5,sk1) = app(sk2,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_19]),c_0_21])]) ).
cnf(c_0_43,negated_conjecture,
( ~ memberP(sk1,sk7)
| ~ memberP(sk2,sk7) ),
c_0_38 ).
cnf(c_0_44,negated_conjecture,
memberP(sk1,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk1,X1)
| memberP(app(sk2,sk5),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_42]),c_0_21]),c_0_35])]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk5,X1)
| memberP(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_26]),c_0_20]),c_0_21])]) ).
cnf(c_0_47,negated_conjecture,
~ memberP(sk2,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk1,X1)
| memberP(sk2,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_45]),c_0_21]),c_0_31])]),c_0_46]) ).
cnf(c_0_49,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_44]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC378-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n010.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:19:55 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.09/0.46 % Version: 3.5.1
% 0.09/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.46 % Starting sh5l with 300s (1) cores
% 0.09/0.46 % new_bool_1 with pid 457552 completed with status 0
% 0.09/0.46 % Result found by new_bool_1
% 0.09/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.46 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.09/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.46 % SubtermCWHack with pid 457560 completed with status 0
% 0.09/0.46 % Result found by SubtermCWHack
% 0.09/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.46 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.09/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.46 % Preprocessing time : 0.002 s
% 0.09/0.46
% 0.09/0.46 % Proof found!
% 0.09/0.46 % SZS status Unsatisfiable
% 0.09/0.46 % SZS output start CNFRefutation
% See solution above
% 0.09/0.46 % Parsed axioms : 198
% 0.09/0.46 % Removed by relevancy pruning/SinE : 160
% 0.09/0.46 % Initial clauses : 38
% 0.09/0.46 % Removed in clause preprocessing : 0
% 0.09/0.46 % Initial clauses in saturation : 38
% 0.09/0.46 % Processed clauses : 401
% 0.09/0.46 % ...of these trivial : 21
% 0.09/0.46 % ...subsumed : 176
% 0.09/0.46 % ...remaining for further processing : 204
% 0.09/0.46 % Other redundant clauses eliminated : 11
% 0.09/0.46 % Clauses deleted for lack of memory : 0
% 0.09/0.46 % Backward-subsumed : 22
% 0.09/0.46 % Backward-rewritten : 4
% 0.09/0.46 % Generated clauses : 1005
% 0.09/0.46 % ...of the previous two non-redundant : 807
% 0.09/0.46 % ...aggressively subsumed : 0
% 0.09/0.46 % Contextual simplify-reflections : 3
% 0.09/0.46 % Paramodulations : 991
% 0.09/0.46 % Factorizations : 0
% 0.09/0.46 % NegExts : 0
% 0.09/0.46 % Equation resolutions : 15
% 0.09/0.46 % Disequality decompositions : 0
% 0.09/0.46 % Total rewrite steps : 1212
% 0.09/0.46 % ...of those cached : 1191
% 0.09/0.46 % Propositional unsat checks : 0
% 0.09/0.46 % Propositional check models : 0
% 0.09/0.46 % Propositional check unsatisfiable : 0
% 0.09/0.46 % Propositional clauses : 0
% 0.09/0.46 % Propositional clauses after purity: 0
% 0.09/0.46 % Propositional unsat core size : 0
% 0.09/0.46 % Propositional preprocessing time : 0.000
% 0.09/0.46 % Propositional encoding time : 0.000
% 0.09/0.46 % Propositional solver time : 0.000
% 0.09/0.46 % Success case prop preproc time : 0.000
% 0.09/0.46 % Success case prop encoding time : 0.000
% 0.09/0.46 % Success case prop solver time : 0.000
% 0.09/0.46 % Current number of processed clauses : 175
% 0.09/0.46 % Positive orientable unit clauses : 26
% 0.09/0.46 % Positive unorientable unit clauses: 0
% 0.09/0.46 % Negative unit clauses : 18
% 0.09/0.46 % Non-unit-clauses : 131
% 0.09/0.46 % Current number of unprocessed clauses: 426
% 0.09/0.46 % ...number of literals in the above : 1717
% 0.09/0.46 % Current number of archived formulas : 0
% 0.09/0.46 % Current number of archived clauses : 26
% 0.09/0.46 % Clause-clause subsumption calls (NU) : 3586
% 0.09/0.46 % Rec. Clause-clause subsumption calls : 2365
% 0.09/0.46 % Non-unit clause-clause subsumptions : 123
% 0.09/0.46 % Unit Clause-clause subsumption calls : 372
% 0.09/0.46 % Rewrite failures with RHS unbound : 0
% 0.09/0.46 % BW rewrite match attempts : 3
% 0.09/0.46 % BW rewrite match successes : 3
% 0.09/0.46 % Condensation attempts : 0
% 0.09/0.46 % Condensation successes : 0
% 0.09/0.46 % Termbank termtop insertions : 16600
% 0.09/0.46 % Search garbage collected termcells : 903
% 0.09/0.46
% 0.09/0.46 % -------------------------------------------------
% 0.09/0.46 % User time : 0.027 s
% 0.09/0.46 % System time : 0.002 s
% 0.09/0.46 % Total time : 0.029 s
% 0.09/0.46 % Maximum resident set size: 3812 pages
% 0.09/0.46
% 0.09/0.46 % -------------------------------------------------
% 0.09/0.46 % User time : 0.032 s
% 0.09/0.46 % System time : 0.006 s
% 0.09/0.46 % Total time : 0.039 s
% 0.09/0.46 % Maximum resident set size: 5120 pages
% 0.09/0.46 % E exiting
%------------------------------------------------------------------------------