↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SEU305+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% 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  : 600s
% DateTime : Tue Jul 19 09:18:49 EDT 2022

% Result   : Theorem 0.64s 47.82s
% Output   : CNFRefutation 0.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   30 (  13 unt;   0 def)
%            Number of atoms       :  109 (  23 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  124 (  45   ~;  42   |;  23   &)
%                                         (   1 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   38 (   0 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t26_lattices,conjecture,
    ! [X1] :
      ( ( ~ empty_carrier(X1)
        & join_commutative(X1)
        & join_semilatt_str(X1) )
     => ! [X2] :
          ( element(X2,the_carrier(X1))
         => ! [X3] :
              ( element(X3,the_carrier(X1))
             => ( ( below(X1,X2,X3)
                  & below(X1,X3,X2) )
               => X2 = X3 ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t26_lattices) ).

fof(d3_lattices,axiom,
    ! [X1] :
      ( ( ~ empty_carrier(X1)
        & join_semilatt_str(X1) )
     => ! [X2] :
          ( element(X2,the_carrier(X1))
         => ! [X3] :
              ( element(X3,the_carrier(X1))
             => ( below(X1,X2,X3)
              <=> join(X1,X2,X3) = X3 ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d3_lattices) ).

fof(redefinition_k3_lattices,axiom,
    ! [X1,X2,X3] :
      ( ( ~ empty_carrier(X1)
        & join_commutative(X1)
        & join_semilatt_str(X1)
        & element(X2,the_carrier(X1))
        & element(X3,the_carrier(X1)) )
     => join_commut(X1,X2,X3) = join(X1,X2,X3) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',redefinition_k3_lattices) ).

fof(commutativity_k3_lattices,axiom,
    ! [X1,X2,X3] :
      ( ( ~ empty_carrier(X1)
        & join_commutative(X1)
        & join_semilatt_str(X1)
        & element(X2,the_carrier(X1))
        & element(X3,the_carrier(X1)) )
     => join_commut(X1,X2,X3) = join_commut(X1,X3,X2) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',commutativity_k3_lattices) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1] :
        ( ( ~ empty_carrier(X1)
          & join_commutative(X1)
          & join_semilatt_str(X1) )
       => ! [X2] :
            ( element(X2,the_carrier(X1))
           => ! [X3] :
                ( element(X3,the_carrier(X1))
               => ( ( below(X1,X2,X3)
                    & below(X1,X3,X2) )
                 => X2 = X3 ) ) ) ),
    inference(assume_negation,[status(cth)],[t26_lattices]) ).

fof(c_0_5,plain,
    ! [X4,X5,X6] :
      ( ( ~ below(X4,X5,X6)
        | join(X4,X5,X6) = X6
        | ~ element(X6,the_carrier(X4))
        | ~ element(X5,the_carrier(X4))
        | empty_carrier(X4)
        | ~ join_semilatt_str(X4) )
      & ( join(X4,X5,X6) != X6
        | below(X4,X5,X6)
        | ~ element(X6,the_carrier(X4))
        | ~ element(X5,the_carrier(X4))
        | empty_carrier(X4)
        | ~ join_semilatt_str(X4) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d3_lattices])])])])])])]) ).

fof(c_0_6,negated_conjecture,
    ( ~ empty_carrier(esk290_0)
    & join_commutative(esk290_0)
    & join_semilatt_str(esk290_0)
    & element(esk291_0,the_carrier(esk290_0))
    & element(esk292_0,the_carrier(esk290_0))
    & below(esk290_0,esk291_0,esk292_0)
    & below(esk290_0,esk292_0,esk291_0)
    & esk291_0 != esk292_0 ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])]) ).

fof(c_0_7,plain,
    ! [X4,X5,X6] :
      ( empty_carrier(X4)
      | ~ join_commutative(X4)
      | ~ join_semilatt_str(X4)
      | ~ element(X5,the_carrier(X4))
      | ~ element(X6,the_carrier(X4))
      | join_commut(X4,X5,X6) = join(X4,X5,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[redefinition_k3_lattices])])]) ).

