TSTP Solution File: REL037+2 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : REL037+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% 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 : Mon Jul 18 19:13:42 EDT 2022

% Result   : Theorem 189.42s 25.22s
% Output   : CNFRefutation 189.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   69 (  69 unt;   0 nHn;   9 RR)
%            Number of literals    :   69 (  68 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :  108 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_7) ).

cnf(i_0_6,plain,
    converse(converse(X1)) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_6) ).

cnf(i_0_3,plain,
    composition(X1,one) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_3) ).

cnf(i_0_5,plain,
    join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_5) ).

cnf(i_0_13,plain,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_13) ).

cnf(i_0_9,plain,
    join(X1,complement(X1)) = top,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_9) ).

cnf(i_0_14,plain,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_14) ).

cnf(i_0_15,plain,
    join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_15) ).

cnf(i_0_10,plain,
    complement(join(complement(X1),complement(complement(X1)))) = zero,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_10) ).

cnf(i_0_12,negated_conjecture,
    composition(esk1_0,top) = esk1_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_12) ).

cnf(i_0_4,plain,
    join(converse(X1),converse(X2)) = converse(join(X1,X2)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_4) ).

cnf(i_0_2,plain,
    join(composition(X1,X2),composition(X3,X2)) = composition(join(X1,X3),X2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_2) ).

cnf(i_0_11,negated_conjecture,
    composition(complement(join(complement(esk2_0),complement(converse(esk1_0)))),complement(join(complement(esk1_0),complement(esk3_0)))) != composition(complement(join(complement(esk2_0),complement(converse(esk1_0)))),esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yx2o5rul/input.p',i_0_11) ).

cnf(c_0_29,plain,
    composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
    i_0_7 ).

cnf(c_0_30,plain,
    converse(converse(X1)) = X1,
    i_0_6 ).

cnf(c_0_31,plain,
    converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_32,plain,
    composition(X1,one) = X1,
    i_0_3 ).

cnf(c_0_33,plain,
    composition(converse(one),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_30]) ).

cnf(c_0_34,plain,
    join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
    i_0_5 ).

cnf(c_0_35,plain,
    join(X1,X2) = join(X2,X1),
    i_0_13 ).

cnf(c_0_36,plain,
    converse(one) = one,
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_37,plain,
    join(X1,complement(X1)) = top,
    i_0_9 ).

cnf(c_0_38,plain,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    i_0_14 ).

cnf(c_0_39,plain,
    join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
    inference(rw,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_40,plain,
    composition(one,X1) = X1,
    inference(rw,[status(thm)],[c_0_33,c_0_36]) ).

cnf(c_0_41,plain,
    join(X1,join(X2,complement(join(X1,X2)))) = top,
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,plain,
    join(complement(X1),complement(X1)) = complement(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36]),c_0_40]) ).

cnf(c_0_43,plain,
    join(top,complement(X1)) = top,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_37]),c_0_35]) ).

cnf(c_0_44,plain,
    join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
    i_0_15 ).

cnf(c_0_45,plain,
    complement(join(complement(X1),complement(complement(X1)))) = zero,
    i_0_10 ).

cnf(c_0_46,plain,
    join(X1,top) = top,
    inference(spm,[status(thm)],[c_0_41,c_0_43]) ).

cnf(c_0_47,plain,
    join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
    inference(rw,[status(thm)],[c_0_44,c_0_35]) ).

cnf(c_0_48,plain,
    join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
    inference(spm,[status(thm)],[c_0_35,c_0_38]) ).

cnf(c_0_49,plain,
    complement(top) = zero,
    inference(rw,[status(thm)],[c_0_45,c_0_37]) ).

cnf(c_0_50,plain,
    join(top,X1) = top,
    inference(spm,[status(thm)],[c_0_35,c_0_46]) ).

cnf(c_0_51,plain,
    join(complement(X1),complement(join(complement(X2),join(complement(X1),complement(join(complement(X1),X2)))))) = join(complement(X1),X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_47]),c_0_48]),c_0_35]),c_0_35]) ).

cnf(c_0_52,plain,
    join(zero,complement(join(zero,complement(X1)))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_49]),c_0_35]),c_0_50]),c_0_49]),c_0_35]) ).

cnf(c_0_53,plain,
    join(zero,complement(X1)) = complement(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_42]),c_0_37]),c_0_46]),c_0_49]),c_0_35]) ).

cnf(c_0_54,plain,
    complement(complement(X1)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_53]) ).

