↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : NUM843+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

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

% Result   : Theorem 62.25s 9.34s
% Output   : Proof 62.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (  13 unt;   0 def)
%            Number of atoms       :   49 (  13 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   42 (  17   ~;  20   |;   4   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   21 (   0 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f24,axiom,
    ! [Vd203,Vd204] :
      ( less(Vd203,Vd204)
      | greater(Vd203,Vd204)
      | Vd203 = Vd204 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qtd24) ).

fof(f24_nnf,plain,
    ! [Vd203,Vd204] :
      ( less(Vd203,Vd204)
      | greater(Vd203,Vd204)
      | Vd203 = Vd204 ),
    inference(nnf_transformation,[status(thm)],[f24]) ).

fof(f24_sk,plain,
    ! [Vd203,Vd204] :
      ( less(Vd203,Vd204)
      | greater(Vd203,Vd204)
      | Vd203 = Vd204 ),
    inference(skolemisation,[status(esa)],[f24_nnf]) ).

cnf(c30,plain,
    ( less(X0,X1)
    | greater(X0,X1)
    | X0 = X1 ),
    inference(cnf_transformation,[status(esa)],[f24_sk]) ).

fof(f20,axiom,
    ! [Vd249,Vd250] :
      ( leq(Vd250,Vd249)
    <=> ( Vd250 = Vd249
        | less(Vd250,Vd249) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qtd20) ).

fof(f20_nnf,plain,
    ! [Vd249,Vd250] :
      ( ( ( Vd250 != Vd249
          & ~ less(Vd250,Vd249) )
        | leq(Vd250,Vd249) )
      & ( Vd250 = Vd249
        | less(Vd250,Vd249)
        | ~ leq(Vd250,Vd249) ) ),
    inference(nnf_transformation,[status(thm)],[f20]) ).

fof(f20_sk,plain,
    ! [Vd250,Vd249] :
      ( ( ( Vd250 != Vd249
          & ~ less(Vd250,Vd249) )
        | leq(Vd250,Vd249) )
      & ( Vd250 = Vd249
        | less(Vd250,Vd249)
        | ~ leq(Vd250,Vd249) ) ),
    inference(skolemisation,[status(esa)],[f20_nnf]) ).

cnf(c23,plain,
    ( ~ less(X1,X0)
    | leq(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f20_sk]) ).

cnf(p212,plain,
    ( leq(X0,X1)
    | greater(X0,X1)
    | X0 = X1 ),
    inference(resolution,[status(thm)],[c30,c23]) ).

fof(f1,axiom,
    ~ leq(vd390,vd391),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qtd1) ).

fof(f1_nnf,plain,
    ~ leq(vd390,vd391),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ~ leq(vd390,vd391),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ~ leq(vd390,vd391),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p4575,plain,
    ( greater(vd390,vd391)
    | vd390 = vd391 ),
    inference(resolution,[status(thm)],[p212,c1]) ).

fof(f0,conjecture,
    greater(vd390,vd391),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qtd0) ).

fof(f0_neg,negated_conjecture,
    ~ greater(vd390,vd391),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ~ greater(vd390,vd391),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

fof(f0_sk,plain,
    ~ greater(vd390,vd391),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ~ greater(vd390,vd391),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p4587,plain,
    vd390 = vd391,
    inference(resolution,[status(thm)],[p4575,c0]) ).

cnf(p4588,plain,
    ~ leq(vd390,vd390),
    inference(superposition,[status(thm)],[p4587,c1]) ).

cnf(c24,plain,
    ( X1 != X0
    | leq(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f20_sk]) ).

cnf(p82,plain,
    leq(X0,X0),
    inference(equality_resolution,[status(thm)],[c24]) ).

cnf(p4597,plain,
    $false,
    inference(resolution,[status(thm)],[p4588,p82]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : NUM843+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.02  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.04/0.31  % Computer : n012.cluster.edu
% 0.04/0.31  % Model    : x86_64 x86_64
% 0.04/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31  % Memory   : 8046.5625MB
% 0.04/0.31  % OS       : Linux 6.8.0-71-generic
% 0.04/0.31  % CPULimit : 300
% 0.04/0.31  % WCLimit  : 300
% 0.04/0.31  % DateTime : Thu Sep 24 05:33:09 UTC 2026
% 0.04/0.31  % CPUTime  : 
% 0.04/0.31  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 62.25/9.34  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 62.25/9.34  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------