↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN359+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:29 PM UTC 2026

% Result   : Theorem 2.99s 0.89s
% Output   : Proof 2.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (  12 unt;   0 def)
%            Number of atoms       :   46 (  10 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   42 (  15   ~;   9   |;  12   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 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   :   33 (   4 sgn  13   !;  10   ?)

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

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

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

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

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

cnf(hi1,negated_conjecture,
    ifeq(big_r(X0),true,big_q(X0,sk1(X0)),true) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

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

cnf(hi0,negated_conjecture,
    big_r(sk0) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(h0,plain,
    big_q(sk0,sk1(sk0)) = true,
    inference(hyper_resolution,[status(thm)],[hi1,hi0]) ).

cnf(c2,plain,
    ( big_q(X0,X0)
    | ~ big_q(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi2,negated_conjecture,
    ifeq(big_q(X0,X1),true,big_q(X0,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(h1,plain,
    big_q(sk0,sk0) = true,
    inference(hyper_resolution,[status(thm)],[hi2,h0]) ).

cnf(c3,plain,
    ( ~ big_r(X1)
    | ~ big_q(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi3,negated_conjecture,
    ifeq(big_q(X0,X1),true,ifeq(big_r(X1),true,false,true),true) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi3,h1,hi0]) ).

cnf(t20,plain,
    false = true,
    inference(orient,[status(thm)],[t0]) ).

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

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

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

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