cnf(c_0_8,plain,
    ( empty_carrier(X1)
    | join(X1,X2,X3) = X3
    | ~ join_semilatt_str(X1)
    | ~ element(X2,the_carrier(X1))
    | ~ element(X3,the_carrier(X1))
    | ~ below(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    element(esk292_0,the_carrier(esk290_0)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    join_semilatt_str(esk290_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,negated_conjecture,
    ~ empty_carrier(esk290_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    element(esk291_0,the_carrier(esk290_0)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_13,plain,
    ! [X4,X5,X6] :
      ( empty_carrier(X4)
      | ~ join_commutative(X4)
      | ~ join_semilatt_str(X4)
      | ~ element(X5,the_carrier(X4))
      | ~ element(X6,the_carrier(X4))
      | join_commut(X4,X5,X6) = join_commut(X4,X6,X5) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[commutativity_k3_lattices])])]) ).

cnf(c_0_14,plain,
    ( join_commut(X1,X2,X3) = join(X1,X2,X3)
    | empty_carrier(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ element(X2,the_carrier(X1))
    | ~ join_semilatt_str(X1)
    | ~ join_commutative(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_15,negated_conjecture,
    join_commutative(esk290_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_16,negated_conjecture,
    ( join(esk290_0,X1,esk292_0) = esk292_0
    | ~ below(esk290_0,X1,esk292_0)
    | ~ element(X1,the_carrier(esk290_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    below(esk290_0,esk291_0,esk292_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_18,negated_conjecture,
    ( join(esk290_0,X1,esk291_0) = esk291_0
    | ~ below(esk290_0,X1,esk291_0)
    | ~ element(X1,the_carrier(esk290_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_10])]),c_0_11]) ).

cnf(c_0_19,negated_conjecture,
    below(esk290_0,esk292_0,esk291_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_20,plain,
    ( join_commut(X1,X2,X3) = join_commut(X1,X3,X2)
    | empty_carrier(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ element(X2,the_carrier(X1))
    | ~ join_semilatt_str(X1)
    | ~ join_commutative(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_21,negated_conjecture,
    ( join_commut(esk290_0,X1,esk292_0) = join(esk290_0,X1,esk292_0)
    | ~ element(X1,the_carrier(esk290_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_9]),c_0_10]),c_0_15])]),c_0_11]) ).

cnf(c_0_22,negated_conjecture,
    join(esk290_0,esk291_0,esk292_0) = esk292_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_12])]) ).

cnf(c_0_23,negated_conjecture,
    ( join_commut(esk290_0,X1,esk291_0) = join(esk290_0,X1,esk291_0)
    | ~ element(X1,the_carrier(esk290_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_10]),c_0_15])]),c_0_11]) ).

cnf(c_0_24,negated_conjecture,
    join(esk290_0,esk292_0,esk291_0) = esk291_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_9])]) ).

cnf(c_0_25,negated_conjecture,
    ( join_commut(esk290_0,X1,esk292_0) = join_commut(esk290_0,esk292_0,X1)
    | ~ element(X1,the_carrier(esk290_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_9]),c_0_10]),c_0_15])]),c_0_11]) ).

cnf(c_0_26,negated_conjecture,
    join_commut(esk290_0,esk291_0,esk292_0) = esk292_0,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_12]),c_0_22]) ).

cnf(c_0_27,negated_conjecture,
    join_commut(esk290_0,esk292_0,esk291_0) = esk291_0,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_9]),c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    esk291_0 != esk292_0,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_12]),c_0_26]),c_0_27]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : SEU305+2 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.15  % Command  : run_ET %s %d
