TSTP Solution File: KLE034+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE034+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:45 EDT 2022
% Result : Theorem 8.33s 2.49s
% Output : CNFRefutation 8.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 42 ( 32 unt; 0 nHn; 26 RR)
% Number of literals : 54 ( 28 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 44 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,negated_conjecture,
leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_6) ).
cnf(i_0_13,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_13) ).
cnf(i_0_7,negated_conjecture,
leq(multiplication(multiplication(esk3_0,esk1_0),c(esk4_0)),zero),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_7) ).
cnf(i_0_17,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_17) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_4) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_2) ).
cnf(i_0_27,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_27) ).
cnf(i_0_12,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_12) ).
cnf(i_0_23,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_23) ).
cnf(i_0_11,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_11) ).
cnf(i_0_14,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_14) ).
cnf(i_0_10,negated_conjecture,
test(esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_10) ).
cnf(i_0_5,negated_conjecture,
~ leq(multiplication(multiplication(multiplication(esk3_0,esk1_0),esk2_0),c(esk5_0)),zero),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_5) ).
cnf(i_0_16,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aonm6ji9/lgb.p',i_0_16) ).
cnf(c_0_42,negated_conjecture,
leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero),
i_0_6 ).
cnf(c_0_43,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_13 ).
cnf(c_0_44,negated_conjecture,
leq(multiplication(multiplication(esk3_0,esk1_0),c(esk4_0)),zero),
i_0_7 ).
cnf(c_0_45,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_17 ).
cnf(c_0_46,negated_conjecture,
leq(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_48,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_49,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_27 ).
cnf(c_0_50,negated_conjecture,
leq(multiplication(esk3_0,multiplication(esk1_0,c(esk4_0))),zero),
inference(rw,[status(thm)],[c_0_44,c_0_43]) ).
cnf(c_0_51,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_12 ).
cnf(c_0_52,plain,
multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_53,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_23 ).
cnf(c_0_55,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_56,plain,
multiplication(esk3_0,multiplication(esk1_0,c(esk4_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_50]),c_0_47]) ).
cnf(c_0_57,plain,
multiplication(zero,X1) = zero,
i_0_11 ).
cnf(c_0_58,plain,
multiplication(addition(esk4_0,X1),multiplication(esk2_0,c(esk5_0))) = multiplication(X1,multiplication(esk2_0,c(esk5_0))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_59,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_48]) ).
cnf(c_0_60,plain,
multiplication(one,X1) = X1,
i_0_14 ).
cnf(c_0_61,negated_conjecture,
test(esk4_0),
i_0_10 ).
cnf(c_0_62,negated_conjecture,
~ leq(multiplication(multiplication(multiplication(esk3_0,esk1_0),esk2_0),c(esk5_0)),zero),
i_0_5 ).
cnf(c_0_63,plain,
multiplication(esk3_0,multiplication(esk1_0,multiplication(c(esk4_0),X1))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_56]),c_0_57]),c_0_43]) ).
cnf(c_0_64,plain,
multiplication(c(esk4_0),multiplication(esk2_0,c(esk5_0))) = multiplication(esk2_0,c(esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61])]) ).
cnf(c_0_65,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_16 ).
cnf(c_0_66,negated_conjecture,
~ leq(multiplication(esk3_0,multiplication(esk1_0,multiplication(esk2_0,c(esk5_0)))),zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_43]),c_0_43]),c_0_43]) ).
cnf(c_0_67,plain,
multiplication(esk3_0,multiplication(esk1_0,multiplication(esk2_0,c(esk5_0)))) = zero,
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,plain,
leq(zero,X1),
inference(spm,[status(thm)],[c_0_65,c_0_53]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KLE034+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 12:38:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # 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
% 8.33/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.33/2.49 # No SInE strategy applied
% 8.33/2.49 # Trying AutoSched0 for 150 seconds
% 8.33/2.49 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 8.33/2.49 # and selection function SelectNewComplexAHP.
% 8.33/2.49 #
% 8.33/2.49 # Preprocessing time : 0.023 s
% 8.33/2.49
% 8.33/2.49 # Proof found!
% 8.33/2.49 # SZS status Theorem
% 8.33/2.49 # SZS output start CNFRefutation
% See solution above
% 8.33/2.49 # Training examples: 0 positive, 0 negative
% 8.33/2.49
% 8.33/2.49 # -------------------------------------------------
% 8.33/2.49 # User time : 0.049 s
% 8.33/2.49 # System time : 0.006 s
% 8.33/2.49 # Total time : 0.055 s
% 8.33/2.49 # Maximum resident set size: 7128 pages
% 8.33/2.49
%------------------------------------------------------------------------------