%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC016+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 : n007.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:37 PM UTC 2026
% Result : Theorem 0.32s 0.65s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 39 ( 8 unt; 0 def)
% Number of atoms : 172 ( 51 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 217 ( 84 ~; 82 |; 33 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 29 ( 0 sgn 20 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( frontsegP(X1,X6)
& frontsegP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( neq(X4,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X3,X5)
| ~ frontsegP(X4,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax42,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(ax46,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/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] :
( frontsegP(X1,X6)
& frontsegP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( neq(X4,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X3,X5)
| ~ frontsegP(X4,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X4
& 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] :
( frontsegP(X1,X6)
& frontsegP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( neq(X4,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X3,X5)
| ~ frontsegP(X4,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
! [X12] :
( ( nil != esk1_0
| ~ frontsegP(esk1_0,X12)
| ~ frontsegP(esk2_0,X12)
| ~ neq(X12,nil)
| ~ ssList(X12) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ frontsegP(esk1_0,X12)
| ~ frontsegP(esk2_0,X12)
| ~ neq(X12,nil)
| ~ ssList(X12) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| frontsegP(esk3_0,esk5_0) )
& ( ~ neq(esk4_0,nil)
| frontsegP(esk4_0,esk5_0) )
& ( ~ neq(esk4_0,nil)
| neq(esk5_0,nil) )
& ( ~ neq(esk4_0,nil)
| ssList(esk5_0) )
& ( nil != esk4_0
| nil = esk3_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])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( nil != esk1_0
| ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( nil != esk1_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ frontsegP(esk4_0,X1)
| ~ frontsegP(esk1_0,X1)
| esk1_0 != nil ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( esk1_0 != nil
| neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( nil != esk4_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( nil = esk2_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(esk4_0,nil)
| frontsegP(esk3_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( ~ frontsegP(esk4_0,esk4_0)
| ~ frontsegP(esk1_0,esk4_0)
| esk1_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_18,negated_conjecture,
( esk4_0 != nil
| esk1_0 = nil ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_19,plain,
! [X22] :
( frontsegP(X22,X22)
| ~ ssList(X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])])]) ).
cnf(c_0_20,negated_conjecture,
( ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssList(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
( neq(esk4_0,nil)
| esk4_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_8]),c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(esk4_0,nil)
| frontsegP(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( ~ neq(esk4_0,nil)
| frontsegP(esk1_0,esk5_0) ),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
fof(c_0_25,plain,
! [X31] :
( ( ~ ssList(X31)
| frontsegP(nil,X31)
| nil != X31 )
& ( ~ ssList(X31)
| nil = X31
| ~ frontsegP(nil,X31) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ frontsegP(esk4_0,esk4_0)
| ~ frontsegP(nil,esk4_0)
| esk4_0 != nil ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ frontsegP(esk4_0,X1)
| ~ frontsegP(esk1_0,X1)
| esk4_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_8]),c_0_8]) ).
cnf(c_0_29,negated_conjecture,
( ~ neq(esk4_0,nil)
| neq(esk5_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
( ssList(esk5_0)
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( frontsegP(esk4_0,esk5_0)
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_32,negated_conjecture,
( frontsegP(esk1_0,esk5_0)
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_35,negated_conjecture,
( ~ frontsegP(nil,esk4_0)
| esk4_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_12])]) ).
cnf(c_0_36,negated_conjecture,
esk4_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22]),c_0_30]),c_0_31]),c_0_32]) ).
cnf(c_0_37,plain,
frontsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_33]),c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_36]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC016+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n007.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 07:47:23 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.55 Running first-order theorem proving
% 0.23/0.55 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.32/0.65 % Version: 3.5.1
% 0.32/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.32/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.32/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.32/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.32/0.65 % Starting sh5l with 300s (1) cores
% 0.32/0.65 % new_bool_1 with pid 566287 completed with status 0
% 0.32/0.65 % Result found by new_bool_1
% 0.32/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.32/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.32/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.32/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.32/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.32/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/0.65 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.32/0.65 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.32/0.65 % Starting SubtermCWHack with 28s (1) cores
% 0.32/0.65 % SubtermCWHack with pid 566290 completed with status 0
% 0.32/0.65 % Result found by SubtermCWHack
% 0.32/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.32/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.32/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.32/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.32/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.32/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/0.65 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.32/0.65 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.32/0.65 % Starting SubtermCWHack with 28s (1) cores
% 0.32/0.65 % Preprocessing time : 0.002 s
% 0.32/0.65
% 0.32/0.65 % Proof found!
% 0.32/0.65 % SZS status Theorem
% 0.32/0.65 % SZS output start CNFRefutation
% See solution above
% 0.32/0.65 % Parsed axioms : 96
% 0.32/0.65 % Removed by relevancy pruning/SinE : 69
% 0.32/0.65 % Initial clauses : 55
% 0.32/0.65 % Removed in clause preprocessing : 0
% 0.32/0.65 % Initial clauses in saturation : 55
% 0.32/0.65 % Processed clauses : 116
% 0.32/0.65 % ...of these trivial : 1
% 0.32/0.65 % ...subsumed : 32
% 0.32/0.65 % ...remaining for further processing : 83
% 0.32/0.65 % Other redundant clauses eliminated : 20
% 0.32/0.65 % Clauses deleted for lack of memory : 0
% 0.32/0.65 % Backward-subsumed : 2
% 0.32/0.65 % Backward-rewritten : 30
% 0.32/0.65 % Generated clauses : 152
% 0.32/0.65 % ...of the previous two non-redundant : 101
% 0.32/0.65 % ...aggressively subsumed : 0
% 0.32/0.65 % Contextual simplify-reflections : 12
% 0.32/0.65 % Paramodulations : 129
% 0.32/0.65 % Factorizations : 0
% 0.32/0.65 % NegExts : 0
% 0.32/0.65 % Equation resolutions : 24
% 0.32/0.65 % Disequality decompositions : 0
% 0.32/0.65 % Total rewrite steps : 100
% 0.32/0.65 % ...of those cached : 91
% 0.32/0.65 % Propositional unsat checks : 0
% 0.32/0.65 % Propositional check models : 0
% 0.32/0.65 % Propositional check unsatisfiable : 0
% 0.32/0.65 % Propositional clauses : 0
% 0.32/0.65 % Propositional clauses after purity: 0
% 0.32/0.65 % Propositional unsat core size : 0
% 0.32/0.65 % Propositional preprocessing time : 0.000
% 0.32/0.65 % Propositional encoding time : 0.000
% 0.32/0.65 % Propositional solver time : 0.000
% 0.32/0.65 % Success case prop preproc time : 0.000
% 0.32/0.65 % Success case prop encoding time : 0.000
% 0.32/0.65 % Success case prop solver time : 0.000
% 0.32/0.65 % Current number of processed clauses : 46
% 0.32/0.65 % Positive orientable unit clauses : 9
% 0.32/0.65 % Positive unorientable unit clauses: 0
% 0.32/0.65 % Negative unit clauses : 1
% 0.32/0.65 % Non-unit-clauses : 36
% 0.32/0.65 % Current number of unprocessed clauses: 38
% 0.32/0.65 % ...number of literals in the above : 218
% 0.32/0.65 % Current number of archived formulas : 0
% 0.32/0.65 % Current number of archived clauses : 32
% 0.32/0.65 % Clause-clause subsumption calls (NU) : 520
% 0.32/0.65 % Rec. Clause-clause subsumption calls : 305
% 0.32/0.65 % Non-unit clause-clause subsumptions : 46
% 0.32/0.65 % Unit Clause-clause subsumption calls : 17
% 0.32/0.65 % Rewrite failures with RHS unbound : 0
% 0.32/0.65 % BW rewrite match attempts : 4
% 0.32/0.65 % BW rewrite match successes : 4
% 0.32/0.65 % Condensation attempts : 0
% 0.32/0.65 % Condensation successes : 0
% 0.32/0.65 % Termbank termtop insertions : 7283
% 0.32/0.65 % Search garbage collected termcells : 1641
% 0.32/0.65
% 0.32/0.65 % -------------------------------------------------
% 0.32/0.65 % User time : 0.014 s
% 0.32/0.65 % System time : 0.003 s
% 0.32/0.65 % Total time : 0.017 s
% 0.32/0.65 % Maximum resident set size: 3760 pages
% 0.32/0.65
% 0.32/0.65 % -------------------------------------------------
% 0.32/0.65 % User time : 0.018 s
% 0.32/0.65 % System time : 0.012 s
% 0.32/0.65 % Total time : 0.030 s
% 0.32/0.65 % Maximum resident set size: 4608 pages
% 0.32/0.65 % E exiting
%------------------------------------------------------------------------------