↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 54.37s 7.36s
% Output   : Proof 54.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   9 unt;   0 def)
%            Number of atoms       :   47 (   4 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   44 (  19   ~;  12   |;   9   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   28 (   0 sgn  20   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
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]) ).

fof(f52,conjecture,
    ! [A] :
      ( ( leq(A,tptp_minus_1)
        & leq(n0,A) )
     => uninit = init ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0001) ).

fof(f52_neg,negated_conjecture,
    ~ ! [A] :
        ( ( leq(A,tptp_minus_1)
          & leq(n0,A) )
       => uninit = init ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ? [A] :
      ( uninit != init
      & leq(A,tptp_minus_1)
      & leq(n0,A) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ( uninit != init
    & leq(sk27,tptp_minus_1)
    & leq(n0,sk27) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk27])],[f52_nnf]) ).

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

cnf(p297,plain,
    ( leq(n0,X0)
    | ~ leq(sk27,X0) ),
    inference(resolution,[status(thm)],[c4,c255]) ).

cnf(c256,plain,
    leq(sk27,tptp_minus_1),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p9723,plain,
    leq(n0,tptp_minus_1),
    inference(resolution,[status(thm)],[p297,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(p9727,plain,
    gt(n0,n0),
    inference(resolution,[status(thm)],[p9723,c15]) ).

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(p9861,plain,
    $false,
    inference(resolution,[status(thm)],[p9727,c2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV165+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n006.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 : Thu Sep 24 18:39:40 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 54.37/7.36  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 54.37/7.36  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------