%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC200-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 : n018.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:26 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.64s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 40 ( 14 unt; 3 nHn; 38 RR)
% Number of literals : 88 ( 19 equ; 51 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_7,negated_conjecture,
singletonP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause161,axiom,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_9,negated_conjecture,
( ~ ssItem(X1)
| memberP(sk1,sk5(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_8,negated_conjecture,
( ~ ssItem(X1)
| ssItem(sk5(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_10,negated_conjecture,
( X1 != sk5(X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(c_0_12,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_13,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_14,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_12 ).
cnf(c_0_15,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_13 ).
cnf(c_0_16,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_17,axiom,
ssList(nil),
clause8 ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| skaf44(X1) = hd(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_19,negated_conjecture,
singletonP(sk3),
co1_7 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
inference(fof_simplification,[status(thm)],[clause161]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(hd(X1),nil) = X1 ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
singletonP(sk1),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| ssItem(hd(X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_26,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_27,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
c_0_21 ).
cnf(c_0_28,negated_conjecture,
cons(hd(sk1),nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
ssItem(hd(sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_24])]) ).
cnf(c_0_30,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
( ~ ssItem(X1)
| memberP(sk1,sk5(X1)) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_32,negated_conjecture,
( ~ ssItem(X1)
| ssItem(sk5(X1)) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_33,negated_conjecture,
( X1 != sk5(X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk1,X1)
| hd(sk1) = X1 ),
inference(csr,[status(thm)],[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_17])]),c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssItem(X1)
| memberP(sk1,sk5(X1)) ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
( ~ ssItem(X1)
| ssItem(sk5(X1)) ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
( X1 != sk5(X1)
| ~ ssItem(X1) ),
c_0_33 ).
cnf(c_0_38,negated_conjecture,
( ~ ssItem(X1)
| sk5(X1) = hd(sk1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38])]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC200-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 % Computer : n018.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Mon Sep 21 08:05:59 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.49 Running first-order theorem proving
% 0.15/0.49 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.24/0.64 % Version: 3.5.1
% 0.24/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.64 % Starting sh5l with 300s (1) cores
% 0.24/0.64 % sh5l with pid 1407384 completed with status 0
% 0.24/0.64 % Result found by sh5l
% 0.24/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.64 % Starting sh5l with 300s (1) cores
% 0.24/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.24/0.64 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.64 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.24/0.64 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.64 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.64 % SubtermCWHack with pid 1407392 completed with status 0
% 0.24/0.64 % Result found by SubtermCWHack
% 0.24/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.64 % Starting sh5l with 300s (1) cores
% 0.24/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.24/0.64 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.64 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.24/0.64 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.64 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.64 % Preprocessing time : 0.005 s
% 0.24/0.64
% 0.24/0.64 % Proof found!
% 0.24/0.64 % SZS status Unsatisfiable
% 0.24/0.64 % SZS output start CNFRefutation
% See solution above
% 0.24/0.64 % Parsed axioms : 195
% 0.24/0.64 % Removed by relevancy pruning/SinE : 33
% 0.24/0.64 % Initial clauses : 162
% 0.24/0.64 % Removed in clause preprocessing : 0
% 0.24/0.64 % Initial clauses in saturation : 162
% 0.24/0.64 % Processed clauses : 405
% 0.24/0.64 % ...of these trivial : 4
% 0.24/0.64 % ...subsumed : 150
% 0.24/0.64 % ...remaining for further processing : 251
% 0.24/0.64 % Other redundant clauses eliminated : 48
% 0.24/0.64 % Clauses deleted for lack of memory : 0
% 0.24/0.64 % Backward-subsumed : 1
% 0.24/0.64 % Backward-rewritten : 7
% 0.24/0.64 % Generated clauses : 811
% 0.24/0.64 % ...of the previous two non-redundant : 578
% 0.24/0.64 % ...aggressively subsumed : 0
% 0.24/0.64 % Contextual simplify-reflections : 15
% 0.24/0.64 % Paramodulations : 759
% 0.24/0.64 % Factorizations : 0
% 0.24/0.64 % NegExts : 0
% 0.24/0.64 % Equation resolutions : 53
% 0.24/0.64 % Disequality decompositions : 0
% 0.24/0.64 % Total rewrite steps : 838
% 0.24/0.64 % ...of those cached : 789
% 0.24/0.64 % Propositional unsat checks : 0
% 0.24/0.64 % Propositional check models : 0
% 0.24/0.64 % Propositional check unsatisfiable : 0
% 0.24/0.64 % Propositional clauses : 0
% 0.24/0.64 % Propositional clauses after purity: 0
% 0.24/0.64 % Propositional unsat core size : 0
% 0.24/0.64 % Propositional preprocessing time : 0.000
% 0.24/0.64 % Propositional encoding time : 0.000
% 0.24/0.64 % Propositional solver time : 0.000
% 0.24/0.64 % Success case prop preproc time : 0.000
% 0.24/0.64 % Success case prop encoding time : 0.000
% 0.24/0.64 % Success case prop solver time : 0.000
% 0.24/0.64 % Current number of processed clauses : 232
% 0.24/0.64 % Positive orientable unit clauses : 58
% 0.24/0.64 % Positive unorientable unit clauses: 0
% 0.24/0.64 % Negative unit clauses : 3
% 0.24/0.64 % Non-unit-clauses : 171
% 0.24/0.64 % Current number of unprocessed clauses: 335
% 0.24/0.64 % ...number of literals in the above : 1846
% 0.24/0.64 % Current number of archived formulas : 0
% 0.24/0.64 % Current number of archived clauses : 8
% 0.24/0.64 % Clause-clause subsumption calls (NU) : 6069
% 0.24/0.64 % Rec. Clause-clause subsumption calls : 2812
% 0.24/0.64 % Non-unit clause-clause subsumptions : 128
% 0.24/0.64 % Unit Clause-clause subsumption calls : 64
% 0.24/0.64 % Rewrite failures with RHS unbound : 0
% 0.24/0.64 % BW rewrite match attempts : 4
% 0.24/0.64 % BW rewrite match successes : 4
% 0.24/0.64 % Condensation attempts : 0
% 0.24/0.64 % Condensation successes : 0
% 0.24/0.64 % Termbank termtop insertions : 19209
% 0.24/0.64 % Search garbage collected termcells : 610
% 0.24/0.64
% 0.24/0.64 % -------------------------------------------------
% 0.24/0.64 % User time : 0.047 s
% 0.24/0.64 % System time : 0.007 s
% 0.24/0.64 % Total time : 0.054 s
% 0.24/0.64 % Maximum resident set size: 4016 pages
% 0.24/0.64
% 0.24/0.64 % -------------------------------------------------
% 0.24/0.64 % User time : 0.056 s
% 0.24/0.64 % System time : 0.012 s
% 0.24/0.64 % Total time : 0.068 s
% 0.24/0.64 % Maximum resident set size: 5120 pages
% 0.24/0.64 % E exiting
%------------------------------------------------------------------------------