↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SEU244+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% 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  : 300s
% DateTime : Tue May  5 05:11:14 PM UTC 2026

% Result   : Theorem 1.25s 1.71s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   65 (   5 unt;   0 def)
%            Number of atoms       :  271 (   0 equ)
%            Maximal formula atoms :   22 (   4 avg)
%            Number of connectives :  371 ( 165   ~; 163   |;  25   &)
%                                         (   9 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   14 (  13 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   56 (   0 sgn  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d5_wellord1,axiom,
    ! [X1] :
      ( relation(X1)
     => ! [X2] :
          ( well_orders(X1,X2)
        <=> ( is_reflexive_in(X1,X2)
            & is_transitive_in(X1,X2)
            & is_antisymmetric_in(X1,X2)
            & is_connected_in(X1,X2)
            & is_well_founded_in(X1,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_wellord1) ).

fof(t5_wellord1,axiom,
    ! [X1] :
      ( relation(X1)
     => ( well_founded_relation(X1)
      <=> is_well_founded_in(X1,relation_field(X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_wellord1) ).

fof(t8_wellord1,conjecture,
    ! [X1] :
      ( relation(X1)
     => ( well_orders(X1,relation_field(X1))
      <=> well_ordering(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_wellord1) ).

fof(d12_relat_2,axiom,
    ! [X1] :
      ( relation(X1)
     => ( antisymmetric(X1)
      <=> is_antisymmetric_in(X1,relation_field(X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d12_relat_2) ).

fof(d14_relat_2,axiom,
    ! [X1] :
      ( relation(X1)
     => ( connected(X1)
      <=> is_connected_in(X1,relation_field(X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d14_relat_2) ).

fof(d16_relat_2,axiom,
    ! [X1] :
      ( relation(X1)
     => ( transitive(X1)
      <=> is_transitive_in(X1,relation_field(X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d16_relat_2) ).

fof(d9_relat_2,axiom,
    ! [X1] :
      ( relation(X1)
     => ( reflexive(X1)
      <=> is_reflexive_in(X1,relation_field(X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_relat_2) ).

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

fof(c_0_8,plain,
    ! [X23,X24] :
      ( ( is_reflexive_in(X23,X24)
        | ~ well_orders(X23,X24)
        | ~ relation(X23) )
      & ( is_transitive_in(X23,X24)
        | ~ well_orders(X23,X24)
        | ~ relation(X23) )
      & ( is_antisymmetric_in(X23,X24)
        | ~ well_orders(X23,X24)
        | ~ relation(X23) )
      & ( is_connected_in(X23,X24)
        | ~ well_orders(X23,X24)
        | ~ relation(X23) )
      & ( is_well_founded_in(X23,X24)
        | ~ well_orders(X23,X24)
        | ~ relation(X23) )
      & ( ~ is_reflexive_in(X23,X24)
        | ~ is_transitive_in(X23,X24)
        | ~ is_antisymmetric_in(X23,X24)
        | ~ is_connected_in(X23,X24)
        | ~ is_well_founded_in(X23,X24)
        | well_orders(X23,X24)
        | ~ relation(X23) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_wellord1])])])]) ).

fof(c_0_9,plain,
    ! [X28] :
      ( ( ~ well_founded_relation(X28)
        | is_well_founded_in(X28,relation_field(X28))
        | ~ relation(X28) )
      & ( ~ is_well_founded_in(X28,relation_field(X28))
        | well_founded_relation(X28)
        | ~ relation(X28) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_wellord1])])]) ).

fof(c_0_10,negated_conjecture,
    ~ ! [X1] :
        ( relation(X1)
       => ( well_orders(X1,relation_field(X1))
        <=> well_ordering(X1) ) ),
    inference(assume_negation,[status(cth)],[t8_wellord1]) ).

fof(c_0_11,plain,
    ! [X19] :
      ( ( ~ antisymmetric(X19)
        | is_antisymmetric_in(X19,relation_field(X19))
        | ~ relation(X19) )
      & ( ~ is_antisymmetric_in(X19,relation_field(X19))
        | antisymmetric(X19)
        | ~ relation(X19) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d12_relat_2])])]) ).

fof(c_0_12,plain,
    ! [X20] :
      ( ( ~ connected(X20)
        | is_connected_in(X20,relation_field(X20))
        | ~ relation(X20) )
      & ( ~ is_connected_in(X20,relation_field(X20))
        | connected(X20)
        | ~ relation(X20) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d14_relat_2])])]) ).

fof(c_0_13,plain,
    ! [X21] :
      ( ( ~ transitive(X21)
        | is_transitive_in(X21,relation_field(X21))
        | ~ relation(X21) )
      & ( ~ is_transitive_in(X21,relation_field(X21))
        | transitive(X21)
        | ~ relation(X21) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_relat_2])])]) ).

