TSTP Solution File: REL010+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : REL010+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:00 EDT 2022
% Result : Theorem 11.06s 2.86s
% Output : CNFRefutation 11.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of clauses : 61 ( 61 unt; 0 nHn; 14 RR)
% Number of literals : 61 ( 60 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 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 : 78 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/input.p',i_0_7) ).
cnf(i_0_6,plain,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/input.p',i_0_6) ).
cnf(i_0_3,plain,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/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-i2lvqiph/input.p',i_0_5) ).
cnf(i_0_13,plain,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/input.p',i_0_13) ).
cnf(i_0_10,plain,
complement(join(complement(X1),complement(complement(X1)))) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/input.p',i_0_10) ).
cnf(i_0_9,plain,
join(X1,complement(X1)) = top,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/input.p',i_0_9) ).
cnf(i_0_15,plain,
join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/input.p',i_0_15) ).
cnf(i_0_14,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/input.p',i_0_14) ).
cnf(i_0_4,plain,
join(converse(X1),converse(X2)) = converse(join(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/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/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/input.p',i_0_2) ).
cnf(i_0_17,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3)))) = complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/input.p',i_0_17) ).
cnf(i_0_12,negated_conjecture,
complement(join(complement(composition(esk1_0,esk2_0)),complement(esk3_0))) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/input.p',i_0_12) ).
cnf(i_0_11,negated_conjecture,
complement(join(complement(esk2_0),complement(composition(converse(esk1_0),esk3_0)))) != zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i2lvqiph/input.p',i_0_11) ).
cnf(c_0_32,plain,
composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
i_0_7 ).
cnf(c_0_33,plain,
converse(converse(X1)) = X1,
i_0_6 ).
cnf(c_0_34,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
composition(X1,one) = X1,
i_0_3 ).
cnf(c_0_36,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
i_0_5 ).
cnf(c_0_37,plain,
join(X1,X2) = join(X2,X1),
i_0_13 ).
cnf(c_0_38,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_33]) ).
cnf(c_0_39,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_35,c_0_38]) ).
cnf(c_0_41,plain,
join(complement(X1),complement(composition(one,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_42,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_43,plain,
complement(join(complement(X1),complement(complement(X1)))) = zero,
i_0_10 ).
cnf(c_0_44,plain,
join(X1,complement(X1)) = top,
i_0_9 ).
cnf(c_0_45,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
i_0_15 ).
cnf(c_0_48,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
i_0_14 ).
cnf(c_0_49,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_47,c_0_37]) ).
cnf(c_0_51,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_45]),c_0_44]),c_0_46]),c_0_37]) ).
cnf(c_0_53,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_44,c_0_48]) ).
cnf(c_0_56,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_54]) ).
cnf(c_0_57,plain,
join(converse(X1),converse(X2)) = converse(join(X1,X2)),
i_0_4 ).
cnf(c_0_58,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_44]) ).
cnf(c_0_59,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_57,c_0_33]) ).
cnf(c_0_60,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_37,c_0_58]) ).
cnf(c_0_61,plain,
join(X1,converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_59,c_0_58]) ).
cnf(c_0_62,plain,
composition(converse(X1),complement(composition(X1,top))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_46]),c_0_53]) ).
cnf(c_0_63,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
join(composition(X1,X2),composition(X3,X2)) = composition(join(X1,X3),X2),
i_0_2 ).
cnf(c_0_65,plain,
composition(top,complement(composition(top,top))) = zero,
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3)))) = complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))),
i_0_17 ).
cnf(c_0_67,negated_conjecture,
complement(join(complement(composition(esk1_0,esk2_0)),complement(esk3_0))) = zero,
i_0_12 ).
cnf(c_0_68,plain,
composition(X1,complement(composition(top,top))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_53]),c_0_60]),c_0_65]) ).
cnf(c_0_69,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3))))))))) = complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_37]),c_0_37]) ).
cnf(c_0_70,negated_conjecture,
complement(join(complement(esk3_0),complement(composition(esk1_0,esk2_0)))) = zero,
inference(rw,[status(thm)],[c_0_67,c_0_37]) ).
cnf(c_0_71,plain,
complement(composition(top,top)) = zero,
inference(spm,[status(thm)],[c_0_42,c_0_68]) ).
cnf(c_0_72,plain,
join(complement(join(complement(composition(converse(X1),X2)),complement(X3))),complement(join(complement(X3),complement(composition(converse(X1),complement(join(complement(X2),complement(composition(X1,X3))))))))) = complement(join(complement(X3),complement(composition(converse(X1),complement(join(complement(X2),complement(composition(X1,X3)))))))),
inference(spm,[status(thm)],[c_0_69,c_0_33]) ).
cnf(c_0_73,negated_conjecture,
join(complement(esk3_0),complement(composition(esk1_0,esk2_0))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_70]),c_0_44]) ).
cnf(c_0_74,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[c_0_68,c_0_71]) ).
cnf(c_0_75,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_44,c_0_53]) ).
cnf(c_0_76,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_53]) ).
cnf(c_0_77,negated_conjecture,
complement(join(complement(esk2_0),complement(composition(converse(esk1_0),esk3_0)))) != zero,
i_0_11 ).
cnf(c_0_78,negated_conjecture,
$false,
inference(sr,[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)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_46]),c_0_46]),c_0_37]),c_0_74]),c_0_75]),c_0_58]),c_0_46]),c_0_76]),c_0_74]),c_0_75]),c_0_58]),c_0_46]),c_0_77]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : REL010+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Fri Jul 8 14:30:46 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.22/0.46 # ENIGMATIC: Selected SinE mode:
% 0.22/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.06/2.86 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 11.06/2.86 # Version: 2.1pre011
% 11.06/2.86 # Preprocessing time : 0.018 s
% 11.06/2.86
% 11.06/2.86 # Proof found!
% 11.06/2.86 # SZS status Theorem
% 11.06/2.86 # SZS output start CNFRefutation
% See solution above
% 11.06/2.86 # Proof object total steps : 61
% 11.06/2.86 # Proof object clause steps : 47
% 11.06/2.86 # Proof object formula steps : 14
% 11.06/2.86 # Proof object conjectures : 7
% 11.06/2.86 # Proof object clause conjectures : 5
% 11.06/2.86 # Proof object formula conjectures : 2
% 11.06/2.86 # Proof object initial clauses used : 14
% 11.06/2.86 # Proof object initial formulas used : 14
% 11.06/2.86 # Proof object generating inferences : 24
% 11.06/2.86 # Proof object simplifying inferences : 33
% 11.06/2.86 # Training examples: 0 positive, 0 negative
% 11.06/2.86 # Parsed axioms : 17
% 11.06/2.86 # Removed by relevancy pruning/SinE : 0
% 11.06/2.86 # Initial clauses : 17
% 11.06/2.86 # Removed in clause preprocessing : 0
% 11.06/2.86 # Initial clauses in saturation : 17
% 11.06/2.86 # Processed clauses : 187
% 11.06/2.86 # ...of these trivial : 52
% 11.06/2.86 # ...subsumed : 19
% 11.06/2.86 # ...remaining for further processing : 115
% 11.06/2.86 # Other redundant clauses eliminated : 0
% 11.06/2.86 # Clauses deleted for lack of memory : 0
% 11.06/2.86 # Backward-subsumed : 0
% 11.06/2.86 # Backward-rewritten : 47
% 11.06/2.86 # Generated clauses : 2568
% 11.06/2.86 # ...of the previous two non-trivial : 1844
% 11.06/2.86 # Contextual simplify-reflections : 0
% 11.06/2.86 # Paramodulations : 2568
% 11.06/2.86 # Factorizations : 0
% 11.06/2.86 # Equation resolutions : 0
% 11.06/2.86 # Propositional unsat checks : 0
% 11.06/2.86 # Propositional unsat check successes : 0
% 11.06/2.86 # Current number of processed clauses : 68
% 11.06/2.86 # Positive orientable unit clauses : 64
% 11.06/2.86 # Positive unorientable unit clauses: 3
% 11.06/2.86 # Negative unit clauses : 1
% 11.06/2.86 # Non-unit-clauses : 0
% 11.06/2.86 # Current number of unprocessed clauses: 1174
% 11.06/2.86 # ...number of literals in the above : 1174
% 11.06/2.86 # Current number of archived formulas : 0
% 11.06/2.86 # Current number of archived clauses : 47
% 11.06/2.86 # Clause-clause subsumption calls (NU) : 0
% 11.06/2.86 # Rec. Clause-clause subsumption calls : 0
% 11.06/2.86 # Non-unit clause-clause subsumptions : 0
% 11.06/2.86 # Unit Clause-clause subsumption calls : 10
% 11.06/2.86 # Rewrite failures with RHS unbound : 0
% 11.06/2.86 # BW rewrite match attempts : 227
% 11.06/2.86 # BW rewrite match successes : 69
% 11.06/2.86 # Condensation attempts : 0
% 11.06/2.86 # Condensation successes : 0
% 11.06/2.86 # Termbank termtop insertions : 49896
% 11.06/2.86
% 11.06/2.86 # -------------------------------------------------
% 11.06/2.86 # User time : 0.047 s
% 11.06/2.86 # System time : 0.004 s
% 11.06/2.86 # Total time : 0.051 s
% 11.06/2.86 # ...preprocessing : 0.018 s
% 11.06/2.86 # ...main loop : 0.033 s
% 11.06/2.86 # Maximum resident set size: 7132 pages
% 11.06/2.86
%------------------------------------------------------------------------------