%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC404-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 : n017.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:17 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.66s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 23 unt; 0 nHn; 34 RR)
% Number of literals : 70 ( 6 equ; 41 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 : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(co1_15,negated_conjecture,
~ memberP(sk2,sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_9,negated_conjecture,
app(app(sk5,sk3),sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
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(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
cnf(co1_14,negated_conjecture,
memberP(sk1,sk7),
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_13,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(c_0_12,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_13,negated_conjecture,
~ memberP(sk2,sk7),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_14,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
c_0_12 ).
cnf(c_0_15,negated_conjecture,
app(app(sk5,sk3),sk6) = sk4,
co1_9 ).
cnf(c_0_16,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_17,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_18,negated_conjecture,
~ memberP(sk2,sk7),
c_0_13 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,negated_conjecture,
( ~ ssList(app(sk5,sk3))
| ~ ssItem(X1)
| ~ memberP(app(sk5,sk3),X1)
| memberP(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_21,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_23,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_24,negated_conjecture,
memberP(sk1,sk7),
co1_14 ).
cnf(c_0_25,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_26,negated_conjecture,
~ memberP(sk4,sk7),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(app(sk5,sk3))
| ~ ssItem(X1)
| ~ memberP(sk3,X1)
| memberP(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
memberP(sk3,sk7),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
ssItem(sk7),
co1_13 ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_31,negated_conjecture,
~ ssList(app(sk5,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_30 ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC404-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.13/0.58 % Computer : n017.cluster.edu
% 0.13/0.58 % Model : x86_64 x86_64
% 0.13/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.58 % Memory : 8046.5625MB
% 0.13/0.58 % OS : Linux 6.8.0-71-generic
% 0.13/0.58 % CPULimit : 300
% 0.13/0.58 % WCLimit : 300
% 0.13/0.58 % DateTime : Mon Sep 21 08:17:14 UTC 2026
% 0.13/0.58 % CPUTime :
% 0.13/0.58 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.62 Running first-order theorem proving
% 0.13/0.62 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.16/0.66 % Version: 3.5.1
% 0.16/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.66 % Starting sh5l with 300s (1) cores
% 0.16/0.66 % new_bool_3 with pid 1878038 completed with status 0
% 0.16/0.66 % Result found by new_bool_3
% 0.16/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.66 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.66 % SubtermCWHack with pid 1878041 completed with status 0
% 0.16/0.66 % Result found by SubtermCWHack
% 0.16/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.66 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.66 % Preprocessing time : 0.002 s
% 0.16/0.66
% 0.16/0.66 % Proof found!
% 0.16/0.66 % SZS status Unsatisfiable
% 0.16/0.66 % SZS output start CNFRefutation
% See solution above
% 0.16/0.66 % Parsed axioms : 201
% 0.16/0.66 % Removed by relevancy pruning/SinE : 131
% 0.16/0.66 % Initial clauses : 70
% 0.16/0.66 % Removed in clause preprocessing : 0
% 0.16/0.66 % Initial clauses in saturation : 70
% 0.16/0.66 % Processed clauses : 197
% 0.16/0.66 % ...of these trivial : 0
% 0.16/0.66 % ...subsumed : 81
% 0.16/0.66 % ...remaining for further processing : 116
% 0.16/0.66 % Other redundant clauses eliminated : 10
% 0.16/0.66 % Clauses deleted for lack of memory : 0
% 0.16/0.66 % Backward-subsumed : 52
% 0.16/0.66 % Backward-rewritten : 2
% 0.16/0.66 % Generated clauses : 503
% 0.16/0.66 % ...of the previous two non-redundant : 366
% 0.16/0.66 % ...aggressively subsumed : 0
% 0.16/0.66 % Contextual simplify-reflections : 2
% 0.16/0.66 % Paramodulations : 490
% 0.16/0.66 % Factorizations : 0
% 0.16/0.66 % NegExts : 0
% 0.16/0.66 % Equation resolutions : 14
% 0.16/0.66 % Disequality decompositions : 0
% 0.16/0.66 % Total rewrite steps : 567
% 0.16/0.66 % ...of those cached : 557
% 0.16/0.66 % Propositional unsat checks : 0
% 0.16/0.66 % Propositional check models : 0
% 0.16/0.66 % Propositional check unsatisfiable : 0
% 0.16/0.66 % Propositional clauses : 0
% 0.16/0.66 % Propositional clauses after purity: 0
% 0.16/0.66 % Propositional unsat core size : 0
% 0.16/0.66 % Propositional preprocessing time : 0.000
% 0.16/0.66 % Propositional encoding time : 0.000
% 0.16/0.66 % Propositional solver time : 0.000
% 0.16/0.66 % Success case prop preproc time : 0.000
% 0.16/0.66 % Success case prop encoding time : 0.000
% 0.16/0.66 % Success case prop solver time : 0.000
% 0.16/0.66 % Current number of processed clauses : 57
% 0.16/0.66 % Positive orientable unit clauses : 14
% 0.16/0.66 % Positive unorientable unit clauses: 0
% 0.16/0.66 % Negative unit clauses : 5
% 0.16/0.66 % Non-unit-clauses : 38
% 0.16/0.66 % Current number of unprocessed clauses: 84
% 0.16/0.66 % ...number of literals in the above : 424
% 0.16/0.66 % Current number of archived formulas : 0
% 0.16/0.66 % Current number of archived clauses : 54
% 0.16/0.66 % Clause-clause subsumption calls (NU) : 1156
% 0.16/0.66 % Rec. Clause-clause subsumption calls : 969
% 0.16/0.66 % Non-unit clause-clause subsumptions : 89
% 0.16/0.66 % Unit Clause-clause subsumption calls : 144
% 0.16/0.66 % Rewrite failures with RHS unbound : 0
% 0.16/0.66 % BW rewrite match attempts : 2
% 0.16/0.66 % BW rewrite match successes : 2
% 0.16/0.66 % Condensation attempts : 0
% 0.16/0.66 % Condensation successes : 0
% 0.16/0.66 % Termbank termtop insertions : 10215
% 0.16/0.66 % Search garbage collected termcells : 866
% 0.16/0.66
% 0.16/0.66 % -------------------------------------------------
% 0.16/0.66 % User time : 0.011 s
% 0.16/0.66 % System time : 0.005 s
% 0.16/0.66 % Total time : 0.016 s
% 0.16/0.66 % Maximum resident set size: 4068 pages
% 0.16/0.66
% 0.16/0.66 % -------------------------------------------------
% 0.16/0.66 % User time : 0.017 s
% 0.16/0.66 % System time : 0.007 s
% 0.16/0.66 % Total time : 0.025 s
% 0.16/0.66 % Maximum resident set size: 4864 pages
% 0.16/0.66 % E exiting
%------------------------------------------------------------------------------