↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : MGT045+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n008.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:11:48 PM UTC 2026

% Result   : Theorem 6.61s 16.55s
% Output   : Proof 6.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   31 (  15 unt;   0 def)
%            Number of atoms       :   65 (  17 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   61 (  27   ~;  17   |;  11   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-4 aty)
%            Number of variables   :   47 (   0 sgn  30   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [X,T0,T] :
      ( ( greater(age(X,T),age(X,T0))
        & organization(X) )
     => greater(external_ties(X,T),external_ties(X,T0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_8) ).

fof(f7_nnf,plain,
    ! [X,T0,T] :
      ( greater(external_ties(X,T),external_ties(X,T0))
      | ~ greater(age(X,T),age(X,T0))
      | ~ organization(X) ),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [X,T,T0] :
      ( greater(external_ties(X,T),external_ties(X,T0))
      | ~ greater(age(X,T),age(X,T0))
      | ~ organization(X) ),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c13,plain,
    ( greater(external_ties(X0,X2),external_ties(X0,X1))
    | ~ greater(age(X0,X2),age(X0,X1))
    | ~ organization(X0) ),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(hi12,axiom,
    ifeq(organization(X0),true,ifeq(greater(age(X0,X1),age(X0,X2)),true,greater(external_ties(X0,X1),external_ties(X0,X2)),true),true) = true,
    inference(equality_encoding,[status(esa)],[c13]) ).

fof(f8,conjecture,
    ! [X,T0,T] :
      ( ( greater(age(X,T),age(X,T0))
        & organization(X) )
     => greater(position(X,T),position(X,T0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_4) ).

fof(f8_neg,negated_conjecture,
    ~ ! [X,T0,T] :
        ( ( greater(age(X,T),age(X,T0))
          & organization(X) )
       => greater(position(X,T),position(X,T0)) ),
    inference(negated_conjecture,[status(cth)],[f8]) ).

fof(f8_nnf,plain,
    ? [X,T0,T] :
      ( ~ greater(position(X,T),position(X,T0))
      & greater(age(X,T),age(X,T0))
      & organization(X) ),
    inference(nnf_transformation,[status(thm)],[f8_neg]) ).

fof(f8_sk,plain,
    ( ~ greater(position(sk0,sk2),position(sk0,sk1))
    & greater(age(sk0,sk2),age(sk0,sk1))
    & organization(sk0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2])],[f8_nnf]) ).

cnf(c14,plain,
    organization(sk0),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(hi13,negated_conjecture,
    organization(sk0) = true,
    inference(equality_encoding,[status(esa)],[c14]) ).

cnf(c15,plain,
    greater(age(sk0,sk2),age(sk0,sk1)),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(hi14,negated_conjecture,
    greater(age(sk0,sk2),age(sk0,sk1)) = true,
    inference(equality_encoding,[status(esa)],[c15]) ).

cnf(h432,plain,
    greater(external_ties(sk0,sk2),external_ties(sk0,sk1)) = true,
    inference(hyper_resolution,[status(thm)],[hi12,hi13,hi14]) ).

fof(f6,axiom,
    ! [X,T0,T] :
      ( organization(X)
     => ( ( external_ties(X,T) = external_ties(X,T0)
         => position(X,T) = position(X,T0) )
        & ( greater(external_ties(X,T),external_ties(X,T0))
         => greater(position(X,T),position(X,T0)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_6) ).

fof(f6_nnf,plain,
    ! [X,T0,T] :
      ( ( ( position(X,T) = position(X,T0)
          | external_ties(X,T) != external_ties(X,T0) )
        & ( greater(position(X,T),position(X,T0))
          | ~ greater(external_ties(X,T),external_ties(X,T0)) ) )
      | ~ organization(X) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [X,T,T0] :
      ( ( ( position(X,T) = position(X,T0)
          | external_ties(X,T) != external_ties(X,T0) )
        & ( greater(position(X,T),position(X,T0))
          | ~ greater(external_ties(X,T),external_ties(X,T0)) ) )
      | ~ organization(X) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c11,plain,
    ( greater(position(X0,X2),position(X0,X1))
    | ~ greater(external_ties(X0,X2),external_ties(X0,X1))
    | ~ organization(X0) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(hi10,axiom,
    ifeq(organization(X0),true,ifeq(greater(external_ties(X0,X1),external_ties(X0,X2)),true,greater(position(X0,X1),position(X0,X2)),true),true) = true,
    inference(equality_encoding,[status(esa)],[c11]) ).

cnf(h763,plain,
    greater(position(sk0,sk2),position(sk0,sk1)) = true,
    inference(hyper_resolution,[status(thm)],[hi10,hi13,h432]) ).

cnf(c16,plain,
    ~ greater(position(sk0,sk2),position(sk0,sk1)),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(hi16,negated_conjecture,
    ifeq(greater(position(sk0,sk2),position(sk0,sk1)),true,false,true) = true,
    inference(equality_encoding,[status(esa)],[c16]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi16,h763]) ).

cnf(t260,plain,
    false = true,
    inference(orient,[status(thm)],[t0]) ).

fof(f3,axiom,
    ! [X,Y] :
      ~ ( greater(Y,X)
        & greater(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',meaning_postulate_greater_strict) ).

fof(f3_nnf,plain,
    ! [X,Y] :
      ( ~ greater(Y,X)
      | ~ greater(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [X,Y] :
      ( ~ greater(Y,X)
      | ~ greater(X,Y) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c8,plain,
    ( ~ greater(X1,X0)
    | ~ greater(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c8,c16]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT045+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/15.60  % Computer : n008.cluster.edu
% 0.10/15.60  % Model    : x86_64 x86_64
% 0.10/15.60  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.60  % Memory   : 8046.5625MB
% 0.10/15.60  % OS       : Linux 6.8.0-71-generic
% 0.10/15.60  % CPULimit : 300
% 0.10/15.60  % WCLimit  : 300
% 0.10/15.60  % DateTime : Thu Sep 24 01:12:11 UTC 2026
% 0.10/15.60  % CPUTime  : 
% 0.10/15.60  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.61/16.55  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.61/16.55  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------