%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC339+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n018.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 : Fri Sep 25 03:06:02 PM UTC 2026
% Result : Theorem 101.78s 14.72s
% Output : Proof 101.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 19
% Syntax : Number of formulae : 129 ( 71 unt; 0 def)
% Number of atoms : 487 ( 154 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 606 ( 248 ~; 198 |; 108 &)
% ( 6 <=>; 46 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 8 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 28 ( 28 usr; 11 con; 0-4 aty)
% Number of variables : 226 ( 2 sgn 122 !; 40 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( segmentP(U,V)
<=> ? [W] :
( ? [X] :
( app(app(W,V),X) = U
& ssList(X) )
& ssList(W) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f6_nnf,plain,
! [U] :
( ! [V] :
( ( ( ! [W] :
( ! [X] :
( app(app(W,V),X) != U
| ~ ssList(X) )
| ~ ssList(W) )
| segmentP(U,V) )
& ( ? [W] :
( ? [X] :
( app(app(W,V),X) = U
& ssList(X) )
& ssList(W) )
| ~ segmentP(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [U,V,W,X] :
( ( ( app(app(W,V),X) != U
| ~ ssList(X)
| ~ ssList(W)
| segmentP(U,V) )
& ( ( app(app(sk7(U,V),V),sk8(U,V)) = U
& ssList(sk8(U,V))
& ssList(sk7(U,V)) )
| ~ segmentP(U,V) ) )
| ~ ssList(V)
| ~ ssList(U) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk7,sk8])],[f6_nnf]) ).
cnf(c21,plain,
( app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(t232,plain,
ifeq(ssList(X1),true,ifeq(ssList(X2),true,ifeq(ssList(X3),true,ifeq(ssList(X4),true,ifeq(app(app(X3,X2),X4),X1,segmentP(X1,X2),true),true),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c21]) ).
cnf(t410,plain,
ifeq(ssList(X1),true,ifeq(ssList(X2),true,ifeq(ssList(X3),true,ifeq(ssList(X4),true,ifeq(app(app(X3,X2),X4),X1,segmentP(X1,X2),true),true),true),true),true) = true,
inference(orient,[status(thm)],[t232]) ).
cnf(t54,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t256,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t54]) ).
cnf(t411,plain,
true = ifeq(ssList(app(app(X1,X2),X3)),true,ifeq(ssList(X2),true,ifeq(ssList(X1),true,ifeq(ssList(X3),true,segmentP(app(app(X1,X2),X3),X2),true),true),true),true),
inference(cp,[status(thm)],[t410,t256]) ).
cnf(t121696,plain,
ifeq(ssList(app(app(X1,X2),X3)),true,ifeq(ssList(X2),true,ifeq(ssList(X1),true,ifeq(ssList(X3),true,segmentP(app(app(X1,X2),X3),X2),true),true),true),true) = true,
inference(orient,[status(thm)],[t411]) ).
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( totalorderedP(U)
& segmentP(V,U) )
| ( nil = W
& nil != X )
| ! [Y] :
( ssList(Y)
=> ! [Z] :
( ssList(Z)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( leq(X7,X5)
& app(X8,cons(X7,nil)) = W
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = Z
& ssList(X6) )
& ssItem(X5) )
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( leq(X1,X3)
& app(cons(X3,nil),X4) = W
& ssList(X4) )
& ssItem(X3) )
& app(X2,cons(X1,nil)) = Y
& ssList(X2) )
& ssItem(X1) )
| ~ totalorderedP(W)
| app(app(Y,W),Z) != X ) ) )
| U != W
| V != X ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f95_neg,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( totalorderedP(U)
& segmentP(V,U) )
| ( nil = W
& nil != X )
| ! [Y] :
( ssList(Y)
=> ! [Z] :
( ssList(Z)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( leq(X7,X5)
& app(X8,cons(X7,nil)) = W
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = Z
& ssList(X6) )
& ssItem(X5) )
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( leq(X1,X3)
& app(cons(X3,nil),X4) = W
& ssList(X4) )
& ssItem(X3) )
& app(X2,cons(X1,nil)) = Y
& ssList(X2) )
& ssItem(X1) )
| ~ totalorderedP(W)
| app(app(Y,W),Z) != X ) ) )
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f95]) ).
fof(f95_nnf,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ~ totalorderedP(U)
| ~ segmentP(V,U) )
& ( nil != W
| nil = X )
& ? [Y] :
( ? [Z] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != W
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != Z
| ~ ssList(X6) )
| ~ ssItem(X5) )
& ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ~ leq(X1,X3)
| app(cons(X3,nil),X4) != W
| ~ ssList(X4) )
| ~ ssItem(X3) )
| app(X2,cons(X1,nil)) != Y
| ~ ssList(X2) )
| ~ ssItem(X1) )
& totalorderedP(W)
& app(app(Y,W),Z) = X
& ssList(Z) )
& ssList(Y) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(nnf_transformation,[status(thm)],[f95_neg]) ).
fof(f95_sk,plain,
! [X1,X2,X3,X4,X5,X6,X7,X8] :
( ( ~ totalorderedP(sk47)
| ~ segmentP(sk48,sk47) )
& ( nil != sk49
| nil = sk50 )
& ( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sk49
| ~ ssList(X8)
| ~ ssItem(X7)
| app(cons(X5,nil),X6) != sk52
| ~ ssList(X6)
| ~ ssItem(X5) )
& ( ~ leq(X1,X3)
| app(cons(X3,nil),X4) != sk49
| ~ ssList(X4)
| ~ ssItem(X3)
| app(X2,cons(X1,nil)) != sk51
| ~ ssList(X2)
| ~ ssItem(X1) )
& totalorderedP(sk49)
& app(app(sk51,sk49),sk52) = sk50
& ssList(sk52)
& ssList(sk51)
& sk47 = sk49
& sk48 = sk50
& ssList(sk50)
& ssList(sk49)
& ssList(sk48)
& ssList(sk47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk47,sk48,sk49,sk50,sk51,sk52])],[f95_nnf]) ).
cnf(c198,plain,
app(app(sk51,sk49),sk52) = sk50,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(t53,plain,
app(app(sk51,sk49),sk52) = sk50,
inference(equality_encoding,[status(esa)],[c198]) ).
cnf(t631,plain,
app(app(sk51,sk49),sk52) = sk50,
inference(orient,[status(thm)],[t53]) ).
cnf(t121697,plain,
true = ifeq(ssList(sk50),true,ifeq(ssList(sk49),true,ifeq(ssList(sk51),true,ifeq(ssList(sk52),true,segmentP(app(app(sk51,sk49),sk52),sk49),true),true),true),true),
inference(cp,[status(thm)],[t121696,t631]) ).
cnf(c191,plain,
ssList(sk48),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(t12,plain,
ssList(sk48) = true,
inference(equality_encoding,[status(esa)],[c191]) ).
cnf(c194,plain,
sk48 = sk50,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(t1,plain,
sk50 = sk48,
inference(equality_encoding,[status(esa)],[c194]) ).
cnf(t930,plain,
sk48 = sk50,
inference(orient,[status(thm)],[t1]) ).
cnf(t122920,plain,
ssList(sk50) = true,
inference(step,[status(thm)],[t12,t930]) ).
cnf(t1378,plain,
ssList(sk50) = true,
inference(orient,[status(thm)],[t122920]) ).
cnf(t126457,plain,
true = ifeq(true,true,ifeq(ssList(sk49),true,ifeq(ssList(sk51),true,ifeq(ssList(sk52),true,segmentP(app(app(sk51,sk49),sk52),sk49),true),true),true),true),
inference(step,[status(thm)],[t121697,t1378]) ).
cnf(t126458,plain,
true = ifeq(ssList(sk49),true,ifeq(ssList(sk51),true,ifeq(ssList(sk52),true,segmentP(app(app(sk51,sk49),sk52),sk49),true),true),true),
inference(step,[status(thm)],[t126457,t256]) ).
cnf(c190,plain,
ssList(sk47),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(t11,plain,
ssList(sk47) = true,
inference(equality_encoding,[status(esa)],[c190]) ).
cnf(c195,plain,
sk47 = sk49,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(t0,plain,
sk49 = sk47,
inference(equality_encoding,[status(esa)],[c195]) ).
cnf(t933,plain,
sk47 = sk49,
inference(orient,[status(thm)],[t0]) ).
cnf(t122919,plain,
ssList(sk49) = true,
inference(step,[status(thm)],[t11,t933]) ).
cnf(t1135,plain,
ssList(sk49) = true,
inference(orient,[status(thm)],[t122919]) ).
cnf(t126459,plain,
true = ifeq(true,true,ifeq(ssList(sk51),true,ifeq(ssList(sk52),true,segmentP(app(app(sk51,sk49),sk52),sk49),true),true),true),
inference(step,[status(thm)],[t126458,t1135]) ).
cnf(t126460,plain,
true = ifeq(ssList(sk51),true,ifeq(ssList(sk52),true,segmentP(app(app(sk51,sk49),sk52),sk49),true),true),
inference(step,[status(thm)],[t126459,t256]) ).
cnf(c196,plain,
ssList(sk51),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(t15,plain,
ssList(sk51) = true,
inference(equality_encoding,[status(esa)],[c196]) ).
cnf(t1621,plain,
ssList(sk51) = true,
inference(orient,[status(thm)],[t15]) ).
cnf(t126461,plain,
true = ifeq(true,true,ifeq(ssList(sk52),true,segmentP(app(app(sk51,sk49),sk52),sk49),true),true),
inference(step,[status(thm)],[t126460,t1621]) ).
cnf(t126462,plain,
true = ifeq(ssList(sk52),true,segmentP(app(app(sk51,sk49),sk52),sk49),true),
inference(step,[status(thm)],[t126461,t256]) ).
cnf(c197,plain,
ssList(sk52),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(t16,plain,
ssList(sk52) = true,
inference(equality_encoding,[status(esa)],[c197]) ).
cnf(t1864,plain,
ssList(sk52) = true,
inference(orient,[status(thm)],[t16]) ).
cnf(t126463,plain,
true = ifeq(true,true,segmentP(app(app(sk51,sk49),sk52),sk49),true),
inference(step,[status(thm)],[t126462,t1864]) ).
cnf(t126464,plain,
true = segmentP(app(app(sk51,sk49),sk52),sk49),
inference(step,[status(thm)],[t126463,t256]) ).
cnf(t126465,plain,
true = segmentP(sk50,sk49),
inference(step,[status(thm)],[t126464,t631]) ).
cnf(t57,plain,
ifeq(not(X1),true,X1,false) = false,
introduced(definition) ).
cnf(t291,plain,
ifeq(not(X1),true,X1,false) = false,
inference(orient,[status(thm)],[t57]) ).
cnf(c203,plain,
( ~ totalorderedP(sk47)
| ~ segmentP(sk48,sk47) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(t72,plain,
or(not(segmentP(sk48,sk47)),not(totalorderedP(sk47))) = true,
inference(equality_encoding,[status(esa)],[c203]) ).
cnf(t522,plain,
or(not(segmentP(sk48,sk47)),not(totalorderedP(sk47))) = true,
inference(orient,[status(thm)],[t72]) ).
cnf(t122912,plain,
or(not(segmentP(sk50,sk47)),not(totalorderedP(sk47))) = true,
inference(step,[status(thm)],[t522,t930]) ).
cnf(t931,plain,
or(not(segmentP(sk50,sk47)),not(totalorderedP(sk47))) = true,
inference(rw,[status(thm)],[t122912]) ).
cnf(t124955,plain,
or(not(segmentP(sk50,sk49)),not(totalorderedP(sk47))) = true,
inference(step,[status(thm)],[t931,t933]) ).
cnf(t124956,plain,
or(not(segmentP(sk50,sk49)),not(totalorderedP(sk49))) = true,
inference(step,[status(thm)],[t124955,t933]) ).
cnf(c199,plain,
totalorderedP(sk49),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(t21,plain,
totalorderedP(sk49) = true,
inference(equality_encoding,[status(esa)],[c199]) ).
cnf(t2422,plain,
totalorderedP(sk49) = true,
inference(orient,[status(thm)],[t21]) ).
cnf(t124957,plain,
or(not(segmentP(sk50,sk49)),not(true)) = true,
inference(step,[status(thm)],[t124956,t2422]) ).
cnf(t6,plain,
not(true) = false,
introduced(definition) ).
cnf(t692,plain,
not(true) = false,
inference(orient,[status(thm)],[t6]) ).
cnf(t124958,plain,
or(not(segmentP(sk50,sk49)),false) = true,
inference(step,[status(thm)],[t124957,t692]) ).
cnf(t32,plain,
or(X1,false) = X1,
introduced(definition) ).
cnf(t288,plain,
or(X1,false) = X1,
inference(orient,[status(thm)],[t32]) ).
cnf(t124959,plain,
not(segmentP(sk50,sk49)) = true,
inference(step,[status(thm)],[t124958,t288]) ).
cnf(t47960,plain,
not(segmentP(sk50,sk49)) = true,
inference(orient,[status(thm)],[t124959]) ).
cnf(t47961,plain,
false = ifeq(true,true,segmentP(sk50,sk49),false),
inference(cp,[status(thm)],[t291,t47960]) ).
cnf(t124960,plain,
false = segmentP(sk50,sk49),
inference(step,[status(thm)],[t47961,t256]) ).
cnf(t47962,plain,
segmentP(sk50,sk49) = false,
inference(orient,[status(thm)],[t124960]) ).
cnf(t126466,plain,
true = false,
inference(step,[status(thm)],[t126465,t47962]) ).
cnf(t122852,plain,
false = true,
inference(orient,[status(thm)],[t126466]) ).
fof(f0,axiom,
! [U] :
( ssItem(U)
=> ! [V] :
( ssItem(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
fof(f0_nnf,plain,
! [U] :
( ! [V] :
( ( ( U = V
| neq(U,V) )
& ( U != V
| ~ neq(U,V) ) )
| ~ ssItem(V) )
| ~ ssItem(U) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [U,V] :
( ( ( U = V
| neq(U,V) )
& ( U != V
| ~ neq(U,V) ) )
| ~ ssItem(V)
| ~ ssItem(U) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( X0 != X1
| ~ neq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
fof(f1,axiom,
? [U] :
( ? [V] :
( U != V
& ssItem(V) )
& ssItem(U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
fof(f1_nnf,plain,
? [U] :
( ? [V] :
( U != V
& ssItem(V) )
& ssItem(U) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
( sk0 != sk1
& ssItem(sk1)
& ssItem(sk0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f1_nnf]) ).
cnf(c4,plain,
sk0 != sk1,
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
fof(f7,axiom,
! [U] :
( ssList(U)
=> ( cyclefreeP(U)
<=> ! [V] :
( ssItem(V)
=> ! [W] :
( ssItem(W)
=> ! [X] :
( ssList(X)
=> ! [Y] :
( ssList(Y)
=> ! [Z] :
( ssList(Z)
=> ( app(app(X,cons(V,Y)),cons(W,Z)) = U
=> ~ ( leq(W,V)
& leq(V,W) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax8) ).
fof(f7_nnf,plain,
! [U] :
( ( ( ? [V] :
( ? [W] :
( ? [X] :
( ? [Y] :
( ? [Z] :
( leq(W,V)
& leq(V,W)
& app(app(X,cons(V,Y)),cons(W,Z)) = U
& ssList(Z) )
& ssList(Y) )
& ssList(X) )
& ssItem(W) )
& ssItem(V) )
| cyclefreeP(U) )
& ( ! [V] :
( ! [W] :
( ! [X] :
( ! [Y] :
( ! [Z] :
( ~ leq(W,V)
| ~ leq(V,W)
| app(app(X,cons(V,Y)),cons(W,Z)) != U
| ~ ssList(Z) )
| ~ ssList(Y) )
| ~ ssList(X) )
| ~ ssItem(W) )
| ~ ssItem(V) )
| ~ cyclefreeP(U) ) )
| ~ ssList(U) ),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [U,V,W,X,Y,Z] :
( ( ( ( leq(sk10(U),sk9(U))
& leq(sk9(U),sk10(U))
& app(app(sk11(U),cons(sk9(U),sk12(U))),cons(sk10(U),sk13(U))) = U
& ssList(sk13(U))
& ssList(sk12(U))
& ssList(sk11(U))
& ssItem(sk10(U))
& ssItem(sk9(U)) )
| cyclefreeP(U) )
& ( ~ leq(W,V)
| ~ leq(V,W)
| app(app(X,cons(V,Y)),cons(W,Z)) != U
| ~ ssList(Z)
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssItem(W)
| ~ ssItem(V)
| ~ cyclefreeP(U) ) )
| ~ ssList(U) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk9,sk10,sk11,sk12,sk13])],[f7_nnf]) ).
cnf(c22,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ cyclefreeP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
fof(f12,axiom,
! [U] :
( ssList(U)
=> ( duplicatefreeP(U)
<=> ! [V] :
( ssItem(V)
=> ! [W] :
( ssItem(W)
=> ! [X] :
( ssList(X)
=> ! [Y] :
( ssList(Y)
=> ! [Z] :
( ssList(Z)
=> ( app(app(X,cons(V,Y)),cons(W,Z)) = U
=> V != W ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax13) ).
fof(f12_nnf,plain,
! [U] :
( ( ( ? [V] :
( ? [W] :
( ? [X] :
( ? [Y] :
( ? [Z] :
( V = W
& app(app(X,cons(V,Y)),cons(W,Z)) = U
& ssList(Z) )
& ssList(Y) )
& ssList(X) )
& ssItem(W) )
& ssItem(V) )
| duplicatefreeP(U) )
& ( ! [V] :
( ! [W] :
( ! [X] :
( ! [Y] :
( ! [Z] :
( V != W
| app(app(X,cons(V,Y)),cons(W,Z)) != U
| ~ ssList(Z) )
| ~ ssList(Y) )
| ~ ssList(X) )
| ~ ssItem(W) )
| ~ ssItem(V) )
| ~ duplicatefreeP(U) ) )
| ~ ssList(U) ),
inference(nnf_transformation,[status(thm)],[f12]) ).
fof(f12_sk,plain,
! [U,V,W,X,Y,Z] :
( ( ( ( sk34(U) = sk35(U)
& app(app(sk36(U),cons(sk34(U),sk37(U))),cons(sk35(U),sk38(U))) = U
& ssList(sk38(U))
& ssList(sk37(U))
& ssList(sk36(U))
& ssItem(sk35(U))
& ssItem(sk34(U)) )
| duplicatefreeP(U) )
& ( V != W
| app(app(X,cons(V,Y)),cons(W,Z)) != U
| ~ ssList(Z)
| ~ ssList(Y)
| ~ ssList(X)
| ~ ssItem(W)
| ~ ssItem(V)
| ~ duplicatefreeP(U) ) )
| ~ ssList(U) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk34,sk35,sk36,sk37,sk38])],[f12_nnf]) ).
cnf(c65,plain,
( X1 != X2
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ duplicatefreeP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
fof(f14,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f14_nnf,plain,
! [U] :
( ! [V] :
( ( ( U = V
| neq(U,V) )
& ( U != V
| ~ neq(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(nnf_transformation,[status(thm)],[f14]) ).
fof(f14_sk,plain,
! [U,V] :
( ( ( U = V
| neq(U,V) )
& ( U != V
| ~ neq(U,V) ) )
| ~ ssList(V)
| ~ ssList(U) ),
inference(skolemisation,[status(esa)],[f14_nnf]) ).
cnf(c80,plain,
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f14_sk]) ).
fof(f17,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> cons(V,U) != U ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax18) ).
fof(f17_nnf,plain,
! [U] :
( ! [V] :
( cons(V,U) != U
| ~ ssItem(V) )
| ~ ssList(U) ),
inference(nnf_transformation,[status(thm)],[f17]) ).
fof(f17_sk,plain,
! [U,V] :
( cons(V,U) != U
| ~ ssItem(V)
| ~ ssList(U) ),
inference(skolemisation,[status(esa)],[f17_nnf]) ).
cnf(c84,plain,
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f17_sk]) ).
fof(f20,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> nil != cons(V,U) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).
fof(f20_nnf,plain,
! [U] :
( ! [V] :
( nil != cons(V,U)
| ~ ssItem(V) )
| ~ ssList(U) ),
inference(nnf_transformation,[status(thm)],[f20]) ).
fof(f20_sk,plain,
! [U,V] :
( nil != cons(V,U)
| ~ ssItem(V)
| ~ ssList(U) ),
inference(skolemisation,[status(esa)],[f20_nnf]) ).
cnf(c90,plain,
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f20_sk]) ).
fof(f32,axiom,
! [U] :
( ssItem(U)
=> ! [V] :
( ssItem(V)
=> ( lt(U,V)
=> ~ lt(V,U) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax33) ).
fof(f32_nnf,plain,
! [U] :
( ! [V] :
( ~ lt(V,U)
| ~ lt(U,V)
| ~ ssItem(V) )
| ~ ssItem(U) ),
inference(nnf_transformation,[status(thm)],[f32]) ).
fof(f32_sk,plain,
! [U,V] :
( ~ lt(V,U)
| ~ lt(U,V)
| ~ ssItem(V)
| ~ ssItem(U) ),
inference(skolemisation,[status(esa)],[f32_nnf]) ).
cnf(c103,plain,
( ~ lt(X1,X0)
| ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(esa)],[f32_sk]) ).
fof(f37,axiom,
! [U] :
( ssItem(U)
=> ~ memberP(nil,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f37_nnf,plain,
! [U] :
( ~ memberP(nil,U)
| ~ ssItem(U) ),
inference(nnf_transformation,[status(thm)],[f37]) ).
fof(f37_sk,plain,
! [U] :
( ~ memberP(nil,U)
| ~ ssItem(U) ),
inference(skolemisation,[status(esa)],[f37_nnf]) ).
cnf(c113,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(esa)],[f37_sk]) ).
fof(f38,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax39) ).
fof(f38_nnf,plain,
~ singletonP(nil),
inference(nnf_transformation,[status(thm)],[f38]) ).
fof(f38_sk,plain,
~ singletonP(nil),
inference(skolemisation,[status(esa)],[f38_nnf]) ).
cnf(c114,plain,
~ singletonP(nil),
inference(cnf_transformation,[status(esa)],[f38_sk]) ).
fof(f89,axiom,
! [U] :
( ssItem(U)
=> ~ lt(U,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax90) ).
fof(f89_nnf,plain,
! [U] :
( ~ lt(U,U)
| ~ ssItem(U) ),
inference(nnf_transformation,[status(thm)],[f89]) ).
fof(f89_sk,plain,
! [U] :
( ~ lt(U,U)
| ~ ssItem(U) ),
inference(skolemisation,[status(esa)],[f89_nnf]) ).
cnf(c182,plain,
( ~ lt(X0,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(esa)],[f89_sk]) ).
fof(f92,axiom,
! [U] :
( ssItem(U)
=> ! [V] :
( ssItem(V)
=> ( lt(U,V)
<=> ( leq(U,V)
& U != V ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax93) ).
fof(f92_nnf,plain,
! [U] :
( ! [V] :
( ( ( ~ leq(U,V)
| U = V
| lt(U,V) )
& ( ( leq(U,V)
& U != V )
| ~ lt(U,V) ) )
| ~ ssItem(V) )
| ~ ssItem(U) ),
inference(nnf_transformation,[status(thm)],[f92]) ).
fof(f92_sk,plain,
! [U,V] :
( ( ( ~ leq(U,V)
| U = V
| lt(U,V) )
& ( ( leq(U,V)
& U != V )
| ~ lt(U,V) ) )
| ~ ssItem(V)
| ~ ssItem(U) ),
inference(skolemisation,[status(esa)],[f92_nnf]) ).
cnf(c185,plain,
( X0 != X1
| ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(esa)],[f92_sk]) ).
fof(f93,axiom,
! [U] :
( ssItem(U)
=> ! [V] :
( ssItem(V)
=> ( gt(U,V)
=> ~ gt(V,U) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax94) ).
fof(f93_nnf,plain,
! [U] :
( ! [V] :
( ~ gt(V,U)
| ~ gt(U,V)
| ~ ssItem(V) )
| ~ ssItem(U) ),
inference(nnf_transformation,[status(thm)],[f93]) ).
fof(f93_sk,plain,
! [U,V] :
( ~ gt(V,U)
| ~ gt(U,V)
| ~ ssItem(V)
| ~ ssItem(U) ),
inference(skolemisation,[status(esa)],[f93_nnf]) ).
cnf(c188,plain,
( ~ gt(X1,X0)
| ~ gt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(esa)],[f93_sk]) ).
cnf(c200,plain,
( ~ leq(X6,X8)
| app(cons(X8,nil),X9) != sk49
| ~ ssList(X9)
| ~ ssItem(X8)
| app(X7,cons(X6,nil)) != sk51
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c201,plain,
( ~ leq(X12,X10)
| app(X13,cons(X12,nil)) != sk49
| ~ ssList(X13)
| ~ ssItem(X12)
| app(cons(X10,nil),X11) != sk52
| ~ ssList(X11)
| ~ ssItem(X10) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c0,c4,c22,c65,c80,c84,c90,c103,c113,c114,c182,c185,c188,c200,c201,c203]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t122852]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC339+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.38 % Computer : n018.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 17:45:05 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 101.78/14.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 101.78/14.72 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------