%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC355+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 : n008.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:19:18 PM UTC 2026
% Result : Theorem 1.70s 1.88s
% Output : CNFRefutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 16 unt; 0 def)
% Number of atoms : 190 ( 38 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 234 ( 93 ~; 93 |; 23 &)
% ( 2 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 37 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> app(X3,cons(X5,nil)) != X4 )
| segmentP(X2,X1) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax80) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> app(X3,cons(X5,nil)) != X4 )
| segmentP(X2,X1) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_9,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)
| neq(esk49_0,nil) )
& ( ~ neq(esk51_0,nil)
| neq(esk49_0,nil) )
& ( neq(esk49_0,nil)
| ssItem(esk52_0) )
& ( ~ neq(esk51_0,nil)
| ssItem(esk52_0) )
& ( neq(esk49_0,nil)
| app(esk50_0,cons(esk52_0,nil)) = esk51_0 )
& ( ~ neq(esk51_0,nil)
| app(esk50_0,cons(esk52_0,nil)) = esk51_0 )
& ( neq(esk49_0,nil)
| ~ segmentP(esk49_0,esk48_0) )
& ( ~ neq(esk51_0,nil)
| ~ segmentP(esk49_0,esk48_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_10,plain,
! [X228,X229,X231] :
( ( ssList(esk6_2(X228,X229))
| ~ frontsegP(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) )
& ( app(X229,esk6_2(X228,X229)) = X228
| ~ frontsegP(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) )
& ( ~ ssList(X231)
| app(X229,X231) != X228
| frontsegP(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])]) ).
fof(c_0_11,plain,
! [X338,X339] :
( ~ ssList(X338)
| ~ ssList(X339)
| ssList(app(X338,X339)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_12,negated_conjecture,
( neq(esk49_0,nil)
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( frontsegP(X3,X2)
| ~ ssList(X1)
| app(X2,X1) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( app(esk50_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
neq(esk49_0,nil),
inference(cn,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X425,X426,X427] :
( ~ ssList(X425)
| ~ ssList(X426)
| ~ ssList(X427)
| app(X426,X427) != app(X426,X425)
| X427 = X425 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])]) ).
cnf(c_0_20,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_13]),c_0_14]) ).
cnf(c_0_21,negated_conjecture,
app(esk48_0,cons(esk52_0,nil)) = esk49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_17]),c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_23,plain,
! [X319,X320] :
( ~ ssList(X319)
| ~ ssItem(X320)
| ssList(cons(X320,X319)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_24,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( frontsegP(esk49_0,esk48_0)
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_17]),c_0_18])]) ).
fof(c_0_30,plain,
! [X236,X237,X240,X241] :
( ( ssList(esk8_2(X236,X237))
| ~ segmentP(X236,X237)
| ~ ssList(X237)
| ~ ssList(X236) )
& ( ssList(esk9_2(X236,X237))
| ~ segmentP(X236,X237)
| ~ ssList(X237)
| ~ ssList(X236) )
& ( app(app(esk8_2(X236,X237),X237),esk9_2(X236,X237)) = X236
| ~ segmentP(X236,X237)
| ~ ssList(X237)
| ~ ssList(X236) )
& ( ~ ssList(X240)
| ~ ssList(X241)
| app(app(X240,X237),X241) != X236
| segmentP(X236,X237)
| ~ ssList(X237)
| ~ ssList(X236) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
cnf(c_0_31,negated_conjecture,
( X1 = cons(esk52_0,nil)
| app(esk48_0,X1) != esk49_0
| ~ ssList(cons(esk52_0,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_22])]) ).
cnf(c_0_32,plain,
( app(X1,esk6_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_33,negated_conjecture,
frontsegP(esk49_0,esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,plain,
( ssList(esk6_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_36,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_37,plain,
! [X343] :
( ~ ssList(X343)
| app(nil,X343) = X343 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_38,negated_conjecture,
( X1 = cons(esk52_0,nil)
| app(esk48_0,X1) != esk49_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_39,negated_conjecture,
app(esk48_0,esk6_2(esk49_0,esk48_0)) = esk49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_22])]) ).
cnf(c_0_40,negated_conjecture,
ssList(esk6_2(esk49_0,esk48_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_33]),c_0_22]),c_0_34])]) ).
cnf(c_0_41,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
esk6_2(esk49_0,esk48_0) = cons(esk52_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_44,negated_conjecture,
( ~ neq(esk51_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_45,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_28])]),c_0_14]) ).
cnf(c_0_46,negated_conjecture,
ssList(cons(esk52_0,nil)),
inference(rw,[status(thm)],[c_0_40,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
~ segmentP(esk49_0,esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_17]),c_0_18])]) ).
cnf(c_0_48,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_45,c_0_21]),c_0_22]),c_0_46])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC355+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.13/0.32 % Computer : n008.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 5 04:45:43 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.70/1.88 % Version : CSE_E---1.7
% 1.70/1.88 % Problem : theBenchmark.p
% 1.70/1.88 % SZS status Theorem for theBenchmark.p
% 1.70/1.88 % SZS output start CNFRefutation
% See solution above
% 1.70/1.88 % Total time : 1.375s
%------------------------------------------------------------------------------