%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC206+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 : 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:43:27 PM UTC 2026
% Result : Theorem 0.24s 0.64s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 17 unt; 0 def)
% Number of atoms : 118 ( 29 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 138 ( 51 ~; 44 |; 20 &)
% ( 3 <=>; 20 =>; 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 : 26 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X3,X5)
| ~ segmentP(X4,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X4
& nil != X3 )
| neq(X1,nil)
| ~ neq(X2,nil)
| 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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X3,X5)
| ~ segmentP(X4,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X4
& nil != X3 )
| neq(X1,nil)
| ~ neq(X2,nil)
| 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)
=> ( ( neq(X4,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X3,X5)
| ~ segmentP(X4,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X4
& nil != X3 )
| neq(X1,nil)
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
( ( ~ 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 )
& ~ neq(esk1_0,nil)
& neq(esk2_0,nil)
& 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(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,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ neq(esk1_0,nil),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X14,X15] :
( ( ~ ssList(X14)
| ~ ssList(X15)
| neq(X14,X15)
| X14 = X15 )
& ( ~ ssList(X14)
| ~ ssList(X15)
| X14 != X15
| ~ neq(X14,X15) ) ),
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_13,negated_conjecture,
( ~ neq(esk4_0,nil)
| segmentP(esk3_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
~ neq(esk3_0,nil),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_19,plain,
! [X44] :
( ( ~ ssList(X44)
| segmentP(nil,X44)
| nil != X44 )
& ( ~ ssList(X44)
| nil = X44
| ~ segmentP(nil,X44) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_20,negated_conjecture,
segmentP(esk3_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_21,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssList(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(esk4_0,nil)
| neq(esk5_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
segmentP(nil,esk5_0),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_14])]) ).
cnf(c_0_27,negated_conjecture,
neq(esk5_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_14])]) ).
cnf(c_0_28,negated_conjecture,
esk5_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC206+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.47 % Computer : n007.cluster.edu
% 0.18/0.47 % Model : x86_64 x86_64
% 0.18/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.47 % Memory : 8046.5625MB
% 0.18/0.47 % OS : Linux 6.8.0-71-generic
% 0.18/0.47 % CPULimit : 300
% 0.18/0.47 % WCLimit : 300
% 0.18/0.47 % DateTime : Mon Sep 21 08:02:50 UTC 2026
% 0.18/0.48 % CPUTime :
% 0.18/0.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.56 Running first-order theorem proving
% 0.24/0.56 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.24/0.64 % Version: 3.5.1
% 0.24/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.64 % Starting sh5l with 300s (1) cores
% 0.24/0.64 % sh5l with pid 601102 completed with status 0
% 0.24/0.64 % Result found by sh5l
% 0.24/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.64 % Starting sh5l with 300s (1) cores
% 0.24/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.24/0.64 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.64 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.24/0.64 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.64 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.64 % SubtermCWHack with pid 601103 completed with status 0
% 0.24/0.64 % Result found by SubtermCWHack
% 0.24/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.64 % Starting sh5l with 300s (1) cores
% 0.24/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.24/0.64 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.64 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.24/0.64 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.64 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.64 % Preprocessing time : 0.005 s
% 0.24/0.64
% 0.24/0.64 % Proof found!
% 0.24/0.64 % SZS status Theorem
% 0.24/0.64 % SZS output start CNFRefutation
% See solution above
% 0.24/0.64 % Parsed axioms : 96
% 0.24/0.64 % Removed by relevancy pruning/SinE : 16
% 0.24/0.64 % Initial clauses : 165
% 0.24/0.64 % Removed in clause preprocessing : 2
% 0.24/0.64 % Initial clauses in saturation : 163
% 0.24/0.64 % Processed clauses : 104
% 0.24/0.64 % ...of these trivial : 0
% 0.24/0.64 % ...subsumed : 2
% 0.24/0.64 % ...remaining for further processing : 102
% 0.24/0.64 % Other redundant clauses eliminated : 3
% 0.24/0.64 % Clauses deleted for lack of memory : 0
% 0.24/0.64 % Backward-subsumed : 4
% 0.24/0.64 % Backward-rewritten : 11
% 0.24/0.64 % Generated clauses : 19
% 0.24/0.64 % ...of the previous two non-redundant : 18
% 0.24/0.64 % ...aggressively subsumed : 0
% 0.24/0.64 % Contextual simplify-reflections : 1
% 0.24/0.64 % Paramodulations : 16
% 0.24/0.64 % Factorizations : 0
% 0.24/0.64 % NegExts : 0
% 0.24/0.64 % Equation resolutions : 3
% 0.24/0.64 % Disequality decompositions : 0
% 0.24/0.64 % Total rewrite steps : 33
% 0.24/0.64 % ...of those cached : 23
% 0.24/0.64 % Propositional unsat checks : 0
% 0.24/0.64 % Propositional check models : 0
% 0.24/0.64 % Propositional check unsatisfiable : 0
% 0.24/0.64 % Propositional clauses : 0
% 0.24/0.64 % Propositional clauses after purity: 0
% 0.24/0.64 % Propositional unsat core size : 0
% 0.24/0.64 % Propositional preprocessing time : 0.000
% 0.24/0.64 % Propositional encoding time : 0.000
% 0.24/0.64 % Propositional solver time : 0.000
% 0.24/0.64 % Success case prop preproc time : 0.000
% 0.24/0.64 % Success case prop encoding time : 0.000
% 0.24/0.64 % Success case prop solver time : 0.000
% 0.24/0.64 % Current number of processed clauses : 84
% 0.24/0.64 % Positive orientable unit clauses : 16
% 0.24/0.64 % Positive unorientable unit clauses: 0
% 0.24/0.64 % Negative unit clauses : 3
% 0.24/0.64 % Non-unit-clauses : 65
% 0.24/0.64 % Current number of unprocessed clauses: 74
% 0.24/0.64 % ...number of literals in the above : 368
% 0.24/0.64 % Current number of archived formulas : 0
% 0.24/0.64 % Current number of archived clauses : 15
% 0.24/0.64 % Clause-clause subsumption calls (NU) : 543
% 0.24/0.64 % Rec. Clause-clause subsumption calls : 516
% 0.24/0.64 % Non-unit clause-clause subsumptions : 3
% 0.24/0.64 % Unit Clause-clause subsumption calls : 58
% 0.24/0.64 % Rewrite failures with RHS unbound : 0
% 0.24/0.64 % BW rewrite match attempts : 4
% 0.24/0.64 % BW rewrite match successes : 4
% 0.24/0.64 % Condensation attempts : 0
% 0.24/0.64 % Condensation successes : 0
% 0.24/0.64 % Termbank termtop insertions : 14453
% 0.24/0.64 % Search garbage collected termcells : 3602
% 0.24/0.64
% 0.24/0.64 % -------------------------------------------------
% 0.24/0.64 % User time : 0.019 s
% 0.24/0.64 % System time : 0.005 s
% 0.24/0.64 % Total time : 0.024 s
% 0.24/0.64 % Maximum resident set size: 4272 pages
% 0.24/0.64
% 0.24/0.64 % -------------------------------------------------
% 0.24/0.64 % User time : 0.024 s
% 0.24/0.64 % System time : 0.012 s
% 0.24/0.64 % Total time : 0.036 s
% 0.24/0.64 % Maximum resident set size: 4608 pages
% 0.24/0.64 % E exiting
%------------------------------------------------------------------------------