%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC037+1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:17:59 PM UTC 2026
% Result : Theorem 1.30s 1.79s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 14 unt; 0 def)
% Number of atoms : 102 ( 42 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 114 ( 39 ~; 41 |; 19 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 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 : 20 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ segmentP(X4,X5)
| ~ segmentP(X3,X5) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
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)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ segmentP(X4,X5)
| ~ segmentP(X3,X5) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_5,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& nil = esk49_0
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& nil != esk48_0
& ( nil = esk51_0
| ssList(esk52_0) )
& ( nil = esk50_0
| ssList(esk52_0) )
& ( nil = esk51_0
| neq(esk52_0,nil) )
& ( nil = esk50_0
| neq(esk52_0,nil) )
& ( nil = esk51_0
| segmentP(esk51_0,esk52_0) )
& ( nil = esk50_0
| segmentP(esk51_0,esk52_0) )
& ( nil = esk51_0
| segmentP(esk50_0,esk52_0) )
& ( nil = esk50_0
| segmentP(esk50_0,esk52_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_6,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
nil = esk49_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,plain,
! [X403] :
( ( ~ segmentP(nil,X403)
| nil = X403
| ~ ssList(X403) )
& ( nil != X403
| segmentP(nil,X403)
| ~ ssList(X403) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_11,negated_conjecture,
( nil = esk50_0
| segmentP(esk51_0,esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
esk51_0 = nil,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_13,negated_conjecture,
esk50_0 != nil,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( nil = esk50_0
| ssList(esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_15,plain,
! [X317,X318] :
( ( ~ neq(X317,X318)
| X317 != X318
| ~ ssList(X318)
| ~ ssList(X317) )
& ( X317 = X318
| neq(X317,X318)
| ~ ssList(X318)
| ~ ssList(X317) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_16,negated_conjecture,
( nil = esk50_0
| neq(esk52_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
segmentP(nil,esk52_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk52_0),
inference(sr,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_20,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
neq(esk52_0,nil),
inference(sr,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_22,negated_conjecture,
esk52_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC037+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n010.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 04:16:51 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.36 % start to proof: theBenchmark
% 1.30/1.79 % Version : CSE_E---1.7
% 1.30/1.79 % Problem : theBenchmark.p
% 1.30/1.79 % SZS status Theorem for theBenchmark.p
% 1.30/1.79 % SZS output start CNFRefutation
% See solution above
% 1.30/1.79 % Total time : 1.417s
%------------------------------------------------------------------------------