%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : REL008+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : Mon Jul 18 19:12:55 EDT 2022
% Result : Theorem 11.69s 2.91s
% Output : CNFRefutation 11.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of clauses : 60 ( 56 unt; 0 nHn; 13 RR)
% Number of literals : 64 ( 63 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 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 : 83 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bn0zrjeq/input.p',i_0_7) ).
cnf(i_0_6,plain,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bn0zrjeq/input.p',i_0_6) ).
cnf(i_0_3,plain,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bn0zrjeq/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/sandbox2/tmp/enigma-theBenchmark.p-bn0zrjeq/input.p',i_0_5) ).
cnf(i_0_11,plain,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bn0zrjeq/input.p',i_0_11) ).
cnf(i_0_9,plain,
complement(join(complement(X1),complement(complement(X1)))) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bn0zrjeq/input.p',i_0_9) ).
cnf(i_0_8,plain,
join(X1,complement(X1)) = top,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bn0zrjeq/input.p',i_0_8) ).
cnf(i_0_13,plain,
join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bn0zrjeq/input.p',i_0_13) ).
cnf(i_0_12,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bn0zrjeq/input.p',i_0_12) ).
cnf(i_0_2,plain,
join(composition(X1,X2),composition(X3,X2)) = composition(join(X1,X3),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bn0zrjeq/input.p',i_0_2) ).
cnf(i_0_4,plain,
join(converse(X1),converse(X2)) = converse(join(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bn0zrjeq/input.p',i_0_4) ).
cnf(i_0_10,negated_conjecture,
( join(join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),composition(esk1_0,join(esk2_0,esk3_0))) != composition(esk1_0,join(esk2_0,esk3_0))
| join(join(composition(esk1_0,join(esk2_0,esk3_0)),composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0)) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bn0zrjeq/input.p',i_0_10) ).
cnf(c_0_26,plain,
composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
i_0_7 ).
cnf(c_0_27,plain,
converse(converse(X1)) = X1,
i_0_6 ).
cnf(c_0_28,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
composition(X1,one) = X1,
i_0_3 ).
cnf(c_0_30,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
i_0_5 ).
cnf(c_0_31,plain,
join(X1,X2) = join(X2,X1),
i_0_11 ).
cnf(c_0_32,plain,
complement(join(complement(X1),complement(complement(X1)))) = zero,
i_0_9 ).
cnf(c_0_33,plain,
join(X1,complement(X1)) = top,
i_0_8 ).
cnf(c_0_34,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27]) ).
cnf(c_0_35,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_29,c_0_34]) ).
cnf(c_0_38,plain,
join(zero,composition(converse(X1),complement(composition(X1,top)))) = zero,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_34,c_0_37]) ).
cnf(c_0_40,plain,
join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
i_0_13 ).
cnf(c_0_41,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
i_0_12 ).
cnf(c_0_42,plain,
join(zero,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_37]),c_0_36]),c_0_39]) ).
cnf(c_0_43,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_40,c_0_31]) ).
cnf(c_0_44,plain,
join(complement(one),composition(converse(X1),complement(X1))) = complement(one),
inference(spm,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_45,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
join(zero,complement(join(complement(X1),complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_33]),c_0_36]),c_0_31]) ).
cnf(c_0_47,plain,
join(complement(one),complement(one)) = complement(one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_37]),c_0_39]) ).
cnf(c_0_48,plain,
join(composition(X1,X2),composition(X3,X2)) = composition(join(X1,X3),X2),
i_0_2 ).
cnf(c_0_49,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
join(zero,complement(complement(one))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_47]),c_0_33]),c_0_36]),c_0_31]) ).
cnf(c_0_51,plain,
join(converse(X1),converse(X2)) = converse(join(X1,X2)),
i_0_4 ).
cnf(c_0_52,plain,
join(X1,composition(X2,X1)) = composition(join(one,X2),X1),
inference(spm,[status(thm)],[c_0_48,c_0_39]) ).
cnf(c_0_53,plain,
complement(join(complement(X1),complement(X1))) = X1,
inference(rw,[status(thm)],[c_0_46,c_0_49]) ).
cnf(c_0_54,plain,
complement(complement(one)) = one,
inference(rw,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_55,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_51,c_0_27]) ).
cnf(c_0_56,plain,
join(X1,X1) = composition(join(one,one),X1),
inference(spm,[status(thm)],[c_0_52,c_0_39]) ).
cnf(c_0_57,plain,
converse(composition(X1,converse(X2))) = composition(X2,converse(X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_58,plain,
converse(join(one,X1)) = join(one,converse(X1)),
inference(spm,[status(thm)],[c_0_51,c_0_37]) ).
cnf(c_0_59,plain,
complement(join(one,one)) = complement(one),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
composition(X1,join(one,one)) = join(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58]),c_0_37]),c_0_27]) ).
cnf(c_0_61,plain,
join(one,one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_59]),c_0_43]) ).
cnf(c_0_62,negated_conjecture,
( join(join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),composition(esk1_0,join(esk2_0,esk3_0))) != composition(esk1_0,join(esk2_0,esk3_0))
| join(join(composition(esk1_0,join(esk2_0,esk3_0)),composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0)) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)) ),
i_0_10 ).
cnf(c_0_63,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_31]),c_0_41]) ).
cnf(c_0_64,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61]),c_0_29]) ).
cnf(c_0_65,negated_conjecture,
( join(composition(esk1_0,esk3_0),join(composition(esk1_0,esk2_0),composition(esk1_0,join(esk2_0,esk3_0)))) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))
| join(composition(esk1_0,join(esk2_0,esk3_0)),join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))) != composition(esk1_0,join(esk2_0,esk3_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_31]),c_0_31]),c_0_31]) ).
cnf(c_0_66,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_31,c_0_41]) ).
cnf(c_0_67,plain,
converse(join(X1,composition(converse(X2),X3))) = join(converse(X1),composition(converse(X3),X2)),
inference(spm,[status(thm)],[c_0_51,c_0_28]) ).
cnf(c_0_68,plain,
join(converse(composition(X1,X2)),composition(X3,converse(X1))) = composition(join(converse(X2),X3),converse(X1)),
inference(spm,[status(thm)],[c_0_48,c_0_26]) ).
cnf(c_0_69,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_41]),c_0_64]) ).
cnf(c_0_70,negated_conjecture,
( join(composition(esk1_0,esk2_0),join(composition(esk1_0,esk3_0),composition(esk1_0,join(esk2_0,esk3_0)))) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))
| join(composition(esk1_0,esk2_0),join(composition(esk1_0,esk3_0),composition(esk1_0,join(esk2_0,esk3_0)))) != composition(esk1_0,join(esk2_0,esk3_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_31]),c_0_66]) ).
cnf(c_0_71,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_67,c_0_68]),c_0_51]),c_0_26]),c_0_27]),c_0_27]),c_0_27]) ).
cnf(c_0_72,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_66,c_0_69]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71]),c_0_72]),c_0_31]),c_0_71]),c_0_69]),c_0_71]),c_0_71]),c_0_72]),c_0_31]),c_0_71]),c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : REL008+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n010.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 09:10:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.41 # ENIGMATIC: Selected SinE mode:
% 0.17/0.42 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.42 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.17/0.42 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.17/0.42 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.69/2.91 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 11.69/2.91 # Version: 2.1pre011
% 11.69/2.91 # Preprocessing time : 0.025 s
% 11.69/2.91
% 11.69/2.91 # Proof found!
% 11.69/2.91 # SZS status Theorem
% 11.69/2.91 # SZS output start CNFRefutation
% See solution above
% 11.69/2.91 # Proof object total steps : 60
% 11.69/2.91 # Proof object clause steps : 48
% 11.69/2.91 # Proof object formula steps : 12
% 11.69/2.91 # Proof object conjectures : 5
% 11.69/2.91 # Proof object clause conjectures : 4
% 11.69/2.91 # Proof object formula conjectures : 1
% 11.69/2.91 # Proof object initial clauses used : 12
% 11.69/2.91 # Proof object initial formulas used : 12
% 11.69/2.91 # Proof object generating inferences : 26
% 11.69/2.91 # Proof object simplifying inferences : 49
% 11.69/2.91 # Training examples: 0 positive, 0 negative
% 11.69/2.91 # Parsed axioms : 13
% 11.69/2.91 # Removed by relevancy pruning/SinE : 0
% 11.69/2.91 # Initial clauses : 13
% 11.69/2.91 # Removed in clause preprocessing : 0
% 11.69/2.91 # Initial clauses in saturation : 13
% 11.69/2.91 # Processed clauses : 289
% 11.69/2.91 # ...of these trivial : 61
% 11.69/2.91 # ...subsumed : 83
% 11.69/2.91 # ...remaining for further processing : 145
% 11.69/2.91 # Other redundant clauses eliminated : 0
% 11.69/2.91 # Clauses deleted for lack of memory : 0
% 11.69/2.91 # Backward-subsumed : 0
% 11.69/2.91 # Backward-rewritten : 70
% 11.69/2.91 # Generated clauses : 3837
% 11.69/2.91 # ...of the previous two non-trivial : 3136
% 11.69/2.91 # Contextual simplify-reflections : 0
% 11.69/2.91 # Paramodulations : 3837
% 11.69/2.91 # Factorizations : 0
% 11.69/2.91 # Equation resolutions : 0
% 11.69/2.91 # Propositional unsat checks : 0
% 11.69/2.91 # Propositional unsat check successes : 0
% 11.69/2.91 # Current number of processed clauses : 75
% 11.69/2.91 # Positive orientable unit clauses : 69
% 11.69/2.91 # Positive unorientable unit clauses: 6
% 11.69/2.91 # Negative unit clauses : 0
% 11.69/2.91 # Non-unit-clauses : 0
% 11.69/2.91 # Current number of unprocessed clauses: 1760
% 11.69/2.91 # ...number of literals in the above : 1760
% 11.69/2.91 # Current number of archived formulas : 0
% 11.69/2.91 # Current number of archived clauses : 70
% 11.69/2.91 # Clause-clause subsumption calls (NU) : 0
% 11.69/2.91 # Rec. Clause-clause subsumption calls : 0
% 11.69/2.91 # Non-unit clause-clause subsumptions : 0
% 11.69/2.91 # Unit Clause-clause subsumption calls : 10
% 11.69/2.91 # Rewrite failures with RHS unbound : 0
% 11.69/2.91 # BW rewrite match attempts : 485
% 11.69/2.91 # BW rewrite match successes : 107
% 11.69/2.91 # Condensation attempts : 0
% 11.69/2.91 # Condensation successes : 0
% 11.69/2.91 # Termbank termtop insertions : 46975
% 11.69/2.91
% 11.69/2.91 # -------------------------------------------------
% 11.69/2.91 # User time : 0.074 s
% 11.69/2.91 # System time : 0.007 s
% 11.69/2.91 # Total time : 0.081 s
% 11.69/2.91 # ...preprocessing : 0.025 s
% 11.69/2.91 # ...main loop : 0.056 s
% 11.69/2.91 # Maximum resident set size: 7356 pages
% 11.69/2.91
%------------------------------------------------------------------------------