cnf(c_0_55,plain,
    join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_35]),c_0_38]) ).

cnf(c_0_56,plain,
    join(X1,X1) = X1,
    inference(spm,[status(thm)],[c_0_42,c_0_54]) ).

cnf(c_0_57,plain,
    join(X1,join(X1,X2)) = join(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_38]),c_0_56]) ).

cnf(c_0_58,negated_conjecture,
    composition(esk1_0,top) = esk1_0,
    i_0_12 ).

cnf(c_0_59,plain,
    join(X1,complement(join(complement(X1),X2))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_47]),c_0_35]) ).

cnf(c_0_60,negated_conjecture,
    join(zero,composition(converse(esk1_0),complement(esk1_0))) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_58]),c_0_49]),c_0_49]) ).

cnf(c_0_61,plain,
    join(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_62,plain,
    join(complement(X1),complement(join(X1,X2))) = complement(X1),
    inference(spm,[status(thm)],[c_0_59,c_0_54]) ).

cnf(c_0_63,plain,
    join(X1,join(X2,X1)) = join(X2,X1),
    inference(spm,[status(thm)],[c_0_48,c_0_56]) ).

cnf(c_0_64,plain,
    join(converse(X1),converse(X2)) = converse(join(X1,X2)),
    i_0_4 ).

cnf(c_0_65,plain,
    join(composition(X1,X2),composition(X3,X2)) = composition(join(X1,X3),X2),
    i_0_2 ).

cnf(c_0_66,negated_conjecture,
    composition(converse(esk1_0),complement(esk1_0)) = zero,
    inference(rw,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_67,plain,
    join(complement(join(X1,complement(X2))),complement(join(complement(X2),complement(X1)))) = X2,
    inference(spm,[status(thm)],[c_0_47,c_0_35]) ).

cnf(c_0_68,plain,
    join(complement(join(complement(X1),X2)),join(X3,complement(join(complement(X1),complement(X2))))) = join(X3,X1),
    inference(spm,[status(thm)],[c_0_55,c_0_47]) ).

cnf(c_0_69,plain,
    join(complement(X1),complement(join(X2,X1))) = complement(X1),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_70,plain,
    converse(join(composition(converse(X1),X2),X3)) = join(composition(converse(X2),X1),converse(X3)),
    inference(spm,[status(thm)],[c_0_64,c_0_31]) ).

cnf(c_0_71,plain,
    join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
    inference(spm,[status(thm)],[c_0_65,c_0_29]) ).

cnf(c_0_72,plain,
    composition(join(converse(esk1_0),X1),complement(esk1_0)) = composition(X1,complement(esk1_0)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_61]) ).

cnf(c_0_73,plain,
    join(X1,complement(join(X2,complement(X1)))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_67]),c_0_35]) ).

cnf(c_0_74,plain,
    join(X1,complement(join(complement(X2),X1))) = join(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_54]),c_0_54]),c_0_35]) ).

cnf(c_0_75,plain,
    join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_64]),c_0_29]),c_0_30]),c_0_30]),c_0_30]) ).

cnf(c_0_76,plain,
    composition(complement(join(X1,complement(converse(esk1_0)))),complement(esk1_0)) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_66]) ).

cnf(c_0_77,plain,
    join(X1,complement(join(X2,X1))) = join(X1,complement(X2)),
    inference(spm,[status(thm)],[c_0_74,c_0_54]) ).

cnf(c_0_78,plain,
    join(X1,join(X2,complement(join(X2,X1)))) = top,
    inference(spm,[status(thm)],[c_0_41,c_0_35]) ).

cnf(c_0_79,plain,
    join(X1,zero) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_37]),c_0_49]),c_0_42]),c_0_54]) ).

cnf(c_0_80,plain,
    composition(complement(join(X1,complement(converse(esk1_0)))),join(complement(esk1_0),X2)) = composition(complement(join(X1,complement(converse(esk1_0)))),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_61]) ).

cnf(c_0_81,plain,
    join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_49]),c_0_38]),c_0_79]),c_0_38]),c_0_35]),c_0_69]) ).

cnf(c_0_82,negated_conjecture,
    composition(complement(join(complement(esk2_0),complement(converse(esk1_0)))),complement(join(complement(esk1_0),complement(esk3_0)))) != composition(complement(join(complement(esk2_0),complement(converse(esk1_0)))),esk3_0),
    i_0_11 ).

