TSTP Solution File: REL031+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : REL031+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:31 EDT 2022
% Result : Theorem 10.03s 2.80s
% Output : CNFRefutation 10.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 11 RR)
% Number of literals : 39 ( 38 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhpzv9gb/input.p',i_0_7) ).
cnf(i_0_6,plain,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhpzv9gb/input.p',i_0_6) ).
cnf(i_0_3,plain,
composition(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhpzv9gb/input.p',i_0_3) ).
cnf(i_0_13,plain,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhpzv9gb/input.p',i_0_13) ).
cnf(i_0_14,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhpzv9gb/input.p',i_0_14) ).
cnf(i_0_11,negated_conjecture,
join(composition(converse(esk2_0),esk2_0),one) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhpzv9gb/input.p',i_0_11) ).
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-bhpzv9gb/input.p',i_0_2) ).
cnf(i_0_12,negated_conjecture,
join(composition(converse(esk1_0),esk1_0),one) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhpzv9gb/input.p',i_0_12) ).
cnf(i_0_4,plain,
join(converse(X1),converse(X2)) = converse(join(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhpzv9gb/input.p',i_0_4) ).
cnf(i_0_1,plain,
composition(composition(X1,X2),X3) = composition(X1,composition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhpzv9gb/input.p',i_0_1) ).
cnf(i_0_10,negated_conjecture,
join(composition(converse(composition(esk1_0,esk2_0)),composition(esk1_0,esk2_0)),one) != one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhpzv9gb/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,
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,
converse(one) = one,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
join(X1,X2) = join(X2,X1),
i_0_13 ).
cnf(c_0_33,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
i_0_14 ).
cnf(c_0_34,negated_conjecture,
join(composition(converse(esk2_0),esk2_0),one) = one,
i_0_11 ).
cnf(c_0_35,plain,
join(composition(X1,X2),composition(X3,X2)) = composition(join(X1,X3),X2),
i_0_2 ).
cnf(c_0_36,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
join(composition(converse(esk1_0),esk1_0),one) = one,
i_0_12 ).
cnf(c_0_38,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
join(one,composition(converse(esk2_0),esk2_0)) = one,
inference(rw,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_40,plain,
join(converse(X1),converse(X2)) = converse(join(X1,X2)),
i_0_4 ).
cnf(c_0_41,plain,
join(X1,composition(X2,X1)) = composition(join(one,X2),X1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
join(one,composition(converse(esk1_0),esk1_0)) = one,
inference(rw,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_43,plain,
composition(composition(X1,X2),X3) = composition(X1,composition(X2,X3)),
i_0_1 ).
cnf(c_0_44,negated_conjecture,
join(one,join(composition(converse(esk2_0),esk2_0),X1)) = join(X1,one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_38]) ).
cnf(c_0_45,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_40,c_0_27]) ).
cnf(c_0_46,negated_conjecture,
join(X1,composition(converse(esk1_0),composition(esk1_0,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_36]) ).
cnf(c_0_47,plain,
converse(composition(X1,converse(X2))) = composition(X2,converse(X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_48,negated_conjecture,
join(composition(converse(composition(esk1_0,esk2_0)),composition(esk1_0,esk2_0)),one) != one,
i_0_10 ).
cnf(c_0_49,plain,
join(one,composition(join(converse(esk2_0),X1),esk2_0)) = join(one,composition(X1,esk2_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_35]),c_0_32]) ).
cnf(c_0_50,plain,
join(X1,composition(X1,composition(converse(esk1_0),esk1_0))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_27]),c_0_28]),c_0_47]),c_0_43]) ).
cnf(c_0_51,plain,
composition(converse(X1),composition(converse(X2),X3)) = composition(converse(composition(X2,X1)),X3),
inference(spm,[status(thm)],[c_0_43,c_0_26]) ).
cnf(c_0_52,negated_conjecture,
join(one,composition(converse(composition(esk1_0,esk2_0)),composition(esk1_0,esk2_0))) != one,
inference(rw,[status(thm)],[c_0_48,c_0_32]) ).
cnf(c_0_53,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_39]),c_0_51]),c_0_43]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : REL031+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n007.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 11:27:47 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.03/2.80 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 10.03/2.80 # Version: 2.1pre011
% 10.03/2.80 # Preprocessing time : 0.021 s
% 10.03/2.80
% 10.03/2.80 # Proof found!
% 10.03/2.80 # SZS status Theorem
% 10.03/2.80 # SZS output start CNFRefutation
% See solution above
% 10.03/2.80 # Proof object total steps : 39
% 10.03/2.80 # Proof object clause steps : 28
% 10.03/2.80 # Proof object formula steps : 11
% 10.03/2.80 # Proof object conjectures : 11
% 10.03/2.80 # Proof object clause conjectures : 8
% 10.03/2.80 # Proof object formula conjectures : 3
% 10.03/2.80 # Proof object initial clauses used : 11
% 10.03/2.80 # Proof object initial formulas used : 11
% 10.03/2.80 # Proof object generating inferences : 13
% 10.03/2.80 # Proof object simplifying inferences : 17
% 10.03/2.80 # Training examples: 0 positive, 0 negative
% 10.03/2.80 # Parsed axioms : 15
% 10.03/2.80 # Removed by relevancy pruning/SinE : 0
% 10.03/2.80 # Initial clauses : 15
% 10.03/2.80 # Removed in clause preprocessing : 0
% 10.03/2.80 # Initial clauses in saturation : 15
% 10.03/2.80 # Processed clauses : 1401
% 10.03/2.80 # ...of these trivial : 699
% 10.03/2.80 # ...subsumed : 306
% 10.03/2.80 # ...remaining for further processing : 396
% 10.03/2.80 # Other redundant clauses eliminated : 0
% 10.03/2.80 # Clauses deleted for lack of memory : 0
% 10.03/2.80 # Backward-subsumed : 0
% 10.03/2.80 # Backward-rewritten : 107
% 10.03/2.80 # Generated clauses : 28524
% 10.03/2.80 # ...of the previous two non-trivial : 22808
% 10.03/2.80 # Contextual simplify-reflections : 0
% 10.03/2.80 # Paramodulations : 28524
% 10.03/2.80 # Factorizations : 0
% 10.03/2.80 # Equation resolutions : 0
% 10.03/2.80 # Propositional unsat checks : 0
% 10.03/2.80 # Propositional unsat check successes : 0
% 10.03/2.80 # Current number of processed clauses : 289
% 10.03/2.80 # Positive orientable unit clauses : 274
% 10.03/2.80 # Positive unorientable unit clauses: 14
% 10.03/2.80 # Negative unit clauses : 1
% 10.03/2.80 # Non-unit-clauses : 0
% 10.03/2.80 # Current number of unprocessed clauses: 19244
% 10.03/2.80 # ...number of literals in the above : 19244
% 10.03/2.80 # Current number of archived formulas : 0
% 10.03/2.80 # Current number of archived clauses : 107
% 10.03/2.80 # Clause-clause subsumption calls (NU) : 0
% 10.03/2.80 # Rec. Clause-clause subsumption calls : 0
% 10.03/2.80 # Non-unit clause-clause subsumptions : 0
% 10.03/2.80 # Unit Clause-clause subsumption calls : 108
% 10.03/2.80 # Rewrite failures with RHS unbound : 0
% 10.03/2.80 # BW rewrite match attempts : 1499
% 10.03/2.80 # BW rewrite match successes : 213
% 10.03/2.80 # Condensation attempts : 0
% 10.03/2.80 # Condensation successes : 0
% 10.03/2.80 # Termbank termtop insertions : 507126
% 10.03/2.80
% 10.03/2.80 # -------------------------------------------------
% 10.03/2.80 # User time : 0.338 s
% 10.03/2.80 # System time : 0.024 s
% 10.03/2.80 # Total time : 0.362 s
% 10.03/2.80 # ...preprocessing : 0.021 s
% 10.03/2.80 # ...main loop : 0.342 s
% 10.03/2.80 # Maximum resident set size: 31644 pages
% 10.03/2.80
%------------------------------------------------------------------------------