TSTP Solution File: SEU275+1 by PyRes---1.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : PyRes---1.3
% Problem  : SEU275+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n029.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  : 600s
% DateTime : Tue Jul 19 13:36:59 EDT 2022

% Result   : Theorem 0.19s 0.56s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named input)

% Comments : 
%------------------------------------------------------------------------------
fof(t7_wellord2,conjecture,
    ! [A] :
      ( ordinal(A)
     => well_ordering(inclusion_relation(A)) ),
    input ).

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)),
    input ).

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

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

fof(t2_wellord2,axiom,
    ! [A] : reflexive(inclusion_relation(A)),
    input ).

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

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

fof(t3_wellord2,axiom,
    ! [A] : transitive(inclusion_relation(A)),
    input ).

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

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

fof(t5_wellord2,axiom,
    ! [A] : antisymmetric(inclusion_relation(A)),
    input ).

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

cnf(c10,axiom,
    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)) ),
    input ).

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

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

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

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

fof(t6_wellord2,axiom,
    ! [A] :
      ( ordinal(A)
     => well_founded_relation(inclusion_relation(A)) ),
    input ).

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

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

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

cnf(c44,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) ) ) ),
    input ).

fof(c25,axiom,
    ! [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,axiom,
    ! [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,axiom,
    ! [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,axiom,
    ( ~ relation(X27)
    | ~ reflexive(X27)
    | ~ transitive(X27)
    | ~ antisymmetric(X27)
    | ~ connected(X27)
    | ~ well_founded_relation(X27)
    | well_ordering(X27) ),
    inference(split_conjunct,status(thm),[c27]) ).

cnf(c52,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,c44]) ).

cnf(c54,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),[c52,c48]) ).

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

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

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

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

cnf(c62,plain,
    $false,
    inference(resolution,status(thm),[c58,c5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU275+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34  % Computer : n029.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  : 600
% 0.13/0.34  % DateTime : Sun Jun 19 03:19:44 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.56  # Version:  1.3
% 0.19/0.56  # SZS status Theorem
% 0.19/0.56  # SZS output start CNFRefutation
% See solution above
% 0.19/0.56  
% 0.19/0.56  # Initial clauses    : 20
% 0.19/0.56  # Processed clauses  : 33
% 0.19/0.56  # Factors computed   : 0
% 0.19/0.56  # Resolvents computed: 24
% 0.19/0.56  # Tautologies deleted: 0
% 0.19/0.56  # Forward subsumed   : 4
% 0.19/0.56  # Backward subsumed  : 5
% 0.19/0.56  # -------- CPU Time ---------
% 0.19/0.56  # User time          : 0.204 s
% 0.19/0.56  # System time        : 0.021 s
% 0.19/0.56  # Total time         : 0.225 s
%------------------------------------------------------------------------------