TSTP Solution File: REL011+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : REL011+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:01 EDT 2022
% Result : Theorem 8.60s 2.56s
% Output : CNFRefutation 8.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of clauses : 59 ( 59 unt; 0 nHn; 14 RR)
% Number of literals : 59 ( 58 equ; 3 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 : 74 ( 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-b4w9q22y/input.p',i_0_7) ).
cnf(i_0_6,plain,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b4w9q22y/input.p',i_0_6) ).
cnf(i_0_3,plain,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b4w9q22y/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-b4w9q22y/input.p',i_0_5) ).
cnf(i_0_13,plain,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b4w9q22y/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-b4w9q22y/input.p',i_0_10) ).
cnf(i_0_9,plain,
join(X1,complement(X1)) = top,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b4w9q22y/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-b4w9q22y/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-b4w9q22y/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-b4w9q22y/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-b4w9q22y/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-b4w9q22y/input.p',i_0_17) ).
cnf(i_0_12,negated_conjecture,
complement(join(complement(esk1_0),complement(composition(converse(esk2_0),esk3_0)))) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b4w9q22y/input.p',i_0_12) ).
cnf(i_0_11,negated_conjecture,
complement(join(complement(composition(esk2_0,esk1_0)),complement(esk3_0))) != zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b4w9q22y/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,
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_37,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
i_0_5 ).
cnf(c_0_38,plain,
join(X1,X2) = join(X2,X1),
i_0_13 ).
cnf(c_0_39,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_36,c_0_39]) ).
cnf(c_0_42,plain,
complement(join(complement(X1),complement(complement(X1)))) = zero,
i_0_10 ).
cnf(c_0_43,plain,
join(X1,complement(X1)) = top,
i_0_9 ).
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,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_39]),c_0_41]) ).
cnf(c_0_46,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_42,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_38]) ).
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(zero,complement(join(complement(X1),complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_43]),c_0_46]),c_0_38]) ).
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)],[c_0_50,c_0_45]) ).
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_43,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_43]) ).
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_38,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_40,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,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_68,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_38]),c_0_38]) ).
cnf(c_0_69,negated_conjecture,
complement(join(complement(esk1_0),complement(composition(converse(esk2_0),esk3_0)))) = zero,
i_0_12 ).
cnf(c_0_70,plain,
complement(composition(top,top)) = zero,
inference(spm,[status(thm)],[c_0_41,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
complement(join(complement(composition(esk2_0,esk1_0)),complement(esk3_0))) != zero,
i_0_11 ).
cnf(c_0_72,negated_conjecture,
join(complement(join(complement(esk3_0),complement(composition(esk2_0,zero)))),complement(join(complement(esk3_0),complement(composition(esk2_0,esk1_0))))) = complement(join(complement(esk3_0),complement(composition(esk2_0,zero)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_38]),c_0_38]) ).
cnf(c_0_73,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[c_0_67,c_0_70]) ).
cnf(c_0_74,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_43,c_0_53]) ).
cnf(c_0_75,negated_conjecture,
complement(join(complement(esk3_0),complement(composition(esk2_0,esk1_0)))) != zero,
inference(rw,[status(thm)],[c_0_71,c_0_38]) ).
cnf(c_0_76,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)],[c_0_72,c_0_73]),c_0_74]),c_0_58]),c_0_46]),c_0_53]),c_0_73]),c_0_74]),c_0_58]),c_0_46]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : REL011+2 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 8 07:53:31 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected SinE mode:
% 0.22/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.60/2.56 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.60/2.56 # Version: 2.1pre011
% 8.60/2.56 # Preprocessing time : 0.020 s
% 8.60/2.56
% 8.60/2.56 # Proof found!
% 8.60/2.56 # SZS status Theorem
% 8.60/2.56 # SZS output start CNFRefutation
% See solution above
% 8.60/2.56 # Proof object total steps : 59
% 8.60/2.56 # Proof object clause steps : 45
% 8.60/2.56 # Proof object formula steps : 14
% 8.60/2.56 # Proof object conjectures : 7
% 8.60/2.56 # Proof object clause conjectures : 5
% 8.60/2.56 # Proof object formula conjectures : 2
% 8.60/2.56 # Proof object initial clauses used : 14
% 8.60/2.56 # Proof object initial formulas used : 14
% 8.60/2.56 # Proof object generating inferences : 21
% 8.60/2.56 # Proof object simplifying inferences : 32
% 8.60/2.56 # Training examples: 0 positive, 0 negative
% 8.60/2.56 # Parsed axioms : 17
% 8.60/2.56 # Removed by relevancy pruning/SinE : 0
% 8.60/2.56 # Initial clauses : 17
% 8.60/2.56 # Removed in clause preprocessing : 0
% 8.60/2.56 # Initial clauses in saturation : 17
% 8.60/2.56 # Processed clauses : 225
% 8.60/2.56 # ...of these trivial : 63
% 8.60/2.56 # ...subsumed : 35
% 8.60/2.56 # ...remaining for further processing : 127
% 8.60/2.56 # Other redundant clauses eliminated : 0
% 8.60/2.56 # Clauses deleted for lack of memory : 0
% 8.60/2.56 # Backward-subsumed : 0
% 8.60/2.56 # Backward-rewritten : 51
% 8.60/2.56 # Generated clauses : 3302
% 8.60/2.56 # ...of the previous two non-trivial : 2489
% 8.60/2.56 # Contextual simplify-reflections : 0
% 8.60/2.56 # Paramodulations : 3302
% 8.60/2.56 # Factorizations : 0
% 8.60/2.56 # Equation resolutions : 0
% 8.60/2.56 # Propositional unsat checks : 0
% 8.60/2.56 # Propositional unsat check successes : 0
% 8.60/2.56 # Current number of processed clauses : 76
% 8.60/2.56 # Positive orientable unit clauses : 72
% 8.60/2.56 # Positive unorientable unit clauses: 3
% 8.60/2.56 # Negative unit clauses : 1
% 8.60/2.56 # Non-unit-clauses : 0
% 8.60/2.56 # Current number of unprocessed clauses: 1638
% 8.60/2.56 # ...number of literals in the above : 1638
% 8.60/2.56 # Current number of archived formulas : 0
% 8.60/2.56 # Current number of archived clauses : 51
% 8.60/2.56 # Clause-clause subsumption calls (NU) : 0
% 8.60/2.56 # Rec. Clause-clause subsumption calls : 0
% 8.60/2.56 # Non-unit clause-clause subsumptions : 0
% 8.60/2.56 # Unit Clause-clause subsumption calls : 12
% 8.60/2.56 # Rewrite failures with RHS unbound : 0
% 8.60/2.56 # BW rewrite match attempts : 357
% 8.60/2.56 # BW rewrite match successes : 77
% 8.60/2.56 # Condensation attempts : 0
% 8.60/2.56 # Condensation successes : 0
% 8.60/2.56 # Termbank termtop insertions : 78904
% 8.60/2.56
% 8.60/2.56 # -------------------------------------------------
% 8.60/2.56 # User time : 0.073 s
% 8.60/2.56 # System time : 0.009 s
% 8.60/2.56 # Total time : 0.082 s
% 8.60/2.56 # ...preprocessing : 0.020 s
% 8.60/2.56 # ...main loop : 0.063 s
% 8.60/2.56 # Maximum resident set size: 7128 pages
% 8.60/2.56
%------------------------------------------------------------------------------