↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 14.87s 2.43s
% Output   : Proof 14.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   31 (  26 unt;   0 def)
%            Number of atoms       :   80 (  15 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :   78 (  29   ~;  15   |;  32   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    8 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  11 con; 0-4 aty)
%            Number of variables   :    4 (   0 sgn   3   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f52,conjecture,
    ( ( leq(pv43,minus(n5,n1))
      & leq(pv41,minus(n5,n1))
      & leq(pv10,minus(n135300,n1))
      & leq(n0,pv43)
      & leq(n0,pv41)
      & leq(n0,pv10) )
   => ( leq(pv43,minus(n5,n1))
      & leq(pv41,minus(n5,n1))
      & leq(pv10,minus(n135300,n1))
      & leq(n0,pv43)
      & leq(n0,pv41)
      & leq(n0,pv10) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0003) ).

fof(f52_neg,negated_conjecture,
    ~ ( ( leq(pv43,minus(n5,n1))
        & leq(pv41,minus(n5,n1))
        & leq(pv10,minus(n135300,n1))
        & leq(n0,pv43)
        & leq(n0,pv41)
        & leq(n0,pv10) )
     => ( leq(pv43,minus(n5,n1))
        & leq(pv41,minus(n5,n1))
        & leq(pv10,minus(n135300,n1))
        & leq(n0,pv43)
        & leq(n0,pv41)
        & leq(n0,pv10) ) ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ( ( ~ leq(pv43,minus(n5,n1))
      | ~ leq(pv41,minus(n5,n1))
      | ~ leq(pv10,minus(n135300,n1))
      | ~ leq(n0,pv43)
      | ~ leq(n0,pv41)
      | ~ leq(n0,pv10) )
    & leq(pv43,minus(n5,n1))
    & leq(pv41,minus(n5,n1))
    & leq(pv10,minus(n135300,n1))
    & leq(n0,pv43)
    & leq(n0,pv41)
    & leq(n0,pv10) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ( ( ~ leq(pv43,minus(n5,n1))
      | ~ leq(pv41,minus(n5,n1))
      | ~ leq(pv10,minus(n135300,n1))
      | ~ leq(n0,pv43)
      | ~ leq(n0,pv41)
      | ~ leq(n0,pv10) )
    & leq(pv43,minus(n5,n1))
    & leq(pv41,minus(n5,n1))
    & leq(pv10,minus(n135300,n1))
    & leq(n0,pv43)
    & leq(n0,pv41)
    & leq(n0,pv10) ),
    inference(skolemisation,[status(esa)],[f52_nnf]) ).

cnf(c261,plain,
    ( ~ leq(pv43,minus(n5,n1))
    | ~ leq(pv41,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(n0,pv43)
    | ~ leq(n0,pv41)
    | ~ leq(n0,pv10) ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(hi300,negated_conjecture,
    ifeq(leq(n0,pv10),trueq,ifeq(leq(n0,pv41),trueq,ifeq(leq(n0,pv43),trueq,ifeq(leq(pv10,minus(n135300,n1)),trueq,ifeq(leq(pv41,minus(n5,n1)),trueq,ifeq(leq(pv43,minus(n5,n1)),trueq,false,trueq),trueq),trueq),trueq),trueq),trueq) = trueq,
    inference(equality_encoding,[status(esa)],[c261]) ).

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

cnf(hi253,negated_conjecture,
    leq(n0,pv10) = trueq,
    inference(equality_encoding,[status(esa)],[c255]) ).

cnf(c256,plain,
    leq(n0,pv41),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(hi254,negated_conjecture,
    leq(n0,pv41) = trueq,
    inference(equality_encoding,[status(esa)],[c256]) ).

cnf(c257,plain,
    leq(n0,pv43),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(hi255,negated_conjecture,
    leq(n0,pv43) = trueq,
    inference(equality_encoding,[status(esa)],[c257]) ).

cnf(c258,plain,
    leq(pv10,minus(n135300,n1)),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(hi256,negated_conjecture,
    leq(pv10,minus(n135300,n1)) = trueq,
    inference(equality_encoding,[status(esa)],[c258]) ).

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

cnf(hi257,negated_conjecture,
    leq(pv41,minus(n5,n1)) = trueq,
    inference(equality_encoding,[status(esa)],[c259]) ).

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

cnf(hi258,negated_conjecture,
    leq(pv43,minus(n5,n1)) = trueq,
    inference(equality_encoding,[status(esa)],[c260]) ).

cnf(t0,plain,
    trueq = false,
    inference(hyper_resolution,[status(thm)],[hi300,hi253,hi254,hi255,hi256,hi257,hi258]) ).

cnf(t658,plain,
    false = trueq,
    inference(orient,[status(thm)],[t0]) ).

fof(f2,axiom,
    ! [X] : ~ gt(X,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_gt) ).

fof(f2_nnf,plain,
    ! [X] : ~ gt(X,X),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X] : ~ gt(X,X),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ~ gt(X0,X0),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

fof(f51,axiom,
    def != use,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',defuse) ).

fof(f51_nnf,plain,
    def != use,
    inference(nnf_transformation,[status(thm)],[f51]) ).

fof(f51_sk,plain,
    def != use,
    inference(skolemisation,[status(esa)],[f51_nnf]) ).

cnf(c254,plain,
    def != use,
    inference(cnf_transformation,[status(esa)],[f51_sk]) ).

cnf(goal_0,negated_conjecture,
    trueq != false,
    inference(equality_encoding,[status(esa)],[c2,c254,c261]) ).

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

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

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