↑ Up

PyRes---1.5.THM-Ref.s

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

% Computer : n015.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:48:00 EDT 2024

% Result   : Theorem 0.22s 0.54s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   4 unt;   0 def)
%            Number of atoms       :   76 (   0 equ)
%            Maximal formula atoms :   15 (   5 avg)
%            Number of connectives :   96 (  34   ~;  32   |;  22   &)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   30 (   3 sgn  12   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(church_46_18_2,conjecture,
    ! [X] :
    ? [Y1,Y2] :
    ! [Z] :
      ( ( big_f(X,Z)
      <=> big_f(Z,X) )
     => ( big_f(X,Z)
      <=> ( big_f(Y2,Z)
          & ( big_f(Y1,Z)
           => big_f(Y1,Y2) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_18_2) ).

fof(c0,negated_conjecture,
    ~ ! [X] :
      ? [Y1,Y2] :
      ! [Z] :
        ( ( big_f(X,Z)
        <=> big_f(Z,X) )
       => ( big_f(X,Z)
        <=> ( big_f(Y2,Z)
            & ( big_f(Y1,Z)
             => big_f(Y1,Y2) ) ) ) ),
    inference(assume_negation,[status(cth)],[church_46_18_2]) ).

fof(c1,negated_conjecture,
    ? [X] :
    ! [Y1,Y2] :
    ? [Z] :
      ( ( ~ big_f(X,Z)
        | big_f(Z,X) )
      & ( ~ big_f(Z,X)
        | big_f(X,Z) )
      & ( ~ big_f(X,Z)
        | ~ big_f(Y2,Z)
        | ( big_f(Y1,Z)
          & ~ big_f(Y1,Y2) ) )
      & ( big_f(X,Z)
        | ( big_f(Y2,Z)
          & ( ~ big_f(Y1,Z)
            | big_f(Y1,Y2) ) ) ) ),
    inference(fof_nnf,[status(thm)],[c0]) ).

fof(c2,negated_conjecture,
    ? [X2] :
    ! [X3,X4] :
    ? [X5] :
      ( ( ~ big_f(X2,X5)
        | big_f(X5,X2) )
      & ( ~ big_f(X5,X2)
        | big_f(X2,X5) )
      & ( ~ big_f(X2,X5)
        | ~ big_f(X4,X5)
        | ( big_f(X3,X5)
          & ~ big_f(X3,X4) ) )
      & ( big_f(X2,X5)
        | ( big_f(X4,X5)
          & ( ~ big_f(X3,X5)
            | big_f(X3,X4) ) ) ) ),
    inference(variable_rename,[status(thm)],[c1]) ).

fof(c3,negated_conjecture,
    ! [X3,X4] :
      ( ( ~ big_f(skolem0001,skolem0002(X3,X4))
        | big_f(skolem0002(X3,X4),skolem0001) )
      & ( ~ big_f(skolem0002(X3,X4),skolem0001)
        | big_f(skolem0001,skolem0002(X3,X4)) )
      & ( ~ big_f(skolem0001,skolem0002(X3,X4))
        | ~ big_f(X4,skolem0002(X3,X4))
        | ( big_f(X3,skolem0002(X3,X4))
          & ~ big_f(X3,X4) ) )
      & ( big_f(skolem0001,skolem0002(X3,X4))
        | ( big_f(X4,skolem0002(X3,X4))
          & ( ~ big_f(X3,skolem0002(X3,X4))
            | big_f(X3,X4) ) ) ) ),
    inference(skolemize,[status(esa)],[c2]) ).

fof(c4,negated_conjecture,
    ! [X3,X4] :
      ( ( ~ big_f(skolem0001,skolem0002(X3,X4))
        | big_f(skolem0002(X3,X4),skolem0001) )
      & ( ~ big_f(skolem0002(X3,X4),skolem0001)
        | big_f(skolem0001,skolem0002(X3,X4)) )
      & ( ~ big_f(skolem0001,skolem0002(X3,X4))
        | ~ big_f(X4,skolem0002(X3,X4))
        | big_f(X3,skolem0002(X3,X4)) )
      & ( ~ big_f(skolem0001,skolem0002(X3,X4))
        | ~ big_f(X4,skolem0002(X3,X4))
        | ~ big_f(X3,X4) )
      & ( big_f(skolem0001,skolem0002(X3,X4))
        | big_f(X4,skolem0002(X3,X4)) )
      & ( big_f(skolem0001,skolem0002(X3,X4))
        | ~ big_f(X3,skolem0002(X3,X4))
        | big_f(X3,X4) ) ),
    inference(distribute,[status(thm)],[c3]) ).

cnf(c9,negated_conjecture,
    ( big_f(skolem0001,skolem0002(X7,X6))
    | big_f(X6,skolem0002(X7,X6)) ),
    inference(split_conjunct,[status(thm)],[c4]) ).

cnf(c11,plain,
    big_f(skolem0001,skolem0002(X8,skolem0001)),
    inference(factor,[status(thm)],[c9]) ).

cnf(c5,negated_conjecture,
    ( ~ big_f(skolem0001,skolem0002(X10,X9))
    | big_f(skolem0002(X10,X9),skolem0001) ),
    inference(split_conjunct,[status(thm)],[c4]) ).

cnf(c12,plain,
    big_f(skolem0002(X11,skolem0001),skolem0001),
    inference(resolution,[status(thm)],[c5,c11]) ).

cnf(c8,negated_conjecture,
    ( ~ big_f(skolem0001,skolem0002(X22,X21))
    | ~ big_f(X21,skolem0002(X22,X21))
    | ~ big_f(X22,X21) ),
    inference(split_conjunct,[status(thm)],[c4]) ).

cnf(c18,plain,
    ( ~ big_f(skolem0001,skolem0002(X25,skolem0001))
    | ~ big_f(X25,skolem0001) ),
    inference(factor,[status(thm)],[c8]) ).

cnf(c29,plain,
    ~ big_f(X26,skolem0001),
    inference(resolution,[status(thm)],[c18,c11]) ).

cnf(c33,plain,
    $false,
    inference(resolution,[status(thm)],[c29,c12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SYN350+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.14  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.15/0.36  % Computer : n015.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Wed May  8 19:44:53 EDT 2024
% 0.15/0.36  % CPUTime  : 
% 0.22/0.54  % Version:  1.5
% 0.22/0.54  % SZS status Theorem
% 0.22/0.54  % SZS output start CNFRefutation
% See solution above
% 0.22/0.54  
% 0.22/0.54  % Initial clauses    : 6
% 0.22/0.54  % Processed clauses  : 10
% 0.22/0.54  % Factors computed   : 3
% 0.22/0.54  % Resolvents computed: 20
% 0.22/0.54  % Tautologies deleted: 0
% 0.22/0.54  % Forward subsumed   : 4
% 0.22/0.54  % Backward subsumed  : 2
% 0.22/0.54  % -------- CPU Time ---------
% 0.22/0.54  % User time          : 0.175 s
% 0.22/0.54  % System time        : 0.009 s
% 0.22/0.54  % Total time         : 0.184 s
%------------------------------------------------------------------------------