TSTP Solution File: KLE146+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE146+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:50:34 EDT 2022
% Result : Theorem 7.97s 2.49s
% Output : CNFRefutation 7.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 15 unt; 0 nHn; 6 RR)
% Number of literals : 19 ( 14 equ; 5 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pwwhdloh/lgb.p',i_0_1) ).
cnf(i_0_7,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pwwhdloh/lgb.p',i_0_7) ).
cnf(i_0_9,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pwwhdloh/lgb.p',i_0_9) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pwwhdloh/lgb.p',i_0_2) ).
cnf(i_0_6,negated_conjecture,
~ leq(one,strong_iteration(esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pwwhdloh/lgb.p',i_0_6) ).
cnf(i_0_15,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pwwhdloh/lgb.p',i_0_15) ).
cnf(c_0_22,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_23,plain,
addition(X1,X1) = X1,
i_0_7 ).
cnf(c_0_24,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
i_0_9 ).
cnf(c_0_25,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_26,negated_conjecture,
~ leq(one,strong_iteration(esk1_0)),
i_0_6 ).
cnf(c_0_27,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_15 ).
cnf(c_0_28,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
addition(one,strong_iteration(esk1_0)) != strong_iteration(esk1_0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
addition(one,strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KLE146+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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 16:32:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.97/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.97/2.49 # No SInE strategy applied
% 7.97/2.49 # Trying AutoSched0 for 150 seconds
% 7.97/2.49 # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.97/2.49 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.97/2.49 #
% 7.97/2.49 # Preprocessing time : 0.023 s
% 7.97/2.49
% 7.97/2.49 # Proof found!
% 7.97/2.49 # SZS status Theorem
% 7.97/2.49 # SZS output start CNFRefutation
% See solution above
% 7.97/2.49 # Training examples: 0 positive, 0 negative
% 7.97/2.49
% 7.97/2.49 # -------------------------------------------------
% 7.97/2.49 # User time : 0.025 s
% 7.97/2.49 # System time : 0.008 s
% 7.97/2.49 # Total time : 0.032 s
% 7.97/2.49 # Maximum resident set size: 7128 pages
% 7.97/2.49
%------------------------------------------------------------------------------