TSTP Solution File: REL004+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : REL004+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:50 EDT 2022
% Result : Theorem 6.75s 2.48s
% Output : CNFRefutation 6.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of clauses : 58 ( 58 unt; 0 nHn; 7 RR)
% Number of literals : 58 ( 57 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 79 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jh7e9vdt/input.p',i_0_7) ).
cnf(i_0_6,plain,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jh7e9vdt/input.p',i_0_6) ).
cnf(i_0_3,plain,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jh7e9vdt/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-jh7e9vdt/input.p',i_0_5) ).
cnf(i_0_12,plain,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jh7e9vdt/input.p',i_0_12) ).
cnf(i_0_9,plain,
join(X1,complement(X1)) = top,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jh7e9vdt/input.p',i_0_9) ).
cnf(i_0_13,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jh7e9vdt/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-jh7e9vdt/input.p',i_0_10) ).
cnf(i_0_14,plain,
join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jh7e9vdt/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-jh7e9vdt/input.p',i_0_4) ).
cnf(i_0_11,negated_conjecture,
complement(converse(esk1_0)) != converse(complement(esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jh7e9vdt/input.p',i_0_11) ).
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,
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_31,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
i_0_5 ).
cnf(c_0_32,plain,
join(X1,X2) = join(X2,X1),
i_0_12 ).
cnf(c_0_33,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
join(X1,complement(X1)) = top,
i_0_9 ).
cnf(c_0_35,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
i_0_13 ).
cnf(c_0_36,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_38,plain,
complement(join(complement(X1),complement(complement(X1)))) = zero,
i_0_10 ).
cnf(c_0_39,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_33]),c_0_37]) ).
cnf(c_0_41,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_42,plain,
join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
i_0_14 ).
cnf(c_0_43,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_34]),c_0_32]) ).
cnf(c_0_44,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_42,c_0_32]) ).
cnf(c_0_46,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_39,c_0_43]) ).
cnf(c_0_47,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_35,c_0_44]) ).
cnf(c_0_48,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_45,c_0_40]),c_0_34]),c_0_41]),c_0_32]) ).
cnf(c_0_49,plain,
join(converse(X1),converse(X2)) = converse(join(X1,X2)),
i_0_4 ).
cnf(c_0_50,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_51,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_32,c_0_46]) ).
cnf(c_0_52,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_49,c_0_27]) ).
cnf(c_0_54,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_48,c_0_52]) ).
cnf(c_0_56,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_53,c_0_34]) ).
cnf(c_0_57,plain,
complement(join(complement(X1),complement(join(X1,X2)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_54]),c_0_41]),c_0_55]),c_0_52]) ).
cnf(c_0_58,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_51,c_0_56]) ).
cnf(c_0_59,plain,
join(complement(X1),complement(join(X1,X2))) = complement(X1),
inference(spm,[status(thm)],[c_0_55,c_0_57]) ).
cnf(c_0_60,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X2),complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_32]) ).
cnf(c_0_61,plain,
join(X1,converse(complement(converse(X1)))) = top,
inference(rw,[status(thm)],[c_0_56,c_0_58]) ).
cnf(c_0_62,plain,
join(complement(X1),join(composition(converse(X2),complement(composition(X2,X1))),X3)) = join(complement(X1),X3),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_63,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_59,c_0_32]) ).
cnf(c_0_64,plain,
complement(join(complement(X1),complement(converse(complement(converse(complement(X1))))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_41]),c_0_52]),c_0_32]) ).
cnf(c_0_65,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_62]),c_0_55]),c_0_55]) ).
cnf(c_0_66,plain,
join(X1,converse(complement(converse(complement(X1))))) = converse(complement(converse(complement(X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_55]),c_0_55]),c_0_32]) ).
cnf(c_0_67,plain,
join(X1,complement(converse(complement(converse(X1))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_55]) ).
cnf(c_0_68,plain,
converse(complement(converse(complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_67]),c_0_27]),c_0_27]),c_0_66]) ).
cnf(c_0_69,plain,
complement(converse(complement(X1))) = converse(X1),
inference(spm,[status(thm)],[c_0_27,c_0_68]) ).
cnf(c_0_70,negated_conjecture,
complement(converse(esk1_0)) != converse(complement(esk1_0)),
i_0_11 ).
cnf(c_0_71,plain,
converse(complement(X1)) = complement(converse(X1)),
inference(spm,[status(thm)],[c_0_55,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : REL004+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 13:43:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.75/2.48 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 6.75/2.48 # Version: 2.1pre011
% 6.75/2.48 # Preprocessing time : 0.019 s
% 6.75/2.48
% 6.75/2.48 # Proof found!
% 6.75/2.48 # SZS status Theorem
% 6.75/2.48 # SZS output start CNFRefutation
% See solution above
% 6.75/2.48 # Proof object total steps : 58
% 6.75/2.48 # Proof object clause steps : 47
% 6.75/2.48 # Proof object formula steps : 11
% 6.75/2.48 # Proof object conjectures : 3
% 6.75/2.48 # Proof object clause conjectures : 2
% 6.75/2.48 # Proof object formula conjectures : 1
% 6.75/2.48 # Proof object initial clauses used : 11
% 6.75/2.48 # Proof object initial formulas used : 11
% 6.75/2.48 # Proof object generating inferences : 28
% 6.75/2.48 # Proof object simplifying inferences : 32
% 6.75/2.48 # Training examples: 0 positive, 0 negative
% 6.75/2.48 # Parsed axioms : 16
% 6.75/2.48 # Removed by relevancy pruning/SinE : 0
% 6.75/2.48 # Initial clauses : 16
% 6.75/2.48 # Removed in clause preprocessing : 0
% 6.75/2.48 # Initial clauses in saturation : 16
% 6.75/2.48 # Processed clauses : 158
% 6.75/2.48 # ...of these trivial : 39
% 6.75/2.48 # ...subsumed : 21
% 6.75/2.48 # ...remaining for further processing : 98
% 6.75/2.48 # Other redundant clauses eliminated : 0
% 6.75/2.48 # Clauses deleted for lack of memory : 0
% 6.75/2.48 # Backward-subsumed : 0
% 6.75/2.48 # Backward-rewritten : 34
% 6.75/2.48 # Generated clauses : 2213
% 6.75/2.48 # ...of the previous two non-trivial : 1613
% 6.75/2.48 # Contextual simplify-reflections : 0
% 6.75/2.48 # Paramodulations : 2213
% 6.75/2.48 # Factorizations : 0
% 6.75/2.48 # Equation resolutions : 0
% 6.75/2.48 # Propositional unsat checks : 0
% 6.75/2.48 # Propositional unsat check successes : 0
% 6.75/2.48 # Current number of processed clauses : 64
% 6.75/2.48 # Positive orientable unit clauses : 61
% 6.75/2.48 # Positive unorientable unit clauses: 3
% 6.75/2.48 # Negative unit clauses : 0
% 6.75/2.48 # Non-unit-clauses : 0
% 6.75/2.48 # Current number of unprocessed clauses: 984
% 6.75/2.48 # ...number of literals in the above : 984
% 6.75/2.48 # Current number of archived formulas : 0
% 6.75/2.48 # Current number of archived clauses : 34
% 6.75/2.48 # Clause-clause subsumption calls (NU) : 0
% 6.75/2.48 # Rec. Clause-clause subsumption calls : 0
% 6.75/2.48 # Non-unit clause-clause subsumptions : 0
% 6.75/2.48 # Unit Clause-clause subsumption calls : 10
% 6.75/2.48 # Rewrite failures with RHS unbound : 0
% 6.75/2.48 # BW rewrite match attempts : 174
% 6.75/2.48 # BW rewrite match successes : 54
% 6.75/2.48 # Condensation attempts : 0
% 6.75/2.48 # Condensation successes : 0
% 6.75/2.48 # Termbank termtop insertions : 32659
% 6.75/2.48
% 6.75/2.48 # -------------------------------------------------
% 6.75/2.48 # User time : 0.040 s
% 6.75/2.48 # System time : 0.009 s
% 6.75/2.48 # Total time : 0.049 s
% 6.75/2.48 # ...preprocessing : 0.019 s
% 6.75/2.48 # ...main loop : 0.030 s
% 6.75/2.48 # Maximum resident set size: 7132 pages
% 6.75/2.48
%------------------------------------------------------------------------------