↑ Up

FindProof---0.1.THM-Prf.s

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

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

% Result   : Theorem 39.20s 5.79s
% Output   : Proof 39.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   47 (  13 unt;   0 def)
%            Number of atoms       :  203 (  12 equ)
%            Maximal formula atoms :   27 (   4 avg)
%            Number of connectives :  214 (  58   ~;  66   |;  60   &)
%                                         (   2 <=>;  28  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-1 aty)
%            Number of variables   :   56 (   0 sgn  39   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f62,axiom,
    gt(n1,n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_1_0) ).

fof(f62_nnf,plain,
    gt(n1,n0),
    inference(nnf_transformation,[status(thm)],[f62]) ).

cnf(c279,plain,
    gt(n1,n0),
    inference(cnf_transformation,[status(esa)],[f62_nnf]) ).

fof(f9,axiom,
    ! [X,Y] :
      ( leq(X,pred(Y))
    <=> gt(Y,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_gt_pred) ).

fof(f9_nnf,plain,
    ! [X,Y] :
      ( ( ~ gt(Y,X)
        | leq(X,pred(Y)) )
      & ( gt(Y,X)
        | ~ leq(X,pred(Y)) ) ),
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ! [X,Y] :
      ( ( ~ gt(Y,X)
        | leq(X,pred(Y)) )
      & ( gt(Y,X)
        | ~ leq(X,pred(Y)) ) ),
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

cnf(c12,plain,
    ( ~ gt(X1,X0)
    | leq(X0,pred(X1)) ),
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

fof(f52,conjecture,
    ( ( ( gt(loopcounter,n0)
       => leq(s_worst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(s_sworst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(s_best7,n3) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_worst7) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_sworst7) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_best7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_worst7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_sworst7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_best7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_worst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_sworst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_best7) )
      & leq(n1,loopcounter)
      & leq(tptp_float_0_001,pv1341) )
   => leq(n0,s_sworst7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0010) ).

fof(f52_neg,negated_conjecture,
    ~ ( ( ( gt(loopcounter,n0)
         => leq(s_worst7,n3) )
        & ( gt(loopcounter,n0)
         => leq(s_sworst7,n3) )
        & ( gt(loopcounter,n0)
         => leq(s_best7,n3) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_worst7) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_sworst7) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_best7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_worst7,n3) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_sworst7,n3) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_best7,n3) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_worst7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_sworst7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_best7) )
        & leq(n1,loopcounter)
        & leq(tptp_float_0_001,pv1341) )
     => leq(n0,s_sworst7) ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ( ~ leq(n0,s_sworst7)
    & ( leq(s_worst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_sworst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_best7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_worst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_sworst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_best7)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_worst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_sworst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_best7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_worst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_sworst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_best7)
      | leq(tptp_float_0_001,pv1341) )
    & leq(n1,loopcounter)
    & leq(tptp_float_0_001,pv1341) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ( ~ leq(n0,s_sworst7)
    & ( leq(s_worst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_sworst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_best7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_worst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_sworst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_best7)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_worst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_sworst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_best7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_worst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_sworst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_best7)
      | leq(tptp_float_0_001,pv1341) )
    & leq(n1,loopcounter)
    & leq(tptp_float_0_001,pv1341) ),
    inference(skolemisation,[status(esa)],[f52_nnf]) ).

