%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWX223+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n015.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:42 AM UTC 2026
% Result : Theorem 15.72s 2.46s
% Output : CNFRefutation 15.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 47 ( 18 unt; 0 def)
% Number of atoms : 93 ( 28 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 98 ( 52 ~; 35 |; 4 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 102 ( 21 sgn 29 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_021,axiom,
! [X0,X1,X2,X3] : app(X0,X1,X2) != lam(X3) ).
fof(axiom_023,axiom,
! [X0,X1] : lam(X0) != var(X1) ).
fof(axiom_024,axiom,
! [X0,X1,X2] :
( X0 != lam(proj1Lam(X0))
=> ( nf(app(X0,X1,X2))
<=> ( nf(X1)
& nf(X0) ) ) ) ).
fof(axiom_026,axiom,
! [X0] :
( nf(lam(X0))
<=> nf(X0) ) ).
fof(axiom_027,axiom,
! [X0] : nf(var(X0)) ).
fof(axiom_029,axiom,
! [X0,X1] : index(cons(X0,X1),zero) = just(X0) ).
fof(axiom_030,axiom,
! [X0,X1,X2] : index(cons(X0,X1),suc(X2)) = index(X1,X2) ).
fof(axiom_031,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_033,axiom,
! [X0,X1,X2,X3] :
( tc(X0,lam(X1),arr(X2,X3))
<=> tc(cons(X2,X0),X1,X3) ) ).
fof(axiom_035,axiom,
! [X0,X1,X2,X3] :
( index(X0,X2) = just(X3)
=> ( tc(X0,var(X2),X1)
<=> X3 = X1 ) ) ).
fof(goal_036,conjecture,
? [X0] :
( tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b)))
& nf(X0) ) ).
fof(negated_conjecture,negated_conjecture,
~ ? [X0] :
( tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b)))
& nf(X0) ),
inference(negate_conjecture,[status(cth)],[goal_036]) ).
cnf(c20,plain,
app(X0,X1,X2) != lam(X3),
inference(clausification,[status(esa)],[axiom_021]) ).
cnf(c22,plain,
lam(X0) != var(X1),
inference(clausification,[status(esa)],[axiom_023]) ).
cnf(c25,plain,
( ~ nf(X1)
| ~ nf(X0)
| nf(app(X0,X1,X2))
| X0 = lam(proj1Lam(X0)) ),
inference(clausification,[status(esa)],[axiom_024]) ).
cnf(c28,plain,
( ~ nf(X0)
| nf(lam(X0)) ),
inference(clausification,[status(esa)],[axiom_026]) ).
cnf(c29,plain,
nf(var(X0)),
inference(clausification,[status(esa)],[axiom_027]) ).
cnf(c31,plain,
index(cons(X0,X1),zero) = just(X0),
inference(clausification,[status(esa)],[axiom_029]) ).
cnf(c32,plain,
index(cons(X0,X1),suc(X2)) = index(X1,X2),
inference(clausification,[status(esa)],[axiom_030]) ).
cnf(c35,plain,
( ~ tc(X0,X2,X3)
| ~ tc(X0,X1,arr(X3,X4))
| tc(X0,app(X1,X2,X3),X4) ),
inference(clausification,[status(esa)],[axiom_031]) ).
cnf(c38,plain,
( ~ tc(cons(X2,X0),X1,X3)
| tc(X0,lam(X1),arr(X2,X3)) ),
inference(clausification,[status(esa)],[axiom_033]) ).
cnf(c41,plain,
( X2 != X3
| tc(X0,var(X1),X3)
| index(X0,X1) != just(X2) ),
inference(clausification,[status(esa)],[axiom_035]) ).
cnf(c42,plain,
( ~ tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b)))
| ~ nf(X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( tc(cons(X0,X1),var(zero),X3)
| X2 != X3
| just(X0) != just(X2) ),
inference(superposition,[status(thm)],[c31,c41]) ).
cnf(d1,plain,
( tc(cons(X0,X2),var(zero),X1)
| 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,
( ~ nf(lam(X0))
| ~ tc(cons(arr(a,arr(a,b)),nil),X0,arr(a,b)) ),
inference(resolution,[status(thm)],[c38,c42]) ).
cnf(d4,plain,
( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,b)
| ~ nf(lam(lam(X0))) ),
inference(resolution,[status(thm)],[d3,c38]) ).
cnf(d5,plain,
( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,X2)
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,arr(X2,b))
| ~ nf(lam(lam(app(X0,X1,X2)))) ),
inference(resolution,[status(thm)],[d4,c35]) ).
cnf(d6,plain,
( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,X2)
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,arr(X2,arr(X4,b)))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X3,X4)
| ~ nf(lam(lam(app(app(X0,X1,X2),X3,X4)))) ),
inference(resolution,[status(thm)],[d5,c35]) ).
cnf(d7,plain,
( tc(cons(X0,X1),var(suc(X2)),X4)
| X3 != X4
| index(X1,X2) != just(X3) ),
inference(superposition,[status(thm)],[c32,c41]) ).
cnf(d8,plain,
( tc(cons(X4,cons(X0,X1)),var(suc(zero)),X3)
| X2 != X3
| just(X0) != just(X2) ),
inference(superposition,[status(thm)],[c31,d7]) ).
cnf(d9,plain,
( tc(cons(X2,cons(X0,X3)),var(suc(zero)),X1)
| X0 != X1 ),
inference(equality_resolution,[status(thm)],[d8]) ).
cnf(d10,plain,
tc(cons(X0,cons(X1,X2)),var(suc(zero)),X1),
inference(equality_resolution,[status(thm)],[d9]) ).
cnf(d11,plain,
( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,a)
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,a)
| ~ nf(lam(lam(app(app(var(suc(zero)),X0,a),X1,a)))) ),
inference(resolution,[status(thm)],[d10,d6]) ).
cnf(d12,plain,
( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,a)
| ~ nf(lam(lam(app(app(var(suc(zero)),var(zero),a),X0,a)))) ),
inference(resolution,[status(thm)],[d11,d2]) ).
cnf(d13,plain,
( ~ nf(lam(app(app(var(suc(zero)),var(zero),a),X0,a)))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,a) ),
inference(resolution,[status(thm)],[d12,c28]) ).
cnf(d14,plain,
~ nf(lam(app(app(var(suc(zero)),var(zero),a),var(zero),a))),
inference(resolution,[status(thm)],[d13,d2]) ).
cnf(d15,plain,
~ nf(app(app(var(suc(zero)),var(zero),a),var(zero),a)),
inference(resolution,[status(thm)],[d14,c28]) ).
cnf(d16,plain,
( ~ nf(var(zero))
| ~ nf(app(var(suc(zero)),var(zero),a))
| app(var(suc(zero)),var(zero),a) = lam(proj1Lam(app(var(suc(zero)),var(zero),a))) ),
inference(resolution,[status(thm)],[d15,c25]) ).
cnf(d17,plain,
( ~ nf(app(var(suc(zero)),var(zero),a))
| app(var(suc(zero)),var(zero),a) = lam(proj1Lam(app(var(suc(zero)),var(zero),a))) ),
inference(resolution,[status(thm)],[c29,d16]) ).
cnf(d18,plain,
~ nf(app(var(suc(zero)),var(zero),a)),
inference(resolution,[status(thm)],[c20,d17]) ).
cnf(d19,plain,
( ~ nf(var(zero))
| ~ nf(var(suc(zero)))
| var(suc(zero)) = lam(proj1Lam(var(suc(zero)))) ),
inference(resolution,[status(thm)],[d18,c25]) ).
cnf(d20,plain,
( ~ nf(var(zero))
| var(suc(zero)) = lam(proj1Lam(var(suc(zero)))) ),
inference(resolution,[status(thm)],[c29,d19]) ).
cnf(d21,plain,
var(suc(zero)) = lam(proj1Lam(var(suc(zero)))),
inference(resolution,[status(thm)],[d20,c29]) ).
cnf(d22,plain,
var(suc(zero)) != var(X0),
inference(superposition,[status(thm)],[d21,c22]) ).
cnf(d23,plain,
$false,
inference(equality_resolution,[status(thm)],[d22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX223+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.38 % Computer : n015.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sat Sep 26 17:02:28 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.72/2.46 % SZS status Theorem for theBenchmark.p
% 15.72/2.46 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------