cnf(c_0_83,plain,
    composition(complement(join(X1,complement(converse(esk1_0)))),complement(join(complement(esk1_0),X2))) = composition(complement(join(X1,complement(converse(esk1_0)))),complement(X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_80]) ).

cnf(c_0_84,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83]),c_0_54])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : REL037+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n020.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Fri Jul  8 12:31:30 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.20/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 189.42/25.22  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 189.42/25.22  # Version: 2.1pre011
% 189.42/25.22  # Preprocessing time       : 0.017 s
% 189.42/25.22  
% 189.42/25.22  # Proof found!
% 189.42/25.22  # SZS status Theorem
% 189.42/25.22  # SZS output start CNFRefutation
% See solution above
% 189.42/25.22  # Proof object total steps             : 69
% 189.42/25.22  # Proof object clause steps            : 56
% 189.42/25.22  # Proof object formula steps           : 13
% 189.42/25.22  # Proof object conjectures             : 7
% 189.42/25.22  # Proof object clause conjectures      : 5
% 189.42/25.22  # Proof object formula conjectures     : 2
% 189.42/25.22  # Proof object initial clauses used    : 13
% 189.42/25.22  # Proof object initial formulas used   : 13
% 189.42/25.22  # Proof object generating inferences   : 36
% 189.42/25.22  # Proof object simplifying inferences  : 54
% 189.42/25.22  # Training examples: 0 positive, 0 negative
% 189.42/25.22  # Parsed axioms                        : 17
% 189.42/25.22  # Removed by relevancy pruning/SinE    : 0
% 189.42/25.22  # Initial clauses                      : 17
% 189.42/25.22  # Removed in clause preprocessing      : 0
% 189.42/25.22  # Initial clauses in saturation        : 17
% 189.42/25.22  # Processed clauses                    : 6494
% 189.42/25.22  # ...of these trivial                  : 3818
% 189.42/25.22  # ...subsumed                          : 634
% 189.42/25.22  # ...remaining for further processing  : 2042
% 189.42/25.22  # Other redundant clauses eliminated   : 0
% 189.42/25.22  # Clauses deleted for lack of memory   : 0
% 189.42/25.22  # Backward-subsumed                    : 0
% 189.42/25.22  # Backward-rewritten                   : 578
% 189.42/25.22  # Generated clauses                    : 684150
% 189.42/25.22  # ...of the previous two non-trivial   : 538146
% 189.42/25.22  # Contextual simplify-reflections      : 0
% 189.42/25.22  # Paramodulations                      : 684150
% 189.42/25.22  # Factorizations                       : 0
% 189.42/25.22  # Equation resolutions                 : 0
% 189.42/25.22  # Propositional unsat checks           : 0
% 189.42/25.22  # Propositional unsat check successes  : 0
% 189.42/25.22  # Current number of processed clauses  : 1464
% 189.42/25.22  #    Positive orientable unit clauses  : 1452
% 189.42/25.22  #    Positive unorientable unit clauses: 12
% 189.42/25.22  #    Negative unit clauses             : 0
% 189.42/25.22  #    Non-unit-clauses                  : 0
% 189.42/25.22  # Current number of unprocessed clauses: 439375
% 189.42/25.22  # ...number of literals in the above   : 439375
% 189.42/25.22  # Current number of archived formulas  : 0
% 189.42/25.22  # Current number of archived clauses   : 578
% 189.42/25.22  # Clause-clause subsumption calls (NU) : 0
% 189.42/25.22  # Rec. Clause-clause subsumption calls : 0
% 189.42/25.22  # Non-unit clause-clause subsumptions  : 0
% 189.42/25.22  # Unit Clause-clause subsumption calls : 176
% 189.42/25.22  # Rewrite failures with RHS unbound    : 0
% 189.42/25.22  # BW rewrite match attempts            : 47947
% 189.42/25.22  # BW rewrite match successes           : 530
% 189.42/25.22  # Condensation attempts                : 0
% 189.42/25.22  # Condensation successes               : 0
% 189.42/25.22  # Termbank termtop insertions          : 33572744
% 189.42/25.22  
% 189.42/25.22  # -------------------------------------------------
% 189.42/25.22  # User time                : 21.794 s
% 189.42/25.22  # System time              : 0.591 s
% 189.42/25.22  # Total time               : 22.385 s
% 189.42/25.22  # ...preprocessing         : 0.017 s
% 189.42/25.22  # ...main loop             : 22.368 s
% 189.42/25.22  # Maximum resident set size: 904176 pages
% 189.42/25.22  
%------------------------------------------------------------------------------