↑ Up

PyRes---1.5.THM-Ref.s

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

% Computer : n016.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:30:13 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ? [W0] : aSupremumOfIn0(W0,xT,xS),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(c20,negated_conjecture,
    ~ ? [W0] : aSupremumOfIn0(W0,xT,xS),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c21,negated_conjecture,
    ! [W0] : ~ aSupremumOfIn0(W0,xT,xS),
    inference(fof_nnf,[status(thm)],[c20]) ).

fof(c22,negated_conjecture,
    ! [X2] : ~ aSupremumOfIn0(X2,xT,xS),
    inference(variable_rename,[status(thm)],[c21]) ).

cnf(c23,negated_conjecture,
    ~ aSupremumOfIn0(X81,xT,xS),
    inference(split_conjunct,[status(thm)],[c22]) ).

fof(m__1330,plain,
    ( aFixedPointOf0(xp,xf)
    & aSupremumOfIn0(xp,xT,xS) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1330) ).

cnf(c25,plain,
    aSupremumOfIn0(xp,xT,xS),
    inference(split_conjunct,[status(thm)],[m__1330]) ).

cnf(c174,plain,
    $false,
    inference(resolution,[status(thm)],[c25,c23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : LAT388+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.34  % Computer : n016.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed May  8 12:22:08 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.44/0.61  % Version:  1.5
% 0.44/0.61  % SZS status Theorem
% 0.44/0.61  % SZS output start CNFRefutation
% See solution above
% 0.44/0.61  
% 0.44/0.61  % Initial clauses    : 89
% 0.44/0.61  % Processed clauses  : 16
% 0.44/0.61  % Factors computed   : 1
% 0.44/0.61  % Resolvents computed: 5
% 0.44/0.61  % Tautologies deleted: 0
% 0.44/0.61  % Forward subsumed   : 4
% 0.44/0.61  % Backward subsumed  : 0
% 0.44/0.61  % -------- CPU Time ---------
% 0.44/0.61  % User time          : 0.243 s
% 0.44/0.61  % System time        : 0.023 s
% 0.44/0.61  % Total time         : 0.266 s
%------------------------------------------------------------------------------