fof(c_0_14,plain,
    ! [X26] :
      ( ( ~ reflexive(X26)
        | is_reflexive_in(X26,relation_field(X26))
        | ~ relation(X26) )
      & ( ~ is_reflexive_in(X26,relation_field(X26))
        | reflexive(X26)
        | ~ relation(X26) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_relat_2])])]) ).

cnf(c_0_15,plain,
    ( well_orders(X1,X2)
    | ~ is_reflexive_in(X1,X2)
    | ~ is_transitive_in(X1,X2)
    | ~ is_antisymmetric_in(X1,X2)
    | ~ is_connected_in(X1,X2)
    | ~ is_well_founded_in(X1,X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,plain,
    ( is_well_founded_in(X1,relation_field(X1))
    | ~ well_founded_relation(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_17,plain,
    ( well_founded_relation(X1)
    | ~ is_well_founded_in(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_18,plain,
    ( is_well_founded_in(X1,X2)
    | ~ well_orders(X1,X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_19,negated_conjecture,
    ( relation(esk1_0)
    & ( ~ well_orders(esk1_0,relation_field(esk1_0))
      | ~ well_ordering(esk1_0) )
    & ( well_orders(esk1_0,relation_field(esk1_0))
      | well_ordering(esk1_0) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).

cnf(c_0_20,plain,
    ( antisymmetric(X1)
    | ~ is_antisymmetric_in(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_21,plain,
    ( is_antisymmetric_in(X1,X2)
    | ~ well_orders(X1,X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_22,plain,
    ( connected(X1)
    | ~ is_connected_in(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_23,plain,
    ( is_connected_in(X1,X2)
    | ~ well_orders(X1,X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_24,plain,
    ( transitive(X1)
    | ~ is_transitive_in(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_25,plain,
    ( is_transitive_in(X1,X2)
    | ~ well_orders(X1,X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_26,plain,
    ( reflexive(X1)
    | ~ is_reflexive_in(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_27,plain,
    ( is_reflexive_in(X1,X2)
    | ~ well_orders(X1,X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_28,plain,
    ( well_orders(X1,relation_field(X1))
    | ~ is_reflexive_in(X1,relation_field(X1))
    | ~ well_founded_relation(X1)
    | ~ is_transitive_in(X1,relation_field(X1))
    | ~ is_connected_in(X1,relation_field(X1))
    | ~ is_antisymmetric_in(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_29,plain,
    ( is_reflexive_in(X1,relation_field(X1))
    | ~ reflexive(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

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

cnf(c_0_31,plain,
    ( well_founded_relation(X1)
    | ~ well_orders(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_32,negated_conjecture,
    ( well_orders(esk1_0,relation_field(esk1_0))
    | well_ordering(esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_33,negated_conjecture,
    relation(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_34,plain,
    ( antisymmetric(X1)
    | ~ well_orders(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_35,plain,
    ( connected(X1)
    | ~ well_orders(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_36,plain,
    ( transitive(X1)
    | ~ well_orders(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_37,plain,
    ( reflexive(X1)
    | ~ well_orders(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_38,plain,
    ( well_orders(X1,relation_field(X1))
    | ~ well_founded_relation(X1)
    | ~ reflexive(X1)
    | ~ is_transitive_in(X1,relation_field(X1))
    | ~ is_connected_in(X1,relation_field(X1))
    | ~ is_antisymmetric_in(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_39,plain,
    ( is_transitive_in(X1,relation_field(X1))
    | ~ transitive(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_40,plain,
    ( well_ordering(X1)
    | ~ reflexive(X1)
    | ~ transitive(X1)
    | ~ antisymmetric(X1)
    | ~ connected(X1)
    | ~ well_founded_relation(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_41,negated_conjecture,
    ( well_founded_relation(esk1_0)
    | well_ordering(esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).

cnf(c_0_42,negated_conjecture,
    ( well_ordering(esk1_0)
    | antisymmetric(esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_32]),c_0_33])]) ).

cnf(c_0_43,negated_conjecture,
    ( well_ordering(esk1_0)
    | connected(esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_33])]) ).

cnf(c_0_44,negated_conjecture,
    ( well_ordering(esk1_0)
    | transitive(esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_32]),c_0_33])]) ).

cnf(c_0_45,negated_conjecture,
    ( reflexive(esk1_0)
    | well_ordering(esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_32]),c_0_33])]) ).

cnf(c_0_46,plain,
    ( well_orders(X1,relation_field(X1))
    | ~ well_founded_relation(X1)
    | ~ reflexive(X1)
    | ~ transitive(X1)
    | ~ is_connected_in(X1,relation_field(X1))
    | ~ is_antisymmetric_in(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_47,plain,
    ( is_connected_in(X1,relation_field(X1))
    | ~ connected(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ well_orders(esk1_0,relation_field(esk1_0))
    | ~ well_ordering(esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_49,negated_conjecture,
    well_ordering(esk1_0),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33])]),c_0_42]),c_0_43]),c_0_44]),c_0_45]) ).

cnf(c_0_50,plain,
    ( well_orders(X1,relation_field(X1))
    | ~ well_founded_relation(X1)
    | ~ reflexive(X1)
    | ~ transitive(X1)
    | ~ connected(X1)
    | ~ is_antisymmetric_in(X1,relation_field(X1))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_51,plain,
    ( is_antisymmetric_in(X1,relation_field(X1))
    | ~ antisymmetric(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_52,negated_conjecture,
    ~ well_orders(esk1_0,relation_field(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).

cnf(c_0_53,plain,
    ( well_orders(X1,relation_field(X1))
    | ~ well_founded_relation(X1)
    | ~ reflexive(X1)
    | ~ transitive(X1)
    | ~ connected(X1)
    | ~ antisymmetric(X1)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_54,negated_conjecture,
    ( ~ well_founded_relation(esk1_0)
    | ~ reflexive(esk1_0)
    | ~ transitive(esk1_0)
    | ~ connected(esk1_0)
    | ~ antisymmetric(esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_33])]) ).

cnf(c_0_55,plain,
    ( well_founded_relation(X1)
    | ~ well_ordering(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_56,negated_conjecture,
    ( ~ reflexive(esk1_0)
    | ~ transitive(esk1_0)
    | ~ connected(esk1_0)
    | ~ antisymmetric(esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_49]),c_0_33])]) ).

cnf(c_0_57,plain,
    ( reflexive(X1)
    | ~ well_ordering(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_58,negated_conjecture,
    ( ~ transitive(esk1_0)
    | ~ connected(esk1_0)
    | ~ antisymmetric(esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_49]),c_0_33])]) ).

cnf(c_0_59,plain,
    ( transitive(X1)
    | ~ well_ordering(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_60,negated_conjecture,
    ( ~ connected(esk1_0)
    | ~ antisymmetric(esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_49]),c_0_33])]) ).

cnf(c_0_61,plain,
    ( connected(X1)
    | ~ well_ordering(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_62,negated_conjecture,
    ~ antisymmetric(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_49]),c_0_33])]) ).

cnf(c_0_63,plain,
    ( antisymmetric(X1)
    | ~ well_ordering(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_64,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_49]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SEU244+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.11  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32  % Computer : n029.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Tue May  5 02:52:29 EDT 2026
% 0.15/0.32  % CPUTime    : 
% 0.15/0.33  % start to proof: theBenchmark
% 1.25/1.71  % Version  : CSE_E---1.7
% 1.25/1.71  % Problem  : theBenchmark.p
% 1.25/1.71  % SZS status Theorem for theBenchmark.p
% 1.25/1.71  % SZS output start CNFRefutation
% See solution above
% 1.25/1.71  % Total time : 1.371s
%------------------------------------------------------------------------------