↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n004.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:12:11 PM UTC 2026

% Result   : Theorem 26.76s 3.86s
% Output   : Proof 26.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   7 unt;   0 def)
%            Number of atoms       :   57 (   8 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   72 (  30   ~;  18   |;  18   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f52,conjecture,
    ( ( leq(pv31,minus(n5,n1))
      & leq(n0,pv31) )
   => ( ( n0 = pv40
       => true )
      & ( n0 != pv40
       => ( leq(pv31,minus(n5,n1))
          & leq(n0,pv31) ) )
      & leq(pv31,minus(n5,n1))
      & leq(n0,pv31) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0018) ).

fof(f52_neg,negated_conjecture,
    ~ ( ( leq(pv31,minus(n5,n1))
        & leq(n0,pv31) )
     => ( ( n0 = pv40
         => true )
        & ( n0 != pv40
         => ( leq(pv31,minus(n5,n1))
            & leq(n0,pv31) ) )
        & leq(pv31,minus(n5,n1))
        & leq(n0,pv31) ) ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ( ( ( ~ true
        & n0 = pv40 )
      | ( ( ~ leq(pv31,minus(n5,n1))
          | ~ leq(n0,pv31) )
        & n0 != pv40 )
      | ~ leq(pv31,minus(n5,n1))
      | ~ leq(n0,pv31) )
    & leq(pv31,minus(n5,n1))
    & leq(n0,pv31) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ( ( ( ~ true
        & n0 = pv40 )
      | ( ( ~ leq(pv31,minus(n5,n1))
          | ~ leq(n0,pv31) )
        & n0 != pv40 )
      | ~ leq(pv31,minus(n5,n1))
      | ~ leq(n0,pv31) )
    & leq(pv31,minus(n5,n1))
    & leq(n0,pv31) ),
    inference(skolemisation,[status(esa)],[f52_nnf]) ).

cnf(c260,plain,
    ( ~ true
    | ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv31)
    | ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv31) ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p296,plain,
    ( ~ true
    | ~ leq(n0,pv31)
    | ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv31) ),
    inference(factoring,[status(thm)],[c260]) ).

cnf(p297,plain,
    ( ~ true
    | ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv31) ),
    inference(factoring,[status(thm)],[p296]) ).

cnf(c255,plain,
    leq(n0,pv31),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p298,plain,
    ( ~ true
    | ~ leq(pv31,minus(n5,n1)) ),
    inference(resolution,[status(thm)],[p297,c255]) ).

cnf(c256,plain,
    leq(pv31,minus(n5,n1)),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p299,plain,
    ~ true,
    inference(resolution,[status(thm)],[p298,c256]) ).

fof(f50,axiom,
    true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ttrue) ).

fof(f50_nnf,plain,
    true,
    inference(nnf_transformation,[status(thm)],[f50]) ).

cnf(c253,plain,
    true,
    inference(cnf_transformation,[status(esa)],[f50_nnf]) ).

cnf(p300,plain,
    $false,
    inference(resolution,[status(thm)],[p299,c253]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV077+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n004.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Thu Sep 24 18:27:06 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 26.76/3.86  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 26.76/3.86  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------