%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC129-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 : n010.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:05:26 PM UTC 2026
% Result : Unsatisfiable 41.85s 5.74s
% Output : Proof 41.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of formulae : 79 ( 35 unt; 0 def)
% Number of atoms : 223 ( 47 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 350 ( 206 ~; 144 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 108 ( 0 sgn 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f6,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
fof(f6_nnf,plain,
cyclefreeP(nil),
inference(nnf_transformation,[status(thm)],[f6]) ).
cnf(c6,plain,
cyclefreeP(nil),
inference(cnf_transformation,[status(esa)],[f6_nnf]) ).
cnf(t2,plain,
cyclefreeP(nil) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(t220,plain,
cyclefreeP(nil) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(t2787,plain,
cyclefreeP(sk4) = true,
inference(rw,[status(thm)],[t220]) ).
cnf(f192,negated_conjecture,
~ cyclefreeP(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f192_nnf,plain,
~ cyclefreeP(sk2),
inference(nnf_transformation,[status(thm)],[f192]) ).
fof(f192_sk,plain,
~ cyclefreeP(sk2),
inference(skolemisation,[status(esa)],[f192_nnf]) ).
cnf(c192,plain,
~ cyclefreeP(sk2),
inference(cnf_transformation,[status(esa)],[f192_sk]) ).
cnf(t3,plain,
cyclefreeP(sk2) = false,
inference(equality_encoding,[status(esa)],[c192]) ).
cnf(f189,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f189_nnf,plain,
sk2 = sk4,
inference(nnf_transformation,[status(thm)],[f189]) ).
cnf(c189,plain,
sk2 = sk4,
inference(cnf_transformation,[status(esa)],[f189_nnf]) ).
cnf(t1,plain,
sk4 = sk2,
inference(equality_encoding,[status(esa)],[c189]) ).
cnf(t219,plain,
sk2 = sk4,
inference(orient,[status(thm)],[t1]) ).
cnf(t3188,plain,
cyclefreeP(sk4) = false,
inference(step,[status(thm)],[t3,t219]) ).
cnf(t221,plain,
cyclefreeP(sk4) = false,
inference(orient,[status(thm)],[t3188]) ).
cnf(t4155,plain,
false = true,
inference(step,[status(thm)],[t2787,t221]) ).
cnf(t3137,plain,
false = true,
inference(orient,[status(thm)],[t4155]) ).
cnf(f10,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause11) ).
fof(f10_nnf,plain,
~ singletonP(nil),
inference(nnf_transformation,[status(thm)],[f10]) ).
fof(f10_sk,plain,
~ singletonP(nil),
inference(skolemisation,[status(esa)],[f10_nnf]) ).
cnf(c10,plain,
~ singletonP(nil),
inference(cnf_transformation,[status(esa)],[f10_sk]) ).
cnf(f53,axiom,
skac3 != skac2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause54) ).
fof(f53_nnf,plain,
skac3 != skac2,
inference(nnf_transformation,[status(thm)],[f53]) ).
fof(f53_sk,plain,
skac3 != skac2,
inference(skolemisation,[status(esa)],[f53_nnf]) ).
cnf(c53,plain,
skac3 != skac2,
inference(cnf_transformation,[status(esa)],[f53_sk]) ).
cnf(f62,axiom,
( ~ ssItem(U)
| ~ lt(U,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause63) ).
fof(f62_nnf,plain,
! [U] :
( ~ ssItem(U)
| ~ lt(U,U) ),
inference(nnf_transformation,[status(thm)],[f62]) ).
fof(f62_sk,plain,
! [U] :
( ~ ssItem(U)
| ~ lt(U,U) ),
inference(skolemisation,[status(esa)],[f62_nnf]) ).
cnf(c62,plain,
( ~ ssItem(X0)
| ~ lt(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f62_sk]) ).
cnf(f70,axiom,
( ~ ssItem(U)
| ~ memberP(nil,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause71) ).
fof(f70_nnf,plain,
! [U] :
( ~ ssItem(U)
| ~ memberP(nil,U) ),
inference(nnf_transformation,[status(thm)],[f70]) ).
fof(f70_sk,plain,
! [U] :
( ~ ssItem(U)
| ~ memberP(nil,U) ),
inference(skolemisation,[status(esa)],[f70_nnf]) ).
cnf(c70,plain,
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(cnf_transformation,[status(esa)],[f70_sk]) ).
cnf(f97,axiom,
( ~ ssList(V)
| ~ ssItem(U)
| cons(U,V) != nil ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause98) ).
fof(f97_nnf,plain,
! [U,V] :
( ~ ssList(V)
| ~ ssItem(U)
| cons(U,V) != nil ),
inference(nnf_transformation,[status(thm)],[f97]) ).
fof(f97_sk,plain,
! [U,V] :
( ~ ssList(V)
| ~ ssItem(U)
| cons(U,V) != nil ),
inference(skolemisation,[status(esa)],[f97_nnf]) ).
cnf(c97,plain,
( ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != nil ),
inference(cnf_transformation,[status(esa)],[f97_sk]) ).
cnf(f98,axiom,
( ~ ssList(V)
| ~ ssItem(U)
| cons(U,V) != V ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause99) ).
fof(f98_nnf,plain,
! [U,V] :
( ~ ssList(V)
| ~ ssItem(U)
| cons(U,V) != V ),
inference(nnf_transformation,[status(thm)],[f98]) ).
fof(f98_sk,plain,
! [U,V] :
( ~ ssList(V)
| ~ ssItem(U)
| cons(U,V) != V ),
inference(skolemisation,[status(esa)],[f98_nnf]) ).
cnf(c98,plain,
( ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != X1 ),
inference(cnf_transformation,[status(esa)],[f98_sk]) ).
cnf(f109,axiom,
( ~ ssItem(V)
| ~ ssItem(U)
| ~ gt(V,U)
| ~ gt(U,V) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause110) ).
fof(f109_nnf,plain,
! [U,V] :
( ~ ssItem(V)
| ~ ssItem(U)
| ~ gt(V,U)
| ~ gt(U,V) ),
inference(nnf_transformation,[status(thm)],[f109]) ).
fof(f109_sk,plain,
! [U,V] :
( ~ ssItem(V)
| ~ ssItem(U)
| ~ gt(V,U)
| ~ gt(U,V) ),
inference(skolemisation,[status(esa)],[f109_nnf]) ).
cnf(c109,plain,
( ~ ssItem(X1)
| ~ ssItem(X0)
| ~ gt(X1,X0)
| ~ gt(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f109_sk]) ).
cnf(f110,axiom,
( ~ ssItem(U)
| ~ ssItem(V)
| ~ lt(U,V)
| U != V ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause111) ).
fof(f110_nnf,plain,
! [U,V] :
( ~ ssItem(U)
| ~ ssItem(V)
| ~ lt(U,V)
| U != V ),
inference(nnf_transformation,[status(thm)],[f110]) ).
fof(f110_sk,plain,
! [U,V] :
( ~ ssItem(U)
| ~ ssItem(V)
| ~ lt(U,V)
| U != V ),
inference(skolemisation,[status(esa)],[f110_nnf]) ).
cnf(c110,plain,
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ lt(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f110_sk]) ).
cnf(f113,axiom,
( ~ ssItem(V)
| ~ ssItem(U)
| ~ lt(V,U)
| ~ lt(U,V) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause114) ).
fof(f113_nnf,plain,
! [U,V] :
( ~ ssItem(V)
| ~ ssItem(U)
| ~ lt(V,U)
| ~ lt(U,V) ),
inference(nnf_transformation,[status(thm)],[f113]) ).
fof(f113_sk,plain,
! [U,V] :
( ~ ssItem(V)
| ~ ssItem(U)
| ~ lt(V,U)
| ~ lt(U,V) ),
inference(skolemisation,[status(esa)],[f113_nnf]) ).
cnf(c113,plain,
( ~ ssItem(X1)
| ~ ssItem(X0)
| ~ lt(X1,X0)
| ~ lt(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f113_sk]) ).
cnf(f114,axiom,
( ~ ssList(U)
| ~ ssList(V)
| ~ neq(U,V)
| U != V ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause115) ).
fof(f114_nnf,plain,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| ~ neq(U,V)
| U != V ),
inference(nnf_transformation,[status(thm)],[f114]) ).
fof(f114_sk,plain,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| ~ neq(U,V)
| U != V ),
inference(skolemisation,[status(esa)],[f114_nnf]) ).
cnf(c114,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ~ neq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f114_sk]) ).
cnf(f116,axiom,
( ~ ssItem(U)
| ~ ssItem(V)
| ~ neq(U,V)
| U != V ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause117) ).
fof(f116_nnf,plain,
! [U,V] :
( ~ ssItem(U)
| ~ ssItem(V)
| ~ neq(U,V)
| U != V ),
inference(nnf_transformation,[status(thm)],[f116]) ).
fof(f116_sk,plain,
! [U,V] :
( ~ ssItem(U)
| ~ ssItem(V)
| ~ neq(U,V)
| U != V ),
inference(skolemisation,[status(esa)],[f116_nnf]) ).
cnf(c116,plain,
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ neq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f116_sk]) ).
cnf(f178,axiom,
( ~ ssList(Y)
| ~ duplicatefreeP(Y)
| ~ ssItem(V)
| ~ ssList(U)
| ~ ssList(W)
| ~ ssList(X)
| app(app(U,cons(V,W)),cons(V,X)) != Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause179) ).
fof(f178_nnf,plain,
! [U,V,W,X,Y] :
( ~ ssList(Y)
| ~ duplicatefreeP(Y)
| ~ ssItem(V)
| ~ ssList(U)
| ~ ssList(W)
| ~ ssList(X)
| app(app(U,cons(V,W)),cons(V,X)) != Y ),
inference(nnf_transformation,[status(thm)],[f178]) ).
fof(f178_sk,plain,
! [U,V,W,X,Y] :
( ~ ssList(Y)
| ~ duplicatefreeP(Y)
| ~ ssItem(V)
| ~ ssList(U)
| ~ ssList(W)
| ~ ssList(X)
| app(app(U,cons(V,W)),cons(V,X)) != Y ),
inference(skolemisation,[status(esa)],[f178_nnf]) ).
cnf(c178,plain,
( ~ ssList(X4)
| ~ duplicatefreeP(X4)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4 ),
inference(cnf_transformation,[status(esa)],[f178_sk]) ).
cnf(f184,axiom,
( ~ ssList(Z)
| ~ cyclefreeP(Z)
| ~ ssItem(U)
| ~ ssItem(V)
| ~ ssList(W)
| ~ ssList(X)
| ~ ssList(Y)
| app(app(W,cons(U,X)),cons(V,Y)) != Z
| ~ leq(V,U)
| ~ leq(U,V) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause185) ).
fof(f184_nnf,plain,
! [U,V,W,X,Y,Z] :
( ~ ssList(Z)
| ~ cyclefreeP(Z)
| ~ ssItem(U)
| ~ ssItem(V)
| ~ ssList(W)
| ~ ssList(X)
| ~ ssList(Y)
| app(app(W,cons(U,X)),cons(V,Y)) != Z
| ~ leq(V,U)
| ~ leq(U,V) ),
inference(nnf_transformation,[status(thm)],[f184]) ).
fof(f184_sk,plain,
! [U,V,W,X,Y,Z] :
( ~ ssList(Z)
| ~ cyclefreeP(Z)
| ~ ssItem(U)
| ~ ssItem(V)
| ~ ssList(W)
| ~ ssList(X)
| ~ ssList(Y)
| app(app(W,cons(U,X)),cons(V,Y)) != Z
| ~ leq(V,U)
| ~ leq(U,V) ),
inference(skolemisation,[status(esa)],[f184_nnf]) ).
cnf(c184,plain,
( ~ ssList(X5)
| ~ cyclefreeP(X5)
| ~ ssItem(X0)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X2,cons(X0,X3)),cons(X1,X4)) != X5
| ~ leq(X1,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f184_sk]) ).
cnf(f191,negated_conjecture,
~ neq(sk4,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f191_nnf,plain,
~ neq(sk4,nil),
inference(nnf_transformation,[status(thm)],[f191]) ).
fof(f191_sk,plain,
~ neq(sk4,nil),
inference(skolemisation,[status(esa)],[f191_nnf]) ).
cnf(c191,plain,
~ neq(sk4,nil),
inference(cnf_transformation,[status(esa)],[f191_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c10,c53,c62,c70,c97,c98,c109,c110,c113,c114,c116,c178,c184,c191,c192]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t3137]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC129-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n010.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 16:33:58 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 41.85/5.74 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 41.85/5.74 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------