↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : KRS179+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n016.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 01:53:25 PM UTC 2026

% Result   : Theorem 6.11s 1.36s
% Output   : Proof 6.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   20 (   5 unt;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   46 (  15   ~;  17   |;  10   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   38 (   0 sgn  18   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [S1,S2] :
      ( ! [Ax,C] :
          ( status(Ax,C,S1)
         => status(Ax,C,S2) )
    <=> isa(S1,S2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',isa) ).

fof(f1_nnf,plain,
    ! [S1,S2] :
      ( ( ~ isa(S1,S2)
        | ! [Ax,C] :
            ( status(Ax,C,S2)
            | ~ status(Ax,C,S1) ) )
      & ( isa(S1,S2)
        | ? [Ax,C] :
            ( ~ status(Ax,C,S2)
            & status(Ax,C,S1) ) ) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [S1,S2,Ax,C] :
      ( ( ~ isa(S1,S2)
        | status(Ax,C,S2)
        | ~ status(Ax,C,S1) )
      & ( isa(S1,S2)
        | ( ~ status(sk2(S1,S2),sk3(S1,S2),S2)
          & status(sk2(S1,S2),sk3(S1,S2),S1) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3])],[f1_nnf]) ).

cnf(c5,plain,
    ( ~ isa(X0,X1)
    | status(X2,X3,X1)
    | ~ status(X2,X3,X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(c3,plain,
    ( isa(X0,X1)
    | status(sk2(X0,X1),sk3(X0,X1),X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p47,plain,
    ( isa(X0,X1)
    | ~ isa(X0,X2)
    | status(sk2(X0,X1),sk3(X0,X1),X2) ),
    inference(resolution,[status(thm)],[c5,c3]) ).

fof(f13,conjecture,
    ! [S1,S2,S3] :
      ( ( isa(S2,S3)
        & isa(S1,S2) )
     => isa(S1,S3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',isa_transitive) ).

fof(f13_neg,negated_conjecture,
    ~ ! [S1,S2,S3] :
        ( ( isa(S2,S3)
          & isa(S1,S2) )
       => isa(S1,S3) ),
    inference(negated_conjecture,[status(cth)],[f13]) ).

fof(f13_nnf,plain,
    ? [S1,S2,S3] :
      ( ~ isa(S1,S3)
      & isa(S2,S3)
      & isa(S1,S2) ),
    inference(nnf_transformation,[status(thm)],[f13_neg]) ).

fof(f13_sk,plain,
    ( ~ isa(sk28,sk30)
    & isa(sk29,sk30)
    & isa(sk28,sk29) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk28,sk29,sk30])],[f13_nnf]) ).

cnf(c39,plain,
    isa(sk28,sk29),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(p220,plain,
    ( isa(sk28,X0)
    | status(sk2(sk28,X0),sk3(sk28,X0),sk29) ),
    inference(resolution,[status(thm)],[p47,c39]) ).

cnf(p603,plain,
    ( ~ isa(sk29,X1)
    | status(sk2(sk28,X0),sk3(sk28,X0),X1)
    | isa(sk28,X0) ),
    inference(resolution,[status(thm)],[p220,c5]) ).

cnf(c40,plain,
    isa(sk29,sk30),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(p1845,plain,
    ( status(sk2(sk28,X0),sk3(sk28,X0),sk30)
    | isa(sk28,X0) ),
    inference(resolution,[status(thm)],[p603,c40]) ).

cnf(c4,plain,
    ( isa(X0,X1)
    | ~ status(sk2(X0,X1),sk3(X0,X1),X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p1847,plain,
    ( isa(sk28,sk30)
    | isa(sk28,sk30) ),
    inference(resolution,[status(thm)],[p1845,c4]) ).

cnf(p1852,plain,
    isa(sk28,sk30),
    inference(factoring,[status(thm)],[p1847]) ).

cnf(c41,plain,
    ~ isa(sk28,sk30),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(p1854,plain,
    $false,
    inference(resolution,[status(thm)],[p1852,c41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS179+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37  % Computer : n016.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.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Wed Sep 23 19:41:27 UTC 2026
% 0.14/0.37  % CPUTime  : 
% 0.14/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.11/1.36  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.11/1.36  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------