↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : KRS216+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n020.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:22 AM UTC 2026

% Result   : Theorem 32.84s 8.56s
% Output   : CNFRefutation 32.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   44 (  14 unt;   0 def)
%            Number of atoms       :   84 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   78 (  38   ~;  30   |;   3   &)
%                                         (   6 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :   80 (  19 sgn  17   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
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(mighta,axiom,
    ! [X0,X1] :
      ( ? [X2,X3] :
          ( status(X2,X3,X1)
          & status(X2,X3,X0) )
    <=> mighta(X0,X1) ) ).

fof(nota,axiom,
    ! [X0,X1] :
      ( ? [X2,X3] :
          ( ~ status(X2,X3,X1)
          & status(X2,X3,X0) )
    <=> nota(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_uns_thm,conjecture,
    nota(uns,thm) ).

fof(negated_conjecture,negated_conjecture,
    ~ nota(uns,thm),
    inference(negate_conjecture,[status(cth)],[nota_uns_thm]) ).

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(c89,plain,
    ( mighta(X2,X3)
    | ~ status(X0,X1,X3)
    | ~ status(X0,X1,X2) ),
    inference(clausification,[status(esa)],[mighta]) ).

cnf(c90,plain,
    ( ~ mighta(X0,X1)
    | status(sK129(X0,X1),sK130(X0,X1),X0) ),
    inference(clausification,[status(esa)],[mighta]) ).

cnf(c91,plain,
    ( ~ mighta(X0,X1)
    | status(sK129(X0,X1),sK130(X0,X1),X1) ),
    inference(clausification,[status(esa)],[mighta]) ).

cnf(c95,plain,
    ( nota(X2,X3)
    | status(X0,X1,X3)
    | ~ status(X0,X1,X2) ),
    inference(clausification,[status(esa)],[nota]) ).

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(uns,thm),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( model(X1,not(sK130(X0,uns)))
    | ~ mighta(X0,uns) ),
    inference(resolution,[status(thm)],[c91,c81]) ).

cnf(d1,plain,
    ( ~ model(X1,sK130(X0,uns))
    | ~ mighta(X0,uns) ),
    inference(resolution,[status(thm)],[d0,c109]) ).

cnf(d2,plain,
    ( model(X1,sK129(X0,uns))
    | ~ mighta(X0,uns) ),
    inference(resolution,[status(thm)],[c91,c80]) ).

cnf(d3,plain,
    ( ~ model(X1,sK129(thm,X0))
    | model(X1,sK130(thm,X0))
    | ~ mighta(thm,X0) ),
    inference(resolution,[status(thm)],[c90,c17]) ).

cnf(d4,plain,
    ( ~ mighta(thm,uns)
    | ~ mighta(thm,uns)
    | model(X0,sK130(thm,uns)) ),
    inference(resolution,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    ( ~ model(X1,X0)
    | model(sK86(X0),X0) ),
    inference(resolution,[status(thm)],[c64,c65]) ).

cnf(d6,plain,
    ( ~ model(sK86(not(X1)),X1)
    | ~ model(X0,not(X1)) ),
    inference(resolution,[status(thm)],[d5,c109]) ).

cnf(d7,plain,
    ( model(sK86(not(not(X1))),X1)
    | ~ model(X0,not(not(X1))) ),
    inference(resolution,[status(thm)],[d6,c108]) ).

cnf(d8,plain,
    ~ model(X0,not(not(sK164))),
    inference(resolution,[status(thm)],[d7,c116]) ).

cnf(d9,plain,
    model(X0,not(sK164)),
    inference(resolution,[status(thm)],[d8,c108]) ).

cnf(d10,plain,
    ( status(X0,sK164,uns)
    | ~ model(sK114(X0),X0) ),
    inference(resolution,[status(thm)],[d9,c79]) ).

cnf(d11,plain,
    status(sK159,sK164,uns),
    inference(resolution,[status(thm)],[d10,c113]) ).

cnf(d12,plain,
    ( mighta(X0,uns)
    | ~ status(sK159,sK164,X0) ),
    inference(resolution,[status(thm)],[d11,c89]) ).

cnf(d13,plain,
    ( nota(uns,X0)
    | status(sK159,sK164,X0) ),
    inference(resolution,[status(thm)],[d11,c95]) ).

cnf(d14,plain,
    ( mighta(X0,uns)
    | nota(uns,X0) ),
    inference(resolution,[status(thm)],[d13,d12]) ).

cnf(d15,plain,
    mighta(thm,uns),
    inference(resolution,[status(thm)],[d14,c128]) ).

cnf(d16,plain,
    model(X0,sK130(thm,uns)),
    inference(resolution,[status(thm)],[d15,d4]) ).

cnf(d17,plain,
    ~ mighta(thm,uns),
    inference(resolution,[status(thm)],[d16,d1]) ).

cnf(d18,plain,
    $false,
    inference(resolution,[status(thm)],[d15,d17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : KRS216+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  % Computer : n020.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Fri Sep 25 19:46:49 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 32.84/8.56  % SZS status Theorem for theBenchmark.p
% 32.84/8.56  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------