↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n002.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 03:34:30 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ( ( ? [Z] :
        ! [X] :
          ( big_p(X)
         => ~ big_r(Z,X) )
      & ! [Y] :
        ? [W] : big_r(Y,W) )
   => ? [X] : ~ big_p(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2113) ).

fof(f0_neg,negated_conjecture,
    ~ ( ( ? [Z] :
          ! [X] :
            ( big_p(X)
           => ~ big_r(Z,X) )
        & ! [Y] :
          ? [W] : big_r(Y,W) )
     => ? [X] : ~ big_p(X) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ( ! [X] : big_p(X)
    & ? [Z] :
      ! [X] :
        ( ~ big_r(Z,X)
        | ~ big_p(X) )
    & ! [Y] :
      ? [W] : big_r(Y,W) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

fof(f0_sk,plain,
    ! [Y,X] :
      ( big_p(X)
      & ( ~ big_r(sk1,X)
        | ~ big_p(X) )
      & big_r(Y,sk0(Y)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).

cnf(c1,plain,
    ( ~ big_r(sk1,X3)
    | ~ big_p(X3) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t3,plain,
    ifeq(big_p(X1),true,ifeq(big_r(sk1,X1),true,false,true),true) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(t5,plain,
    ifeq(big_p(X1),true,ifeq(big_r(sk1,X1),true,false,true),true) = true,
    inference(orient,[status(thm)],[t3]) ).

cnf(c2,plain,
    big_p(X3),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t0,plain,
    big_p(X1) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(t6,plain,
    big_p(X1) = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(t13,plain,
    ifeq(true,true,ifeq(big_r(sk1,X1),true,false,true),true) = true,
    inference(step,[status(thm)],[t5,t6]) ).

cnf(t2,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t4,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t2]) ).

cnf(t14,plain,
    ifeq(big_r(sk1,X1),true,false,true) = true,
    inference(step,[status(thm)],[t13,t4]) ).

cnf(t7,plain,
    ifeq(big_r(sk1,X1),true,false,true) = true,
    inference(rw,[status(thm)],[t14]) ).

cnf(t9,plain,
    ifeq(big_r(sk1,X1),true,false,true) = true,
    inference(orient,[status(thm)],[t7]) ).

cnf(c0,plain,
    big_r(X0,sk0(X0)),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t1,plain,
    big_r(X1,sk0(X1)) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t8,plain,
    big_r(X1,sk0(X1)) = true,
    inference(orient,[status(thm)],[t1]) ).

cnf(t10,plain,
    true = ifeq(true,true,false,true),
    inference(cp,[status(thm)],[t9,t8]) ).

cnf(t15,plain,
    true = false,
    inference(step,[status(thm)],[t10,t4]) ).

cnf(t11,plain,
    false = true,
    inference(orient,[status(thm)],[t15]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t11]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN362+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n002.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Fri Sep 25 01:01:51 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.94/1.23  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.94/1.23  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------