TSTP Solution File: SEU182+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SEU182+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% 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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:30:46 EDT 2023

% Result   : Theorem 2.92s 0.84s
% Output   : CNFRefutation 2.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   29 (   8 unt;   0 def)
%            Number of atoms       :  131 (  15 equ)
%            Maximal formula atoms :   38 (   4 avg)
%            Number of connectives :  170 (  68   ~;  73   |;  14   &)
%                                         (   5 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   5 avg)
%            Maximal term depth    :    7 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   2 con; 0-5 aty)
%            Number of variables   :   69 (   2 sgn;  40   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t44_relat_1,conjecture,
    ! [X1] :
      ( relation(X1)
     => ! [X2] :
          ( relation(X2)
         => subset(relation_dom(relation_composition(X1,X2)),relation_dom(X1)) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.XfLJ2HPR8A/E---3.1_32637.p',t44_relat_1) ).

fof(d4_relat_1,axiom,
    ! [X1] :
      ( relation(X1)
     => ! [X2] :
          ( X2 = relation_dom(X1)
        <=> ! [X3] :
              ( in(X3,X2)
            <=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.XfLJ2HPR8A/E---3.1_32637.p',d4_relat_1) ).

fof(d3_tarski,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( in(X3,X1)
         => in(X3,X2) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.XfLJ2HPR8A/E---3.1_32637.p',d3_tarski) ).

fof(d8_relat_1,axiom,
    ! [X1] :
      ( relation(X1)
     => ! [X2] :
          ( relation(X2)
         => ! [X3] :
              ( relation(X3)
             => ( X3 = relation_composition(X1,X2)
              <=> ! [X4,X5] :
                    ( in(ordered_pair(X4,X5),X3)
                  <=> ? [X6] :
                        ( in(ordered_pair(X4,X6),X1)
                        & in(ordered_pair(X6,X5),X2) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.XfLJ2HPR8A/E---3.1_32637.p',d8_relat_1) ).

fof(dt_k5_relat_1,axiom,
    ! [X1,X2] :
      ( ( relation(X1)
        & relation(X2) )
     => relation(relation_composition(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/tmp.XfLJ2HPR8A/E---3.1_32637.p',dt_k5_relat_1) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( relation(X1)
       => ! [X2] :
            ( relation(X2)
           => subset(relation_dom(relation_composition(X1,X2)),relation_dom(X1)) ) ),
    inference(assume_negation,[status(cth)],[t44_relat_1]) ).

fof(c_0_6,plain,
    ! [X18,X19,X20,X22,X23,X24,X26] :
      ( ( ~ in(X20,X19)
        | in(ordered_pair(X20,esk4_3(X18,X19,X20)),X18)
        | X19 != relation_dom(X18)
        | ~ relation(X18) )
      & ( ~ in(ordered_pair(X22,X23),X18)
        | in(X22,X19)
        | X19 != relation_dom(X18)
        | ~ relation(X18) )
      & ( ~ in(esk5_2(X18,X24),X24)
        | ~ in(ordered_pair(esk5_2(X18,X24),X26),X18)
        | X24 = relation_dom(X18)
        | ~ relation(X18) )
      & ( in(esk5_2(X18,X24),X24)
        | in(ordered_pair(esk5_2(X18,X24),esk6_2(X18,X24)),X18)
        | X24 = relation_dom(X18)
        | ~ relation(X18) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_relat_1])])])])])]) ).

fof(c_0_7,negated_conjecture,
    ( relation(esk1_0)
    & relation(esk2_0)
    & ~ subset(relation_dom(relation_composition(esk1_0,esk2_0)),relation_dom(esk1_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

fof(c_0_8,plain,
    ! [X9,X10,X11,X12,X13] :
      ( ( ~ subset(X9,X10)
        | ~ in(X11,X9)
        | in(X11,X10) )
      & ( in(esk3_2(X12,X13),X12)
        | subset(X12,X13) )
      & ( ~ in(esk3_2(X12,X13),X13)
        | subset(X12,X13) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).

cnf(c_0_9,plain,
    ( in(ordered_pair(X1,esk4_3(X3,X2,X1)),X3)
    | ~ in(X1,X2)
    | X2 != relation_dom(X3)
    | ~ relation(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ~ subset(relation_dom(relation_composition(esk1_0,esk2_0)),relation_dom(esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( in(esk3_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_12,plain,
    ! [X28,X29,X30,X31,X32,X34,X35,X36,X39] :
      ( ( in(ordered_pair(X31,esk7_5(X28,X29,X30,X31,X32)),X28)
        | ~ in(ordered_pair(X31,X32),X30)
        | X30 != relation_composition(X28,X29)
        | ~ relation(X30)
        | ~ relation(X29)
        | ~ relation(X28) )
      & ( in(ordered_pair(esk7_5(X28,X29,X30,X31,X32),X32),X29)
        | ~ in(ordered_pair(X31,X32),X30)
        | X30 != relation_composition(X28,X29)
        | ~ relation(X30)
        | ~ relation(X29)
        | ~ relation(X28) )
      & ( ~ in(ordered_pair(X34,X36),X28)
        | ~ in(ordered_pair(X36,X35),X29)
        | in(ordered_pair(X34,X35),X30)
        | X30 != relation_composition(X28,X29)
        | ~ relation(X30)
        | ~ relation(X29)
        | ~ relation(X28) )
      & ( ~ in(ordered_pair(esk8_3(X28,X29,X30),esk9_3(X28,X29,X30)),X30)
        | ~ in(ordered_pair(esk8_3(X28,X29,X30),X39),X28)
        | ~ in(ordered_pair(X39,esk9_3(X28,X29,X30)),X29)
        | X30 = relation_composition(X28,X29)
        | ~ relation(X30)
        | ~ relation(X29)
        | ~ relation(X28) )
      & ( in(ordered_pair(esk8_3(X28,X29,X30),esk10_3(X28,X29,X30)),X28)
        | in(ordered_pair(esk8_3(X28,X29,X30),esk9_3(X28,X29,X30)),X30)
        | X30 = relation_composition(X28,X29)
        | ~ relation(X30)
        | ~ relation(X29)
        | ~ relation(X28) )
      & ( in(ordered_pair(esk10_3(X28,X29,X30),esk9_3(X28,X29,X30)),X29)
        | in(ordered_pair(esk8_3(X28,X29,X30),esk9_3(X28,X29,X30)),X30)
        | X30 = relation_composition(X28,X29)
        | ~ relation(X30)
        | ~ relation(X29)
        | ~ relation(X28) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_relat_1])])])])])]) ).

fof(c_0_13,plain,
    ! [X41,X42] :
      ( ~ relation(X41)
      | ~ relation(X42)
      | relation(relation_composition(X41,X42)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_relat_1])]) ).

cnf(c_0_14,plain,
    ( in(ordered_pair(X1,esk4_3(X2,relation_dom(X2),X1)),X2)
    | ~ relation(X2)
    | ~ in(X1,relation_dom(X2)) ),
    inference(er,[status(thm)],[c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    in(esk3_2(relation_dom(relation_composition(esk1_0,esk2_0)),relation_dom(esk1_0)),relation_dom(relation_composition(esk1_0,esk2_0))),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,plain,
    ( in(ordered_pair(X1,esk7_5(X2,X3,X4,X1,X5)),X2)
    | ~ in(ordered_pair(X1,X5),X4)
    | X4 != relation_composition(X2,X3)
    | ~ relation(X4)
    | ~ relation(X3)
    | ~ relation(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    ( relation(relation_composition(X1,X2))
    | ~ relation(X1)
    | ~ relation(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ( in(ordered_pair(esk3_2(relation_dom(relation_composition(esk1_0,esk2_0)),relation_dom(esk1_0)),esk4_3(relation_composition(esk1_0,esk2_0),relation_dom(relation_composition(esk1_0,esk2_0)),esk3_2(relation_dom(relation_composition(esk1_0,esk2_0)),relation_dom(esk1_0)))),relation_composition(esk1_0,esk2_0))
    | ~ relation(relation_composition(esk1_0,esk2_0)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    relation(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_20,negated_conjecture,
    relation(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_21,plain,
    ( in(X1,X4)
    | ~ in(ordered_pair(X1,X2),X3)
    | X4 != relation_dom(X3)
    | ~ relation(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_22,plain,
    ( in(ordered_pair(X1,esk7_5(X2,X3,relation_composition(X2,X3),X1,X4)),X2)
    | ~ relation(X3)
    | ~ relation(X2)
    | ~ in(ordered_pair(X1,X4),relation_composition(X2,X3)) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    in(ordered_pair(esk3_2(relation_dom(relation_composition(esk1_0,esk2_0)),relation_dom(esk1_0)),esk4_3(relation_composition(esk1_0,esk2_0),relation_dom(relation_composition(esk1_0,esk2_0)),esk3_2(relation_dom(relation_composition(esk1_0,esk2_0)),relation_dom(esk1_0)))),relation_composition(esk1_0,esk2_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_17]),c_0_19]),c_0_20])]) ).

cnf(c_0_24,plain,
    ( in(X1,relation_dom(X2))
    | ~ relation(X2)
    | ~ in(ordered_pair(X1,X3),X2) ),
    inference(er,[status(thm)],[c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    in(ordered_pair(esk3_2(relation_dom(relation_composition(esk1_0,esk2_0)),relation_dom(esk1_0)),esk7_5(esk1_0,esk2_0,relation_composition(esk1_0,esk2_0),esk3_2(relation_dom(relation_composition(esk1_0,esk2_0)),relation_dom(esk1_0)),esk4_3(relation_composition(esk1_0,esk2_0),relation_dom(relation_composition(esk1_0,esk2_0)),esk3_2(relation_dom(relation_composition(esk1_0,esk2_0)),relation_dom(esk1_0))))),esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]),c_0_20])]) ).

cnf(c_0_26,plain,
    ( subset(X1,X2)
    | ~ in(esk3_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_27,negated_conjecture,
    in(esk3_2(relation_dom(relation_composition(esk1_0,esk2_0)),relation_dom(esk1_0)),relation_dom(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_20])]) ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEU182+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 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   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Oct  2 08:18:35 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.XfLJ2HPR8A/E---3.1_32637.p
% 2.92/0.84  # Version: 3.1pre001
% 2.92/0.84  # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.92/0.84  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/0.84  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.92/0.84  # Starting new_bool_3 with 300s (1) cores
% 2.92/0.84  # Starting new_bool_1 with 300s (1) cores
% 2.92/0.84  # Starting sh5l with 300s (1) cores
% 2.92/0.84  # sh5l with pid 32718 completed with status 0
% 2.92/0.84  # Result found by sh5l
% 2.92/0.84  # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.92/0.84  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/0.84  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.92/0.84  # Starting new_bool_3 with 300s (1) cores
% 2.92/0.84  # Starting new_bool_1 with 300s (1) cores
% 2.92/0.84  # Starting sh5l with 300s (1) cores
% 2.92/0.84  # SinE strategy is gf500_gu_R04_F100_L20000
% 2.92/0.84  # Search class: FGHSM-FFMS32-SFFFFFNN
% 2.92/0.84  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.92/0.84  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 163s (1) cores
% 2.92/0.84  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 32724 completed with status 0
% 2.92/0.84  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 2.92/0.84  # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.92/0.84  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/0.84  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.92/0.84  # Starting new_bool_3 with 300s (1) cores
% 2.92/0.84  # Starting new_bool_1 with 300s (1) cores
% 2.92/0.84  # Starting sh5l with 300s (1) cores
% 2.92/0.84  # SinE strategy is gf500_gu_R04_F100_L20000
% 2.92/0.84  # Search class: FGHSM-FFMS32-SFFFFFNN
% 2.92/0.84  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.92/0.84  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 163s (1) cores
% 2.92/0.84  # Preprocessing time       : 0.002 s
% 2.92/0.84  # Presaturation interreduction done
% 2.92/0.84  
% 2.92/0.84  # Proof found!
% 2.92/0.84  # SZS status Theorem
% 2.92/0.84  # SZS output start CNFRefutation
% See solution above
% 2.92/0.84  # Parsed axioms                        : 35
% 2.92/0.84  # Removed by relevancy pruning/SinE    : 9
% 2.92/0.84  # Initial clauses                      : 42
% 2.92/0.84  # Removed in clause preprocessing      : 0
% 2.92/0.84  # Initial clauses in saturation        : 42
% 2.92/0.84  # Processed clauses                    : 3733
% 2.92/0.84  # ...of these trivial                  : 160
% 2.92/0.84  # ...subsumed                          : 1251
% 2.92/0.84  # ...remaining for further processing  : 2322
% 2.92/0.84  # Other redundant clauses eliminated   : 5
% 2.92/0.84  # Clauses deleted for lack of memory   : 0
% 2.92/0.84  # Backward-subsumed                    : 20
% 2.92/0.84  # Backward-rewritten                   : 11
% 2.92/0.84  # Generated clauses                    : 14148
% 2.92/0.84  # ...of the previous two non-redundant : 10465
% 2.92/0.84  # ...aggressively subsumed             : 0
% 2.92/0.84  # Contextual simplify-reflections      : 4
% 2.92/0.84  # Paramodulations                      : 14131
% 2.92/0.84  # Factorizations                       : 12
% 2.92/0.84  # NegExts                              : 0
% 2.92/0.84  # Equation resolutions                 : 5
% 2.92/0.84  # Total rewrite steps                  : 9906
% 2.92/0.84  # Propositional unsat checks           : 0
% 2.92/0.84  #    Propositional check models        : 0
% 2.92/0.84  #    Propositional check unsatisfiable : 0
% 2.92/0.84  #    Propositional clauses             : 0
% 2.92/0.84  #    Propositional clauses after purity: 0
% 2.92/0.84  #    Propositional unsat core size     : 0
% 2.92/0.84  #    Propositional preprocessing time  : 0.000
% 2.92/0.84  #    Propositional encoding time       : 0.000
% 2.92/0.84  #    Propositional solver time         : 0.000
% 2.92/0.84  #    Success case prop preproc time    : 0.000
% 2.92/0.84  #    Success case prop encoding time   : 0.000
% 2.92/0.84  #    Success case prop solver time     : 0.000
% 2.92/0.84  # Current number of processed clauses  : 2244
% 2.92/0.84  #    Positive orientable unit clauses  : 675
% 2.92/0.84  #    Positive unorientable unit clauses: 1
% 2.92/0.84  #    Negative unit clauses             : 90
% 2.92/0.84  #    Non-unit-clauses                  : 1478
% 2.92/0.84  # Current number of unprocessed clauses: 6776
% 2.92/0.84  # ...number of literals in the above   : 19698
% 2.92/0.84  # Current number of archived formulas  : 0
% 2.92/0.84  # Current number of archived clauses   : 73
% 2.92/0.84  # Clause-clause subsumption calls (NU) : 431856
% 2.92/0.84  # Rec. Clause-clause subsumption calls : 348414
% 2.92/0.84  # Non-unit clause-clause subsumptions  : 403
% 2.92/0.84  # Unit Clause-clause subsumption calls : 95533
% 2.92/0.84  # Rewrite failures with RHS unbound    : 0
% 2.92/0.84  # BW rewrite match attempts            : 51822
% 2.92/0.84  # BW rewrite match successes           : 22
% 2.92/0.84  # Condensation attempts                : 0
% 2.92/0.84  # Condensation successes               : 0
% 2.92/0.84  # Termbank termtop insertions          : 243504
% 2.92/0.84  
% 2.92/0.84  # -------------------------------------------------
% 2.92/0.84  # User time                : 0.333 s
% 2.92/0.84  # System time              : 0.009 s
% 2.92/0.84  # Total time               : 0.342 s
% 2.92/0.84  # Maximum resident set size: 1852 pages
% 2.92/0.84  
% 2.92/0.84  # -------------------------------------------------
% 2.92/0.84  # User time                : 0.334 s
% 2.92/0.84  # System time              : 0.011 s
% 2.92/0.84  # Total time               : 0.345 s
% 2.92/0.84  # Maximum resident set size: 1700 pages
% 2.92/0.84  % E---3.1 exiting
%------------------------------------------------------------------------------