↑ Up

PyRes---1.5.THM-Ref.s

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

% Computer : n014.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:47:14 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel30,conjecture,
    ! [X] : big_i(X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel30) ).

fof(c0,negated_conjecture,
    ~ ! [X] : big_i(X),
    inference(assume_negation,[status(cth)],[pel30]) ).

fof(c1,negated_conjecture,
    ? [X] : ~ big_i(X),
    inference(fof_nnf,[status(thm)],[c0]) ).

fof(c2,negated_conjecture,
    ? [X2] : ~ big_i(X2),
    inference(variable_rename,[status(thm)],[c1]) ).

fof(c3,negated_conjecture,
    ~ big_i(skolem0001),
    inference(skolemize,[status(esa)],[c2]) ).

cnf(c4,negated_conjecture,
    ~ big_i(skolem0001),
    inference(split_conjunct,[status(thm)],[c3]) ).

fof(pel30_2,axiom,
    ! [X] :
      ( ( big_g(X)
       => ~ big_i(X) )
     => ( big_f(X)
        & big_h(X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel30_2) ).

fof(c5,plain,
    ! [X] :
      ( ( big_g(X)
       => ~ big_i(X) )
     => ( big_f(X)
        & big_h(X) ) ),
    inference(fof_simplification,[status(thm)],[pel30_2]) ).

fof(c6,plain,
    ! [X] :
      ( ( big_g(X)
        & big_i(X) )
      | ( big_f(X)
        & big_h(X) ) ),
    inference(fof_nnf,[status(thm)],[c5]) ).

fof(c7,plain,
    ! [X3] :
      ( ( big_g(X3)
        & big_i(X3) )
      | ( big_f(X3)
        & big_h(X3) ) ),
    inference(variable_rename,[status(thm)],[c6]) ).

fof(c8,plain,
    ! [X3] :
      ( ( big_g(X3)
        | big_f(X3) )
      & ( big_g(X3)
        | big_h(X3) )
      & ( big_i(X3)
        | big_f(X3) )
      & ( big_i(X3)
        | big_h(X3) ) ),
    inference(distribute,[status(thm)],[c7]) ).

cnf(c11,plain,
    ( big_i(X7)
    | big_f(X7) ),
    inference(split_conjunct,[status(thm)],[c8]) ).

cnf(c19,plain,
    big_f(skolem0001),
    inference(resolution,[status(thm)],[c11,c4]) ).

cnf(c12,plain,
    ( big_i(X8)
    | big_h(X8) ),
    inference(split_conjunct,[status(thm)],[c8]) ).

cnf(c20,plain,
    big_h(skolem0001),
    inference(resolution,[status(thm)],[c12,c4]) ).

fof(pel30_1,axiom,
    ! [X] :
      ( ( big_f(X)
        | big_g(X) )
     => ~ big_h(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel30_1) ).

fof(c13,plain,
    ! [X] :
      ( ( big_f(X)
        | big_g(X) )
     => ~ big_h(X) ),
    inference(fof_simplification,[status(thm)],[pel30_1]) ).

fof(c14,plain,
    ! [X] :
      ( ( ~ big_f(X)
        & ~ big_g(X) )
      | ~ big_h(X) ),
    inference(fof_nnf,[status(thm)],[c13]) ).

fof(c15,plain,
    ! [X4] :
      ( ( ~ big_f(X4)
        & ~ big_g(X4) )
      | ~ big_h(X4) ),
    inference(variable_rename,[status(thm)],[c14]) ).

fof(c16,plain,
    ! [X4] :
      ( ( ~ big_f(X4)
        | ~ big_h(X4) )
      & ( ~ big_g(X4)
        | ~ big_h(X4) ) ),
    inference(distribute,[status(thm)],[c15]) ).

cnf(c17,plain,
    ( ~ big_f(X9)
    | ~ big_h(X9) ),
    inference(split_conjunct,[status(thm)],[c16]) ).

cnf(c21,plain,
    ~ big_f(skolem0001),
    inference(resolution,[status(thm)],[c17,c20]) ).

cnf(c25,plain,
    $false,
    inference(resolution,[status(thm)],[c21,c19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN060+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.14  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.15/0.35  % Computer : n014.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Wed May  8 20:30:23 EDT 2024
% 0.15/0.35  % CPUTime  : 
% 0.22/0.57  % Version:  1.5
% 0.22/0.57  % SZS status Theorem
% 0.22/0.57  % SZS output start CNFRefutation
% See solution above
% 0.22/0.57  
% 0.22/0.57  % Initial clauses    : 7
% 0.22/0.57  % Processed clauses  : 9
% 0.22/0.57  % Factors computed   : 0
% 0.22/0.57  % Resolvents computed: 8
% 0.22/0.57  % Tautologies deleted: 0
% 0.22/0.57  % Forward subsumed   : 0
% 0.22/0.57  % Backward subsumed  : 0
% 0.22/0.57  % -------- CPU Time ---------
% 0.22/0.57  % User time          : 0.188 s
% 0.22/0.57  % System time        : 0.021 s
% 0.22/0.57  % Total time         : 0.209 s
%------------------------------------------------------------------------------