↑ Up

FindProof---0.1.THM-Prf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(f52,conjecture,
    ( ( leq(pv49,minus(n6,n1))
      & leq(n0,pv49) )
   => ( lt(n0,a_select2(sigma,pv49))
     => true ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0012) ).

fof(f52_neg,negated_conjecture,
    ~ ( ( leq(pv49,minus(n6,n1))
        & leq(n0,pv49) )
     => ( lt(n0,a_select2(sigma,pv49))
       => true ) ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ( ~ true
    & lt(n0,a_select2(sigma,pv49))
    & leq(pv49,minus(n6,n1))
    & leq(n0,pv49) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ( ~ true
    & lt(n0,a_select2(sigma,pv49))
    & leq(pv49,minus(n6,n1))
    & leq(n0,pv49) ),
    inference(skolemisation,[status(esa)],[f52_nnf]) ).

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

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

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(hi252,axiom,
    true = trueq,
    inference(equality_encoding,[status(esa)],[c253]) ).

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

cnf(t542,plain,
    false = trueq,
    inference(orient,[status(thm)],[t1]) ).

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(goal_0,negated_conjecture,
    trueq != false,
    inference(equality_encoding,[status(esa)],[c2,c254,c258]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV119+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/5.38  % Computer : n013.cluster.edu
% 0.09/5.38  % Model    : x86_64 x86_64
% 0.09/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38  % Memory   : 8046.5625MB
% 0.09/5.38  % OS       : Linux 6.8.0-71-generic
% 0.09/5.38  % CPULimit : 300
% 0.09/5.38  % WCLimit  : 300
% 0.09/5.38  % DateTime : Thu Sep 24 18:33:15 UTC 2026
% 0.09/5.38  % CPUTime  : 
% 0.09/5.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.85/6.59  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.85/6.59  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------