↑ Up

PyRes---1.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : SET903+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n025.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 : Thu May  9 17:40:20 EDT 2024

% Result   : Theorem 0.71s 0.87s
% Output   : Refutation 0.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   26 (  10 unt;   0 def)
%            Number of atoms       :  102 ( 101 equ)
%            Maximal formula atoms :   32 (   3 avg)
%            Number of connectives :  117 (  41   ~;  42   |;  34   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   36 (   2 sgn  18   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t44_zfmisc_1,conjecture,
    ! [A,B,C] :
      ~ ( singleton(A) = set_union2(B,C)
        & B != C
        & B != empty_set
        & C != empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t44_zfmisc_1) ).

fof(c3,negated_conjecture,
    ~ ! [A,B,C] :
        ~ ( singleton(A) = set_union2(B,C)
          & B != C
          & B != empty_set
          & C != empty_set ),
    inference(assume_negation,[status(cth)],[t44_zfmisc_1]) ).

fof(c4,negated_conjecture,
    ? [A,B,C] :
      ( singleton(A) = set_union2(B,C)
      & B != C
      & B != empty_set
      & C != empty_set ),
    inference(fof_nnf,[status(thm)],[c3]) ).

fof(c5,negated_conjecture,
    ? [X2,X3,X4] :
      ( singleton(X2) = set_union2(X3,X4)
      & X3 != X4
      & X3 != empty_set
      & X4 != empty_set ),
    inference(variable_rename,[status(thm)],[c4]) ).

fof(c6,negated_conjecture,
    ( singleton(skolem0001) = set_union2(skolem0002,skolem0003)
    & skolem0002 != skolem0003
    & skolem0002 != empty_set
    & skolem0003 != empty_set ),
    inference(skolemize,[status(esa)],[c5]) ).

cnf(c8,negated_conjecture,
    skolem0002 != skolem0003,
    inference(split_conjunct,[status(thm)],[c6]) ).

cnf(symmetry,axiom,
    ( X19 != X18
    | X18 = X19 ),
    theory(equality) ).

cnf(transitivity,axiom,
    ( X25 != X24
    | X24 != X23
    | X25 = X23 ),
    theory(equality) ).

cnf(c9,negated_conjecture,
    skolem0002 != empty_set,
    inference(split_conjunct,[status(thm)],[c6]) ).

cnf(c7,negated_conjecture,
    singleton(skolem0001) = set_union2(skolem0002,skolem0003),
    inference(split_conjunct,[status(thm)],[c6]) ).

fof(t43_zfmisc_1,axiom,
    ! [A,B,C] :
      ~ ( singleton(A) = set_union2(B,C)
        & ~ ( B = singleton(A)
            & C = singleton(A) )
        & ~ ( B = empty_set
            & C = singleton(A) )
        & ~ ( B = singleton(A)
            & C = empty_set ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t43_zfmisc_1) ).

fof(c11,plain,
    ! [A,B,C] :
      ( singleton(A) != set_union2(B,C)
      | ( B = singleton(A)
        & C = singleton(A) )
      | ( B = empty_set
        & C = singleton(A) )
      | ( B = singleton(A)
        & C = empty_set ) ),
    inference(fof_nnf,[status(thm)],[t43_zfmisc_1]) ).

fof(c12,plain,
    ! [X5,X6,X7] :
      ( singleton(X5) != set_union2(X6,X7)
      | ( X6 = singleton(X5)
        & X7 = singleton(X5) )
      | ( X6 = empty_set
        & X7 = singleton(X5) )
      | ( X6 = singleton(X5)
        & X7 = empty_set ) ),
    inference(variable_rename,[status(thm)],[c11]) ).

fof(c13,plain,
    ! [X5,X6,X7] :
      ( ( singleton(X5) != set_union2(X6,X7)
        | X6 = singleton(X5)
        | X6 = empty_set
        | X6 = singleton(X5) )
      & ( singleton(X5) != set_union2(X6,X7)
        | X6 = singleton(X5)
        | X6 = empty_set
        | X7 = empty_set )
      & ( singleton(X5) != set_union2(X6,X7)
        | X6 = singleton(X5)
        | X7 = singleton(X5)
        | X6 = singleton(X5) )
      & ( singleton(X5) != set_union2(X6,X7)
        | X6 = singleton(X5)
        | X7 = singleton(X5)
        | X7 = empty_set )
      & ( singleton(X5) != set_union2(X6,X7)
        | X7 = singleton(X5)
        | X6 = empty_set
        | X6 = singleton(X5) )
      & ( singleton(X5) != set_union2(X6,X7)
        | X7 = singleton(X5)
        | X6 = empty_set
        | X7 = empty_set )
      & ( singleton(X5) != set_union2(X6,X7)
        | X7 = singleton(X5)
        | X7 = singleton(X5)
        | X6 = singleton(X5) )
      & ( singleton(X5) != set_union2(X6,X7)
        | X7 = singleton(X5)
        | X7 = singleton(X5)
        | X7 = empty_set ) ),
    inference(distribute,[status(thm)],[c12]) ).

cnf(c14,plain,
    ( singleton(X53) != set_union2(X55,X54)
    | X55 = singleton(X53)
    | X55 = empty_set
    | X55 = singleton(X53) ),
    inference(split_conjunct,[status(thm)],[c13]) ).

cnf(c87,plain,
    ( skolem0002 = singleton(skolem0001)
    | skolem0002 = empty_set ),
    inference(resolution,[status(thm)],[c14,c7]) ).

cnf(c522,plain,
    skolem0002 = singleton(skolem0001),
    inference(resolution,[status(thm)],[c87,c9]) ).

cnf(c535,plain,
    singleton(skolem0001) = skolem0002,
    inference(resolution,[status(thm)],[c522,symmetry]) ).

cnf(c546,plain,
    ( X181 != singleton(skolem0001)
    | X181 = skolem0002 ),
    inference(resolution,[status(thm)],[c535,transitivity]) ).

cnf(c10,negated_conjecture,
    skolem0003 != empty_set,
    inference(split_conjunct,[status(thm)],[c6]) ).

cnf(c21,plain,
    ( singleton(X113) != set_union2(X115,X114)
    | X114 = singleton(X113)
    | X114 = singleton(X113)
    | X114 = empty_set ),
    inference(split_conjunct,[status(thm)],[c13]) ).

cnf(c213,plain,
    ( skolem0003 = singleton(skolem0001)
    | skolem0003 = empty_set ),
    inference(resolution,[status(thm)],[c21,c7]) ).

cnf(c1155,plain,
    skolem0003 = singleton(skolem0001),
    inference(resolution,[status(thm)],[c213,c10]) ).

cnf(c1172,plain,
    skolem0003 = skolem0002,
    inference(resolution,[status(thm)],[c1155,c546]) ).

cnf(c1187,plain,
    skolem0002 = skolem0003,
    inference(resolution,[status(thm)],[c1172,symmetry]) ).

cnf(c1208,plain,
    $false,
    inference(resolution,[status(thm)],[c1187,c8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET903+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed May  8 18:15:53 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.71/0.87  % Version:  1.5
% 0.71/0.87  % SZS status Theorem
% 0.71/0.87  % SZS output start CNFRefutation
% See solution above
% 0.71/0.87  
% 0.71/0.87  % Initial clauses    : 25
% 0.71/0.87  % Processed clauses  : 115
% 0.71/0.87  % Factors computed   : 2
% 0.71/0.87  % Resolvents computed: 1167
% 0.71/0.87  % Tautologies deleted: 3
% 0.71/0.87  % Forward subsumed   : 137
% 0.71/0.87  % Backward subsumed  : 3
% 0.71/0.87  % -------- CPU Time ---------
% 0.71/0.87  % User time          : 0.511 s
% 0.71/0.87  % System time        : 0.016 s
% 0.71/0.87  % Total time         : 0.527 s
%------------------------------------------------------------------------------