↑ Up

PyRes---1.5.THM-Ref.s

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

% Computer : n010.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:41:00 EDT 2024

% Result   : Theorem 0.38s 0.59s
% Output   : Refutation 0.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   41 (  18 unt;   0 def)
%            Number of atoms       :  126 (   0 equ)
%            Maximal formula atoms :   22 (   3 avg)
%            Number of connectives :  147 (  62   ~;  57   |;  22   &)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   29 (   4 sgn  20   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t7_wellord2,conjecture,
    ! [A] :
      ( ordinal(A)
     => well_ordering(inclusion_relation(A)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_wellord2) ).

fof(c0,negated_conjecture,
    ~ ! [A] :
        ( ordinal(A)
       => well_ordering(inclusion_relation(A)) ),
    inference(assume_negation,[status(cth)],[t7_wellord2]) ).

fof(c1,negated_conjecture,
    ? [A] :
      ( ordinal(A)
      & ~ well_ordering(inclusion_relation(A)) ),
    inference(fof_nnf,[status(thm)],[c0]) ).

fof(c2,negated_conjecture,
    ? [X2] :
      ( ordinal(X2)
      & ~ well_ordering(inclusion_relation(X2)) ),
    inference(variable_rename,[status(thm)],[c1]) ).

fof(c3,negated_conjecture,
    ( ordinal(skolem0001)
    & ~ well_ordering(inclusion_relation(skolem0001)) ),
    inference(skolemize,[status(esa)],[c2]) ).

cnf(c5,negated_conjecture,
    ~ well_ordering(inclusion_relation(skolem0001)),
    inference(split_conjunct,[status(thm)],[c3]) ).

fof(dt_k1_wellord2,axiom,
    ! [A] : relation(inclusion_relation(A)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_wellord2) ).

fof(c23,plain,
    ! [X9] : relation(inclusion_relation(X9)),
    inference(variable_rename,[status(thm)],[dt_k1_wellord2]) ).

cnf(c24,plain,
    relation(inclusion_relation(X16)),
    inference(split_conjunct,[status(thm)],[c23]) ).

fof(t2_wellord2,axiom,
    ! [A] : reflexive(inclusion_relation(A)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_wellord2) ).

fof(c16,plain,
    ! [X7] : reflexive(inclusion_relation(X7)),
    inference(variable_rename,[status(thm)],[t2_wellord2]) ).

cnf(c17,plain,
    reflexive(inclusion_relation(X15)),
    inference(split_conjunct,[status(thm)],[c16]) ).

fof(t3_wellord2,axiom,
    ! [A] : transitive(inclusion_relation(A)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_wellord2) ).

fof(c14,plain,
    ! [X6] : transitive(inclusion_relation(X6)),
    inference(variable_rename,[status(thm)],[t3_wellord2]) ).

cnf(c15,plain,
    transitive(inclusion_relation(X14)),
    inference(split_conjunct,[status(thm)],[c14]) ).

fof(t5_wellord2,axiom,
    ! [A] : antisymmetric(inclusion_relation(A)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_wellord2) ).

fof(c9,plain,
    ! [X4] : antisymmetric(inclusion_relation(X4)),
    inference(variable_rename,[status(thm)],[t5_wellord2]) ).

cnf(c10,plain,
    antisymmetric(inclusion_relation(X13)),
    inference(split_conjunct,[status(thm)],[c9]) ).

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

fof(t4_wellord2,axiom,
    ! [A] :
      ( ordinal(A)
     => connected(inclusion_relation(A)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_wellord2) ).

fof(c11,plain,
    ! [A] :
      ( ~ ordinal(A)
      | connected(inclusion_relation(A)) ),
    inference(fof_nnf,[status(thm)],[t4_wellord2]) ).

fof(c12,plain,
    ! [X5] :
      ( ~ ordinal(X5)
      | connected(inclusion_relation(X5)) ),
    inference(variable_rename,[status(thm)],[c11]) ).

cnf(c13,plain,
    ( ~ ordinal(X20)
    | connected(inclusion_relation(X20)) ),
    inference(split_conjunct,[status(thm)],[c12]) ).

cnf(c49,plain,
    connected(inclusion_relation(skolem0001)),
    inference(resolution,[status(thm)],[c13,c4]) ).

fof(t6_wellord2,axiom,
    ! [A] :
      ( ordinal(A)
     => well_founded_relation(inclusion_relation(A)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_wellord2) ).

fof(c6,plain,
    ! [A] :
      ( ~ ordinal(A)
      | well_founded_relation(inclusion_relation(A)) ),
    inference(fof_nnf,[status(thm)],[t6_wellord2]) ).

fof(c7,plain,
    ! [X3] :
      ( ~ ordinal(X3)
      | well_founded_relation(inclusion_relation(X3)) ),
    inference(variable_rename,[status(thm)],[c6]) ).

cnf(c8,plain,
    ( ~ ordinal(X18)
    | well_founded_relation(inclusion_relation(X18)) ),
    inference(split_conjunct,[status(thm)],[c7]) ).

cnf(c45,plain,
    well_founded_relation(inclusion_relation(skolem0001)),
    inference(resolution,[status(thm)],[c8,c4]) ).

fof(d4_wellord1,axiom,
    ! [A] :
      ( relation(A)
     => ( well_ordering(A)
      <=> ( reflexive(A)
          & transitive(A)
          & antisymmetric(A)
          & connected(A)
          & well_founded_relation(A) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_wellord1) ).

fof(c25,plain,
    ! [A] :
      ( ~ relation(A)
      | ( ( ~ well_ordering(A)
          | ( reflexive(A)
            & transitive(A)
            & antisymmetric(A)
            & connected(A)
            & well_founded_relation(A) ) )
        & ( ~ reflexive(A)
          | ~ transitive(A)
          | ~ antisymmetric(A)
          | ~ connected(A)
          | ~ well_founded_relation(A)
          | well_ordering(A) ) ) ),
    inference(fof_nnf,[status(thm)],[d4_wellord1]) ).

fof(c26,plain,
    ! [X10] :
      ( ~ relation(X10)
      | ( ( ~ well_ordering(X10)
          | ( reflexive(X10)
            & transitive(X10)
            & antisymmetric(X10)
            & connected(X10)
            & well_founded_relation(X10) ) )
        & ( ~ reflexive(X10)
          | ~ transitive(X10)
          | ~ antisymmetric(X10)
          | ~ connected(X10)
          | ~ well_founded_relation(X10)
          | well_ordering(X10) ) ) ),
    inference(variable_rename,[status(thm)],[c25]) ).

fof(c27,plain,
    ! [X10] :
      ( ( ~ relation(X10)
        | ~ well_ordering(X10)
        | reflexive(X10) )
      & ( ~ relation(X10)
        | ~ well_ordering(X10)
        | transitive(X10) )
      & ( ~ relation(X10)
        | ~ well_ordering(X10)
        | antisymmetric(X10) )
      & ( ~ relation(X10)
        | ~ well_ordering(X10)
        | connected(X10) )
      & ( ~ relation(X10)
        | ~ well_ordering(X10)
        | well_founded_relation(X10) )
      & ( ~ relation(X10)
        | ~ reflexive(X10)
        | ~ transitive(X10)
        | ~ antisymmetric(X10)
        | ~ connected(X10)
        | ~ well_founded_relation(X10)
        | well_ordering(X10) ) ),
    inference(distribute,[status(thm)],[c26]) ).

cnf(c33,plain,
    ( ~ relation(X27)
    | ~ reflexive(X27)
    | ~ transitive(X27)
    | ~ antisymmetric(X27)
    | ~ connected(X27)
    | ~ well_founded_relation(X27)
    | well_ordering(X27) ),
    inference(split_conjunct,[status(thm)],[c27]) ).

cnf(c53,plain,
    ( ~ relation(inclusion_relation(skolem0001))
    | ~ reflexive(inclusion_relation(skolem0001))
    | ~ transitive(inclusion_relation(skolem0001))
    | ~ antisymmetric(inclusion_relation(skolem0001))
    | ~ connected(inclusion_relation(skolem0001))
    | well_ordering(inclusion_relation(skolem0001)) ),
    inference(resolution,[status(thm)],[c33,c45]) ).

cnf(c59,plain,
    ( ~ relation(inclusion_relation(skolem0001))
    | ~ reflexive(inclusion_relation(skolem0001))
    | ~ transitive(inclusion_relation(skolem0001))
    | ~ antisymmetric(inclusion_relation(skolem0001))
    | well_ordering(inclusion_relation(skolem0001)) ),
    inference(resolution,[status(thm)],[c53,c49]) ).

cnf(c65,plain,
    ( ~ relation(inclusion_relation(skolem0001))
    | ~ reflexive(inclusion_relation(skolem0001))
    | ~ transitive(inclusion_relation(skolem0001))
    | well_ordering(inclusion_relation(skolem0001)) ),
    inference(resolution,[status(thm)],[c59,c10]) ).

cnf(c66,plain,
    ( ~ relation(inclusion_relation(skolem0001))
    | ~ reflexive(inclusion_relation(skolem0001))
    | well_ordering(inclusion_relation(skolem0001)) ),
    inference(resolution,[status(thm)],[c65,c15]) ).

cnf(c67,plain,
    ( ~ relation(inclusion_relation(skolem0001))
    | well_ordering(inclusion_relation(skolem0001)) ),
    inference(resolution,[status(thm)],[c66,c17]) ).

cnf(c68,plain,
    well_ordering(inclusion_relation(skolem0001)),
    inference(resolution,[status(thm)],[c67,c24]) ).

cnf(c71,plain,
    $false,
    inference(resolution,[status(thm)],[c68,c5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SEU275+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Wed May  8 11:08:38 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.38/0.59  % Version:  1.5
% 0.38/0.59  % SZS status Theorem
% 0.38/0.59  % SZS output start CNFRefutation
% See solution above
% 0.38/0.59  
% 0.38/0.59  % Initial clauses    : 20
% 0.38/0.59  % Processed clauses  : 38
% 0.38/0.59  % Factors computed   : 0
% 0.38/0.59  % Resolvents computed: 33
% 0.38/0.59  % Tautologies deleted: 0
% 0.38/0.59  % Forward subsumed   : 10
% 0.38/0.59  % Backward subsumed  : 10
% 0.38/0.59  % -------- CPU Time ---------
% 0.38/0.59  % User time          : 0.218 s
% 0.38/0.59  % System time        : 0.011 s
% 0.38/0.59  % Total time         : 0.229 s
%------------------------------------------------------------------------------