cnf(c264,plain,
    ( leq(n0,s_sworst7)
    | ~ gt(loopcounter,n0) ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

fof(f0,axiom,
    ! [X,Y] :
      ( X = Y
      | gt(Y,X)
      | gt(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality) ).

fof(f0_nnf,plain,
    ! [X,Y] :
      ( X = Y
      | gt(Y,X)
      | gt(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X,Y] :
      ( X = Y
      | gt(Y,X)
      | gt(X,Y) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( X0 = X1
    | gt(X1,X0)
    | gt(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p308,plain,
    ( loopcounter = n0
    | gt(n0,loopcounter)
    | leq(n0,s_sworst7) ),
    inference(resolution,[status(thm)],[c264,c0]) ).

cnf(c269,plain,
    ~ leq(n0,s_sworst7),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p323,plain,
    ( loopcounter = n0
    | gt(n0,loopcounter) ),
    inference(resolution,[status(thm)],[p308,c269]) ).

cnf(p364,plain,
    ( loopcounter = n0
    | leq(loopcounter,pred(n0)) ),
    inference(resolution,[status(thm)],[c12,p323]) ).

fof(f4,axiom,
    ! [X,Y,Z] :
      ( ( leq(Y,Z)
        & leq(X,Y) )
     => leq(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_leq) ).

fof(f4_nnf,plain,
    ! [X,Y,Z] :
      ( leq(X,Z)
      | ~ leq(Y,Z)
      | ~ leq(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [X,Y,Z] :
      ( leq(X,Z)
      | ~ leq(Y,Z)
      | ~ leq(X,Y) ),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    ( leq(X0,X2)
    | ~ leq(X1,X2)
    | ~ leq(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

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

cnf(p307,plain,
    ( leq(n1,X0)
    | ~ leq(loopcounter,X0) ),
    inference(resolution,[status(thm)],[c4,c256]) ).

cnf(p369,plain,
    ( leq(n1,pred(n0))
    | loopcounter = n0 ),
    inference(resolution,[status(thm)],[p364,p307]) ).

cnf(c11,plain,
    ( gt(X1,X0)
    | ~ leq(X0,pred(X1)) ),
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

cnf(p389,plain,
    ( gt(n0,n1)
    | loopcounter = n0 ),
    inference(resolution,[status(thm)],[p369,c11]) ).

fof(f1,axiom,
    ! [X,Y,Z] :
      ( ( gt(Y,Z)
        & gt(X,Y) )
     => gt(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_gt) ).

fof(f1_nnf,plain,
    ! [X,Y,Z] :
      ( gt(X,Z)
      | ~ gt(Y,Z)
      | ~ gt(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X,Y,Z] :
      ( gt(X,Z)
      | ~ gt(Y,Z)
      | ~ gt(X,Y) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( gt(X0,X2)
    | ~ gt(X1,X2)
    | ~ gt(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p390,plain,
    ( gt(n0,X0)
    | ~ gt(n1,X0)
    | loopcounter = n0 ),
    inference(resolution,[status(thm)],[p389,c1]) ).

cnf(p6142,plain,
    ( gt(n0,n0)
    | loopcounter = n0 ),
    inference(resolution,[status(thm)],[c279,p390]) ).

fof(f2,axiom,
    ! [X] : ~ gt(X,X),
    file('/export/starexec/sandbox/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]) ).

cnf(p7700,plain,
    loopcounter = n0,
    inference(resolution,[status(thm)],[p6142,c2]) ).

cnf(p7701,plain,
    leq(n1,n0),
    inference(demodulation,[status(thm)],[p7700,c256]) ).

fof(f12,axiom,
    ! [X,Y] :
      ( leq(X,Y)
    <=> gt(succ(Y),X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).

fof(f12_nnf,plain,
    ! [X,Y] :
      ( ( ~ gt(succ(Y),X)
        | leq(X,Y) )
      & ( gt(succ(Y),X)
        | ~ leq(X,Y) ) ),
    inference(nnf_transformation,[status(thm)],[f12]) ).

fof(f12_sk,plain,
    ! [X,Y] :
      ( ( ~ gt(succ(Y),X)
        | leq(X,Y) )
      & ( gt(succ(Y),X)
        | ~ leq(X,Y) ) ),
    inference(skolemisation,[status(esa)],[f12_nnf]) ).

cnf(c15,plain,
    ( gt(succ(X1),X0)
    | ~ leq(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f12_sk]) ).

cnf(p10126,plain,
    gt(n1,n1),
    inference(resolution,[status(thm)],[p7701,c15]) ).

cnf(p10271,plain,
    $false,
    inference(resolution,[status(thm)],[p10126,c2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV140+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.37  % Computer : n017.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Thu Sep 24 18:31:16 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 39.20/5.79  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 39.20/5.79  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------