TSTP Solution File: KLE027+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE027+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:42 EDT 2022
% Result : Theorem 7.42s 2.28s
% Output : CNFRefutation 7.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 58 ( 37 unt; 0 def)
% Number of atoms : 106 ( 59 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 82 ( 34 ~; 29 |; 12 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 90 ( 3 sgn 54 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(goals,conjecture,
! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X8) )
=> addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)) = addition(multiplication(X7,X4),multiplication(c(X7),X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(test_deMorgan1,axiom,
! [X4,X5] :
( ( test(X4)
& test(X5) )
=> c(addition(X4,X5)) = multiplication(c(X4),c(X5)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+2.ax',test_deMorgan1) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(c_0_12,plain,
! [X37,X38] :
( ( c(X37) != X38
| complement(X37,X38)
| ~ test(X37) )
& ( ~ complement(X37,X38)
| c(X37) = X38
| ~ test(X37) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X8) )
=> addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)) = addition(multiplication(X7,X4),multiplication(c(X7),X6)) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_14,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,negated_conjecture,
( test(esk5_0)
& test(esk6_0)
& addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_16,plain,
! [X35,X36] :
( ( multiplication(X35,X36) = zero
| ~ complement(X36,X35) )
& ( multiplication(X36,X35) = zero
| ~ complement(X36,X35) )
& ( addition(X35,X36) = one
| ~ complement(X36,X35) )
& ( multiplication(X35,X36) != zero
| multiplication(X36,X35) != zero
| addition(X35,X36) != one
| complement(X36,X35) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_17,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
test(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X9,X10] : addition(X9,X10) = addition(X10,X9),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_20,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
complement(esk5_0,c(esk5_0)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,plain,
! [X31,X33,X34] :
( ( ~ test(X31)
| complement(esk1_1(X31),X31) )
& ( ~ complement(X34,X33)
| test(X33) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])]) ).
cnf(c_0_26,plain,
( complement(X2,X1)
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
addition(esk5_0,c(esk5_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_28,negated_conjecture,
multiplication(c(esk5_0),esk5_0) = zero,
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
multiplication(esk5_0,c(esk5_0)) = zero,
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_30,plain,
( test(X2)
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_31,plain,
! [X40,X41] :
( ~ test(X40)
| ~ test(X41)
| c(addition(X40,X41)) = multiplication(c(X40),c(X41)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_deMorgan1])]) ).
cnf(c_0_32,plain,
( c(X1) = X2
| ~ complement(X1,X2)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,negated_conjecture,
complement(c(esk5_0),esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_29])]) ).
cnf(c_0_34,negated_conjecture,
test(c(esk5_0)),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
fof(c_0_35,plain,
! [X21,X22,X23] : multiplication(X21,addition(X22,X23)) = addition(multiplication(X21,X22),multiplication(X21,X23)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_36,plain,
! [X11,X12,X13] : addition(X13,addition(X12,X11)) = addition(addition(X13,X12),X11),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_37,plain,
! [X16,X17,X18] : multiplication(X16,multiplication(X17,X18)) = multiplication(multiplication(X16,X17),X18),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_38,plain,
! [X28] : multiplication(zero,X28) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_39,plain,
! [X14] : addition(X14,zero) = X14,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_40,plain,
( c(addition(X1,X2)) = multiplication(c(X1),c(X2))
| ~ test(X1)
| ~ test(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,negated_conjecture,
c(c(esk5_0)) = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
fof(c_0_42,plain,
! [X15] : addition(X15,X15) = X15,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_43,negated_conjecture,
addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_44,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_47,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,negated_conjecture,
( c(addition(X1,c(esk5_0))) = multiplication(c(X1),esk5_0)
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_34]),c_0_41]) ).
cnf(c_0_50,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,negated_conjecture,
addition(multiplication(esk5_0,multiplication(esk5_0,esk2_0)),addition(multiplication(esk5_0,multiplication(c(esk5_0),esk3_0)),multiplication(c(esk5_0),esk4_0))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_52,negated_conjecture,
multiplication(esk5_0,multiplication(c(esk5_0),X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_29]),c_0_47]) ).
cnf(c_0_53,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_48,c_0_22]) ).
cnf(c_0_54,negated_conjecture,
multiplication(esk5_0,esk5_0) = esk5_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_34]),c_0_50]),c_0_41]),c_0_41]) ).
cnf(c_0_55,negated_conjecture,
addition(multiplication(esk5_0,multiplication(esk5_0,esk2_0)),multiplication(c(esk5_0),esk4_0)) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_56,negated_conjecture,
multiplication(esk5_0,multiplication(esk5_0,X1)) = multiplication(esk5_0,X1),
inference(spm,[status(thm)],[c_0_46,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE027+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n014.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 09:30:22 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.43 # ENIGMATIC: Selected SinE mode:
% 0.19/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.42/2.28 # ENIGMATIC: Solved by autoschedule:
% 7.42/2.28 # No SInE strategy applied
% 7.42/2.28 # Trying AutoSched0 for 150 seconds
% 7.42/2.28 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S064A
% 7.42/2.28 # and selection function SelectComplexG.
% 7.42/2.28 #
% 7.42/2.28 # Preprocessing time : 0.025 s
% 7.42/2.28 # Presaturation interreduction done
% 7.42/2.28
% 7.42/2.28 # Proof found!
% 7.42/2.28 # SZS status Theorem
% 7.42/2.28 # SZS output start CNFRefutation
% See solution above
% 7.42/2.28 # Training examples: 0 positive, 0 negative
% 7.42/2.28
% 7.42/2.28 # -------------------------------------------------
% 7.42/2.28 # User time : 0.128 s
% 7.42/2.28 # System time : 0.011 s
% 7.42/2.28 # Total time : 0.138 s
% 7.42/2.28 # Maximum resident set size: 7120 pages
% 7.42/2.28
%------------------------------------------------------------------------------