%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC019+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 : n004.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:55 PM UTC 2026
% Result : Theorem 1.35s 1.72s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 80 ( 26 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 93 ( 35 ~; 29 |; 17 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 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 : 22 ( 0 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
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(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)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
! [X463] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& esk51_0 = esk50_0
& ( ~ ssList(X463)
| ~ neq(X463,nil)
| ~ frontsegP(esk49_0,X463)
| ~ frontsegP(esk48_0,X463) )
& ( nil != esk49_0
| nil != esk48_0 ) ),
inference(shift_quantors,[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,
esk51_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk49_0,X1)
| ~ frontsegP(esk48_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
esk49_0 = esk48_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
fof(c_0_11,plain,
! [X371] :
( ~ ssList(X371)
| frontsegP(X371,X371) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])]) ).
cnf(c_0_12,negated_conjecture,
( ~ frontsegP(esk48_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_13,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk48_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 != esk49_0
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
~ neq(esk48_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_18,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_20,negated_conjecture,
esk48_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_10])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_14])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC019+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.11 % 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 : n004.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:14:32 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.35/1.72 % Version : CSE_E---1.7
% 1.35/1.72 % Problem : theBenchmark.p
% 1.35/1.72 % SZS status Theorem for theBenchmark.p
% 1.35/1.72 % SZS output start CNFRefutation
% See solution above
% 1.35/1.72 % Total time : 1.372s
%------------------------------------------------------------------------------