TSTP Solution File: KLE025+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE025+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:40 EDT 2022
% Result : Theorem 7.74s 2.25s
% Output : CNFRefutation 7.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of clauses : 59 ( 32 unt; 0 nHn; 41 RR)
% Number of literals : 98 ( 63 equ; 42 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_25,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_25) ).
cnf(i_0_22,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_22) ).
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-pdzygmmy/lgb.p',i_0_17) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_4) ).
cnf(i_0_21,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_21) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_2) ).
cnf(i_0_13,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_13) ).
cnf(i_0_11,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_11) ).
cnf(i_0_7,negated_conjecture,
test(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_7) ).
cnf(i_0_19,plain,
( complement(esk4_1(X1),X1)
| ~ test(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_19) ).
cnf(i_0_9,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_9) ).
cnf(i_0_24,plain,
( c(X1) = X2
| ~ test(X1)
| ~ complement(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_24) ).
cnf(i_0_20,plain,
( complement(X1,X2)
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_20) ).
cnf(i_0_6,negated_conjecture,
multiplication(multiplication(esk2_0,esk1_0),c(esk3_0)) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_6) ).
cnf(i_0_23,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_23) ).
cnf(i_0_5,negated_conjecture,
multiplication(multiplication(esk2_0,esk1_0),esk3_0) != multiplication(esk2_0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdzygmmy/lgb.p',i_0_5) ).
cnf(c_0_42,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_25 ).
cnf(c_0_43,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
i_0_22 ).
cnf(c_0_44,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_45,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_17 ).
cnf(c_0_46,plain,
( multiplication(X1,c(X1)) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_48,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_21 ).
cnf(c_0_49,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_50,plain,
( multiplication(X1,addition(X2,c(X1))) = multiplication(X1,X2)
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_51,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_44]),c_0_49]) ).
cnf(c_0_52,plain,
multiplication(X1,one) = X1,
i_0_13 ).
cnf(c_0_53,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_11 ).
cnf(c_0_54,plain,
( multiplication(X1,X1) = X1
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
test(esk3_0),
i_0_7 ).
cnf(c_0_56,plain,
( multiplication(X1,multiplication(X2,c(multiplication(X1,X2)))) = zero
| ~ test(multiplication(X1,X2)) ),
inference(spm,[status(thm)],[c_0_53,c_0_46]) ).
cnf(c_0_57,negated_conjecture,
multiplication(esk3_0,esk3_0) = esk3_0,
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
( complement(esk4_1(X1),X1)
| ~ test(X1) ),
i_0_19 ).
cnf(c_0_59,plain,
multiplication(esk3_0,multiplication(esk3_0,c(esk3_0))) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_55])]) ).
cnf(c_0_60,plain,
multiplication(esk3_0,multiplication(esk3_0,X1)) = multiplication(esk3_0,X1),
inference(spm,[status(thm)],[c_0_53,c_0_57]) ).
cnf(c_0_61,plain,
( multiplication(esk4_1(X1),X1) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_58]) ).
cnf(c_0_62,plain,
multiplication(zero,X1) = zero,
i_0_9 ).
cnf(c_0_63,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_52]),c_0_49]) ).
cnf(c_0_64,plain,
multiplication(esk3_0,c(esk3_0)) = zero,
inference(rw,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
( c(X1) = X2
| ~ test(X1)
| ~ complement(X1,X2) ),
i_0_24 ).
cnf(c_0_66,plain,
( complement(X1,X2)
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
i_0_20 ).
cnf(c_0_67,plain,
( multiplication(esk4_1(X1),multiplication(X1,X2)) = zero
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_61]),c_0_62]) ).
cnf(c_0_68,plain,
multiplication(esk3_0,addition(one,c(esk3_0))) = esk3_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_47]),c_0_49]) ).
cnf(c_0_69,plain,
( c(X1) = X2
| multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero
| addition(X2,X1) != one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,plain,
multiplication(esk4_1(esk3_0),esk3_0) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_55])]) ).
cnf(c_0_71,negated_conjecture,
multiplication(multiplication(esk2_0,esk1_0),c(esk3_0)) = zero,
i_0_6 ).
cnf(c_0_72,plain,
( esk4_1(esk3_0) = c(esk3_0)
| multiplication(esk3_0,esk4_1(esk3_0)) != zero
| addition(esk3_0,esk4_1(esk3_0)) != one ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_55])]),c_0_49]) ).
cnf(c_0_73,plain,
( addition(X1,esk4_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_58]) ).
cnf(c_0_74,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
i_0_23 ).
cnf(c_0_75,negated_conjecture,
multiplication(esk2_0,multiplication(esk1_0,c(esk3_0))) = zero,
inference(rw,[status(thm)],[c_0_71,c_0_53]) ).
cnf(c_0_76,plain,
( esk4_1(esk3_0) = c(esk3_0)
| multiplication(esk3_0,esk4_1(esk3_0)) != zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_55])]) ).
cnf(c_0_77,plain,
( multiplication(X1,esk4_1(X1)) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_58]) ).
cnf(c_0_78,negated_conjecture,
multiplication(esk2_0,addition(X1,multiplication(esk1_0,c(esk3_0)))) = multiplication(esk2_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_75]),c_0_47]) ).
cnf(c_0_79,plain,
esk4_1(esk3_0) = c(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_55])]) ).
cnf(c_0_80,negated_conjecture,
multiplication(multiplication(esk2_0,esk1_0),esk3_0) != multiplication(esk2_0,esk1_0),
i_0_5 ).
cnf(c_0_81,plain,
multiplication(esk2_0,multiplication(esk1_0,addition(X1,c(esk3_0)))) = multiplication(esk2_0,multiplication(esk1_0,X1)),
inference(spm,[status(thm)],[c_0_78,c_0_45]) ).
cnf(c_0_82,plain,
addition(esk3_0,c(esk3_0)) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_79]),c_0_55])]) ).
cnf(c_0_83,negated_conjecture,
multiplication(esk2_0,multiplication(esk1_0,esk3_0)) != multiplication(esk2_0,esk1_0),
inference(rw,[status(thm)],[c_0_80,c_0_53]) ).
cnf(c_0_84,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_52]),c_0_83]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE025+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 16 14:44:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.74/2.25 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.74/2.25 # No SInE strategy applied
% 7.74/2.25 # Trying AutoSched0 for 150 seconds
% 7.74/2.25 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.74/2.25 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.74/2.25 #
% 7.74/2.25 # Preprocessing time : 0.023 s
% 7.74/2.25 # Presaturation interreduction done
% 7.74/2.25
% 7.74/2.25 # Proof found!
% 7.74/2.25 # SZS status Theorem
% 7.74/2.25 # SZS output start CNFRefutation
% See solution above
% 7.74/2.25 # Training examples: 0 positive, 0 negative
% 7.74/2.25
% 7.74/2.25 # -------------------------------------------------
% 7.74/2.25 # User time : 0.079 s
% 7.74/2.25 # System time : 0.008 s
% 7.74/2.25 # Total time : 0.087 s
% 7.74/2.25 # Maximum resident set size: 7120 pages
% 7.74/2.25
%------------------------------------------------------------------------------