%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC012-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 : n015.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:42:36 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.46s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 16 unt; 1 nHn; 31 RR)
% Number of literals : 62 ( 22 equ; 36 neg)
% Maximal clause size : 6 ( 2 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 : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_14,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk3,cons(sk5,nil)) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_13,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(c_0_10,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_11,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_12,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk3,cons(sk5,nil)) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_13,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_14,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
c_0_10 ).
cnf(c_0_15,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_16,negated_conjecture,
neq(sk2,nil),
c_0_11 ).
cnf(c_0_17,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk3,cons(sk5,nil)) = sk4 ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_13 ).
cnf(c_0_20,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2)
| app(X1,X3) != sk1
| app(app(X1,cons(X2,nil)),X3) != sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_21,negated_conjecture,
app(sk1,cons(sk5,nil)) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_15]),c_0_15]),c_0_16])]) ).
cnf(c_0_22,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_15]),c_0_16])]) ).
cnf(c_0_23,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) != sk1
| app(sk2,X1) != sk2 ),
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_26,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_24 ).
cnf(c_0_27,axiom,
ssList(nil),
clause8 ).
cnf(c_0_28,negated_conjecture,
app(sk2,nil) != sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_23])]) ).
cnf(c_0_29,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC012-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n015.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 07:52:22 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.13/0.46 % Version: 3.5.1
% 0.13/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.46 % Starting sh5l with 300s (1) cores
% 0.13/0.46 % new_bool_3 with pid 967932 completed with status 0
% 0.13/0.46 % Result found by new_bool_3
% 0.13/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.46 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.13/0.46 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.13/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.46 % SubtermCWHack with pid 967935 completed with status 0
% 0.13/0.46 % Result found by SubtermCWHack
% 0.13/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.46 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.13/0.46 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.13/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.46 % Preprocessing time : 0.001 s
% 0.13/0.46
% 0.13/0.46 % Proof found!
% 0.13/0.46 % SZS status Unsatisfiable
% 0.13/0.46 % SZS output start CNFRefutation
% See solution above
% 0.13/0.46 % Parsed axioms : 199
% 0.13/0.46 % Removed by relevancy pruning/SinE : 164
% 0.13/0.46 % Initial clauses : 35
% 0.13/0.46 % Removed in clause preprocessing : 0
% 0.13/0.46 % Initial clauses in saturation : 35
% 0.13/0.46 % Processed clauses : 95
% 0.13/0.46 % ...of these trivial : 4
% 0.13/0.46 % ...subsumed : 23
% 0.13/0.46 % ...remaining for further processing : 68
% 0.13/0.46 % Other redundant clauses eliminated : 8
% 0.13/0.46 % Clauses deleted for lack of memory : 0
% 0.13/0.46 % Backward-subsumed : 9
% 0.13/0.46 % Backward-rewritten : 3
% 0.13/0.46 % Generated clauses : 225
% 0.13/0.46 % ...of the previous two non-redundant : 163
% 0.13/0.46 % ...aggressively subsumed : 0
% 0.13/0.46 % Contextual simplify-reflections : 2
% 0.13/0.46 % Paramodulations : 214
% 0.13/0.46 % Factorizations : 0
% 0.13/0.46 % NegExts : 0
% 0.13/0.46 % Equation resolutions : 12
% 0.13/0.46 % Disequality decompositions : 0
% 0.13/0.46 % Total rewrite steps : 216
% 0.13/0.46 % ...of those cached : 207
% 0.13/0.46 % Propositional unsat checks : 0
% 0.13/0.46 % Propositional check models : 0
% 0.13/0.46 % Propositional check unsatisfiable : 0
% 0.13/0.46 % Propositional clauses : 0
% 0.13/0.46 % Propositional clauses after purity: 0
% 0.13/0.46 % Propositional unsat core size : 0
% 0.13/0.46 % Propositional preprocessing time : 0.000
% 0.13/0.46 % Propositional encoding time : 0.000
% 0.13/0.46 % Propositional solver time : 0.000
% 0.13/0.46 % Success case prop preproc time : 0.000
% 0.13/0.46 % Success case prop encoding time : 0.000
% 0.13/0.46 % Success case prop solver time : 0.000
% 0.13/0.46 % Current number of processed clauses : 53
% 0.13/0.46 % Positive orientable unit clauses : 10
% 0.13/0.46 % Positive unorientable unit clauses: 0
% 0.13/0.46 % Negative unit clauses : 3
% 0.13/0.46 % Non-unit-clauses : 40
% 0.13/0.46 % Current number of unprocessed clauses: 94
% 0.13/0.46 % ...number of literals in the above : 477
% 0.13/0.46 % Current number of archived formulas : 0
% 0.13/0.46 % Current number of archived clauses : 12
% 0.13/0.46 % Clause-clause subsumption calls (NU) : 261
% 0.13/0.46 % Rec. Clause-clause subsumption calls : 148
% 0.13/0.46 % Non-unit clause-clause subsumptions : 29
% 0.13/0.46 % Unit Clause-clause subsumption calls : 24
% 0.13/0.46 % Rewrite failures with RHS unbound : 0
% 0.13/0.46 % BW rewrite match attempts : 3
% 0.13/0.46 % BW rewrite match successes : 3
% 0.13/0.46 % Condensation attempts : 0
% 0.13/0.46 % Condensation successes : 0
% 0.13/0.46 % Termbank termtop insertions : 6456
% 0.13/0.46 % Search garbage collected termcells : 935
% 0.13/0.46
% 0.13/0.46 % -------------------------------------------------
% 0.13/0.46 % User time : 0.012 s
% 0.13/0.46 % System time : 0.002 s
% 0.13/0.46 % Total time : 0.014 s
% 0.13/0.46 % Maximum resident set size: 3812 pages
% 0.13/0.46
% 0.13/0.46 % -------------------------------------------------
% 0.13/0.46 % User time : 0.018 s
% 0.13/0.46 % System time : 0.004 s
% 0.13/0.46 % Total time : 0.023 s
% 0.13/0.46 % Maximum resident set size: 5120 pages
% 0.13/0.46 % E exiting
%------------------------------------------------------------------------------