%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC386+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:11 PM UTC 2026
% Result : Theorem 0.12s 5.87s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 9 unt; 0 def)
% Number of atoms : 152 ( 67 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 180 ( 64 ~; 65 |; 28 &)
% ( 2 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 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 : 34 ( 0 sgn 25 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( memberP(X2,X6)
& cons(X6,nil) = X1
& ssItem(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( memberP(X2,X6)
& cons(X6,nil) = X1
& ssItem(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( memberP(X2,X6)
& cons(X6,nil) = X1
& ssItem(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
! [X12] :
( ( nil != esk1_0
| ~ memberP(esk2_0,X12)
| cons(X12,nil) != esk1_0
| ~ ssItem(X12) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ memberP(esk2_0,X12)
| cons(X12,nil) != esk1_0
| ~ ssItem(X12) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& ( memberP(esk4_0,esk5_0)
| nil = esk3_0 )
& ( memberP(esk4_0,esk5_0)
| nil = esk4_0 )
& ( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 )
& ( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 )
& ( ssItem(esk5_0)
| nil = esk3_0 )
& ( ssItem(esk5_0)
| nil = esk4_0 )
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
fof(c_0_7,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_8,negated_conjecture,
( ~ memberP(esk2_0,X1)
| cons(X1,nil) != esk1_0
| ~ ssItem(X1)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( memberP(esk4_0,esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ssItem(esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,plain,
! [X48,X49] :
( ( ~ ssList(X48)
| ~ ssList(X49)
| neq(X48,X49)
| X48 = X49 )
& ( ~ ssList(X48)
| ~ ssList(X49)
| X48 != X49
| ~ neq(X48,X49) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
cnf(c_0_15,negated_conjecture,
( nil != esk1_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk2_0,X1)
| cons(X1,nil) != esk3_0
| esk2_0 = nil ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( memberP(esk2_0,esk5_0)
| esk2_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( ssItem(esk5_0)
| esk2_0 = nil ),
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( esk2_0 = nil
| cons(esk5_0,nil) = esk3_0 ),
inference(rw,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( esk3_0 != nil
| neq(esk2_0,nil) ),
inference(rw,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_22,negated_conjecture,
esk2_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]) ).
fof(c_0_23,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_24,negated_conjecture,
( memberP(esk4_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( esk3_0 != nil
| neq(nil,nil) ),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_28,plain,
! [X25] :
( ~ memberP(nil,X25)
| ~ ssItem(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_29,negated_conjecture,
( memberP(esk2_0,esk5_0)
| esk3_0 = nil ),
inference(rw,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_30,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,negated_conjecture,
( ssItem(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
memberP(nil,esk5_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_22]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC386+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.12/5.80 % Computer : n010.cluster.edu
% 0.12/5.80 % Model : x86_64 x86_64
% 0.12/5.80 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.80 % Memory : 8046.5625MB
% 0.12/5.80 % OS : Linux 6.8.0-71-generic
% 0.12/5.80 % CPULimit : 300
% 0.12/5.80 % WCLimit : 300
% 0.12/5.80 % DateTime : Mon Sep 21 08:20:48 UTC 2026
% 0.12/5.81 % CPUTime :
% 0.12/5.81 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.84 Running first-order theorem proving
% 0.12/5.84 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.12/5.87 % Version: 3.5.1
% 0.12/5.87 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/5.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.87 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/5.87 % Starting new_bool_3 with 300s (1) cores
% 0.12/5.87 % Starting new_bool_1 with 300s (1) cores
% 0.12/5.87 % Starting sh5l with 300s (1) cores
% 0.12/5.87 % new_bool_3 with pid 459764 completed with status 0
% 0.12/5.87 % Result found by new_bool_3
% 0.12/5.87 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/5.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.87 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/5.87 % Starting new_bool_3 with 300s (1) cores
% 0.12/5.87 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/5.87 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/5.87 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.12/5.87 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/5.87 % Starting SubtermCWHack with 31s (1) cores
% 0.12/5.87 % SubtermCWHack with pid 459767 completed with status 0
% 0.12/5.87 % Result found by SubtermCWHack
% 0.12/5.87 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/5.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.87 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/5.87 % Starting new_bool_3 with 300s (1) cores
% 0.12/5.87 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/5.87 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/5.87 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.12/5.87 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/5.87 % Starting SubtermCWHack with 31s (1) cores
% 0.12/5.87 % Preprocessing time : 0.002 s
% 0.12/5.87
% 0.12/5.87 % Proof found!
% 0.12/5.87 % SZS status Theorem
% 0.12/5.87 % SZS output start CNFRefutation
% See solution above
% 0.12/5.87 % Parsed axioms : 96
% 0.12/5.87 % Removed by relevancy pruning/SinE : 73
% 0.12/5.87 % Initial clauses : 54
% 0.12/5.87 % Removed in clause preprocessing : 0
% 0.12/5.87 % Initial clauses in saturation : 54
% 0.12/5.87 % Processed clauses : 53
% 0.12/5.87 % ...of these trivial : 0
% 0.12/5.87 % ...subsumed : 3
% 0.12/5.87 % ...remaining for further processing : 50
% 0.12/5.87 % Other redundant clauses eliminated : 4
% 0.12/5.87 % Clauses deleted for lack of memory : 0
% 0.12/5.87 % Backward-subsumed : 1
% 0.12/5.87 % Backward-rewritten : 13
% 0.12/5.87 % Generated clauses : 29
% 0.12/5.87 % ...of the previous two non-redundant : 19
% 0.12/5.87 % ...aggressively subsumed : 0
% 0.12/5.87 % Contextual simplify-reflections : 3
% 0.12/5.87 % Paramodulations : 24
% 0.12/5.87 % Factorizations : 0
% 0.12/5.87 % NegExts : 0
% 0.12/5.87 % Equation resolutions : 4
% 0.12/5.87 % Disequality decompositions : 0
% 0.12/5.87 % Total rewrite steps : 52
% 0.12/5.87 % ...of those cached : 45
% 0.12/5.87 % Propositional unsat checks : 0
% 0.12/5.87 % Propositional check models : 0
% 0.12/5.87 % Propositional check unsatisfiable : 0
% 0.12/5.87 % Propositional clauses : 0
% 0.12/5.87 % Propositional clauses after purity: 0
% 0.12/5.87 % Propositional unsat core size : 0
% 0.12/5.87 % Propositional preprocessing time : 0.000
% 0.12/5.87 % Propositional encoding time : 0.000
% 0.12/5.87 % Propositional solver time : 0.000
% 0.12/5.87 % Success case prop preproc time : 0.000
% 0.12/5.87 % Success case prop encoding time : 0.000
% 0.12/5.87 % Success case prop solver time : 0.000
% 0.12/5.87 % Current number of processed clauses : 31
% 0.12/5.87 % Positive orientable unit clauses : 11
% 0.12/5.87 % Positive unorientable unit clauses: 0
% 0.12/5.87 % Negative unit clauses : 2
% 0.12/5.87 % Non-unit-clauses : 18
% 0.12/5.87 % Current number of unprocessed clauses: 19
% 0.12/5.87 % ...number of literals in the above : 92
% 0.12/5.87 % Current number of archived formulas : 0
% 0.12/5.87 % Current number of archived clauses : 16
% 0.12/5.87 % Clause-clause subsumption calls (NU) : 88
% 0.12/5.87 % Rec. Clause-clause subsumption calls : 46
% 0.12/5.87 % Non-unit clause-clause subsumptions : 4
% 0.12/5.87 % Unit Clause-clause subsumption calls : 6
% 0.12/5.87 % Rewrite failures with RHS unbound : 0
% 0.12/5.87 % BW rewrite match attempts : 3
% 0.12/5.87 % BW rewrite match successes : 3
% 0.12/5.87 % Condensation attempts : 0
% 0.12/5.87 % Condensation successes : 0
% 0.12/5.87 % Termbank termtop insertions : 5354
% 0.12/5.87 % Search garbage collected termcells : 1599
% 0.12/5.87
% 0.12/5.87 % -------------------------------------------------
% 0.12/5.87 % User time : 0.007 s
% 0.12/5.87 % System time : 0.004 s
% 0.12/5.87 % Total time : 0.011 s
% 0.12/5.87 % Maximum resident set size: 3760 pages
% 0.12/5.87
% 0.12/5.87 % -------------------------------------------------
% 0.12/5.87 % User time : 0.012 s
% 0.12/5.87 % System time : 0.008 s
% 0.12/5.87 % Total time : 0.020 s
% 0.12/5.87 % Maximum resident set size: 4864 pages
% 0.12/5.87 % E exiting
%------------------------------------------------------------------------------