TSTP Solution File: KLE139+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE139+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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 14.93s 3.38s
% Output : CNFRefutation 14.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 21 unt; 0 nHn; 6 RR)
% Number of literals : 31 ( 21 equ; 8 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 : 40 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wbl56ur5/input.p',i_0_1) ).
cnf(i_0_20,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wbl56ur5/input.p',i_0_20) ).
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-wbl56ur5/input.p',i_0_5) ).
cnf(i_0_6,negated_conjecture,
( ~ leq(strong_iteration(esk1_0),addition(multiplication(strong_iteration(esk1_0),esk1_0),one))
| ~ leq(addition(multiplication(strong_iteration(esk1_0),esk1_0),one),strong_iteration(esk1_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wbl56ur5/input.p',i_0_6) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wbl56ur5/input.p',i_0_2) ).
cnf(i_0_10,plain,
addition(star(X1),multiplication(strong_iteration(X1),zero)) = strong_iteration(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wbl56ur5/input.p',i_0_10) ).
cnf(i_0_12,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wbl56ur5/input.p',i_0_12) ).
cnf(i_0_11,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wbl56ur5/input.p',i_0_11) ).
cnf(i_0_15,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wbl56ur5/input.p',i_0_15) ).
cnf(i_0_7,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wbl56ur5/input.p',i_0_7) ).
cnf(c_0_31,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_32,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
i_0_20 ).
cnf(c_0_33,plain,
addition(one,addition(multiplication(star(X1),X1),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_5 ).
cnf(c_0_35,negated_conjecture,
( ~ leq(strong_iteration(esk1_0),addition(multiplication(strong_iteration(esk1_0),esk1_0),one))
| ~ leq(addition(multiplication(strong_iteration(esk1_0),esk1_0),one),strong_iteration(esk1_0)) ),
i_0_6 ).
cnf(c_0_36,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_37,plain,
addition(one,multiplication(addition(star(X1),X2),X1)) = addition(star(X1),multiplication(X2,X1)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
addition(star(X1),multiplication(strong_iteration(X1),zero)) = strong_iteration(X1),
i_0_10 ).
cnf(c_0_39,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_12 ).
cnf(c_0_40,plain,
multiplication(zero,X1) = zero,
i_0_11 ).
cnf(c_0_41,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_15 ).
cnf(c_0_42,plain,
addition(X1,X1) = X1,
i_0_7 ).
cnf(c_0_43,negated_conjecture,
( ~ leq(strong_iteration(esk1_0),addition(one,multiplication(strong_iteration(esk1_0),esk1_0)))
| ~ leq(addition(one,multiplication(strong_iteration(esk1_0),esk1_0)),strong_iteration(esk1_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_36]) ).
cnf(c_0_44,plain,
addition(one,multiplication(strong_iteration(X1),X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]),c_0_38]) ).
cnf(c_0_45,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KLE139+2 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Thu Jun 16 12:03:13 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 14.93/3.38 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 14.93/3.38 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 34; version: 991; iters: 150)
% 14.93/3.38 # Preprocessing time : 0.818 s
% 14.93/3.38 # Presaturation interreduction done
% 14.93/3.38
% 14.93/3.38 # Proof found!
% 14.93/3.38 # SZS status Theorem
% 14.93/3.38 # SZS output start CNFRefutation
% See solution above
% 14.93/3.38 # Training examples: 0 positive, 0 negative
% 14.93/3.38
% 14.93/3.38 # -------------------------------------------------
% 14.93/3.38 # User time : 0.785 s
% 14.93/3.38 # System time : 0.110 s
% 14.93/3.38 # Total time : 0.895 s
% 14.93/3.38 # ...preprocessing : 0.818 s
% 14.93/3.38 # ...main loop : 0.077 s
% 14.93/3.38 # Maximum resident set size: 167412 pages
% 14.93/3.38
%------------------------------------------------------------------------------