TSTP Solution File: HAL006+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : HAL006+1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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 : Sat Jul 16 12:45:06 EDT 2022
% Result : Theorem 8.64s 2.53s
% Output : CNFRefutation 8.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 49 ( 11 unt; 0 nHn; 49 RR)
% Number of literals : 117 ( 26 equ; 76 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 81 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_53,plain,
( apply(X1,subtract(X2,X3,X4)) = subtract(X5,apply(X1,X3),apply(X1,X4))
| ~ element(X4,X2)
| ~ element(X3,X2)
| ~ morphism(X1,X2,X5) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_53) ).
cnf(i_0_20,plain,
morphism(g,b,e),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_20) ).
cnf(i_0_38,plain,
( element(apply(X1,X2),X3)
| ~ element(X2,X4)
| ~ morphism(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_38) ).
cnf(i_0_52,plain,
( subtract(X1,X2,subtract(X1,X2,X3)) = X3
| ~ element(X3,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_52) ).
cnf(i_0_54,plain,
( element(subtract(X1,X2,X3),X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_54) ).
cnf(i_0_24,negated_conjecture,
( apply(g,subtract(b,X1,X2)) != esk2_0
| ~ element(X2,b)
| ~ element(X1,b) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_24) ).
cnf(i_0_55,plain,
( subtract(X1,X2,X2) = zero(X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_55) ).
cnf(i_0_31,plain,
( apply(g,apply(alpha,esk7_1(X1))) = esk6_1(X1)
| ~ element(X1,e) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_31) ).
cnf(i_0_34,plain,
( subtract(e,apply(g,esk5_1(X1)),X1) = esk6_1(X1)
| ~ element(X1,e) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_34) ).
cnf(i_0_4,plain,
morphism(alpha,a,b),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_4) ).
cnf(i_0_37,plain,
( apply(X1,zero(X2)) = zero(X3)
| ~ morphism(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_37) ).
cnf(i_0_33,plain,
( element(esk7_1(X1),a)
| ~ element(X1,e) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_33) ).
cnf(i_0_25,negated_conjecture,
element(esk2_0,e),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_25) ).
cnf(i_0_36,plain,
( element(esk5_1(X1),b)
| ~ element(X1,e) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6mz5ivh/input.p',i_0_36) ).
cnf(c_0_70,plain,
( apply(X1,subtract(X2,X3,X4)) = subtract(X5,apply(X1,X3),apply(X1,X4))
| ~ element(X4,X2)
| ~ element(X3,X2)
| ~ morphism(X1,X2,X5) ),
i_0_53 ).
cnf(c_0_71,plain,
morphism(g,b,e),
i_0_20 ).
cnf(c_0_72,plain,
( element(apply(X1,X2),X3)
| ~ element(X2,X4)
| ~ morphism(X1,X4,X3) ),
i_0_38 ).
cnf(c_0_73,plain,
( subtract(X1,X2,subtract(X1,X2,X3)) = X3
| ~ element(X3,X1)
| ~ element(X2,X1) ),
i_0_52 ).
cnf(c_0_74,plain,
( subtract(e,apply(g,X1),apply(g,X2)) = apply(g,subtract(b,X1,X2))
| ~ element(X2,b)
| ~ element(X1,b) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_75,plain,
( element(apply(g,X1),e)
| ~ element(X1,b) ),
inference(spm,[status(thm)],[c_0_72,c_0_71]) ).
cnf(c_0_76,plain,
( subtract(e,apply(g,X1),apply(g,subtract(b,X1,X2))) = apply(g,X2)
| ~ element(X2,b)
| ~ element(X1,b) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_75]) ).
cnf(c_0_77,plain,
( element(subtract(X1,X2,X3),X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
i_0_54 ).
cnf(c_0_78,plain,
( apply(g,subtract(b,X1,subtract(b,X1,X2))) = apply(g,X2)
| ~ element(X1,b)
| ~ element(X2,b) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_76]),c_0_77]) ).
cnf(c_0_79,negated_conjecture,
( apply(g,subtract(b,X1,X2)) != esk2_0
| ~ element(X2,b)
| ~ element(X1,b) ),
i_0_24 ).
cnf(c_0_80,plain,
( apply(g,subtract(b,X1,subtract(b,X2,subtract(b,X2,X3)))) = subtract(e,apply(g,X1),apply(g,X3))
| ~ element(subtract(b,X2,subtract(b,X2,X3)),b)
| ~ element(X1,b)
| ~ element(X2,b)
| ~ element(X3,b) ),
inference(spm,[status(thm)],[c_0_74,c_0_78]) ).
cnf(c_0_81,negated_conjecture,
( subtract(e,apply(g,X1),apply(g,X2)) != esk2_0
| ~ element(subtract(b,X3,subtract(b,X3,X2)),b)
| ~ element(X1,b)
| ~ element(X3,b)
| ~ element(X2,b) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_82,plain,
( subtract(X1,X2,X2) = zero(X1)
| ~ element(X2,X1) ),
i_0_55 ).
cnf(c_0_83,plain,
( subtract(e,apply(g,X1),apply(g,X2)) != esk2_0
| ~ element(X2,b)
| ~ element(X1,b)
| ~ element(X3,b) ),
inference(spm,[status(thm)],[c_0_81,c_0_73]) ).
cnf(c_0_84,plain,
( apply(g,apply(alpha,esk7_1(X1))) = esk6_1(X1)
| ~ element(X1,e) ),
i_0_31 ).
cnf(c_0_85,plain,
( subtract(e,apply(g,esk5_1(X1)),X1) = esk6_1(X1)
| ~ element(X1,e) ),
i_0_34 ).
cnf(c_0_86,plain,
morphism(alpha,a,b),
i_0_4 ).
cnf(c_0_87,plain,
( apply(X1,zero(X2)) = zero(X3)
| ~ morphism(X1,X2,X3) ),
i_0_37 ).
cnf(c_0_88,plain,
( element(zero(X1),X1)
| ~ element(X2,X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_82]) ).
cnf(c_0_89,plain,
( element(esk7_1(X1),a)
| ~ element(X1,e) ),
i_0_33 ).
cnf(c_0_90,negated_conjecture,
element(esk2_0,e),
i_0_25 ).
cnf(c_0_91,plain,
( subtract(e,apply(g,X1),esk6_1(X2)) != esk2_0
| ~ element(apply(alpha,esk7_1(X2)),b)
| ~ element(X1,b)
| ~ element(X3,b)
| ~ element(X2,e) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_92,plain,
( subtract(e,apply(g,esk5_1(X1)),esk6_1(X1)) = X1
| ~ element(apply(g,esk5_1(X1)),e)
| ~ element(X1,e) ),
inference(spm,[status(thm)],[c_0_73,c_0_85]) ).
cnf(c_0_93,plain,
( element(esk5_1(X1),b)
| ~ element(X1,e) ),
i_0_36 ).
cnf(c_0_94,plain,
( element(apply(alpha,X1),b)
| ~ element(X1,a) ),
inference(spm,[status(thm)],[c_0_72,c_0_86]) ).
cnf(c_0_95,plain,
apply(alpha,zero(a)) = zero(b),
inference(spm,[status(thm)],[c_0_87,c_0_86]) ).
cnf(c_0_96,plain,
( element(zero(a),a)
| ~ element(X1,e) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_97,negated_conjecture,
element(zero(e),e),
inference(spm,[status(thm)],[c_0_88,c_0_90]) ).
cnf(c_0_98,plain,
( X1 != esk2_0
| ~ element(apply(alpha,esk7_1(X1)),b)
| ~ element(X2,b)
| ~ element(X1,e) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_75]),c_0_93]) ).
cnf(c_0_99,plain,
( element(zero(b),b)
| ~ element(zero(a),a) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_100,negated_conjecture,
element(zero(a),a),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_101,plain,
( X1 != esk2_0
| ~ element(X2,b)
| ~ element(X1,e) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_94]),c_0_89]) ).
cnf(c_0_102,plain,
element(zero(b),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_100])]) ).
cnf(c_0_103,plain,
( X1 != esk2_0
| ~ element(X1,e) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_104,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_103,c_0_90]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HAL006+1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 21:05:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.64/2.53 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.64/2.53 # Version: 2.1pre011
% 8.64/2.53 # Preprocessing time : 0.018 s
% 8.64/2.53
% 8.64/2.53 # Proof found!
% 8.64/2.53 # SZS status Theorem
% 8.64/2.53 # SZS output start CNFRefutation
% See solution above
% 8.64/2.53 # Proof object total steps : 49
% 8.64/2.53 # Proof object clause steps : 35
% 8.64/2.53 # Proof object formula steps : 14
% 8.64/2.53 # Proof object conjectures : 8
% 8.64/2.53 # Proof object clause conjectures : 6
% 8.64/2.53 # Proof object formula conjectures : 2
% 8.64/2.53 # Proof object initial clauses used : 14
% 8.64/2.53 # Proof object initial formulas used : 14
% 8.64/2.53 # Proof object generating inferences : 20
% 8.64/2.53 # Proof object simplifying inferences : 8
% 8.64/2.53 # Training examples: 0 positive, 0 negative
% 8.64/2.53 # Parsed axioms : 57
% 8.64/2.53 # Removed by relevancy pruning/SinE : 0
% 8.64/2.53 # Initial clauses : 57
% 8.64/2.53 # Removed in clause preprocessing : 0
% 8.64/2.53 # Initial clauses in saturation : 57
% 8.64/2.53 # Processed clauses : 738
% 8.64/2.53 # ...of these trivial : 16
% 8.64/2.53 # ...subsumed : 256
% 8.64/2.53 # ...remaining for further processing : 466
% 8.64/2.53 # Other redundant clauses eliminated : 6
% 8.64/2.53 # Clauses deleted for lack of memory : 0
% 8.64/2.53 # Backward-subsumed : 57
% 8.64/2.53 # Backward-rewritten : 20
% 8.64/2.53 # Generated clauses : 2250
% 8.64/2.53 # ...of the previous two non-trivial : 2071
% 8.64/2.53 # Contextual simplify-reflections : 637
% 8.64/2.53 # Paramodulations : 2236
% 8.64/2.53 # Factorizations : 0
% 8.64/2.53 # Equation resolutions : 14
% 8.64/2.53 # Propositional unsat checks : 0
% 8.64/2.53 # Propositional unsat check successes : 0
% 8.64/2.53 # Current number of processed clauses : 389
% 8.64/2.53 # Positive orientable unit clauses : 36
% 8.64/2.53 # Positive unorientable unit clauses: 0
% 8.64/2.53 # Negative unit clauses : 0
% 8.64/2.53 # Non-unit-clauses : 353
% 8.64/2.53 # Current number of unprocessed clauses: 1188
% 8.64/2.53 # ...number of literals in the above : 8046
% 8.64/2.53 # Current number of archived formulas : 0
% 8.64/2.53 # Current number of archived clauses : 77
% 8.64/2.53 # Clause-clause subsumption calls (NU) : 44548
% 8.64/2.53 # Rec. Clause-clause subsumption calls : 7369
% 8.64/2.53 # Non-unit clause-clause subsumptions : 949
% 8.64/2.53 # Unit Clause-clause subsumption calls : 65
% 8.64/2.53 # Rewrite failures with RHS unbound : 0
% 8.64/2.53 # BW rewrite match attempts : 8
% 8.64/2.53 # BW rewrite match successes : 7
% 8.64/2.53 # Condensation attempts : 0
% 8.64/2.53 # Condensation successes : 0
% 8.64/2.53 # Termbank termtop insertions : 63427
% 8.64/2.53
% 8.64/2.53 # -------------------------------------------------
% 8.64/2.53 # User time : 0.110 s
% 8.64/2.53 # System time : 0.004 s
% 8.64/2.53 # Total time : 0.114 s
% 8.64/2.53 # ...preprocessing : 0.018 s
% 8.64/2.53 # ...main loop : 0.096 s
% 8.64/2.53 # Maximum resident set size: 7128 pages
% 8.64/2.53
%------------------------------------------------------------------------------