↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 28.68s 4.13s
% Output   : Proof 28.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (  14 unt;   0 def)
%            Number of atoms       :   77 (  35 equ)
%            Maximal formula atoms :   11 (   3 avg)
%            Number of connectives :   89 (  35   ~;  22   |;  26   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :   22 (  22 usr;  14 con; 0-3 aty)
%            Number of variables   :    4 (   0 sgn   3   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f38,axiom,
    ! [X] : minus(X,n1) = pred(X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).

fof(f38_nnf,plain,
    ! [X] : minus(X,n1) = pred(X),
    inference(nnf_transformation,[status(thm)],[f38]) ).

fof(f38_sk,plain,
    ! [X] : minus(X,n1) = pred(X),
    inference(skolemisation,[status(esa)],[f38_nnf]) ).

cnf(c234,plain,
    minus(X0,n1) = pred(X0),
    inference(cnf_transformation,[status(esa)],[f38_sk]) ).

fof(f52,conjecture,
    ( ( leq(pv35,minus(n5,n1))
      & leq(n0,pv35)
      & pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
      & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
   => ( ( n0 = pv44
       => true )
      & ( n0 != pv44
       => ( leq(pv35,minus(n5,n1))
          & leq(n0,pv35)
          & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          & n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0010) ).

fof(f52_neg,negated_conjecture,
    ~ ( ( leq(pv35,minus(n5,n1))
        & leq(n0,pv35)
        & pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
        & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
     => ( ( n0 = pv44
         => true )
        & ( n0 != pv44
         => ( leq(pv35,minus(n5,n1))
            & leq(n0,pv35)
            & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
            & n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ( ( ( ~ true
        & n0 = pv44 )
      | ( ( ~ leq(pv35,minus(n5,n1))
          | ~ leq(n0,pv35)
          | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          | n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) )
        & n0 != pv44 ) )
    & leq(pv35,minus(n5,n1))
    & leq(n0,pv35)
    & pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ( ( ( ~ true
        & n0 = pv44 )
      | ( ( ~ leq(pv35,minus(n5,n1))
          | ~ leq(n0,pv35)
          | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          | n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) )
        & n0 != pv44 ) )
    & leq(pv35,minus(n5,n1))
    & leq(n0,pv35)
    & pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ),
    inference(skolemisation,[status(esa)],[f52_nnf]) ).

cnf(c262,plain,
    ( ~ true
    | ~ leq(pv35,minus(n5,n1))
    | ~ leq(n0,pv35)
    | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    | n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p312,plain,
    ( ~ true
    | ~ leq(pv35,pred(n5))
    | ~ leq(n0,pv35)
    | pv78 != sum(n0,pred(n135300),a_select3(q,pv79,pv35))
    | n0 != n0 ),
    inference(superposition,[status(thm)],[c234,c262]) ).

cnf(p314,plain,
    ( ~ true
    | ~ leq(pv35,pred(n5))
    | ~ leq(n0,pv35)
    | pv78 != sum(n0,pred(n135300),a_select3(q,pv79,pv35)) ),
    inference(equality_resolution,[status(thm)],[p312]) ).

cnf(c255,plain,
    pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p309,plain,
    pv78 = sum(n0,pred(n135300),a_select3(q,pv79,pv35)),
    inference(superposition,[status(thm)],[c234,c255]) ).

cnf(p315,plain,
    ( ~ true
    | ~ leq(pv35,pred(n5))
    | ~ leq(n0,pv35) ),
    inference(resolution,[status(thm)],[p314,p309]) ).

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

cnf(p316,plain,
    ( ~ true
    | ~ leq(pv35,pred(n5)) ),
    inference(resolution,[status(thm)],[p315,c257]) ).

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

cnf(p310,plain,
    leq(pv35,pred(n5)),
    inference(superposition,[status(thm)],[c234,c258]) ).

cnf(p317,plain,
    ~ true,
    inference(resolution,[status(thm)],[p316,p310]) ).

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(p318,plain,
    $false,
    inference(resolution,[status(thm)],[p317,c253]) ).

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