TSTP Solution File: KLE008+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE008+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:29 EDT 2022
% Result : Theorem 8.65s 2.45s
% Output : CNFRefutation 8.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 19
% Syntax : Number of clauses : 71 ( 43 unt; 11 nHn; 38 RR)
% Number of literals : 103 ( 57 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 90 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_25,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_25) ).
cnf(i_0_15,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_15) ).
cnf(i_0_5,negated_conjecture,
( leq(esk1_0,multiplication(esk3_0,esk2_0))
| leq(multiplication(c(esk3_0),esk1_0),zero) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_5) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_4) ).
cnf(i_0_8,negated_conjecture,
test(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_8) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_2) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_1) ).
cnf(i_0_6,negated_conjecture,
( leq(esk1_0,esk2_0)
| leq(esk1_0,multiplication(esk3_0,esk2_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_6) ).
cnf(i_0_14,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_14) ).
cnf(i_0_17,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_17) ).
cnf(i_0_23,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_23) ).
cnf(i_0_11,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_11) ).
cnf(i_0_9,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_9) ).
cnf(i_0_16,plain,
multiplication(X1,zero) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_16) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_3) ).
cnf(i_0_21,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_21) ).
cnf(i_0_10,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_10) ).
cnf(i_0_12,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_12) ).
cnf(i_0_7,negated_conjecture,
( ~ leq(esk1_0,esk2_0)
| ~ leq(esk1_0,multiplication(esk3_0,esk2_0))
| ~ leq(multiplication(c(esk3_0),esk1_0),zero) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lywan61a/lgb.p',i_0_7) ).
cnf(c_0_45,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_25 ).
cnf(c_0_46,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_15 ).
cnf(c_0_47,negated_conjecture,
( leq(esk1_0,multiplication(esk3_0,esk2_0))
| leq(multiplication(c(esk3_0),esk1_0),zero) ),
i_0_5 ).
cnf(c_0_48,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_49,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_50,negated_conjecture,
test(esk3_0),
i_0_8 ).
cnf(c_0_51,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_52,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_53,negated_conjecture,
( leq(esk1_0,esk2_0)
| leq(esk1_0,multiplication(esk3_0,esk2_0)) ),
i_0_6 ).
cnf(c_0_54,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_14 ).
cnf(c_0_55,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_17 ).
cnf(c_0_56,negated_conjecture,
( multiplication(c(esk3_0),esk1_0) = zero
| leq(esk1_0,multiplication(esk3_0,esk2_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_57,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
i_0_23 ).
cnf(c_0_58,negated_conjecture,
complement(esk3_0,c(esk3_0)),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_59,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_60,negated_conjecture,
( addition(esk1_0,multiplication(esk3_0,esk2_0)) = multiplication(esk3_0,esk2_0)
| leq(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_53]) ).
cnf(c_0_61,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_11 ).
cnf(c_0_62,plain,
( leq(multiplication(X1,X2),multiplication(X1,X3))
| multiplication(X1,addition(X2,X3)) != multiplication(X1,X3) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_63,plain,
( addition(esk1_0,multiplication(esk3_0,esk2_0)) = multiplication(esk3_0,esk2_0)
| multiplication(c(esk3_0),esk1_0) = zero ),
inference(spm,[status(thm)],[c_0_46,c_0_56]) ).
cnf(c_0_64,plain,
multiplication(c(esk3_0),esk3_0) = zero,
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,plain,
multiplication(zero,X1) = zero,
i_0_9 ).
cnf(c_0_66,plain,
multiplication(X1,zero) = zero,
i_0_16 ).
cnf(c_0_67,plain,
( leq(X1,addition(X2,X3))
| addition(X3,addition(X1,X2)) != addition(X2,X3) ),
inference(spm,[status(thm)],[c_0_54,c_0_59]) ).
cnf(c_0_68,plain,
( addition(esk1_0,multiplication(esk3_0,esk2_0)) = multiplication(esk3_0,esk2_0)
| addition(esk1_0,esk2_0) = esk2_0 ),
inference(spm,[status(thm)],[c_0_46,c_0_60]) ).
cnf(c_0_69,plain,
addition(X1,X2) = addition(X2,X1),
c_0_51 ).
cnf(c_0_70,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
c_0_61 ).
cnf(c_0_71,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
c_0_52 ).
cnf(c_0_72,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_73,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_21 ).
cnf(c_0_74,plain,
( multiplication(c(esk3_0),esk1_0) = zero
| leq(multiplication(X1,esk1_0),multiplication(X1,multiplication(esk3_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_75,plain,
multiplication(c(esk3_0),multiplication(esk3_0,X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_64]),c_0_65]) ).
cnf(c_0_76,plain,
( leq(multiplication(X1,X2),zero)
| multiplication(X1,X2) != zero ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_48]),c_0_66]),c_0_66]) ).
cnf(c_0_77,plain,
( addition(esk1_0,esk2_0) = esk2_0
| leq(esk1_0,addition(multiplication(esk3_0,esk2_0),X1)) ),
inference(ar,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69,c_0_70,c_0_71]) ).
cnf(c_0_78,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_59,c_0_72]) ).
cnf(c_0_79,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_10 ).
cnf(c_0_80,plain,
multiplication(one,X1) = X1,
i_0_12 ).
cnf(c_0_81,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_52,c_0_72]) ).
cnf(c_0_82,plain,
addition(esk3_0,c(esk3_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_58]),c_0_51]) ).
cnf(c_0_83,plain,
leq(multiplication(c(esk3_0),esk1_0),zero),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]) ).
cnf(c_0_84,plain,
( addition(esk1_0,esk2_0) = esk2_0
| leq(esk1_0,addition(X1,multiplication(esk3_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_85,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_51]) ).
cnf(c_0_86,plain,
addition(one,esk3_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_51]) ).
cnf(c_0_87,plain,
multiplication(c(esk3_0),esk1_0) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_83]),c_0_48]) ).
cnf(c_0_88,negated_conjecture,
( ~ leq(esk1_0,esk2_0)
| ~ leq(esk1_0,multiplication(esk3_0,esk2_0))
| ~ leq(multiplication(c(esk3_0),esk1_0),zero) ),
i_0_7 ).
cnf(c_0_89,plain,
addition(esk1_0,esk2_0) = esk2_0,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_51]),c_0_86]),c_0_80]),c_0_46]) ).
cnf(c_0_90,plain,
multiplication(addition(X1,c(esk3_0)),esk1_0) = multiplication(X1,esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_87]),c_0_48]) ).
cnf(c_0_91,negated_conjecture,
( ~ leq(esk1_0,multiplication(esk3_0,esk2_0))
| ~ leq(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_83])]) ).
cnf(c_0_92,plain,
leq(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_54,c_0_89]) ).
cnf(c_0_93,plain,
leq(multiplication(X1,esk1_0),multiplication(X1,esk2_0)),
inference(spm,[status(thm)],[c_0_62,c_0_89]) ).
cnf(c_0_94,plain,
multiplication(esk3_0,esk1_0) = esk1_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_82]),c_0_80]) ).
cnf(c_0_95,negated_conjecture,
~ leq(esk1_0,multiplication(esk3_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]) ).
cnf(c_0_96,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE008+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 12:40:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.65/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.65/2.45 # No SInE strategy applied
% 8.65/2.45 # Trying AutoSched0 for 150 seconds
% 8.65/2.45 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 8.65/2.45 # and selection function SelectComplexG.
% 8.65/2.45 #
% 8.65/2.45 # Preprocessing time : 0.023 s
% 8.65/2.45
% 8.65/2.45 # Proof found!
% 8.65/2.45 # SZS status Theorem
% 8.65/2.45 # SZS output start CNFRefutation
% See solution above
% 8.65/2.45 # Training examples: 1 positive, 2 negative
% 8.65/2.45
% 8.65/2.45 # -------------------------------------------------
% 8.65/2.45 # User time : 0.063 s
% 8.65/2.45 # System time : 0.010 s
% 8.65/2.45 # Total time : 0.073 s
% 8.65/2.45 # Maximum resident set size: 7124 pages
% 8.65/2.45
%------------------------------------------------------------------------------