% 0.14/0.36  % Computer : n010.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Mon Jun 20 12:11:22 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.46/23.46  eprover: CPU time limit exceeded, terminating
% 0.46/23.47  eprover: CPU time limit exceeded, terminating
% 0.46/23.48  eprover: CPU time limit exceeded, terminating
% 0.46/23.51  eprover: CPU time limit exceeded, terminating
% 0.64/46.48  eprover: CPU time limit exceeded, terminating
% 0.64/46.49  eprover: CPU time limit exceeded, terminating
% 0.64/46.52  eprover: CPU time limit exceeded, terminating
% 0.64/46.52  eprover: CPU time limit exceeded, terminating
% 0.64/47.82  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.64/47.82  
% 0.64/47.82  # Failure: Resource limit exceeded (time)
% 0.64/47.82  # OLD status Res
% 0.64/47.82  # Preprocessing time       : 0.123 s
% 0.64/47.82  # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.64/47.82  
% 0.64/47.82  # Failure: Resource limit exceeded (time)
% 0.64/47.82  # OLD status Res
% 0.64/47.82  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.64/47.82  # Preprocessing time       : 0.021 s
% 0.64/47.82  # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.64/47.82  # Preprocessing time       : 0.068 s
% 0.64/47.82  
% 0.64/47.82  # Proof found!
% 0.64/47.82  # SZS status Theorem
% 0.64/47.82  # SZS output start CNFRefutation
% See solution above
% 0.64/47.82  # Proof object total steps             : 30
% 0.64/47.82  # Proof object clause steps            : 21
% 0.64/47.82  # Proof object formula steps           : 9
% 0.64/47.82  # Proof object conjectures             : 21
% 0.64/47.82  # Proof object clause conjectures      : 18
% 0.64/47.82  # Proof object formula conjectures     : 3
% 0.64/47.82  # Proof object initial clauses used    : 11
% 0.64/47.82  # Proof object initial formulas used   : 4
% 0.64/47.82  # Proof object generating inferences   : 10
% 0.64/47.82  # Proof object simplifying inferences  : 27
% 0.64/47.82  # Training examples: 0 positive, 0 negative
% 0.64/47.82  # Parsed axioms                        : 454
% 0.64/47.82  # Removed by relevancy pruning/SinE    : 0
% 0.64/47.82  # Initial clauses                      : 1784
% 0.64/47.82  # Removed in clause preprocessing      : 40
% 0.64/47.82  # Initial clauses in saturation        : 1744
% 0.64/47.82  # Processed clauses                    : 3196
% 0.64/47.82  # ...of these trivial                  : 183
% 0.64/47.82  # ...subsumed                          : 372
% 0.64/47.82  # ...remaining for further processing  : 2641
% 0.64/47.82  # Other redundant clauses eliminated   : 279
% 0.64/47.82  # Clauses deleted for lack of memory   : 0
% 0.64/47.82  # Backward-subsumed                    : 30
% 0.64/47.82  # Backward-rewritten                   : 163
% 0.64/47.82  # Generated clauses                    : 46145
% 0.64/47.82  # ...of the previous two non-trivial   : 43954
% 0.64/47.82  # Contextual simplify-reflections      : 245
% 0.64/47.82  # Paramodulations                      : 45733
% 0.64/47.82  # Factorizations                       : 17
% 0.64/47.82  # Equation resolutions                 : 442
% 0.64/47.82  # Current number of processed clauses  : 2312
% 0.64/47.82  #    Positive orientable unit clauses  : 566
% 0.64/47.82  #    Positive unorientable unit clauses: 3
% 0.64/47.82  #    Negative unit clauses             : 58
% 0.64/47.82  #    Non-unit-clauses                  : 1685
% 0.64/47.82  # Current number of unprocessed clauses: 32729
% 0.64/47.82  # ...number of literals in the above   : 162285
% 0.64/47.82  # Current number of archived formulas  : 0
% 0.64/47.82  # Current number of archived clauses   : 198
% 0.64/47.82  # Clause-clause subsumption calls (NU) : 1223848
% 0.64/47.82  # Rec. Clause-clause subsumption calls : 131218
% 0.64/47.82  # Non-unit clause-clause subsumptions  : 560
% 0.64/47.82  # Unit Clause-clause subsumption calls : 49668
% 0.64/47.82  # Rewrite failures with RHS unbound    : 0
% 0.64/47.82  # BW rewrite match attempts            : 341
% 0.64/47.82  # BW rewrite match successes           : 114
% 0.64/47.82  # Condensation attempts                : 0
% 0.64/47.82  # Condensation successes               : 0
% 0.64/47.82  # Termbank termtop insertions          : 1096350
% 0.64/47.82  
% 0.64/47.82  # -------------------------------------------------
% 0.64/47.82  # User time                : 0.905 s
% 0.64/47.82  # System time              : 0.033 s
% 0.64/47.82  # Total time               : 0.938 s
% 0.64/47.82  # Maximum resident set size: 44200 pages
% 0.64/69.51  eprover: CPU time limit exceeded, terminating
% 0.64/69.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.64/69.52  eprover: No such file or directory
% 0.64/69.53  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.64/69.53  eprover: No such file or directory
% 0.64/69.53  eprover: CPU time limit exceeded, terminating
% 0.64/69.54  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.64/69.54  eprover: No such file or directory
% 0.64/69.54  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.64/69.54  eprover: No such file or directory
% 0.64/69.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.64/69.55  eprover: No such file or directory
% 0.64/69.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.64/69.55  eprover: No such file or directory
% 0.64/69.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.64/69.55  eprover: No such file or directory
% 0.64/69.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.64/69.55  eprover: No such file or directory
% 0.64/69.56  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.64/69.56  eprover: No such file or directory
% 0.64/69.56  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.64/69.56  eprover: No such file or directory
% 0.64/69.56  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.64/69.56  eprover: No such file or directory
% 0.64/69.56  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.64/69.56  eprover: No such file or directory
% 0.64/69.57  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.64/69.57  eprover: No such file or directory
% 0.64/69.57  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.64/69.57  eprover: No such file or directory
% 0.64/69.57  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.64/69.57  eprover: No such file or directory
% 0.64/69.58  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.64/69.58  eprover: No such file or directory
% 0.64/69.58  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.64/69.58  eprover: No such file or directory
%------------------------------------------------------------------------------