↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 4.10s 0.96s
% Output   : Proof 4.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   29 (  25 unt;   0 def)
%            Number of atoms       :   33 (  14 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   23 (  19   ~;   0   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-4 aty)
%            Number of variables   :   16 (   2 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f52,conjecture,
    ( ~ leq(tptp_float_0_001,tptp_float_0_001)
   => leq(s_worst7,n3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0020) ).

fof(f52_neg,negated_conjecture,
    ~ ( ~ leq(tptp_float_0_001,tptp_float_0_001)
     => leq(s_worst7,n3) ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ( ~ leq(s_worst7,n3)
    & ~ leq(tptp_float_0_001,tptp_float_0_001) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ( ~ leq(s_worst7,n3)
    & ~ leq(tptp_float_0_001,tptp_float_0_001) ),
    inference(skolemisation,[status(esa)],[f52_nnf]) ).

cnf(c255,plain,
    ~ leq(tptp_float_0_001,tptp_float_0_001),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(t48,plain,
    ifeq(leq(tptp_float_0_001,tptp_float_0_001),trueq,false,trueq) = trueq,
    inference(equality_encoding,[status(esa)],[c255]) ).

fof(f3,axiom,
    ! [X] : leq(X,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_leq) ).

fof(f3_nnf,plain,
    ! [X] : leq(X,X),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [X] : leq(X,X),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    leq(X0,X0),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(t26,plain,
    leq(X1,X1) = trueq,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(t96,plain,
    leq(X1,X1) = trueq,
    inference(orient,[status(thm)],[t26]) ).

cnf(t265,plain,
    ifeq(trueq,trueq,false,trueq) = trueq,
    inference(step,[status(thm)],[t48,t96]) ).

cnf(t38,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t70,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t38]) ).

cnf(t266,plain,
    false = trueq,
    inference(step,[status(thm)],[t265,t70]) ).

cnf(t261,plain,
    false = trueq,
    inference(orient,[status(thm)],[t266]) ).

fof(f2,axiom,
    ! [X] : ~ gt(X,X),
    file('/export/starexec/sandbox2/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/sandbox2/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(c256,plain,
    ~ leq(s_worst7,n3),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV150+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n004.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:37:35 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.10/0.96  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.10/0.96  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------