TSTP Solution File: KLE039+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE039+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:49:47 EDT 2022
% Result : Theorem 8.51s 2.60s
% Output : CNFRefutation 8.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of clauses : 66 ( 49 unt; 0 nHn; 24 RR)
% Number of literals : 83 ( 52 equ; 19 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_2) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_1) ).
cnf(i_0_16,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_16) ).
cnf(i_0_11,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_11) ).
cnf(i_0_12,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_12) ).
cnf(i_0_17,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_17) ).
cnf(i_0_14,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_14) ).
cnf(i_0_10,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_10) ).
cnf(i_0_9,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_9) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_3) ).
cnf(i_0_18,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_18) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_4) ).
cnf(i_0_7,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_7) ).
cnf(i_0_8,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_8) ).
cnf(i_0_5,negated_conjecture,
star(star(esk1_0)) != star(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-unqhg6rb/input.p',i_0_5) ).
cnf(c_0_34,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_35,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_36,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
i_0_16 ).
cnf(c_0_37,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_11 ).
cnf(c_0_38,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_12 ).
cnf(c_0_40,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
i_0_17 ).
cnf(c_0_41,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_14 ).
cnf(c_0_42,plain,
multiplication(X1,one) = X1,
i_0_10 ).
cnf(c_0_43,plain,
multiplication(one,X1) = X1,
i_0_9 ).
cnf(c_0_44,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_45,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
i_0_18 ).
cnf(c_0_46,plain,
( leq(multiplication(X1,star(X2)),X3)
| addition(X3,addition(multiplication(X3,X2),X1)) != X3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_35]),c_0_38]) ).
cnf(c_0_47,plain,
addition(one,addition(star(X1),multiplication(star(X1),X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_35]),c_0_34]) ).
cnf(c_0_48,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_34]) ).
cnf(c_0_49,plain,
( leq(multiplication(X1,star(X2)),one)
| ~ leq(addition(X2,X1),one) ),
inference(spm,[status(thm)],[c_0_36,c_0_43]) ).
cnf(c_0_50,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_44]) ).
cnf(c_0_51,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_45]),c_0_35]),c_0_34]) ).
cnf(c_0_52,plain,
( leq(multiplication(X1,star(X2)),X3)
| addition(X3,addition(X1,multiplication(X3,X2))) != X3 ),
inference(spm,[status(thm)],[c_0_46,c_0_34]) ).
cnf(c_0_53,plain,
addition(one,multiplication(star(X1),addition(X1,one))) = star(X1),
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_55,plain,
( leq(star(X1),one)
| ~ leq(addition(X1,one),one) ),
inference(spm,[status(thm)],[c_0_49,c_0_43]) ).
cnf(c_0_56,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,plain,
leq(star(addition(X1,one)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_43]),c_0_44])]) ).
cnf(c_0_58,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_54]) ).
cnf(c_0_59,plain,
( star(X1) = one
| ~ leq(addition(X1,one),one) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_55]),c_0_34]),c_0_56]) ).
cnf(c_0_60,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_7 ).
cnf(c_0_61,plain,
leq(star(one),star(zero)),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,plain,
( star(zero) = one
| ~ leq(one,one) ),
inference(spm,[status(thm)],[c_0_59,c_0_58]) ).
cnf(c_0_63,plain,
addition(X1,addition(X2,addition(X1,X2))) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_44,c_0_35]) ).
cnf(c_0_64,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_43]),c_0_34]) ).
cnf(c_0_65,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_8 ).
cnf(c_0_66,plain,
addition(star(zero),star(one)) = star(zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_61]),c_0_34]) ).
cnf(c_0_67,plain,
star(zero) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_37]),c_0_44])]) ).
cnf(c_0_68,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_34]),c_0_50]) ).
cnf(c_0_69,plain,
addition(one,multiplication(addition(X1,one),star(X1))) = star(X1),
inference(rw,[status(thm)],[c_0_51,c_0_64]) ).
cnf(c_0_70,plain,
( leq(multiplication(X1,multiplication(X2,star(X3))),X1)
| ~ leq(multiplication(X1,addition(X3,X2)),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_41]),c_0_65]) ).
cnf(c_0_71,plain,
( leq(multiplication(X1,multiplication(X2,star(X2))),X1)
| multiplication(X1,addition(X2,one)) != X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_44]),c_0_65]),c_0_48]) ).
cnf(c_0_72,plain,
star(one) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_56]),c_0_67]) ).
cnf(c_0_73,plain,
multiplication(addition(X1,one),star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_34]),c_0_64]),c_0_35]),c_0_44]) ).
cnf(c_0_74,plain,
( leq(multiplication(X1,multiplication(X2,star(X2))),X1)
| ~ leq(multiplication(X1,X2),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_44]),c_0_65]) ).
cnf(c_0_75,plain,
( multiplication(X1,addition(one,multiplication(X2,star(X3)))) = X1
| ~ leq(multiplication(X1,addition(X3,X2)),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_70]),c_0_34]),c_0_48]),c_0_34]) ).
cnf(c_0_76,plain,
multiplication(star(X1),addition(X1,one)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_53]),c_0_34]),c_0_48]),c_0_35]),c_0_44]) ).
cnf(c_0_77,plain,
leq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_43]),c_0_42]),c_0_44]),c_0_42])]) ).
cnf(c_0_78,plain,
multiplication(addition(one,X1),star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_73,c_0_34]) ).
cnf(c_0_79,plain,
( multiplication(X1,addition(one,multiplication(X2,star(X2)))) = X1
| ~ leq(multiplication(X1,X2),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_74]),c_0_34]),c_0_48]),c_0_34]) ).
cnf(c_0_80,plain,
multiplication(star(X1),star(X1)) = star(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_43]),c_0_56]),c_0_77])]) ).
cnf(c_0_81,plain,
multiplication(star(X1),star(star(X1))) = star(star(X1)),
inference(spm,[status(thm)],[c_0_78,c_0_56]) ).
cnf(c_0_82,negated_conjecture,
star(star(esk1_0)) != star(esk1_0),
i_0_5 ).
cnf(c_0_83,plain,
star(star(X1)) = star(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_56]),c_0_81]),c_0_77])]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KLE039+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n022.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 : Thu Jun 16 12:46:34 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.51/2.60 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.51/2.60 # Version: 2.1pre011
% 8.51/2.60 # Preprocessing time : 0.013 s
% 8.51/2.60
% 8.51/2.60 # Proof found!
% 8.51/2.60 # SZS status Theorem
% 8.51/2.60 # SZS output start CNFRefutation
% See solution above
% 8.51/2.60 # Proof object total steps : 66
% 8.51/2.60 # Proof object clause steps : 51
% 8.51/2.60 # Proof object formula steps : 15
% 8.51/2.60 # Proof object conjectures : 3
% 8.51/2.60 # Proof object clause conjectures : 2
% 8.51/2.60 # Proof object formula conjectures : 1
% 8.51/2.60 # Proof object initial clauses used : 15
% 8.51/2.60 # Proof object initial formulas used : 15
% 8.51/2.60 # Proof object generating inferences : 32
% 8.51/2.60 # Proof object simplifying inferences : 56
% 8.51/2.60 # Training examples: 0 positive, 0 negative
% 8.51/2.60 # Parsed axioms : 18
% 8.51/2.60 # Removed by relevancy pruning/SinE : 0
% 8.51/2.60 # Initial clauses : 18
% 8.51/2.60 # Removed in clause preprocessing : 0
% 8.51/2.60 # Initial clauses in saturation : 18
% 8.51/2.60 # Processed clauses : 1789
% 8.51/2.60 # ...of these trivial : 131
% 8.51/2.60 # ...subsumed : 1315
% 8.51/2.60 # ...remaining for further processing : 343
% 8.51/2.60 # Other redundant clauses eliminated : 0
% 8.51/2.60 # Clauses deleted for lack of memory : 0
% 8.51/2.60 # Backward-subsumed : 8
% 8.51/2.60 # Backward-rewritten : 68
% 8.51/2.60 # Generated clauses : 15212
% 8.51/2.60 # ...of the previous two non-trivial : 12545
% 8.51/2.60 # Contextual simplify-reflections : 84
% 8.51/2.60 # Paramodulations : 15212
% 8.51/2.60 # Factorizations : 0
% 8.51/2.60 # Equation resolutions : 0
% 8.51/2.60 # Propositional unsat checks : 0
% 8.51/2.60 # Propositional unsat check successes : 0
% 8.51/2.60 # Current number of processed clauses : 267
% 8.51/2.60 # Positive orientable unit clauses : 64
% 8.51/2.60 # Positive unorientable unit clauses: 9
% 8.51/2.60 # Negative unit clauses : 25
% 8.51/2.60 # Non-unit-clauses : 169
% 8.51/2.60 # Current number of unprocessed clauses: 9032
% 8.51/2.60 # ...number of literals in the above : 16391
% 8.51/2.60 # Current number of archived formulas : 0
% 8.51/2.60 # Current number of archived clauses : 76
% 8.51/2.60 # Clause-clause subsumption calls (NU) : 6028
% 8.51/2.60 # Rec. Clause-clause subsumption calls : 5866
% 8.51/2.60 # Non-unit clause-clause subsumptions : 376
% 8.51/2.60 # Unit Clause-clause subsumption calls : 720
% 8.51/2.60 # Rewrite failures with RHS unbound : 0
% 8.51/2.60 # BW rewrite match attempts : 312
% 8.51/2.60 # BW rewrite match successes : 95
% 8.51/2.60 # Condensation attempts : 0
% 8.51/2.60 # Condensation successes : 0
% 8.51/2.60 # Termbank termtop insertions : 192286
% 8.51/2.60
% 8.51/2.60 # -------------------------------------------------
% 8.51/2.60 # User time : 0.159 s
% 8.51/2.60 # System time : 0.013 s
% 8.51/2.60 # Total time : 0.172 s
% 8.51/2.60 # ...preprocessing : 0.013 s
% 8.51/2.60 # ...main loop : 0.159 s
% 8.51/2.60 # Maximum resident set size: 15276 pages
% 8.51/2.60
%------------------------------------------------------------------------------