↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SET108+1 : TPTP v9.0.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Jul 25 03:31:34 PM UTC 2025

% Result   : Theorem 0.12s 0.35s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   1 unt;   0 def)
%            Number of atoms       :   41 (  24 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   51 (  21   ~;  18   |;  12   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn   2   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(existence_of_first_and_second,plain,
    ! [X] :
    ? [U,V] :
      ( ( member(U,universal_class)
        & member(V,universal_class)
        & X = ordered_pair(U,V) )
      | ( ~ ? [Y,Z] :
              ( member(Y,universal_class)
              & member(Z,universal_class)
              & X = ordered_pair(Y,Z) )
        & U = X
        & V = X ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_first_and_second) ).

fof(existence_of_first_and_second_negated,plain,
    ~ ! [X] :
      ? [U,V] :
        ( ( member(U,universal_class)
          & member(V,universal_class)
          & X = ordered_pair(U,V) )
        | ( ~ ? [Y,Z] :
                ( member(Y,universal_class)
                & member(Z,universal_class)
                & X = ordered_pair(Y,Z) )
          & U = X
          & V = X ) ),
    inference(negate_conjecture,[status(cth)],[existence_of_first_and_second]) ).

cnf(89,plain,
    ( ~ member(X0,universal_class)
    | ~ member(X1,universal_class)
    | sK10 != ordered_pair(X0,X1) ),
    inference(cnf,[status(esa)],[existence_of_first_and_second_negated]) ).

cnf(l0,plain,
    ( ~ member(sK11(sK10,sK10),universal_class)
    | ~ member(sK12(sK10,sK10),universal_class)
    | sK10 != ordered_pair(sK11(sK10,sK10),sK12(sK10,sK10)) ),
    inference(instantiation,[status(thm)],[89]) ).

cnf(92,plain,
    ( X0 != sK10
    | X1 != sK10
    | sK10 = ordered_pair(sK11(X0,X1),sK12(X0,X1)) ),
    inference(cnf,[status(esa)],[existence_of_first_and_second_negated]) ).

cnf(l3,plain,
    ( sK10 != sK10
    | sK10 != sK10
    | sK10 = ordered_pair(sK11(sK10,sK10),sK12(sK10,sK10)) ),
    inference(instantiation,[status(thm)],[92]) ).

cnf(90,plain,
    ( X0 != sK10
    | X1 != sK10
    | member(sK11(X0,X1),universal_class) ),
    inference(cnf,[status(esa)],[existence_of_first_and_second_negated]) ).

cnf(l2,plain,
    ( sK10 != sK10
    | sK10 != sK10
    | member(sK11(sK10,sK10),universal_class) ),
    inference(instantiation,[status(thm)],[90]) ).

cnf(91,plain,
    ( X0 != sK10
    | X1 != sK10
    | member(sK12(X0,X1),universal_class) ),
    inference(cnf,[status(esa)],[existence_of_first_and_second_negated]) ).

cnf(l1,plain,
    ( sK10 != sK10
    | sK10 != sK10
    | member(sK12(sK10,sK10),universal_class) ),
    inference(instantiation,[status(thm)],[91]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l3,l2,l1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SET108+1 : TPTP v9.0.0. Bugfixed v5.4.0.
% 0.06/0.12  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.33  % Computer : n026.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Mon Jul 21 19:57:34 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % launching worker at depth: 5
% 0.12/0.34  % launching worker at depth: 1
% 0.12/0.34  % launching worker at depth: 4
% 0.12/0.34  % launching worker at depth: 3
% 0.12/0.34  % launching worker at depth: 2
% 0.12/0.34  % launching worker at depth: 6
% 0.12/0.34  % launching worker at depth: 7
% 0.12/0.34  % launching worker at depth: 8
% 0.12/0.34  % launching worker at depth: 9
% 0.12/0.35  % SZS status Theorem for theBenchmark
% 0.12/0.35  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------