%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC387-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 : n012.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:12 PM UTC 2026
% Result : Unsatisfiable 0.07s 0.34s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 13 unt; 3 nHn; 37 RR)
% Number of literals : 71 ( 31 equ; 39 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_9,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_7,negated_conjecture,
( ~ memberP(sk2,X1)
| cons(X1,nil) != sk1
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| memberP(sk4,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_11,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_12,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_13,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_15,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ memberP(sk2,X1)
| cons(X1,nil) != sk1
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_17,negated_conjecture,
( ~ neq(sk4,nil)
| memberP(sk4,sk5) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_18,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_19,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_12 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,negated_conjecture,
( sk4 != nil
| sk1 = nil ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
c_0_15 ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_24,negated_conjecture,
( ~ memberP(sk2,X1)
| cons(X1,nil) != sk1
| ~ ssItem(X1) ),
c_0_16 ).
cnf(c_0_25,negated_conjecture,
( ~ neq(sk4,nil)
| memberP(sk4,sk5) ),
c_0_17 ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_18 ).
cnf(c_0_27,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_28,axiom,
ssList(nil),
clause8 ).
cnf(c_0_29,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk1 ),
inference(rw,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_31,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_23 ).
cnf(c_0_32,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk4,X1)
| cons(X1,nil) != sk1 ),
inference(rw,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_33,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[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_28])]),c_0_29]) ).
cnf(c_0_34,negated_conjecture,
cons(sk5,nil) = sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_35,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC387-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 21 08:20:22 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.07/0.34 % Version: 3.5.1
% 0.07/0.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34 % Starting sh5l with 300s (1) cores
% 0.07/0.34 % new_bool_3 with pid 1972176 completed with status 0
% 0.07/0.34 % Result found by new_bool_3
% 0.07/0.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.34 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.07/0.34 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.34 % SubtermCWHack with pid 1972179 completed with status 0
% 0.07/0.34 % Result found by SubtermCWHack
% 0.07/0.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.34 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.07/0.34 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.34 % Preprocessing time : 0.001 s
% 0.07/0.34
% 0.07/0.34 % Proof found!
% 0.07/0.34 % SZS status Unsatisfiable
% 0.07/0.34 % SZS output start CNFRefutation
% See solution above
% 0.07/0.34 % Parsed axioms : 197
% 0.07/0.34 % Removed by relevancy pruning/SinE : 156
% 0.07/0.34 % Initial clauses : 41
% 0.07/0.34 % Removed in clause preprocessing : 0
% 0.07/0.34 % Initial clauses in saturation : 41
% 0.07/0.34 % Processed clauses : 31
% 0.07/0.34 % ...of these trivial : 0
% 0.07/0.34 % ...subsumed : 1
% 0.07/0.34 % ...remaining for further processing : 30
% 0.07/0.34 % Other redundant clauses eliminated : 2
% 0.07/0.34 % Clauses deleted for lack of memory : 0
% 0.07/0.34 % Backward-subsumed : 1
% 0.07/0.34 % Backward-rewritten : 5
% 0.07/0.34 % Generated clauses : 14
% 0.07/0.34 % ...of the previous two non-redundant : 9
% 0.07/0.34 % ...aggressively subsumed : 0
% 0.07/0.34 % Contextual simplify-reflections : 1
% 0.07/0.34 % Paramodulations : 12
% 0.07/0.34 % Factorizations : 0
% 0.07/0.34 % NegExts : 0
% 0.07/0.34 % Equation resolutions : 2
% 0.07/0.34 % Disequality decompositions : 0
% 0.07/0.34 % Total rewrite steps : 29
% 0.07/0.34 % ...of those cached : 21
% 0.07/0.34 % Propositional unsat checks : 0
% 0.07/0.34 % Propositional check models : 0
% 0.07/0.34 % Propositional check unsatisfiable : 0
% 0.07/0.34 % Propositional clauses : 0
% 0.07/0.34 % Propositional clauses after purity: 0
% 0.07/0.34 % Propositional unsat core size : 0
% 0.07/0.34 % Propositional preprocessing time : 0.000
% 0.07/0.34 % Propositional encoding time : 0.000
% 0.07/0.34 % Propositional solver time : 0.000
% 0.07/0.34 % Success case prop preproc time : 0.000
% 0.07/0.34 % Success case prop encoding time : 0.000
% 0.07/0.34 % Success case prop solver time : 0.000
% 0.07/0.34 % Current number of processed clauses : 22
% 0.07/0.34 % Positive orientable unit clauses : 8
% 0.07/0.34 % Positive unorientable unit clauses: 0
% 0.07/0.34 % Negative unit clauses : 2
% 0.07/0.34 % Non-unit-clauses : 12
% 0.07/0.34 % Current number of unprocessed clauses: 17
% 0.07/0.34 % ...number of literals in the above : 84
% 0.07/0.34 % Current number of archived formulas : 0
% 0.07/0.34 % Current number of archived clauses : 6
% 0.07/0.34 % Clause-clause subsumption calls (NU) : 5
% 0.07/0.34 % Rec. Clause-clause subsumption calls : 3
% 0.07/0.34 % Non-unit clause-clause subsumptions : 1
% 0.07/0.34 % Unit Clause-clause subsumption calls : 2
% 0.07/0.34 % Rewrite failures with RHS unbound : 0
% 0.07/0.34 % BW rewrite match attempts : 5
% 0.07/0.34 % BW rewrite match successes : 5
% 0.07/0.34 % Condensation attempts : 0
% 0.07/0.34 % Condensation successes : 0
% 0.07/0.34 % Termbank termtop insertions : 3270
% 0.07/0.34 % Search garbage collected termcells : 915
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.002 s
% 0.07/0.34 % System time : 0.002 s
% 0.07/0.34 % Total time : 0.005 s
% 0.07/0.34 % Maximum resident set size: 3812 pages
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.004 s
% 0.07/0.34 % System time : 0.005 s
% 0.07/0.34 % Total time : 0.009 s
% 0.07/0.34 % Maximum resident set size: 4864 pages
% 0.07/0.34 % E exiting
%------------------------------------------------------------------------------