TSTP Solution File: REL024+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : REL024+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:17 EDT 2022
% Result : Theorem 8.87s 2.66s
% Output : CNFRefutation 8.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 5 RR)
% Number of literals : 35 ( 34 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 60 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0fqfqh_/input.p',i_0_7) ).
cnf(i_0_6,plain,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0fqfqh_/input.p',i_0_6) ).
cnf(i_0_3,plain,
composition(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0fqfqh_/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-d0fqfqh_/input.p',i_0_5) ).
cnf(i_0_11,plain,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0fqfqh_/input.p',i_0_11) ).
cnf(i_0_12,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0fqfqh_/input.p',i_0_12) ).
cnf(i_0_13,plain,
join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0fqfqh_/input.p',i_0_13) ).
cnf(i_0_4,plain,
join(converse(X1),converse(X2)) = converse(join(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0fqfqh_/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-d0fqfqh_/input.p',i_0_2) ).
cnf(i_0_10,negated_conjecture,
join(composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk2_0),complement(esk3_0)))),composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),esk3_0)) != composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0fqfqh_/input.p',i_0_10) ).
cnf(c_0_24,plain,
composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
i_0_7 ).
cnf(c_0_25,plain,
converse(converse(X1)) = X1,
i_0_6 ).
cnf(c_0_26,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
composition(X1,one) = X1,
i_0_3 ).
cnf(c_0_28,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]) ).
cnf(c_0_29,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
i_0_5 ).
cnf(c_0_30,plain,
join(X1,X2) = join(X2,X1),
i_0_11 ).
cnf(c_0_31,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_31]) ).
cnf(c_0_34,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
i_0_12 ).
cnf(c_0_35,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31]),c_0_33]) ).
cnf(c_0_36,plain,
join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
i_0_13 ).
cnf(c_0_37,plain,
join(converse(X1),converse(X2)) = converse(join(X1,X2)),
i_0_4 ).
cnf(c_0_38,plain,
join(composition(X1,X2),composition(X3,X2)) = composition(join(X1,X3),X2),
i_0_2 ).
cnf(c_0_39,plain,
join(complement(X1),join(complement(X1),X2)) = join(complement(X1),X2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_41,negated_conjecture,
join(composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk2_0),complement(esk3_0)))),composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),esk3_0)) != composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),esk3_0),
i_0_10 ).
cnf(c_0_42,plain,
converse(join(composition(converse(X1),X2),X3)) = join(composition(converse(X2),X1),converse(X3)),
inference(spm,[status(thm)],[c_0_37,c_0_26]) ).
cnf(c_0_43,plain,
join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
inference(spm,[status(thm)],[c_0_38,c_0_24]) ).
cnf(c_0_44,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_30]) ).
cnf(c_0_45,negated_conjecture,
join(composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),esk3_0),composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk2_0),complement(esk3_0))))) != composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),esk3_0),
inference(rw,[status(thm)],[c_0_41,c_0_30]) ).
cnf(c_0_46,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_42,c_0_43]),c_0_37]),c_0_24]),c_0_25]),c_0_25]),c_0_25]) ).
cnf(c_0_47,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_44,c_0_30]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : REL024+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.16 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.37 % Computer : n007.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 600
% 0.14/0.37 % DateTime : Fri Jul 8 12:11:32 EDT 2022
% 0.14/0.38 % CPUTime :
% 0.21/0.48 # ENIGMATIC: Selected SinE mode:
% 0.21/0.49 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.87/2.66 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.87/2.66 # Version: 2.1pre011
% 8.87/2.66 # Preprocessing time : 0.016 s
% 8.87/2.66
% 8.87/2.66 # Proof found!
% 8.87/2.66 # SZS status Theorem
% 8.87/2.66 # SZS output start CNFRefutation
% See solution above
% 8.87/2.66 # Proof object total steps : 35
% 8.87/2.66 # Proof object clause steps : 25
% 8.87/2.66 # Proof object formula steps : 10
% 8.87/2.66 # Proof object conjectures : 4
% 8.87/2.66 # Proof object clause conjectures : 3
% 8.87/2.66 # Proof object formula conjectures : 1
% 8.87/2.66 # Proof object initial clauses used : 10
% 8.87/2.66 # Proof object initial formulas used : 10
% 8.87/2.66 # Proof object generating inferences : 10
% 8.87/2.66 # Proof object simplifying inferences : 16
% 8.87/2.66 # Training examples: 0 positive, 0 negative
% 8.87/2.66 # Parsed axioms : 13
% 8.87/2.66 # Removed by relevancy pruning/SinE : 0
% 8.87/2.66 # Initial clauses : 13
% 8.87/2.66 # Removed in clause preprocessing : 0
% 8.87/2.66 # Initial clauses in saturation : 13
% 8.87/2.66 # Processed clauses : 477
% 8.87/2.66 # ...of these trivial : 202
% 8.87/2.66 # ...subsumed : 119
% 8.87/2.66 # ...remaining for further processing : 156
% 8.87/2.66 # Other redundant clauses eliminated : 0
% 8.87/2.66 # Clauses deleted for lack of memory : 0
% 8.87/2.66 # Backward-subsumed : 0
% 8.87/2.66 # Backward-rewritten : 38
% 8.87/2.66 # Generated clauses : 5850
% 8.87/2.66 # ...of the previous two non-trivial : 3857
% 8.87/2.66 # Contextual simplify-reflections : 0
% 8.87/2.66 # Paramodulations : 5850
% 8.87/2.66 # Factorizations : 0
% 8.87/2.66 # Equation resolutions : 0
% 8.87/2.66 # Propositional unsat checks : 0
% 8.87/2.66 # Propositional unsat check successes : 0
% 8.87/2.66 # Current number of processed clauses : 118
% 8.87/2.66 # Positive orientable unit clauses : 112
% 8.87/2.66 # Positive unorientable unit clauses: 6
% 8.87/2.66 # Negative unit clauses : 0
% 8.87/2.66 # Non-unit-clauses : 0
% 8.87/2.66 # Current number of unprocessed clauses: 3025
% 8.87/2.66 # ...number of literals in the above : 3025
% 8.87/2.66 # Current number of archived formulas : 0
% 8.87/2.66 # Current number of archived clauses : 38
% 8.87/2.66 # Clause-clause subsumption calls (NU) : 0
% 8.87/2.66 # Rec. Clause-clause subsumption calls : 0
% 8.87/2.66 # Non-unit clause-clause subsumptions : 0
% 8.87/2.66 # Unit Clause-clause subsumption calls : 16
% 8.87/2.66 # Rewrite failures with RHS unbound : 0
% 8.87/2.66 # BW rewrite match attempts : 287
% 8.87/2.66 # BW rewrite match successes : 90
% 8.87/2.66 # Condensation attempts : 0
% 8.87/2.66 # Condensation successes : 0
% 8.87/2.66 # Termbank termtop insertions : 69881
% 8.87/2.66
% 8.87/2.66 # -------------------------------------------------
% 8.87/2.66 # User time : 0.056 s
% 8.87/2.66 # System time : 0.006 s
% 8.87/2.66 # Total time : 0.062 s
% 8.87/2.66 # ...preprocessing : 0.016 s
% 8.87/2.66 # ...main loop : 0.046 s
% 8.87/2.66 # Maximum resident set size: 8676 pages
% 8.87/2.66
%------------------------------------------------------------------------------