TSTP Solution File: LCL896+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : LCL896+1 : TPTP v8.1.0. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n020.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 : Sun Jul 17 10:18:30 EDT 2022

% Result   : Theorem 0.68s 69.86s
% Output   : CNFRefutation 0.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   51 (  37 unt;   0 def)
%            Number of atoms       :   70 (  27 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   35 (  16   ~;  13   |;   2   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :  105 (  11 sgn  51   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(sos_03,axiom,
    ! [X1] : '+'(X1,'0') = X1,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_03) ).

fof(sos_02,axiom,
    ! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_02) ).

fof(sos_09,axiom,
    ! [X12,X13,X14] :
      ( '>='(X12,X13)
     => '>='('+'(X12,X14),'+'(X13,X14)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_09) ).

fof(sos_08,axiom,
    ! [X1] : '>='(X1,'0'),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_08) ).

fof(sos_06,axiom,
    ! [X7,X8] :
      ( ( '>='(X7,X8)
        & '>='(X8,X7) )
     => X7 = X8 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_06) ).

fof(sos_07,axiom,
    ! [X9,X10,X11] :
      ( '>='('+'(X9,X10),X11)
    <=> '>='(X10,'==>'(X9,X11)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_07) ).

fof(sos_11,axiom,
    ! [X18,X19,X20] :
      ( '>='(X18,X19)
     => '>='('==>'(X20,X18),'==>'(X20,X19)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_11) ).

fof(sos_12,axiom,
    ! [X1,X2,X3] : '+'('+'(X1,'==>'(X1,X2)),'==>'('+'(X1,'==>'(X1,X2)),X3)) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_12) ).

fof(sos_01,axiom,
    ! [X1,X2,X3] : '+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_01) ).

fof(sos_04,axiom,
    ! [X1] : '>='(X1,X1),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_04) ).

fof(goals_13,conjecture,
    ! [X21,X22] : '+'(X21,'==>'(X21,X22)) = '+'(X22,'==>'(X22,X21)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',goals_13) ).

fof(c_0_11,plain,
    ! [X2] : '+'(X2,'0') = X2,
    inference(variable_rename,[status(thm)],[sos_03]) ).

fof(c_0_12,plain,
    ! [X3,X4] : '+'(X3,X4) = '+'(X4,X3),
    inference(variable_rename,[status(thm)],[sos_02]) ).

fof(c_0_13,plain,
    ! [X15,X16,X17] :
      ( ~ '>='(X15,X16)
      | '>='('+'(X15,X17),'+'(X16,X17)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])])]) ).

fof(c_0_14,plain,
    ! [X2] : '>='(X2,'0'),
    inference(variable_rename,[status(thm)],[sos_08]) ).

cnf(c_0_15,plain,
    '+'(X1,'0') = X1,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,plain,
    '+'(X1,X2) = '+'(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    ( '>='('+'(X1,X2),'+'(X3,X2))
    | ~ '>='(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,plain,
    '>='(X1,'0'),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_19,plain,
    '+'('0',X1) = X1,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

fof(c_0_20,plain,
    ! [X9,X10] :
      ( ~ '>='(X9,X10)
      | ~ '>='(X10,X9)
      | X9 = X10 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])]) ).

fof(c_0_21,plain,
    ! [X12,X13,X14,X12,X13,X14] :
      ( ( ~ '>='('+'(X12,X13),X14)
        | '>='(X13,'==>'(X12,X14)) )
      & ( ~ '>='(X13,'==>'(X12,X14))
        | '>='('+'(X12,X13),X14) ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).

cnf(c_0_22,plain,
    '>='('+'(X1,X2),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

fof(c_0_23,plain,
    ! [X21,X22,X23] :
      ( ~ '>='(X21,X22)
      | '>='('==>'(X23,X21),'==>'(X23,X22)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_11])])])]) ).

