↑ Up

PyRes---1.5.THM-Ref.s

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

% Computer : n024.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:18 EDT 2024

% Result   : Theorem 0.18s 0.50s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   15 (  10 unt;   0 def)
%            Number of atoms       :   24 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   19 (  10   ~;   7   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel57,conjecture,
    big_f(f(a,b),f(a,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel57) ).

fof(c0,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    inference(assume_negation,[status(cth)],[pel57]) ).

fof(c1,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    inference(fof_simplification,[status(thm)],[c0]) ).

cnf(c2,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    inference(split_conjunct,[status(thm)],[c1]) ).

fof(pel57_1,axiom,
    big_f(f(a,b),f(b,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel57_1) ).

cnf(c7,plain,
    big_f(f(a,b),f(b,c)),
    inference(split_conjunct,[status(thm)],[pel57_1]) ).

fof(pel57_3,axiom,
    ! [X,Y,Z] :
      ( ( big_f(X,Y)
        & big_f(Y,Z) )
     => big_f(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel57_3) ).

fof(c3,plain,
    ! [X,Y,Z] :
      ( ~ big_f(X,Y)
      | ~ big_f(Y,Z)
      | big_f(X,Z) ),
    inference(fof_nnf,[status(thm)],[pel57_3]) ).

fof(c4,plain,
    ! [X2,X3,X4] :
      ( ~ big_f(X2,X3)
      | ~ big_f(X3,X4)
      | big_f(X2,X4) ),
    inference(variable_rename,[status(thm)],[c3]) ).

cnf(c5,plain,
    ( ~ big_f(X6,X5)
    | ~ big_f(X5,X7)
    | big_f(X6,X7) ),
    inference(split_conjunct,[status(thm)],[c4]) ).

fof(pel57_2,axiom,
    big_f(f(b,c),f(a,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel57_2) ).

cnf(c6,plain,
    big_f(f(b,c),f(a,c)),
    inference(split_conjunct,[status(thm)],[pel57_2]) ).

cnf(c9,plain,
    ( ~ big_f(X9,f(b,c))
    | big_f(X9,f(a,c)) ),
    inference(resolution,[status(thm)],[c6,c5]) ).

cnf(c11,plain,
    big_f(f(a,b),f(a,c)),
    inference(resolution,[status(thm)],[c9,c7]) ).

cnf(c12,plain,
    $false,
    inference(resolution,[status(thm)],[c11,c2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN079+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33  % Computer : n024.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 : Wed May  8 19:49:23 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.18/0.50  % Version:  1.5
% 0.18/0.50  % SZS status Theorem
% 0.18/0.50  % SZS output start CNFRefutation
% See solution above
% 0.18/0.50  
% 0.18/0.50  % Initial clauses    : 4
% 0.18/0.50  % Processed clauses  : 6
% 0.18/0.50  % Factors computed   : 1
% 0.18/0.50  % Resolvents computed: 5
% 0.18/0.50  % Tautologies deleted: 1
% 0.18/0.50  % Forward subsumed   : 0
% 0.18/0.50  % Backward subsumed  : 0
% 0.18/0.50  % -------- CPU Time ---------
% 0.18/0.50  % User time          : 0.152 s
% 0.18/0.50  % System time        : 0.018 s
% 0.18/0.50  % Total time         : 0.169 s
%------------------------------------------------------------------------------