%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWX219+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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 : Sun Sep 27 09:15:41 AM UTC 2026
% Result : Theorem 26.74s 3.98s
% Output : CNFRefutation 26.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 16 unt; 0 def)
% Number of atoms : 57 ( 21 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 54 ( 29 ~; 20 |; 1 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 97 ( 33 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_025,axiom,
! [X0,X1] : index(cons(X0,X1),zero) = just(X0) ).
fof(axiom_026,axiom,
! [X0,X1,X2] : index(cons(X0,X1),suc(X2)) = index(X1,X2) ).
fof(axiom_027,axiom,
! [X0,X1,X2,X3,X4] :
( tc(X0,app(X2,X3,X4),X1)
<=> ( tc(X0,X3,X4)
& tc(X0,X2,arr(X4,X1)) ) ) ).
fof(axiom_029,axiom,
! [X0,X1,X2,X3] :
( tc(X0,lam(X1),arr(X2,X3))
<=> tc(cons(X2,X0),X1,X3) ) ).
fof(axiom_031,axiom,
! [X0,X1,X2,X3] :
( index(X0,X2) = just(X3)
=> ( tc(X0,var(X2),X1)
<=> X3 = X1 ) ) ).
fof(goal_032,conjecture,
? [X0] : tc(nil,X0,arr(arr(b,c),arr(arr(a,b),arr(a,c)))) ).
fof(negated_conjecture,negated_conjecture,
~ ? [X0] : tc(nil,X0,arr(arr(b,c),arr(arr(a,b),arr(a,c)))),
inference(negate_conjecture,[status(cth)],[goal_032]) ).
cnf(c24,plain,
just(X0) = index(cons(X0,X1),zero),
inference(clausification,[status(esa)],[axiom_025]) ).
cnf(c25,plain,
index(X0,X1) = index(cons(X2,X0),suc(X1)),
inference(clausification,[status(esa)],[axiom_026]) ).
cnf(c28,plain,
( ~ tc(X0,X1,arr(X3,X4))
| ~ tc(X0,X2,X3)
| tc(X0,app(X1,X2,X3),X4) ),
inference(clausification,[status(esa)],[axiom_027]) ).
cnf(c31,plain,
( ~ tc(cons(X2,X0),X1,X3)
| tc(X0,lam(X1),arr(X2,X3)) ),
inference(clausification,[status(esa)],[axiom_029]) ).
cnf(c34,plain,
( X3 != X0
| tc(X1,var(X2),X3)
| just(X0) != index(X1,X2) ),
inference(clausification,[status(esa)],[axiom_031]) ).
cnf(c35,plain,
~ tc(nil,X0,arr(arr(b,c),arr(arr(a,b),arr(a,c)))),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( tc(cons(X0,X1),var(zero),X3)
| X3 != X2
| just(X2) != just(X0) ),
inference(superposition,[status(thm)],[c24,c34]) ).
cnf(d1,plain,
( tc(cons(X1,X2),var(zero),X0)
| X0 != X1 ),
inference(equality_resolution,[status(thm)],[d0]) ).
cnf(d2,plain,
tc(cons(X0,X1),var(zero),X0),
inference(equality_resolution,[status(thm)],[d1]) ).
cnf(d3,plain,
( tc(cons(X0,X1),var(suc(X2)),X4)
| X4 != X3
| just(X3) != index(X1,X2) ),
inference(superposition,[status(thm)],[c25,c34]) ).
cnf(d4,plain,
( tc(cons(X4,cons(X0,X1)),var(suc(zero)),X3)
| X3 != X2
| just(X2) != just(X0) ),
inference(superposition,[status(thm)],[c24,d3]) ).
cnf(d5,plain,
( tc(cons(X2,cons(X1,X3)),var(suc(zero)),X0)
| X0 != X1 ),
inference(equality_resolution,[status(thm)],[d4]) ).
cnf(d6,plain,
tc(cons(X0,cons(X1,X2)),var(suc(zero)),X1),
inference(equality_resolution,[status(thm)],[d5]) ).
cnf(d7,plain,
~ tc(cons(arr(b,c),nil),X0,arr(arr(a,b),arr(a,c))),
inference(resolution,[status(thm)],[c35,c31]) ).
cnf(d8,plain,
~ tc(cons(arr(a,b),cons(arr(b,c),nil)),X0,arr(a,c)),
inference(resolution,[status(thm)],[d7,c31]) ).
cnf(d9,plain,
~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X0,c),
inference(resolution,[status(thm)],[d8,c31]) ).
cnf(d10,plain,
( ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X2,arr(X1,c))
| ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X0,X1) ),
inference(resolution,[status(thm)],[d9,c28]) ).
cnf(d11,plain,
( tc(cons(X5,cons(X0,X1)),var(suc(suc(X2))),X4)
| X4 != X3
| just(X3) != index(X1,X2) ),
inference(superposition,[status(thm)],[c25,d3]) ).
cnf(d12,plain,
( tc(cons(X4,cons(X5,cons(X0,X1))),var(suc(suc(zero))),X3)
| X3 != X2
| just(X2) != just(X0) ),
inference(superposition,[status(thm)],[c24,d11]) ).
cnf(d13,plain,
( tc(cons(X2,cons(X3,cons(X1,X4))),var(suc(suc(zero))),X0)
| X0 != X1 ),
inference(equality_resolution,[status(thm)],[d12]) ).
cnf(d14,plain,
tc(cons(X0,cons(X1,cons(X2,X3))),var(suc(suc(zero))),X2),
inference(equality_resolution,[status(thm)],[d13]) ).
cnf(d15,plain,
~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X0,b),
inference(resolution,[status(thm)],[d14,d10]) ).
cnf(d16,plain,
( ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X2,arr(X1,b))
| ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X0,X1) ),
inference(resolution,[status(thm)],[d15,c28]) ).
cnf(d17,plain,
~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X0,a),
inference(resolution,[status(thm)],[d16,d6]) ).
cnf(d18,plain,
$false,
inference(resolution,[status(thm)],[d17,d2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX219+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n001.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Sat Sep 26 17:04:14 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 26.74/3.98 % SZS status Theorem for theBenchmark.p
% 26.74/3.98 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------