TSTP Solution File: KLE144+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE144+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : Sun Jul 17 01:50:32 EDT 2022
% Result : Theorem 8.39s 2.42s
% Output : CNFRefutation 8.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 16
% Syntax : Number of clauses : 65 ( 46 unt; 0 nHn; 27 RR)
% Number of literals : 84 ( 51 equ; 21 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 95 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_18) ).
cnf(i_0_13,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_13) ).
cnf(i_0_16,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_16) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_2) ).
cnf(i_0_19,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_19) ).
cnf(i_0_15,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_15) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_1) ).
cnf(i_0_7,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_7) ).
cnf(i_0_8,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_8) ).
cnf(i_0_3,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_3) ).
cnf(i_0_14,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_14) ).
cnf(i_0_10,plain,
addition(star(X1),multiplication(strong_iteration(X1),zero)) = strong_iteration(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_10) ).
cnf(i_0_5,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_5) ).
cnf(i_0_20,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_20) ).
cnf(i_0_4,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_4) ).
cnf(i_0_6,negated_conjecture,
strong_iteration(star(esk1_0)) != strong_iteration(one),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d0dxq71z/input.p',i_0_6) ).
cnf(c_0_37,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
i_0_18 ).
cnf(c_0_38,plain,
multiplication(one,X1) = X1,
i_0_13 ).
cnf(c_0_39,plain,
( leq(multiplication(X1,star(X2)),one)
| ~ leq(addition(X2,X1),one) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_16 ).
cnf(c_0_41,plain,
( leq(star(X1),one)
| ~ leq(addition(X1,one),one) ),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_42,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_43,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
i_0_19 ).
cnf(c_0_44,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_15 ).
cnf(c_0_45,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_46,plain,
( addition(one,star(X1)) = one
| ~ leq(addition(X1,one),one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_47,plain,
addition(X1,X1) = X1,
i_0_7 ).
cnf(c_0_48,plain,
addition(one,star(one)) = star(one),
inference(spm,[status(thm)],[c_0_43,c_0_38]) ).
cnf(c_0_49,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
i_0_8 ).
cnf(c_0_50,plain,
( leq(multiplication(X1,star(X2)),X3)
| addition(multiplication(X3,X2),addition(X1,X3)) != X3 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_44]),c_0_45]) ).
cnf(c_0_51,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_42,c_0_45]) ).
cnf(c_0_52,plain,
( star(one) = one
| ~ leq(one,one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_53,plain,
( leq(X1,multiplication(strong_iteration(one),X2))
| ~ leq(X1,addition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_38]) ).
cnf(c_0_54,plain,
addition(X1,zero) = X1,
i_0_3 ).
cnf(c_0_55,plain,
( leq(multiplication(X1,star(X2)),X3)
| addition(X3,addition(multiplication(X3,X2),X1)) != X3 ),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
addition(one,addition(multiplication(X1,star(X1)),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_45,c_0_43]) ).
cnf(c_0_57,plain,
star(one) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_44]),c_0_47])]) ).
cnf(c_0_58,plain,
multiplication(X1,one) = X1,
i_0_14 ).
cnf(c_0_59,plain,
( leq(X1,multiplication(strong_iteration(one),zero))
| ~ leq(X1,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
( leq(X1,one)
| addition(one,X1) != one ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_57]),c_0_58]),c_0_57]) ).
cnf(c_0_61,plain,
addition(star(X1),multiplication(strong_iteration(X1),zero)) = strong_iteration(X1),
i_0_10 ).
cnf(c_0_62,plain,
leq(one,multiplication(strong_iteration(one),zero)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_47])]) ).
cnf(c_0_63,plain,
addition(one,multiplication(strong_iteration(one),zero)) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_61,c_0_57]) ).
cnf(c_0_64,plain,
multiplication(strong_iteration(one),zero) = strong_iteration(one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_62]),c_0_63]) ).
cnf(c_0_65,plain,
( leq(X1,strong_iteration(one))
| ~ leq(X1,X1) ),
inference(rw,[status(thm)],[c_0_59,c_0_64]) ).
cnf(c_0_66,plain,
leq(X1,strong_iteration(one)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_44]),c_0_47])]) ).
cnf(c_0_67,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_5 ).
cnf(c_0_68,plain,
addition(X1,strong_iteration(one)) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_40,c_0_66]) ).
cnf(c_0_69,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_38]),c_0_42]) ).
cnf(c_0_70,plain,
addition(strong_iteration(one),X1) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_42,c_0_68]) ).
cnf(c_0_71,plain,
multiplication(addition(X1,one),strong_iteration(one)) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_72,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_45,c_0_47]) ).
cnf(c_0_73,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
i_0_20 ).
cnf(c_0_74,plain,
multiplication(addition(one,X1),strong_iteration(one)) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_71,c_0_42]) ).
cnf(c_0_75,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,plain,
( leq(X1,multiplication(strong_iteration(X2),zero))
| ~ leq(X1,multiplication(X2,X1)) ),
inference(spm,[status(thm)],[c_0_49,c_0_54]) ).
cnf(c_0_77,plain,
multiplication(star(X1),strong_iteration(one)) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_4 ).
cnf(c_0_79,plain,
leq(strong_iteration(one),multiplication(strong_iteration(star(X1)),zero)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_66])]) ).
cnf(c_0_80,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_58]),c_0_42]) ).
cnf(c_0_81,plain,
multiplication(strong_iteration(star(X1)),zero) = strong_iteration(one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_79]),c_0_70]) ).
cnf(c_0_82,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_42,c_0_54]) ).
cnf(c_0_83,negated_conjecture,
strong_iteration(star(esk1_0)) != strong_iteration(one),
i_0_6 ).
cnf(c_0_84,plain,
strong_iteration(star(X1)) = strong_iteration(one),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_68]),c_0_82]),c_0_58]) ).
cnf(c_0_85,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE144+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n028.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 : Thu Jun 16 16:42:13 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.39/2.42 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.39/2.42 # Version: 2.1pre011
% 8.39/2.42 # Preprocessing time : 0.011 s
% 8.39/2.42
% 8.39/2.42 # Proof found!
% 8.39/2.42 # SZS status Theorem
% 8.39/2.42 # SZS output start CNFRefutation
% See solution above
% 8.39/2.42 # Proof object total steps : 65
% 8.39/2.42 # Proof object clause steps : 49
% 8.39/2.42 # Proof object formula steps : 16
% 8.39/2.42 # Proof object conjectures : 3
% 8.39/2.42 # Proof object clause conjectures : 2
% 8.39/2.42 # Proof object formula conjectures : 1
% 8.39/2.42 # Proof object initial clauses used : 16
% 8.39/2.42 # Proof object initial formulas used : 16
% 8.39/2.42 # Proof object generating inferences : 30
% 8.39/2.42 # Proof object simplifying inferences : 26
% 8.39/2.42 # Training examples: 0 positive, 0 negative
% 8.39/2.42 # Parsed axioms : 20
% 8.39/2.42 # Removed by relevancy pruning/SinE : 0
% 8.39/2.42 # Initial clauses : 20
% 8.39/2.42 # Removed in clause preprocessing : 0
% 8.39/2.42 # Initial clauses in saturation : 20
% 8.39/2.42 # Processed clauses : 417
% 8.39/2.42 # ...of these trivial : 54
% 8.39/2.42 # ...subsumed : 144
% 8.39/2.42 # ...remaining for further processing : 219
% 8.39/2.42 # Other redundant clauses eliminated : 0
% 8.39/2.42 # Clauses deleted for lack of memory : 0
% 8.39/2.42 # Backward-subsumed : 7
% 8.39/2.42 # Backward-rewritten : 69
% 8.39/2.42 # Generated clauses : 3707
% 8.39/2.42 # ...of the previous two non-trivial : 2659
% 8.39/2.42 # Contextual simplify-reflections : 4
% 8.39/2.42 # Paramodulations : 3707
% 8.39/2.42 # Factorizations : 0
% 8.39/2.42 # Equation resolutions : 0
% 8.39/2.42 # Propositional unsat checks : 0
% 8.39/2.42 # Propositional unsat check successes : 0
% 8.39/2.42 # Current number of processed clauses : 143
% 8.39/2.42 # Positive orientable unit clauses : 50
% 8.39/2.42 # Positive unorientable unit clauses: 4
% 8.39/2.42 # Negative unit clauses : 1
% 8.39/2.42 # Non-unit-clauses : 88
% 8.39/2.42 # Current number of unprocessed clauses: 1634
% 8.39/2.42 # ...number of literals in the above : 2785
% 8.39/2.42 # Current number of archived formulas : 0
% 8.39/2.42 # Current number of archived clauses : 76
% 8.39/2.42 # Clause-clause subsumption calls (NU) : 968
% 8.39/2.42 # Rec. Clause-clause subsumption calls : 968
% 8.39/2.42 # Non-unit clause-clause subsumptions : 128
% 8.39/2.42 # Unit Clause-clause subsumption calls : 30
% 8.39/2.42 # Rewrite failures with RHS unbound : 0
% 8.39/2.42 # BW rewrite match attempts : 156
% 8.39/2.42 # BW rewrite match successes : 100
% 8.39/2.42 # Condensation attempts : 0
% 8.39/2.42 # Condensation successes : 0
% 8.39/2.42 # Termbank termtop insertions : 42483
% 8.39/2.42
% 8.39/2.42 # -------------------------------------------------
% 8.39/2.42 # User time : 0.035 s
% 8.39/2.42 # System time : 0.009 s
% 8.39/2.42 # Total time : 0.044 s
% 8.39/2.42 # ...preprocessing : 0.011 s
% 8.39/2.42 # ...main loop : 0.033 s
% 8.39/2.42 # Maximum resident set size: 7132 pages
% 8.39/2.42
%------------------------------------------------------------------------------