↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SET020+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:09 PM UTC 2025

% Result   : Theorem 5.24s 1.02s
% Output   : CNFRefutation 5.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   19 (  10 unt;   0 def)
%            Number of atoms       :   40 (  19 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   34 (  13   ~;  10   |;   8   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   12 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(unique_1st_and_2nd_in_pair_of_sets1,plain,
    ! [U,V,X] :
      ( ( member(U,universal_class)
        & member(V,universal_class)
        & X = ordered_pair(U,V) )
     => ( first(X) = U
        & second(X) = V ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unique_1st_and_2nd_in_pair_of_sets1) ).

fof(unique_1st_and_2nd_in_pair_of_sets1_negated,plain,
    ~ ! [U,V,X] :
        ( ( member(U,universal_class)
          & member(V,universal_class)
          & X = ordered_pair(U,V) )
       => ( first(X) = U
          & second(X) = V ) ),
    inference(negate_conjecture,[status(cth)],[unique_1st_and_2nd_in_pair_of_sets1]) ).

cnf(92,plain,
    ( first(sK12) != sK10
    | second(sK12) != sK11 ),
    inference(cnf,[status(esa)],[unique_1st_and_2nd_in_pair_of_sets1_negated]) ).

cnf(l0,plain,
    ( first(sK12) != sK10
    | second(sK12) != sK11 ),
    inference(instantiation,[status(thm)],[92]) ).

fof(first_second,plain,
    ! [X,Y] :
      ( ( member(X,universal_class)
        & member(Y,universal_class) )
     => ( first(ordered_pair(X,Y)) = X
        & second(ordered_pair(X,Y)) = Y ) ),
    file('Axioms/SET005+0.ax',first_second) ).

cnf(18,plain,
    ( ~ member(X0,universal_class)
    | ~ member(X1,universal_class)
    | second(ordered_pair(X0,X1)) = X1 ),
    inference(cnf,[status(esa)],[first_second]) ).

cnf(l29,plain,
    ( ~ member(sK10,universal_class)
    | ~ member(sK11,universal_class)
    | second(ordered_pair(sK10,sK11)) = sK11 ),
    inference(instantiation,[status(thm)],[18]) ).

cnf(91,plain,
    sK12 = ordered_pair(sK10,sK11),
    inference(cnf,[status(esa)],[unique_1st_and_2nd_in_pair_of_sets1_negated]) ).

cnf(l27,plain,
    sK12 = ordered_pair(sK10,sK11),
    inference(instantiation,[status(thm)],[91]) ).

cnf(90,plain,
    member(sK11,universal_class),
    inference(cnf,[status(esa)],[unique_1st_and_2nd_in_pair_of_sets1_negated]) ).

cnf(l31,plain,
    member(sK11,universal_class),
    inference(instantiation,[status(thm)],[90]) ).

cnf(89,plain,
    member(sK10,universal_class),
    inference(cnf,[status(esa)],[unique_1st_and_2nd_in_pair_of_sets1_negated]) ).

cnf(l30,plain,
    member(sK10,universal_class),
    inference(instantiation,[status(thm)],[89]) ).

cnf(l12,plain,
    sK12 = ordered_pair(sK10,sK11),
    inference(instantiation,[status(thm)],[91]) ).

cnf(17,plain,
    ( ~ member(X0,universal_class)
    | ~ member(X1,universal_class)
    | first(ordered_pair(X0,X1)) = X0 ),
    inference(cnf,[status(esa)],[first_second]) ).

cnf(l2,plain,
    ( ~ member(sK10,universal_class)
    | ~ member(sK11,universal_class)
    | first(ordered_pair(sK10,sK11)) = sK10 ),
    inference(instantiation,[status(thm)],[17]) ).

cnf(l6,plain,
    member(sK10,universal_class),
    inference(instantiation,[status(thm)],[89]) ).

cnf(l9,plain,
    member(sK11,universal_class),
    inference(instantiation,[status(thm)],[90]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l29,l27,l31,l30,l12,l2,l6,l9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SET020+1 : TPTP v9.0.0. Bugfixed v5.4.0.
% 0.07/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:20:04 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % launching worker at depth: 2
% 0.12/0.34  % launching worker at depth: 4
% 0.12/0.34  % launching worker at depth: 1
% 0.12/0.34  % launching worker at depth: 5
% 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: 3
% 0.12/0.34  % launching worker at depth: 8
% 0.12/0.34  % launching worker at depth: 9
% 0.12/0.38  % launching worker at depth: 10
% 5.24/1.02  % SZS status Theorem for theBenchmark
% 5.24/1.02  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------