↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n013.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:31:21 PM UTC 2026

% Result   : Theorem 5.97s 1.31s
% Output   : Proof 5.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   5 unt;   0 def)
%            Number of atoms       :   85 (   0 equ)
%            Maximal formula atoms :    9 (   4 avg)
%            Number of connectives :   89 (  24   ~;  20   |;  37   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   49 (   3 sgn  20   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f45,conjecture,
    ! [X105] :
      ( occurrence_of(X105,tptp0)
     => ? [X106,X107] :
          ( ( occurrence_of(X107,tptp2)
           => ~ ? [X109] :
                  ( min_precedes(X106,X109,tptp0)
                  & occurrence_of(X109,tptp1) ) )
          & ( occurrence_of(X107,tptp1)
           => ~ ? [X108] :
                  ( min_precedes(X106,X108,tptp0)
                  & occurrence_of(X108,tptp2) ) )
          & leaf_occ(X107,X105) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f45_neg,negated_conjecture,
    ~ ! [X105] :
        ( occurrence_of(X105,tptp0)
       => ? [X106,X107] :
            ( ( occurrence_of(X107,tptp2)
             => ~ ? [X109] :
                    ( min_precedes(X106,X109,tptp0)
                    & occurrence_of(X109,tptp1) ) )
            & ( occurrence_of(X107,tptp1)
             => ~ ? [X108] :
                    ( min_precedes(X106,X108,tptp0)
                    & occurrence_of(X108,tptp2) ) )
            & leaf_occ(X107,X105) ) ),
    inference(negated_conjecture,[status(cth)],[f45]) ).

fof(f45_nnf,plain,
    ? [X105] :
      ( ! [X106,X107] :
          ( ( ? [X109] :
                ( min_precedes(X106,X109,tptp0)
                & occurrence_of(X109,tptp1) )
            & occurrence_of(X107,tptp2) )
          | ( ? [X108] :
                ( min_precedes(X106,X108,tptp0)
                & occurrence_of(X108,tptp2) )
            & occurrence_of(X107,tptp1) )
          | ~ leaf_occ(X107,X105) )
      & occurrence_of(X105,tptp0) ),
    inference(nnf_transformation,[status(thm)],[f45_neg]) ).

fof(f45_sk,plain,
    ! [X107,X106] :
      ( ( ( min_precedes(X106,sk17(X106,X107),tptp0)
          & occurrence_of(sk17(X106,X107),tptp1)
          & occurrence_of(X107,tptp2) )
        | ( min_precedes(X106,sk16(X106,X107),tptp0)
          & occurrence_of(sk16(X106,X107),tptp2)
          & occurrence_of(X107,tptp1) )
        | ~ leaf_occ(X107,sk15) )
      & occurrence_of(sk15,tptp0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk15,sk16,sk17])],[f45_nnf]) ).

cnf(c79,plain,
    occurrence_of(sk15,tptp0),
    inference(cnf_transformation,[status(esa)],[f45_sk]) ).

fof(f32,axiom,
    ! [X101] :
      ( occurrence_of(X101,tptp0)
     => ? [X102,X103,X104] :
          ( leaf_occ(X104,X101)
          & next_subocc(X103,X104,tptp0)
          & ( occurrence_of(X104,tptp2)
            | occurrence_of(X104,tptp1) )
          & next_subocc(X102,X103,tptp0)
          & occurrence_of(X103,tptp4)
          & root_occ(X102,X101)
          & occurrence_of(X102,tptp3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).

fof(f32_nnf,plain,
    ! [X101] :
      ( ? [X102,X103,X104] :
          ( leaf_occ(X104,X101)
          & next_subocc(X103,X104,tptp0)
          & ( occurrence_of(X104,tptp2)
            | occurrence_of(X104,tptp1) )
          & next_subocc(X102,X103,tptp0)
          & occurrence_of(X103,tptp4)
          & root_occ(X102,X101)
          & occurrence_of(X102,tptp3) )
      | ~ occurrence_of(X101,tptp0) ),
    inference(nnf_transformation,[status(thm)],[f32]) ).

fof(f32_sk,plain,
    ! [X101] :
      ( ( leaf_occ(sk14(X101),X101)
        & next_subocc(sk13(X101),sk14(X101),tptp0)
        & ( occurrence_of(sk14(X101),tptp2)
          | occurrence_of(sk14(X101),tptp1) )
        & next_subocc(sk12(X101),sk13(X101),tptp0)
        & occurrence_of(sk13(X101),tptp4)
        & root_occ(sk12(X101),X101)
        & occurrence_of(sk12(X101),tptp3) )
      | ~ occurrence_of(X101,tptp0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk12,sk13,sk14])],[f32_nnf]) ).

cnf(c66,plain,
    ( leaf_occ(sk14(X0),X0)
    | ~ occurrence_of(X0,tptp0) ),
    inference(cnf_transformation,[status(esa)],[f32_sk]) ).

cnf(p112,plain,
    leaf_occ(sk14(sk15),sk15),
    inference(resolution,[status(thm)],[c79,c66]) ).

fof(f9,axiom,
    ! [X31,X32,X33] :
      ( ( leaf_occ(X32,X31)
        & occurrence_of(X31,X33) )
     => ~ ? [X34] : min_precedes(X32,X34,X33) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_09) ).

fof(f9_nnf,plain,
    ! [X31,X32,X33] :
      ( ! [X34] : ~ min_precedes(X32,X34,X33)
      | ~ leaf_occ(X32,X31)
      | ~ occurrence_of(X31,X33) ),
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ! [X31,X33,X32,X34] :
      ( ~ min_precedes(X32,X34,X33)
      | ~ leaf_occ(X32,X31)
      | ~ occurrence_of(X31,X33) ),
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

cnf(c15,plain,
    ( ~ min_precedes(X1,X3,X2)
    | ~ leaf_occ(X1,X0)
    | ~ occurrence_of(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

cnf(p99,plain,
    ( ~ min_precedes(X0,X1,tptp0)
    | ~ leaf_occ(X0,sk15) ),
    inference(resolution,[status(thm)],[c79,c15]) ).

cnf(p183,plain,
    ~ min_precedes(sk14(sk15),X0,tptp0),
    inference(resolution,[status(thm)],[p112,p99]) ).

cnf(c88,plain,
    ( min_precedes(X1,sk17(X1,X2),tptp0)
    | min_precedes(X1,sk16(X1,X2),tptp0)
    | ~ leaf_occ(X2,sk15) ),
    inference(cnf_transformation,[status(esa)],[f45_sk]) ).

cnf(p182,plain,
    ( min_precedes(X0,sk17(X0,sk14(sk15)),tptp0)
    | min_precedes(X0,sk16(X0,sk14(sk15)),tptp0) ),
    inference(resolution,[status(thm)],[p112,c88]) ).

cnf(p433,plain,
    min_precedes(sk14(sk15),sk16(sk14(sk15),sk14(sk15)),tptp0),
    inference(resolution,[status(thm)],[p183,p182]) ).

cnf(p1201,plain,
    $false,
    inference(resolution,[status(thm)],[p433,p183]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PRO010+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.37  % Computer : n013.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 : Thu Sep 24 06:26:51 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.97/1.31  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.97/1.31  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------