↑ Up

PyRes---1.5.THM-Ref.s

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

% Computer : n003.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:36:05 EDT 2024

% Result   : Theorem 0.22s 0.55s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (   9 unt;   0 def)
%            Number of atoms       :   48 (  10 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   46 (  21   ~;  11   |;  10   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   13 (   0 sgn   6   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ! [W0] :
      ( ( aSet0(W0)
        & isCountable0(W0) )
     => W0 != slcrc0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(c5,negated_conjecture,
    ~ ! [W0] :
        ( ( aSet0(W0)
          & isCountable0(W0) )
       => W0 != slcrc0 ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c6,negated_conjecture,
    ? [W0] :
      ( aSet0(W0)
      & isCountable0(W0)
      & W0 = slcrc0 ),
    inference(fof_nnf,[status(thm)],[c5]) ).

fof(c7,negated_conjecture,
    ? [X2] :
      ( aSet0(X2)
      & isCountable0(X2)
      & X2 = slcrc0 ),
    inference(variable_rename,[status(thm)],[c6]) ).

fof(c8,negated_conjecture,
    ( aSet0(skolem0001)
    & isCountable0(skolem0001)
    & skolem0001 = slcrc0 ),
    inference(skolemize,[status(esa)],[c7]) ).

cnf(c9,negated_conjecture,
    aSet0(skolem0001),
    inference(split_conjunct,[status(thm)],[c8]) ).

cnf(c10,negated_conjecture,
    isCountable0(skolem0001),
    inference(split_conjunct,[status(thm)],[c8]) ).

fof(mCountNFin,axiom,
    ! [W0] :
      ( ( aSet0(W0)
        & isCountable0(W0) )
     => ~ isFinite0(W0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin) ).

fof(c12,plain,
    ! [W0] :
      ( ( aSet0(W0)
        & isCountable0(W0) )
     => ~ isFinite0(W0) ),
    inference(fof_simplification,[status(thm)],[mCountNFin]) ).

fof(c13,plain,
    ! [W0] :
      ( ~ aSet0(W0)
      | ~ isCountable0(W0)
      | ~ isFinite0(W0) ),
    inference(fof_nnf,[status(thm)],[c12]) ).

fof(c14,plain,
    ! [X3] :
      ( ~ aSet0(X3)
      | ~ isCountable0(X3)
      | ~ isFinite0(X3) ),
    inference(variable_rename,[status(thm)],[c13]) ).

cnf(c15,plain,
    ( ~ aSet0(X27)
    | ~ isCountable0(X27)
    | ~ isFinite0(X27) ),
    inference(split_conjunct,[status(thm)],[c14]) ).

fof(mEmpFin,axiom,
    isFinite0(slcrc0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEmpFin) ).

cnf(c18,plain,
    isFinite0(slcrc0),
    inference(split_conjunct,[status(thm)],[mEmpFin]) ).

cnf(symmetry,axiom,
    ( X11 != X12
    | X12 = X11 ),
    theory(equality) ).

cnf(c11,negated_conjecture,
    skolem0001 = slcrc0,
    inference(split_conjunct,[status(thm)],[c8]) ).

cnf(c39,plain,
    slcrc0 = skolem0001,
    inference(resolution,[status(thm)],[c11,symmetry]) ).

cnf(c3,axiom,
    ( X35 != X34
    | ~ isFinite0(X35)
    | isFinite0(X34) ),
    theory(equality) ).

cnf(c54,plain,
    ( ~ isFinite0(slcrc0)
    | isFinite0(skolem0001) ),
    inference(resolution,[status(thm)],[c3,c39]) ).

cnf(c57,plain,
    isFinite0(skolem0001),
    inference(resolution,[status(thm)],[c54,c18]) ).

cnf(c58,plain,
    ( ~ aSet0(skolem0001)
    | ~ isCountable0(skolem0001) ),
    inference(resolution,[status(thm)],[c57,c15]) ).

cnf(c62,plain,
    ~ aSet0(skolem0001),
    inference(resolution,[status(thm)],[c58,c10]) ).

cnf(c63,plain,
    $false,
    inference(resolution,[status(thm)],[c62,c9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : NUM531+1 : TPTP v8.1.2. Released v4.0.0.
% 0.14/0.14  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.36  % Computer : n003.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.21/0.36  % CPULimit : 300
% 0.21/0.36  % WCLimit  : 300
% 0.21/0.36  % DateTime : Wed May  8 16:53:23 EDT 2024
% 0.21/0.36  % CPUTime  : 
% 0.22/0.55  % Version:  1.5
% 0.22/0.55  % SZS status Theorem
% 0.22/0.55  % SZS output start CNFRefutation
% See solution above
% 0.22/0.55  
% 0.22/0.55  % Initial clauses    : 21
% 0.22/0.55  % Processed clauses  : 25
% 0.22/0.55  % Factors computed   : 1
% 0.22/0.55  % Resolvents computed: 25
% 0.22/0.55  % Tautologies deleted: 6
% 0.22/0.55  % Forward subsumed   : 9
% 0.22/0.55  % Backward subsumed  : 2
% 0.22/0.55  % -------- CPU Time ---------
% 0.22/0.55  % User time          : 0.167 s
% 0.22/0.55  % System time        : 0.020 s
% 0.22/0.55  % Total time         : 0.187 s
%------------------------------------------------------------------------------