cnf(c_0_24,plain,
    ( X1 = X2
    | ~ '>='(X2,X1)
    | ~ '>='(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_25,plain,
    ( '>='(X1,'==>'(X2,X3))
    | ~ '>='('+'(X2,X1),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_26,plain,
    '>='('+'(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_22,c_0_16]) ).

cnf(c_0_27,plain,
    ( '>='('==>'(X1,X2),'==>'(X1,X3))
    | ~ '>='(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_28,plain,
    ( '0' = X1
    | ~ '>='('0',X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_18]) ).

cnf(c_0_29,plain,
    '>='(X1,'==>'(X2,X2)),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    '>='('==>'(X1,'+'(X2,X3)),'==>'(X1,X3)),
    inference(spm,[status(thm)],[c_0_27,c_0_22]) ).

cnf(c_0_31,plain,
    '==>'(X1,X1) = '0',
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

fof(c_0_32,plain,
    ! [X4,X5,X6] : '+'('+'(X4,'==>'(X4,X5)),'==>'('+'(X4,'==>'(X4,X5)),X6)) = '+'(X4,'==>'(X4,'+'(X5,'==>'(X5,X6)))),
    inference(variable_rename,[status(thm)],[sos_12]) ).

fof(c_0_33,plain,
    ! [X4,X5,X6] : '+'('+'(X4,X5),X6) = '+'(X4,'+'(X5,X6)),
    inference(variable_rename,[status(thm)],[sos_01]) ).

cnf(c_0_34,plain,
    '>='('0','==>'('+'(X1,X2),X2)),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

fof(c_0_35,plain,
    ! [X2] : '>='(X2,X2),
    inference(variable_rename,[status(thm)],[sos_04]) ).

cnf(c_0_36,plain,
    '+'('+'(X1,'==>'(X1,X2)),'==>'('+'(X1,'==>'(X1,X2)),X3)) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_37,plain,
    '+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_38,plain,
    '==>'('+'(X1,X2),X2) = '0',
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_34]),c_0_18])]) ).

cnf(c_0_39,plain,
    ( '>='('+'(X1,X2),X3)
    | ~ '>='(X2,'==>'(X1,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_40,plain,
    '>='(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_41,plain,
    '+'(X1,'+'('==>'(X1,X2),'==>'('+'(X1,'==>'(X1,X2)),X3))) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))),
    inference(rw,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,plain,
    '==>'('+'(X1,X2),X1) = '0',
    inference(spm,[status(thm)],[c_0_38,c_0_16]) ).

fof(c_0_43,negated_conjecture,
    ~ ! [X21,X22] : '+'(X21,'==>'(X21,X22)) = '+'(X22,'==>'(X22,X21)),
    inference(assume_negation,[status(cth)],[goals_13]) ).

cnf(c_0_44,plain,
    '>='('+'(X1,'==>'(X1,X2)),X2),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_45,plain,
    '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X1)))) = '+'(X1,'==>'(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_15]) ).

fof(c_0_46,negated_conjecture,
    '+'(esk1_0,'==>'(esk1_0,esk2_0)) != '+'(esk2_0,'==>'(esk2_0,esk1_0)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])]) ).

cnf(c_0_47,plain,
    '>='('+'(X1,'==>'(X1,X2)),'+'(X2,'==>'(X2,X1))),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_48,negated_conjecture,
    '+'(esk1_0,'==>'(esk1_0,esk2_0)) != '+'(esk2_0,'==>'(esk2_0,esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_49,plain,
    '+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_47]),c_0_47])]) ).

cnf(c_0_50,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : LCL896+1 : TPTP v8.1.0. Released v5.5.0.
% 0.12/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n020.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 : Mon Jul  4 03:27:30 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.37/23.41  eprover: CPU time limit exceeded, terminating
% 0.37/23.41  eprover: CPU time limit exceeded, terminating
% 0.37/23.41  eprover: CPU time limit exceeded, terminating
% 0.37/23.42  eprover: CPU time limit exceeded, terminating
% 0.52/46.43  eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.52/46.43  
% 0.52/46.44  eprover: CPU time limit exceeded, terminating
% 0.52/46.44  eprover: CPU time limit exceeded, terminating
% 0.68/69.44  eprover: CPU time limit exceeded, terminating
% 0.68/69.45  eprover: CPU time limit exceeded, terminating
% 0.68/69.45  eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.68/69.45  
% 0.68/69.86  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.68/69.86  
% 0.68/69.86  # Failure: Resource limit exceeded (time)
% 0.68/69.86  # OLD status Res
% 0.68/69.86  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.68/69.86  # Preprocessing time       : 0.014 s
% 0.68/69.86  # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.68/69.86  
% 0.68/69.86  # Failure: Resource limit exceeded (time)
% 0.68/69.86  # OLD status Res
% 0.68/69.86  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.68/69.86  # Preprocessing time       : 0.007 s
% 0.68/69.86  # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.68/69.86  
% 0.68/69.86  # Failure: Resource limit exceeded (time)
% 0.68/69.86  # OLD status Res
% 0.68/69.86  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.68/69.86  # Preprocessing time       : 0.014 s
% 0.68/69.86  # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.68/69.86  # Preprocessing time       : 0.014 s
% 0.68/69.86  
% 0.68/69.86  # Proof found!
% 0.68/69.86  # SZS status Theorem
% 0.68/69.86  # SZS output start CNFRefutation
% See solution above
% 0.68/69.86  # Proof object total steps             : 51
% 0.68/69.86  # Proof object clause steps            : 28
% 0.68/69.86  # Proof object formula steps           : 23
% 0.68/69.86  # Proof object conjectures             : 5
% 0.68/69.86  # Proof object clause conjectures      : 2
% 0.68/69.86  # Proof object formula conjectures     : 3
% 0.68/69.86  # Proof object initial clauses used    : 12
% 0.68/69.86  # Proof object initial formulas used   : 11
% 0.68/69.86  # Proof object generating inferences   : 14
% 0.68/69.86  # Proof object simplifying inferences  : 9
% 0.68/69.86  # Training examples: 0 positive, 0 negative
% 0.68/69.86  # Parsed axioms                        : 13
% 0.68/69.86  # Removed by relevancy pruning/SinE    : 0
% 0.68/69.86  # Initial clauses                      : 14
% 0.68/69.86  # Removed in clause preprocessing      : 0
% 0.68/69.86  # Initial clauses in saturation        : 14
% 0.68/69.86  # Processed clauses                    : 1467
% 0.68/69.86  # ...of these trivial                  : 913
% 0.68/69.86  # ...subsumed                          : 265
% 0.68/69.86  # ...remaining for further processing  : 289
% 0.68/69.86  # Other redundant clauses eliminated   : 0
% 0.68/69.86  # Clauses deleted for lack of memory   : 0
% 0.68/69.86  # Backward-subsumed                    : 0
% 0.68/69.86  # Backward-rewritten                   : 15
% 0.68/69.86  # Generated clauses                    : 36236
% 0.68/69.86  # ...of the previous two non-trivial   : 12588
% 0.68/69.86  # Contextual simplify-reflections      : 0
% 0.68/69.86  # Paramodulations                      : 36236
% 0.68/69.86  # Factorizations                       : 0
% 0.68/69.86  # Equation resolutions                 : 0
% 0.68/69.86  # Current number of processed clauses  : 274
% 0.68/69.86  #    Positive orientable unit clauses  : 254
% 0.68/69.86  #    Positive unorientable unit clauses: 5
% 0.68/69.86  #    Negative unit clauses             : 0
% 0.68/69.86  #    Non-unit-clauses                  : 15
% 0.68/69.86  # Current number of unprocessed clauses: 10948
% 0.68/69.86  # ...number of literals in the above   : 11516
% 0.68/69.86  # Current number of archived formulas  : 0
% 0.68/69.86  # Current number of archived clauses   : 15
% 0.68/69.86  # Clause-clause subsumption calls (NU) : 187
% 0.68/69.86  # Rec. Clause-clause subsumption calls : 187
% 0.68/69.86  # Non-unit clause-clause subsumptions  : 150
% 0.68/69.86  # Unit Clause-clause subsumption calls : 132
% 0.68/69.86  # Rewrite failures with RHS unbound    : 0
% 0.68/69.86  # BW rewrite match attempts            : 2332
% 0.68/69.86  # BW rewrite match successes           : 80
% 0.68/69.86  # Condensation attempts                : 0
% 0.68/69.86  # Condensation successes               : 0
% 0.68/69.86  # Termbank termtop insertions          : 336690
% 0.68/69.86  
% 0.68/69.86  # -------------------------------------------------
% 0.68/69.86  # User time                : 0.210 s
% 0.68/69.86  # System time              : 0.011 s
% 0.68/69.86  # Total time               : 0.221 s
% 0.68/69.86  # Maximum resident set size: 15468 pages
% 0.68/92.46  eprover: CPU time limit exceeded, terminating
% 0.68/92.47  eprover: CPU time limit exceeded, terminating
% 0.68/92.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.48  eprover: No such file or directory
% 0.68/92.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.48  eprover: No such file or directory
% 0.68/92.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.48  eprover: No such file or directory
% 0.68/92.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.49  eprover: No such file or directory
% 0.68/92.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.49  eprover: No such file or directory
% 0.68/92.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.49  eprover: No such file or directory
% 0.68/92.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.50  eprover: No such file or directory
% 0.68/92.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.50  eprover: No such file or directory
% 0.68/92.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.50  eprover: No such file or directory
% 0.68/92.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.50  eprover: No such file or directory
% 0.68/92.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.51  eprover: No such file or directory
% 0.68/92.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.51  eprover: No such file or directory
% 0.68/92.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.51  eprover: No such file or directory
% 0.68/92.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.52  eprover: No such file or directory
% 0.68/92.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.52  eprover: No such file or directory
% 0.68/92.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.68/92.52  eprover: No such file or directory
%------------------------------------------------------------------------------