%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE020+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:36 EDT 2022
% Result : Theorem 9.29s 2.58s
% Output : CNFRefutation 9.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 61 ( 47 unt; 0 def)
% Number of atoms : 99 ( 58 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 61 ( 23 ~; 18 |; 14 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 : 81 ( 0 sgn 48 !; 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] :
( ( test(X4)
& test(X5)
& test(X6) )
=> addition(X4,multiplication(X5,X6)) = multiplication(addition(X4,X5),addition(X4,X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
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(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(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
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_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(c_0_12,plain,
! [X35,X36] :
( ( c(X35) != X36
| complement(X35,X36)
| ~ test(X35) )
& ( ~ complement(X35,X36)
| c(X35) = X36
| ~ test(X35) ) ),
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] :
( ( test(X4)
& test(X5)
& test(X6) )
=> addition(X4,multiplication(X5,X6)) = multiplication(addition(X4,X5),addition(X4,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(esk2_0)
& test(esk3_0)
& test(esk4_0)
& addition(esk2_0,multiplication(esk3_0,esk4_0)) != multiplication(addition(esk2_0,esk3_0),addition(esk2_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,
! [X29,X31,X32] :
( ( ~ test(X29)
| complement(esk1_1(X29),X29) )
& ( ~ complement(X32,X31)
| test(X31) ) ),
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])])])])]) ).
fof(c_0_17,plain,
! [X33,X34] :
( ( multiplication(X33,X34) = zero
| ~ complement(X34,X33) )
& ( multiplication(X34,X33) = zero
| ~ complement(X34,X33) )
& ( addition(X33,X34) = one
| ~ complement(X34,X33) )
& ( multiplication(X33,X34) != zero
| multiplication(X34,X33) != zero
| addition(X33,X34) != one
| complement(X34,X33) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_18,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_21,plain,
! [X9,X10,X11] : addition(X11,addition(X10,X9)) = addition(addition(X11,X10),X9),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_22,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_23,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_26,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_27,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,negated_conjecture,
complement(esk2_0,c(esk2_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_29,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_30,plain,
! [X18] : multiplication(one,X18) = X18,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_31,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,negated_conjecture,
complement(esk1_1(esk3_0),esk3_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_34,negated_conjecture,
complement(esk1_1(esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
fof(c_0_35,plain,
! [X19,X20,X21] : multiplication(X19,addition(X20,X21)) = addition(multiplication(X19,X20),multiplication(X19,X21)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_36,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_38,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_40,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_41,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_42,negated_conjecture,
addition(esk3_0,esk1_1(esk3_0)) = one,
inference(spm,[status(thm)],[c_0_27,c_0_33]) ).
cnf(c_0_43,negated_conjecture,
addition(esk4_0,esk1_1(esk4_0)) = one,
inference(spm,[status(thm)],[c_0_27,c_0_34]) ).
fof(c_0_44,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_45,negated_conjecture,
addition(esk2_0,multiplication(esk3_0,esk4_0)) != multiplication(addition(esk2_0,esk3_0),addition(esk2_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_46,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_47,negated_conjecture,
addition(multiplication(esk2_0,X1),multiplication(c(esk2_0),X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_48,negated_conjecture,
multiplication(c(esk2_0),esk2_0) = zero,
inference(spm,[status(thm)],[c_0_39,c_0_28]) ).
cnf(c_0_49,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_50,negated_conjecture,
addition(one,esk3_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_29]) ).
cnf(c_0_51,negated_conjecture,
addition(one,esk4_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_43]),c_0_29]) ).
cnf(c_0_52,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_53,negated_conjecture,
addition(multiplication(esk2_0,esk2_0),addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk4_0)))) != addition(esk2_0,multiplication(esk3_0,esk4_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_36]),c_0_36]),c_0_31]) ).
cnf(c_0_54,negated_conjecture,
multiplication(esk2_0,esk2_0) = esk2_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_55,negated_conjecture,
addition(X1,multiplication(esk3_0,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_50]),c_0_38]),c_0_38]) ).
cnf(c_0_56,negated_conjecture,
addition(X1,multiplication(X1,esk4_0)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_51]),c_0_52]),c_0_52]) ).
cnf(c_0_57,negated_conjecture,
addition(esk2_0,addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk4_0)))) != addition(esk2_0,multiplication(esk3_0,esk4_0)),
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
addition(X1,addition(multiplication(esk3_0,X1),X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
addition(X1,addition(multiplication(X1,esk4_0),X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KLE020+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n026.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 07:53:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/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
% 9.29/2.58 # ENIGMATIC: Solved by autoschedule:
% 9.29/2.58 # No SInE strategy applied
% 9.29/2.58 # Trying AutoSched0 for 150 seconds
% 9.29/2.58 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 9.29/2.58 # and selection function SelectComplexG.
% 9.29/2.58 #
% 9.29/2.58 # Preprocessing time : 0.023 s
% 9.29/2.58
% 9.29/2.58 # Proof found!
% 9.29/2.58 # SZS status Theorem
% 9.29/2.58 # SZS output start CNFRefutation
% See solution above
% 9.29/2.58 # Training examples: 0 positive, 0 negative
% 9.29/2.58
% 9.29/2.58 # -------------------------------------------------
% 9.29/2.58 # User time : 0.108 s
% 9.29/2.58 # System time : 0.014 s
% 9.29/2.58 # Total time : 0.122 s
% 9.29/2.58 # Maximum resident set size: 7120 pages
% 9.29/2.58
%------------------------------------------------------------------------------