%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : KRS200+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n003.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 07:45:21 AM UTC 2026
% Result : Theorem 89.58s 26.75s
% Output : CNFRefutation 89.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 56 ( 14 unt; 0 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 110 ( 49 ~; 47 |; 2 &)
% ( 8 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 113 ( 23 sgn 25 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(unp,axiom,
! [X0,X1] :
( ( ~ ? [X2] : model(X2,X0)
=> ~ ? [X3] : model(X3,X1) )
<=> status(X0,X1,unp) ) ).
fof(thm,axiom,
! [X0,X1] :
( ! [X2] :
( model(X2,X0)
=> model(X2,X1) )
<=> status(X0,X1,thm) ) ).
fof(cax,axiom,
! [X0,X1] :
( ~ ? [X2] : model(X2,X0)
<=> status(X0,X1,cax) ) ).
fof(uns,axiom,
! [X0,X1] :
( ( ! [X3] : model(X3,not(X1))
& ! [X2] : model(X2,X0) )
<=> status(X0,X1,uns) ) ).
fof(isa,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) )
<=> isa(X0,X1) ) ).
fof(nota,axiom,
! [X0,X1] :
( ? [X2,X3] :
( ~ status(X2,X3,X1)
& status(X2,X3,X0) )
<=> nota(X0,X1) ) ).
fof(nevera,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) )
<=> nevera(X0,X1) ) ).
fof(completeness,axiom,
! [X0,X1] :
~ ( model(X0,X1)
<=> model(X0,not(X1)) ) ).
fof(tautology,axiom,
? [X0] :
! [X1] : model(X1,X0) ).
fof(contradiction,axiom,
? [X0] :
! [X1] : ~ model(X1,X0) ).
fof(nota_unp_thm,conjecture,
nota(unp,thm) ).
fof(negated_conjecture,negated_conjecture,
~ nota(unp,thm),
inference(negate_conjecture,[status(cth)],[nota_unp_thm]) ).
cnf(c0,plain,
( status(X1,X2,unp)
| ~ model(X0,X1) ),
inference(clausification,[status(esa)],[unp]) ).
cnf(c17,plain,
( ~ status(X1,X2,thm)
| model(X0,X2)
| ~ model(X0,X1) ),
inference(clausification,[status(esa)],[thm]) ).
cnf(c64,plain,
( status(X0,X1,cax)
| model(sK86(X0),X0) ),
inference(clausification,[status(esa)],[cax]) ).
cnf(c65,plain,
( ~ status(X1,X2,cax)
| ~ model(X0,X1) ),
inference(clausification,[status(esa)],[cax]) ).
cnf(c79,plain,
( status(X0,X1,uns)
| ~ model(sK115(X1),not(X1))
| ~ model(sK114(X0),X0) ),
inference(clausification,[status(esa)],[uns]) ).
cnf(c80,plain,
( ~ status(X1,X2,uns)
| model(X0,X1) ),
inference(clausification,[status(esa)],[uns]) ).
cnf(c81,plain,
( ~ status(X2,X1,uns)
| model(X0,not(X1)) ),
inference(clausification,[status(esa)],[uns]) ).
cnf(c92,plain,
( isa(X0,X1)
| status(sK133(X0,X1),sK134(X0,X1),X0) ),
inference(clausification,[status(esa)],[isa]) ).
cnf(c93,plain,
( isa(X0,X1)
| ~ status(sK133(X0,X1),sK134(X0,X1),X1) ),
inference(clausification,[status(esa)],[isa]) ).
cnf(c94,plain,
( ~ isa(X2,X3)
| status(X0,X1,X3)
| ~ status(X0,X1,X2) ),
inference(clausification,[status(esa)],[isa]) ).
cnf(c95,plain,
( nota(X2,X3)
| status(X0,X1,X3)
| ~ status(X0,X1,X2) ),
inference(clausification,[status(esa)],[nota]) ).
cnf(c98,plain,
( nevera(X0,X1)
| status(sK145(X0,X1),sK146(X0,X1),X0) ),
inference(clausification,[status(esa)],[nevera]) ).
cnf(c99,plain,
( nevera(X0,X1)
| status(sK145(X0,X1),sK146(X0,X1),X1) ),
inference(clausification,[status(esa)],[nevera]) ).
cnf(c100,plain,
( ~ nevera(X2,X3)
| ~ status(X0,X1,X3)
| ~ status(X0,X1,X2) ),
inference(clausification,[status(esa)],[nevera]) ).
cnf(c108,plain,
( model(X0,not(X1))
| model(X0,X1) ),
inference(clausification,[status(esa)],[completeness]) ).
cnf(c109,plain,
( ~ model(X0,X1)
| ~ model(X0,not(X1)) ),
inference(clausification,[status(esa)],[completeness]) ).
cnf(c113,plain,
model(X0,sK159),
inference(clausification,[status(esa)],[tautology]) ).
cnf(c116,plain,
~ model(X0,sK164),
inference(clausification,[status(esa)],[contradiction]) ).
cnf(c128,plain,
~ nota(unp,thm),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( nevera(X0,X1)
| ~ nevera(X1,X2)
| ~ status(sK145(X0,X1),sK146(X0,X1),X2) ),
inference(resolution,[status(thm)],[c100,c99]) ).
cnf(d1,plain,
( nevera(X1,X0)
| nevera(X1,X0)
| ~ nevera(X0,X1) ),
inference(resolution,[status(thm)],[d0,c98]) ).
cnf(d2,plain,
( model(X1,not(sK146(X0,uns)))
| nevera(X0,uns) ),
inference(resolution,[status(thm)],[c99,c81]) ).
cnf(d3,plain,
( ~ model(X1,sK146(X0,uns))
| nevera(X0,uns) ),
inference(resolution,[status(thm)],[d2,c109]) ).
cnf(d4,plain,
( model(X1,sK145(X0,uns))
| nevera(X0,uns) ),
inference(resolution,[status(thm)],[c99,c80]) ).
cnf(d5,plain,
( ~ model(X1,sK145(thm,X0))
| model(X1,sK146(thm,X0))
| nevera(thm,X0) ),
inference(resolution,[status(thm)],[c98,c17]) ).
cnf(d6,plain,
( nevera(thm,uns)
| nevera(thm,uns)
| model(X0,sK146(thm,uns)) ),
inference(resolution,[status(thm)],[d5,d4]) ).
cnf(d7,plain,
( nevera(thm,uns)
| nevera(thm,uns) ),
inference(resolution,[status(thm)],[d6,d3]) ).
cnf(d8,plain,
nevera(uns,thm),
inference(resolution,[status(thm)],[d7,d1]) ).
cnf(d9,plain,
( ~ model(X1,X0)
| model(sK86(X0),X0) ),
inference(resolution,[status(thm)],[c64,c65]) ).
cnf(d10,plain,
( ~ model(sK86(not(X1)),X1)
| ~ model(X0,not(X1)) ),
inference(resolution,[status(thm)],[d9,c109]) ).
cnf(d11,plain,
( model(sK86(not(not(X1))),X1)
| ~ model(X0,not(not(X1))) ),
inference(resolution,[status(thm)],[d10,c108]) ).
cnf(d12,plain,
~ model(X0,not(not(sK164))),
inference(resolution,[status(thm)],[d11,c116]) ).
cnf(d13,plain,
model(X0,not(sK164)),
inference(resolution,[status(thm)],[d12,c108]) ).
cnf(d14,plain,
( status(X0,sK164,uns)
| ~ model(sK114(X0),X0) ),
inference(resolution,[status(thm)],[d13,c79]) ).
cnf(d15,plain,
status(sK159,sK164,uns),
inference(resolution,[status(thm)],[d14,c113]) ).
cnf(d16,plain,
( ~ nevera(uns,X0)
| ~ status(sK159,sK164,X0) ),
inference(resolution,[status(thm)],[d15,c100]) ).
cnf(d17,plain,
( ~ model(X3,X0)
| ~ isa(unp,X2)
| status(X0,X1,X2) ),
inference(resolution,[status(thm)],[c94,c0]) ).
cnf(d18,plain,
( ~ nevera(uns,X1)
| ~ isa(unp,X1)
| ~ model(X0,sK159) ),
inference(resolution,[status(thm)],[d17,d16]) ).
cnf(d19,plain,
( ~ nevera(uns,X0)
| ~ isa(unp,X0) ),
inference(resolution,[status(thm)],[c113,d18]) ).
cnf(d20,plain,
~ isa(unp,thm),
inference(resolution,[status(thm)],[d19,d8]) ).
cnf(d21,plain,
( isa(X0,X1)
| nota(X0,X2)
| status(sK133(X0,X1),sK134(X0,X1),X2) ),
inference(resolution,[status(thm)],[c95,c92]) ).
cnf(d22,plain,
( isa(X0,X1)
| nota(X0,X1)
| isa(X0,X1) ),
inference(resolution,[status(thm)],[d21,c93]) ).
cnf(d23,plain,
isa(unp,thm),
inference(resolution,[status(thm)],[d22,c128]) ).
cnf(d24,plain,
$false,
inference(resolution,[status(thm)],[d23,d20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KRS200+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.07 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.42 % Computer : n003.cluster.edu
% 0.18/0.42 % Model : x86_64 x86_64
% 0.18/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.42 % Memory : 8046.5625MB
% 0.18/0.42 % OS : Linux 6.8.0-71-generic
% 0.18/0.42 % CPULimit : 300
% 0.18/0.42 % WCLimit : 300
% 0.18/0.42 % DateTime : Fri Sep 25 19:46:22 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 89.58/26.75 % SZS status Theorem for theBenchmark.p
% 89.58/26.75 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------