TSTP Solution File: KLE143+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE143+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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 19.30s 3.73s
% Output : CNFRefutation 19.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 56 ( 43 unt; 0 nHn; 16 RR)
% Number of literals : 69 ( 47 equ; 16 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 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 : 92 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_9) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_2) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_1) ).
cnf(i_0_7,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/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-qm8bz2ep/input.p',i_0_8) ).
cnf(i_0_12,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_12) ).
cnf(i_0_5,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_5) ).
cnf(i_0_13,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_13) ).
cnf(i_0_14,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_14) ).
cnf(i_0_4,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_4) ).
cnf(i_0_15,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_15) ).
cnf(i_0_16,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_16) ).
cnf(i_0_11,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_11) ).
cnf(i_0_3,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_3) ).
cnf(i_0_6,negated_conjecture,
( ~ leq(strong_iteration(esk1_0),multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)))
| ~ leq(multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)),strong_iteration(esk1_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qm8bz2ep/input.p',i_0_6) ).
cnf(c_0_32,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
i_0_9 ).
cnf(c_0_33,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_34,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_35,plain,
addition(X1,X1) = X1,
i_0_7 ).
cnf(c_0_36,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
i_0_8 ).
cnf(c_0_37,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_12 ).
cnf(c_0_39,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_5 ).
cnf(c_0_41,plain,
multiplication(one,X1) = X1,
i_0_13 ).
cnf(c_0_42,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(X3,multiplication(X2,X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_43,plain,
addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))) = strong_iteration(multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
multiplication(X1,one) = X1,
i_0_14 ).
cnf(c_0_45,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_39,c_0_33]) ).
cnf(c_0_46,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33]) ).
cnf(c_0_47,plain,
addition(one,addition(multiplication(X1,strong_iteration(X1)),X2)) = addition(strong_iteration(X1),X2),
inference(spm,[status(thm)],[c_0_34,c_0_37]) ).
cnf(c_0_48,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_4 ).
cnf(c_0_49,plain,
( leq(multiplication(X1,strong_iteration(multiplication(X2,X1))),strong_iteration(X2))
| ~ leq(multiplication(X1,strong_iteration(multiplication(X2,X1))),strong_iteration(multiplication(X2,X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_50,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_15 ).
cnf(c_0_51,plain,
multiplication(addition(X1,one),strong_iteration(X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_37]),c_0_33]),c_0_46]) ).
cnf(c_0_52,plain,
addition(one,addition(X1,multiplication(X2,strong_iteration(X2)))) = addition(strong_iteration(X2),X1),
inference(spm,[status(thm)],[c_0_47,c_0_33]) ).
cnf(c_0_53,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_44]),c_0_33]) ).
cnf(c_0_54,plain,
addition(one,strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[c_0_39,c_0_37]) ).
cnf(c_0_55,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_16 ).
cnf(c_0_56,plain,
( leq(multiplication(X1,strong_iteration(multiplication(X2,X1))),strong_iteration(X2))
| multiplication(addition(X1,one),strong_iteration(multiplication(X2,X1))) != strong_iteration(multiplication(X2,X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_33]),c_0_46]) ).
cnf(c_0_57,plain,
multiplication(addition(one,X1),strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[c_0_51,c_0_33]) ).
cnf(c_0_58,plain,
addition(X1,strong_iteration(X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_33]),c_0_54]),c_0_37]),c_0_33]) ).
cnf(c_0_59,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| addition(X1,addition(multiplication(X2,X1),X3)) != addition(multiplication(X2,X1),X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_50]) ).
cnf(c_0_60,plain,
( addition(strong_iteration(X1),multiplication(X2,strong_iteration(multiplication(X1,X2)))) = strong_iteration(X1)
| multiplication(addition(X2,one),strong_iteration(multiplication(X1,X2))) != strong_iteration(multiplication(X1,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_33]) ).
cnf(c_0_61,plain,
multiplication(strong_iteration(X1),strong_iteration(multiplication(X1,strong_iteration(X1)))) = strong_iteration(multiplication(X1,strong_iteration(X1))),
inference(spm,[status(thm)],[c_0_57,c_0_37]) ).
cnf(c_0_62,plain,
addition(strong_iteration(X1),strong_iteration(multiplication(X1,strong_iteration(X1)))) = strong_iteration(multiplication(X1,strong_iteration(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_58]),c_0_54]) ).
cnf(c_0_63,plain,
multiplication(zero,X1) = zero,
i_0_11 ).
cnf(c_0_64,plain,
addition(X1,zero) = X1,
i_0_3 ).
cnf(c_0_65,negated_conjecture,
( ~ leq(strong_iteration(esk1_0),multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)))
| ~ leq(multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)),strong_iteration(esk1_0)) ),
i_0_6 ).
cnf(c_0_66,plain,
leq(X1,multiplication(strong_iteration(X2),X1)),
inference(spm,[status(thm)],[c_0_59,c_0_45]) ).
cnf(c_0_67,plain,
strong_iteration(multiplication(X1,strong_iteration(X1))) = strong_iteration(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_60,c_0_61]),c_0_62]),c_0_33]),c_0_54]),c_0_61])]) ).
cnf(c_0_68,plain,
strong_iteration(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_63]),c_0_64]) ).
cnf(c_0_69,negated_conjecture,
~ leq(multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)),strong_iteration(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).
cnf(c_0_70,plain,
multiplication(strong_iteration(X1),strong_iteration(X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_67]),c_0_67]) ).
cnf(c_0_71,plain,
leq(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_68]),c_0_41]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KLE143+2 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Thu Jun 16 07:06:16 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.16/0.39 # ENIGMATIC: Selected SinE mode:
% 0.16/0.40 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.40 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.16/0.40 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.16/0.40 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 19.30/3.73 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 19.30/3.73 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 28; version: 991; iters: 150)
% 19.30/3.73 # Preprocessing time : 1.147 s
% 19.30/3.73 # Presaturation interreduction done
% 19.30/3.73
% 19.30/3.73 # Proof found!
% 19.30/3.73 # SZS status Theorem
% 19.30/3.73 # SZS output start CNFRefutation
% See solution above
% 19.30/3.73 # Training examples: 0 positive, 0 negative
% 19.30/3.73
% 19.30/3.73 # -------------------------------------------------
% 19.30/3.73 # User time : 1.285 s
% 19.30/3.73 # System time : 0.139 s
% 19.30/3.73 # Total time : 1.424 s
% 19.30/3.73 # ...preprocessing : 1.147 s
% 19.30/3.73 # ...main loop : 0.277 s
% 19.30/3.73 # Maximum resident set size: 184420 pages
% 19.30/3.73
%------------------------------------------------------------------------------