↑ Up

PyRes---1.5.THM-Ref.s

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

% Computer : n005.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:40:34 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(t28_finsub_1,conjecture,
    finite_subsets(empty_set) = singleton(empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_finsub_1) ).

fof(c23,negated_conjecture,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(assume_negation,[status(cth)],[t28_finsub_1]) ).

fof(c24,negated_conjecture,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(fof_simplification,[status(thm)],[c23]) ).

cnf(c25,negated_conjecture,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(split_conjunct,[status(thm)],[c24]) ).

cnf(transitivity,axiom,
    ( X66 != X65
    | X65 != X64
    | X66 = X64 ),
    theory(equality) ).

fof(t1_zfmisc_1,axiom,
    powerset(empty_set) = singleton(empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_zfmisc_1) ).

cnf(c19,plain,
    powerset(empty_set) = singleton(empty_set),
    inference(split_conjunct,[status(thm)],[t1_zfmisc_1]) ).

cnf(c351,plain,
    ( X490 != powerset(empty_set)
    | X490 = singleton(empty_set) ),
    inference(resolution,[status(thm)],[c19,transitivity]) ).

fof(fc1_xboole_0,axiom,
    empty(empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).

cnf(c36,plain,
    empty(empty_set),
    inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).

fof(cc1_finset_1,axiom,
    ! [A] :
      ( empty(A)
     => finite(A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_finset_1) ).

fof(c138,plain,
    ! [A] :
      ( ~ empty(A)
      | finite(A) ),
    inference(fof_nnf,[status(thm)],[cc1_finset_1]) ).

fof(c139,plain,
    ! [X43] :
      ( ~ empty(X43)
      | finite(X43) ),
    inference(variable_rename,[status(thm)],[c138]) ).

cnf(c140,plain,
    ( ~ empty(X106)
    | finite(X106) ),
    inference(split_conjunct,[status(thm)],[c139]) ).

cnf(c179,plain,
    finite(empty_set),
    inference(resolution,[status(thm)],[c140,c36]) ).

fof(t27_finsub_1,axiom,
    ! [A] :
      ( finite(A)
     => finite_subsets(A) = powerset(A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t27_finsub_1) ).

fof(c20,plain,
    ! [A] :
      ( ~ finite(A)
      | finite_subsets(A) = powerset(A) ),
    inference(fof_nnf,[status(thm)],[t27_finsub_1]) ).

fof(c21,plain,
    ! [X2] :
      ( ~ finite(X2)
      | finite_subsets(X2) = powerset(X2) ),
    inference(variable_rename,[status(thm)],[c20]) ).

cnf(c22,plain,
    ( ~ finite(X193)
    | finite_subsets(X193) = powerset(X193) ),
    inference(split_conjunct,[status(thm)],[c21]) ).

cnf(c378,plain,
    finite_subsets(empty_set) = powerset(empty_set),
    inference(resolution,[status(thm)],[c22,c179]) ).

cnf(c1701,plain,
    finite_subsets(empty_set) = singleton(empty_set),
    inference(resolution,[status(thm)],[c378,c351]) ).

cnf(c3050,plain,
    $false,
    inference(resolution,[status(thm)],[c1701,c25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU115+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed May  8 11:15:08 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 1.20/1.41  % Version:  1.5
% 1.20/1.41  % SZS status Theorem
% 1.20/1.41  % SZS output start CNFRefutation
% See solution above
% 1.20/1.41  
% 1.20/1.41  % Initial clauses    : 86
% 1.20/1.41  % Processed clauses  : 500
% 1.20/1.41  % Factors computed   : 4
% 1.20/1.41  % Resolvents computed: 2894
% 1.20/1.41  % Tautologies deleted: 17
% 1.20/1.41  % Forward subsumed   : 271
% 1.20/1.41  % Backward subsumed  : 35
% 1.20/1.41  % -------- CPU Time ---------
% 1.20/1.41  % User time          : 1.032 s
% 1.20/1.41  % System time        : 0.023 s
% 1.20/1.41  % Total time         : 1.055 s
%------------------------------------------------------------------------------