↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWV059+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 : n015.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 6.89s 1.41s
% Output   : Proof 6.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (  18 unt;   0 def)
%            Number of atoms       :   42 (  10 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   41 (  23   ~;   4   |;   8   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-4 aty)
%            Number of variables   :    4 (   0 sgn   3   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f52,conjecture,
    ( geq(pv72,tptp_float_0_001)
   => ( ( gt(plus(n1,loopcounter),n1)
       => true )
      & ( ~ gt(plus(n1,loopcounter),n1)
       => true ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0049) ).

fof(f52_neg,negated_conjecture,
    ~ ( geq(pv72,tptp_float_0_001)
     => ( ( gt(plus(n1,loopcounter),n1)
         => true )
        & ( ~ gt(plus(n1,loopcounter),n1)
         => true ) ) ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ( ( ( ~ true
        & gt(plus(n1,loopcounter),n1) )
      | ( ~ true
        & ~ gt(plus(n1,loopcounter),n1) ) )
    & geq(pv72,tptp_float_0_001) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ( ( ( ~ true
        & gt(plus(n1,loopcounter),n1) )
      | ( ~ true
        & ~ gt(plus(n1,loopcounter),n1) ) )
    & geq(pv72,tptp_float_0_001) ),
    inference(skolemisation,[status(esa)],[f52_nnf]) ).

cnf(c259,plain,
    ( ~ true
    | ~ true ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(hi290,negated_conjecture,
    ifeq(true,trueq,ifeq(true,trueq,false,trueq),trueq) = trueq,
    inference(equality_encoding,[status(esa)],[c259]) ).

fof(f50,axiom,
    true,
    file('/export/starexec/sandbox/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(hi252,axiom,
    true = trueq,
    inference(equality_encoding,[status(esa)],[c253]) ).

cnf(t0,plain,
    trueq = false,
    inference(hyper_resolution,[status(thm)],[hi290,hi252,hi252]) ).

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

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]) ).

fof(f51,axiom,
    def != use,
    file('/export/starexec/sandbox/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(c257,plain,
    ( ~ true
    | ~ gt(plus(n1,loopcounter),n1) ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

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

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

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

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