↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n026.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:50 PM UTC 2026

% Result   : Theorem 21.55s 3.56s
% Output   : Proof 21.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   8 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   54 (  23   ~;  18   |;  11   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   21 (   0 sgn  13   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [X,T0,T] :
      ( dissimilar(X,T0,T)
    <=> ( ~ ( is_aligned(X,T0)
          <=> is_aligned(X,T) )
        & organization(X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_2) ).

fof(f6_nnf,plain,
    ! [X,T0,T] :
      ( ( ( ( ~ is_aligned(X,T)
            | is_aligned(X,T0) )
          & ( is_aligned(X,T)
            | ~ is_aligned(X,T0) ) )
        | ~ organization(X)
        | dissimilar(X,T0,T) )
      & ( ( ( ( is_aligned(X,T)
              & ~ is_aligned(X,T0) )
            | ( ~ is_aligned(X,T)
              & is_aligned(X,T0) ) )
          & organization(X) )
        | ~ dissimilar(X,T0,T) ) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [X,T0,T] :
      ( ( ( ( ~ is_aligned(X,T)
            | is_aligned(X,T0) )
          & ( is_aligned(X,T)
            | ~ is_aligned(X,T0) ) )
        | ~ organization(X)
        | dissimilar(X,T0,T) )
      & ( ( ( ( is_aligned(X,T)
              & ~ is_aligned(X,T0) )
            | ( ~ is_aligned(X,T)
              & is_aligned(X,T0) ) )
          & organization(X) )
        | ~ dissimilar(X,T0,T) ) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c14,plain,
    ( ~ is_aligned(X0,X1)
    | ~ is_aligned(X0,X2)
    | ~ dissimilar(X0,X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

fof(f7,conjecture,
    ! [X,T] : ~ dissimilar(X,T,T),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background_assumption_1) ).

fof(f7_neg,negated_conjecture,
    ~ ! [X,T] : ~ dissimilar(X,T,T),
    inference(negated_conjecture,[status(cth)],[f7]) ).

fof(f7_nnf,plain,
    ? [X,T] : dissimilar(X,T,T),
    inference(nnf_transformation,[status(thm)],[f7_neg]) ).

fof(f7_sk,plain,
    dissimilar(sk0,sk1,sk1),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f7_nnf]) ).

cnf(c18,plain,
    dissimilar(sk0,sk1,sk1),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(p41,plain,
    ( ~ is_aligned(sk0,sk1)
    | ~ is_aligned(sk0,sk1) ),
    inference(resolution,[status(thm)],[c14,c18]) ).

cnf(p42,plain,
    ~ is_aligned(sk0,sk1),
    inference(factoring,[status(thm)],[p41]) ).

cnf(c13,plain,
    ( is_aligned(X0,X2)
    | is_aligned(X0,X1)
    | ~ dissimilar(X0,X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(p35,plain,
    ( is_aligned(sk0,sk1)
    | is_aligned(sk0,sk1) ),
    inference(resolution,[status(thm)],[c13,c18]) ).

cnf(p36,plain,
    is_aligned(sk0,sk1),
    inference(factoring,[status(thm)],[p35]) ).

cnf(p43,plain,
    $false,
    inference(resolution,[status(thm)],[p42,p36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT052+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n026.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 01:16:25 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 21.55/3.56  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.55/3.56  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------