%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC054+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 : n001.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:47 PM UTC 2026
% Result : Theorem 0.09s 0.44s
% Output : CNFRefutation 0.09s
% 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 : 223 ( 90 ~; 88 |; 33 &)
% ( 1 <=>; 11 =>; 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] :
( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( neq(X4,nil)
& ! [X5] :
( ~ segmentP(X3,X5)
| ~ segmentP(X4,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
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] :
( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( neq(X4,nil)
& ! [X5] :
( ~ segmentP(X3,X5)
| ~ segmentP(X4,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( neq(X4,nil)
& ! [X5] :
( ~ segmentP(X3,X5)
| ~ segmentP(X4,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
! [X12] :
( ( nil != esk1_0
| ~ segmentP(esk1_0,X12)
| ~ segmentP(esk2_0,X12)
| ~ neq(X12,nil)
| ~ ssList(X12) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ segmentP(esk1_0,X12)
| ~ segmentP(esk2_0,X12)
| ~ neq(X12,nil)
| ~ ssList(X12) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| segmentP(esk3_0,esk5_0) )
& ( ~ neq(esk4_0,nil)
| segmentP(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
| ~ segmentP(esk1_0,X1)
| ~ segmentP(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)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(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)
| segmentP(esk3_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( ~ segmentP(esk4_0,esk4_0)
| ~ segmentP(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,
! [X24] :
( segmentP(X24,X24)
| ~ ssList(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_20,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(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)
| segmentP(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( ~ neq(esk4_0,nil)
| segmentP(esk1_0,esk5_0) ),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
fof(c_0_25,plain,
! [X30] :
( ( ~ ssList(X30)
| segmentP(nil,X30)
| nil != X30 )
& ( ~ ssList(X30)
| nil = X30
| ~ segmentP(nil,X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ segmentP(esk4_0,esk4_0)
| ~ segmentP(nil,esk4_0)
| esk4_0 != nil ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(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,
( segmentP(esk4_0,esk5_0)
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_32,negated_conjecture,
( segmentP(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
| segmentP(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,
( ~ segmentP(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,
segmentP(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.03 % Problem : SWC054+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.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 07:57:29 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.44 % Version: 3.5.1
% 0.09/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44 % Starting sh5l with 300s (1) cores
% 0.09/0.44 % new_bool_3 with pid 2613703 completed with status 0
% 0.09/0.44 % Result found by new_bool_3
% 0.09/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.44 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.09/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.44 % SubtermCWHack with pid 2613706 completed with status 0
% 0.09/0.44 % Result found by SubtermCWHack
% 0.09/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.44 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.09/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.44 % Preprocessing time : 0.002 s
% 0.09/0.44
% 0.09/0.44 % Proof found!
% 0.09/0.44 % SZS status Theorem
% 0.09/0.44 % SZS output start CNFRefutation
% See solution above
% 0.09/0.44 % Parsed axioms : 96
% 0.09/0.44 % Removed by relevancy pruning/SinE : 70
% 0.09/0.44 % Initial clauses : 53
% 0.09/0.44 % Removed in clause preprocessing : 0
% 0.09/0.44 % Initial clauses in saturation : 53
% 0.09/0.44 % Processed clauses : 95
% 0.09/0.44 % ...of these trivial : 1
% 0.09/0.44 % ...subsumed : 21
% 0.09/0.44 % ...remaining for further processing : 73
% 0.09/0.44 % Other redundant clauses eliminated : 9
% 0.09/0.44 % Clauses deleted for lack of memory : 0
% 0.09/0.44 % Backward-subsumed : 2
% 0.09/0.44 % Backward-rewritten : 27
% 0.09/0.44 % Generated clauses : 98
% 0.09/0.44 % ...of the previous two non-redundant : 64
% 0.09/0.44 % ...aggressively subsumed : 0
% 0.09/0.44 % Contextual simplify-reflections : 11
% 0.09/0.44 % Paramodulations : 88
% 0.09/0.44 % Factorizations : 0
% 0.09/0.44 % NegExts : 0
% 0.09/0.44 % Equation resolutions : 11
% 0.09/0.44 % Disequality decompositions : 0
% 0.09/0.44 % Total rewrite steps : 66
% 0.09/0.44 % ...of those cached : 59
% 0.09/0.44 % Propositional unsat checks : 0
% 0.09/0.44 % Propositional check models : 0
% 0.09/0.44 % Propositional check unsatisfiable : 0
% 0.09/0.44 % Propositional clauses : 0
% 0.09/0.44 % Propositional clauses after purity: 0
% 0.09/0.44 % Propositional unsat core size : 0
% 0.09/0.44 % Propositional preprocessing time : 0.000
% 0.09/0.44 % Propositional encoding time : 0.000
% 0.09/0.44 % Propositional solver time : 0.000
% 0.09/0.44 % Success case prop preproc time : 0.000
% 0.09/0.44 % Success case prop encoding time : 0.000
% 0.09/0.44 % Success case prop solver time : 0.000
% 0.09/0.44 % Current number of processed clauses : 40
% 0.09/0.44 % Positive orientable unit clauses : 8
% 0.09/0.44 % Positive unorientable unit clauses: 0
% 0.09/0.44 % Negative unit clauses : 1
% 0.09/0.44 % Non-unit-clauses : 31
% 0.09/0.44 % Current number of unprocessed clauses: 22
% 0.09/0.44 % ...number of literals in the above : 120
% 0.09/0.44 % Current number of archived formulas : 0
% 0.09/0.44 % Current number of archived clauses : 29
% 0.09/0.44 % Clause-clause subsumption calls (NU) : 447
% 0.09/0.44 % Rec. Clause-clause subsumption calls : 239
% 0.09/0.44 % Non-unit clause-clause subsumptions : 34
% 0.09/0.44 % Unit Clause-clause subsumption calls : 4
% 0.09/0.44 % Rewrite failures with RHS unbound : 0
% 0.09/0.44 % BW rewrite match attempts : 3
% 0.09/0.44 % BW rewrite match successes : 3
% 0.09/0.44 % Condensation attempts : 0
% 0.09/0.44 % Condensation successes : 0
% 0.09/0.44 % Termbank termtop insertions : 6368
% 0.09/0.44 % Search garbage collected termcells : 1576
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.010 s
% 0.09/0.44 % System time : 0.003 s
% 0.09/0.44 % Total time : 0.013 s
% 0.09/0.44 % Maximum resident set size: 3760 pages
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.015 s
% 0.09/0.44 % System time : 0.006 s
% 0.09/0.44 % Total time : 0.021 s
% 0.09/0.44 % Maximum resident set size: 4864 pages
% 0.09/0.44 % E exiting
%------------------------------------------------------------------------------