TSTP Solution File: KLE015+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE015+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:35 EDT 2022
% Result : Theorem 9.80s 2.52s
% Output : CNFRefutation 9.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 53 ( 41 unt; 0 nHn; 28 RR)
% Number of literals : 67 ( 43 equ; 18 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 69 ( 5 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-o4p0i0bm/lgb.p',i_0_1) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_3) ).
cnf(i_0_24,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_24) ).
cnf(i_0_6,negated_conjecture,
test(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_6) ).
cnf(i_0_13,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_13) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_2) ).
cnf(i_0_20,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_20) ).
cnf(i_0_14,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_14) ).
cnf(i_0_7,negated_conjecture,
test(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_7) ).
cnf(i_0_21,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_21) ).
cnf(i_0_9,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_9) ).
cnf(i_0_11,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_11) ).
cnf(i_0_5,negated_conjecture,
multiplication(multiplication(addition(esk1_0,esk2_0),c(esk1_0)),c(esk2_0)) != zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_5) ).
cnf(i_0_10,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_10) ).
cnf(i_0_8,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_8) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_4) ).
cnf(i_0_16,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4p0i0bm/lgb.p',i_0_16) ).
cnf(c_0_42,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_43,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_44,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_24 ).
cnf(c_0_45,negated_conjecture,
test(esk1_0),
i_0_6 ).
cnf(c_0_46,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_13 ).
cnf(c_0_47,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( complement(esk1_0,X1)
| c(esk1_0) != X1 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
leq(X1,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_51,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_20 ).
cnf(c_0_52,negated_conjecture,
complement(esk1_0,c(esk1_0)),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_53,plain,
leq(X1,addition(X2,X1)),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
addition(esk1_0,c(esk1_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_50]) ).
cnf(c_0_55,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_14 ).
cnf(c_0_56,plain,
leq(c(esk1_0),one),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
test(esk2_0),
i_0_7 ).
cnf(c_0_58,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
i_0_21 ).
cnf(c_0_59,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_9 ).
cnf(c_0_60,plain,
addition(one,c(esk1_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_50]) ).
cnf(c_0_61,plain,
multiplication(one,X1) = X1,
i_0_11 ).
cnf(c_0_62,negated_conjecture,
( complement(esk2_0,X1)
| c(esk2_0) != X1 ),
inference(spm,[status(thm)],[c_0_44,c_0_57]) ).
cnf(c_0_63,negated_conjecture,
multiplication(multiplication(addition(esk1_0,esk2_0),c(esk1_0)),c(esk2_0)) != zero,
i_0_5 ).
cnf(c_0_64,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_10 ).
cnf(c_0_65,plain,
multiplication(esk1_0,c(esk1_0)) = zero,
inference(spm,[status(thm)],[c_0_58,c_0_52]) ).
cnf(c_0_66,plain,
multiplication(zero,X1) = zero,
i_0_8 ).
cnf(c_0_67,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_68,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_16 ).
cnf(c_0_69,plain,
addition(X1,multiplication(c(esk1_0),X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_61]) ).
cnf(c_0_70,negated_conjecture,
complement(esk2_0,c(esk2_0)),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_71,negated_conjecture,
addition(multiplication(esk1_0,multiplication(c(esk1_0),c(esk2_0))),multiplication(esk2_0,multiplication(c(esk1_0),c(esk2_0)))) != zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64]),c_0_59]) ).
cnf(c_0_72,plain,
multiplication(esk1_0,multiplication(c(esk1_0),X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_73,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_67,c_0_50]) ).
cnf(c_0_74,plain,
addition(multiplication(X1,X2),multiplication(X1,multiplication(c(esk1_0),X2))) = multiplication(X1,X2),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_75,plain,
multiplication(esk2_0,c(esk2_0)) = zero,
inference(spm,[status(thm)],[c_0_58,c_0_70]) ).
cnf(c_0_76,negated_conjecture,
multiplication(esk2_0,multiplication(c(esk1_0),c(esk2_0))) != zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72]),c_0_73]) ).
cnf(c_0_77,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_73]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE015+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n017.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 14:26:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.80/2.52 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.80/2.52 # No SInE strategy applied
% 9.80/2.52 # Trying AutoSched0 for 150 seconds
% 9.80/2.52 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 9.80/2.52 # and selection function SelectCQArEqLast.
% 9.80/2.52 #
% 9.80/2.52 # Preprocessing time : 0.022 s
% 9.80/2.52 # Presaturation interreduction done
% 9.80/2.52
% 9.80/2.52 # Proof found!
% 9.80/2.52 # SZS status Theorem
% 9.80/2.52 # SZS output start CNFRefutation
% See solution above
% 9.80/2.52 # Training examples: 0 positive, 0 negative
% 9.80/2.52
% 9.80/2.52 # -------------------------------------------------
% 9.80/2.52 # User time : 0.202 s
% 9.80/2.52 # System time : 0.018 s
% 9.80/2.52 # Total time : 0.220 s
% 9.80/2.52 # Maximum resident set size: 7128 pages
% 9.80/2.52
%------------------------------------------------------------------------------