↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : PHI010+1 : TPTP v9.3.1. Released v7.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n010.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 02:30:17 PM UTC 2026

% Result   : Theorem 4.34s 1.09s
% Output   : Proof 4.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   27 (  10 unt;   0 def)
%            Number of atoms       :  123 (  28 equ)
%            Maximal formula atoms :   19 (   4 avg)
%            Number of connectives :  153 (  57   ~;  52   |;  36   &)
%                                         (   1 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-4 aty)
%            Number of variables   :   42 (   0 sgn  20   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [F,X,W] :
      ( ( object(W)
        & object(X)
        & property(F) )
     => ( ( X = W
          & is_the(X,F) )
      <=> ? [Y] :
            ( Y = W
            & ! [Z] :
                ( object(Z)
               => ( exemplifies_property(F,Z)
                 => Z = Y ) )
            & exemplifies_property(F,Y)
            & object(Y) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_axiom_identity_instance) ).

fof(f3_nnf,plain,
    ! [F,X,W] :
      ( ( ( ! [Y] :
              ( Y != W
              | ? [Z] :
                  ( Z != Y
                  & exemplifies_property(F,Z)
                  & object(Z) )
              | ~ exemplifies_property(F,Y)
              | ~ object(Y) )
          | ( X = W
            & is_the(X,F) ) )
        & ( ? [Y] :
              ( Y = W
              & ! [Z] :
                  ( Z = Y
                  | ~ exemplifies_property(F,Z)
                  | ~ object(Z) )
              & exemplifies_property(F,Y)
              & object(Y) )
          | X != W
          | ~ is_the(X,F) ) )
      | ~ object(W)
      | ~ object(X)
      | ~ property(F) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [F,X,W,Z,Y] :
      ( ( ( Y != W
          | ( sk1(F,X,W,Y) != Y
            & exemplifies_property(F,sk1(F,X,W,Y))
            & object(sk1(F,X,W,Y)) )
          | ~ exemplifies_property(F,Y)
          | ~ object(Y)
          | ( X = W
            & is_the(X,F) ) )
        & ( ( sk0(F,X,W) = W
            & ( Z = sk0(F,X,W)
              | ~ exemplifies_property(F,Z)
              | ~ object(Z) )
            & exemplifies_property(F,sk0(F,X,W))
            & object(sk0(F,X,W)) )
          | X != W
          | ~ is_the(X,F) ) )
      | ~ object(W)
      | ~ object(X)
      | ~ property(F) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f3_nnf]) ).

cnf(c8,plain,
    ( sk0(X0,X1,X2) = X2
    | X1 != X2
    | ~ is_the(X1,X0)
    | ~ object(X2)
    | ~ object(X1)
    | ~ property(X0) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p53,plain,
    ( sk0(X0,X1,X1) = X1
    | ~ is_the(X1,X0)
    | ~ object(X1)
    | ~ object(X1)
    | ~ property(X0) ),
    inference(equality_resolution,[status(thm)],[c8]) ).

cnf(p111,plain,
    ( sk0(X0,X1,X1) = X1
    | ~ is_the(X1,X0)
    | ~ object(X1)
    | ~ property(X0) ),
    inference(factoring,[status(thm)],[p53]) ).

fof(f4,conjecture,
    ! [X,F,Y] :
      ( ( object(Y)
        & property(F)
        & object(X) )
     => ( ( X = Y
          & is_the(X,F) )
       => exemplifies_property(F,Y) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_1) ).

fof(f4_neg,negated_conjecture,
    ~ ! [X,F,Y] :
        ( ( object(Y)
          & property(F)
          & object(X) )
       => ( ( X = Y
            & is_the(X,F) )
         => exemplifies_property(F,Y) ) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f4_nnf,plain,
    ? [X,F,Y] :
      ( ~ exemplifies_property(F,Y)
      & X = Y
      & is_the(X,F)
      & object(Y)
      & property(F)
      & object(X) ),
    inference(nnf_transformation,[status(thm)],[f4_neg]) ).

fof(f4_sk,plain,
    ( ~ exemplifies_property(sk3,sk4)
    & sk2 = sk4
    & is_the(sk2,sk3)
    & object(sk4)
    & property(sk3)
    & object(sk2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3,sk4])],[f4_nnf]) ).

cnf(c16,plain,
    property(sk3),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(p112,plain,
    ( sk0(sk3,X0,X0) = X0
    | ~ is_the(X0,sk3)
    | ~ object(X0) ),
    inference(resolution,[status(thm)],[p111,c16]) ).

cnf(c15,plain,
    object(sk2),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(p113,plain,
    ( sk0(sk3,sk2,sk2) = sk2
    | ~ is_the(sk2,sk3) ),
    inference(resolution,[status(thm)],[p112,c15]) ).

cnf(c18,plain,
    is_the(sk2,sk3),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(p119,plain,
    sk0(sk3,sk2,sk2) = sk2,
    inference(resolution,[status(thm)],[p113,c18]) ).

cnf(c6,plain,
    ( exemplifies_property(X0,sk0(X0,X1,X2))
    | X1 != X2
    | ~ is_the(X1,X0)
    | ~ object(X2)
    | ~ object(X1)
    | ~ property(X0) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p33,plain,
    ( exemplifies_property(X0,sk0(X0,X1,X1))
    | ~ is_the(X1,X0)
    | ~ object(X1)
    | ~ object(X1)
    | ~ property(X0) ),
    inference(equality_resolution,[status(thm)],[c6]) ).

cnf(p89,plain,
    ( exemplifies_property(X0,sk0(X0,X1,X1))
    | ~ is_the(X1,X0)
    | ~ object(X1)
    | ~ property(X0) ),
    inference(factoring,[status(thm)],[p33]) ).

cnf(p90,plain,
    ( exemplifies_property(sk3,sk0(sk3,X0,X0))
    | ~ is_the(X0,sk3)
    | ~ object(X0) ),
    inference(resolution,[status(thm)],[p89,c16]) ).

cnf(p94,plain,
    ( exemplifies_property(sk3,sk0(sk3,sk2,sk2))
    | ~ is_the(sk2,sk3) ),
    inference(resolution,[status(thm)],[p90,c15]) ).

cnf(p100,plain,
    exemplifies_property(sk3,sk0(sk3,sk2,sk2)),
    inference(resolution,[status(thm)],[p94,c18]) ).

cnf(p124,plain,
    exemplifies_property(sk3,sk2),
    inference(demodulation,[status(thm)],[p119,p100]) ).

cnf(c19,plain,
    sk2 = sk4,
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(c20,plain,
    ~ exemplifies_property(sk3,sk4),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(p23,plain,
    ~ exemplifies_property(sk3,sk2),
    inference(superposition,[status(thm)],[c19,c20]) ).

cnf(p130,plain,
    $false,
    inference(resolution,[status(thm)],[p124,p23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PHI010+1 : TPTP v9.3.1. Released v7.2.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.36  % Computer : n010.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Thu Sep 24 06:06:12 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 0.08/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.34/1.09  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.34/1.09  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------