%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC105+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:18:18 PM UTC 2026
% Result : Theorem 1.29s 1.72s
% Output : CNFRefutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 106 ( 43 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 119 ( 42 ~; 47 |; 20 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& rearsegP(X2,X1) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax52,axiom,
! [X1] :
( ssList(X1)
=> ( rearsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax52) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& rearsegP(X2,X1) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_4,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( neq(esk49_0,nil)
| nil = esk49_0 )
& ( ~ neq(esk48_0,nil)
| ~ rearsegP(esk49_0,esk48_0)
| nil = esk49_0 )
& ( neq(esk49_0,nil)
| nil != esk48_0 )
& ( ~ neq(esk48_0,nil)
| ~ rearsegP(esk49_0,esk48_0)
| nil != esk48_0 )
& ( neq(esk50_0,nil)
| nil = esk51_0 )
& ( rearsegP(esk51_0,esk50_0)
| nil = esk51_0 )
& ( neq(esk50_0,nil)
| nil = esk50_0 )
& ( rearsegP(esk51_0,esk50_0)
| nil = esk50_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_5,negated_conjecture,
( neq(esk50_0,nil)
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( rearsegP(esk51_0,esk50_0)
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( rearsegP(esk51_0,esk50_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( nil = esk49_0
| ~ neq(esk48_0,nil)
| ~ rearsegP(esk49_0,esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( esk49_0 = nil
| neq(esk48_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( esk49_0 = nil
| rearsegP(esk49_0,esk48_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_6]),c_0_6]),c_0_7]) ).
fof(c_0_13,plain,
! [X390] :
( ( ~ rearsegP(nil,X390)
| nil = X390
| ~ ssList(X390) )
& ( nil != X390
| rearsegP(nil,X390)
| ~ ssList(X390) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax52])])]) ).
cnf(c_0_14,negated_conjecture,
( esk48_0 = nil
| rearsegP(esk49_0,esk48_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_7]),c_0_6]),c_0_7]) ).
cnf(c_0_15,negated_conjecture,
esk49_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ rearsegP(esk49_0,esk48_0)
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,plain,
( nil = X1
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( esk48_0 = nil
| rearsegP(nil,esk48_0) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_20,plain,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,negated_conjecture,
( esk48_0 != nil
| ~ rearsegP(nil,esk48_0)
| ~ neq(esk48_0,nil) ),
inference(rw,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_24,negated_conjecture,
esk48_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_25,plain,
rearsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_20]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
( neq(nil,nil)
| esk48_0 != nil ),
inference(rw,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_27,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]),c_0_25]),c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_24])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC105+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.14/0.32 % Computer : n010.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 04:26:06 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.29/1.72 % Version : CSE_E---1.7
% 1.29/1.72 % Problem : theBenchmark.p
% 1.29/1.72 % SZS status Theorem for theBenchmark.p
% 1.29/1.72 % SZS output start CNFRefutation
% See solution above
% 1.29/1.72 % Total time : 1.369s
%------------------------------------------------------------------------------