TSTP Solution File: KLE141+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE141+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:30 EDT 2022
% Result : Theorem 7.94s 2.36s
% Output : CNFRefutation 7.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 43 ( 29 unt; 0 nHn; 19 RR)
% Number of literals : 57 ( 35 equ; 16 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 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 : 69 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_18) ).
cnf(i_0_15,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_15) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_1) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_2) ).
cnf(i_0_7,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/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/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_8) ).
cnf(i_0_13,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_13) ).
cnf(i_0_14,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_14) ).
cnf(i_0_3,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_3) ).
cnf(i_0_20,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_20) ).
cnf(i_0_16,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_16) ).
cnf(i_0_10,plain,
addition(star(X1),multiplication(strong_iteration(X1),zero)) = strong_iteration(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_10) ).
cnf(i_0_12,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_12) ).
cnf(i_0_11,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_11) ).
cnf(i_0_6,negated_conjecture,
multiplication(strong_iteration(one),esk1_0) != strong_iteration(one),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9l1pbcqs/input.p',i_0_6) ).
cnf(c_0_36,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
i_0_18 ).
cnf(c_0_37,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_15 ).
cnf(c_0_38,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_39,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_40,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_36,c_0_37]),c_0_38]) ).
cnf(c_0_41,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_42,plain,
addition(X1,X1) = X1,
i_0_7 ).
cnf(c_0_43,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
i_0_8 ).
cnf(c_0_44,plain,
multiplication(one,X1) = X1,
i_0_13 ).
cnf(c_0_45,plain,
( leq(multiplication(X1,star(X2)),X3)
| addition(X3,addition(multiplication(X3,X2),X1)) != X3 ),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
multiplication(X1,one) = X1,
i_0_14 ).
cnf(c_0_47,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_38,c_0_42]) ).
cnf(c_0_48,plain,
( leq(X1,multiplication(strong_iteration(one),X2))
| ~ leq(X1,addition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
addition(X1,zero) = X1,
i_0_3 ).
cnf(c_0_50,plain,
( leq(multiplication(X1,star(one)),X2)
| addition(X2,X1) != X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_51,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
i_0_20 ).
cnf(c_0_52,plain,
( leq(X1,multiplication(strong_iteration(one),zero))
| ~ leq(X1,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
( leq(star(one),X1)
| addition(X1,one) != X1 ),
inference(spm,[status(thm)],[c_0_50,c_0_44]) ).
cnf(c_0_54,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_47,c_0_51]) ).
cnf(c_0_55,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_16 ).
cnf(c_0_56,plain,
leq(star(one),multiplication(strong_iteration(one),zero)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_39]),c_0_54])]) ).
cnf(c_0_57,plain,
addition(star(X1),multiplication(strong_iteration(X1),zero)) = strong_iteration(X1),
i_0_10 ).
cnf(c_0_58,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_12 ).
cnf(c_0_59,plain,
multiplication(strong_iteration(one),zero) = strong_iteration(one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_60,plain,
multiplication(zero,X1) = zero,
i_0_11 ).
cnf(c_0_61,negated_conjecture,
multiplication(strong_iteration(one),esk1_0) != strong_iteration(one),
i_0_6 ).
cnf(c_0_62,plain,
multiplication(strong_iteration(one),X1) = strong_iteration(one),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_59]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KLE141+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 12:50:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.94/2.36 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.94/2.36 # Version: 2.1pre011
% 7.94/2.36 # Preprocessing time : 0.009 s
% 7.94/2.36
% 7.94/2.36 # Proof found!
% 7.94/2.36 # SZS status Theorem
% 7.94/2.36 # SZS output start CNFRefutation
% See solution above
% 7.94/2.36 # Proof object total steps : 43
% 7.94/2.36 # Proof object clause steps : 28
% 7.94/2.36 # Proof object formula steps : 15
% 7.94/2.36 # Proof object conjectures : 3
% 7.94/2.36 # Proof object clause conjectures : 2
% 7.94/2.36 # Proof object formula conjectures : 1
% 7.94/2.36 # Proof object initial clauses used : 15
% 7.94/2.36 # Proof object initial formulas used : 15
% 7.94/2.36 # Proof object generating inferences : 11
% 7.94/2.36 # Proof object simplifying inferences : 11
% 7.94/2.36 # Training examples: 0 positive, 0 negative
% 7.94/2.36 # Parsed axioms : 20
% 7.94/2.36 # Removed by relevancy pruning/SinE : 0
% 7.94/2.36 # Initial clauses : 20
% 7.94/2.36 # Removed in clause preprocessing : 0
% 7.94/2.36 # Initial clauses in saturation : 20
% 7.94/2.36 # Processed clauses : 145
% 7.94/2.36 # ...of these trivial : 18
% 7.94/2.36 # ...subsumed : 34
% 7.94/2.36 # ...remaining for further processing : 93
% 7.94/2.36 # Other redundant clauses eliminated : 0
% 7.94/2.36 # Clauses deleted for lack of memory : 0
% 7.94/2.36 # Backward-subsumed : 1
% 7.94/2.36 # Backward-rewritten : 21
% 7.94/2.36 # Generated clauses : 1196
% 7.94/2.36 # ...of the previous two non-trivial : 880
% 7.94/2.36 # Contextual simplify-reflections : 0
% 7.94/2.36 # Paramodulations : 1196
% 7.94/2.36 # Factorizations : 0
% 7.94/2.36 # Equation resolutions : 0
% 7.94/2.36 # Propositional unsat checks : 0
% 7.94/2.36 # Propositional unsat check successes : 0
% 7.94/2.36 # Current number of processed clauses : 71
% 7.94/2.36 # Positive orientable unit clauses : 41
% 7.94/2.36 # Positive unorientable unit clauses: 3
% 7.94/2.36 # Negative unit clauses : 0
% 7.94/2.36 # Non-unit-clauses : 27
% 7.94/2.36 # Current number of unprocessed clauses: 632
% 7.94/2.36 # ...number of literals in the above : 909
% 7.94/2.36 # Current number of archived formulas : 0
% 7.94/2.36 # Current number of archived clauses : 22
% 7.94/2.36 # Clause-clause subsumption calls (NU) : 112
% 7.94/2.36 # Rec. Clause-clause subsumption calls : 112
% 7.94/2.36 # Non-unit clause-clause subsumptions : 17
% 7.94/2.36 # Unit Clause-clause subsumption calls : 10
% 7.94/2.36 # Rewrite failures with RHS unbound : 0
% 7.94/2.36 # BW rewrite match attempts : 81
% 7.94/2.36 # BW rewrite match successes : 44
% 7.94/2.36 # Condensation attempts : 0
% 7.94/2.36 # Condensation successes : 0
% 7.94/2.36 # Termbank termtop insertions : 12480
% 7.94/2.36
% 7.94/2.36 # -------------------------------------------------
% 7.94/2.36 # User time : 0.017 s
% 7.94/2.36 # System time : 0.003 s
% 7.94/2.36 # Total time : 0.019 s
% 7.94/2.36 # ...preprocessing : 0.009 s
% 7.94/2.36 # ...main loop : 0.010 s
% 7.94/2.36 # Maximum resident set size: 7128 pages
% 7.94/2.36
%------------------------------------------------------------------------------