TSTP Solution File: KLE024+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE024+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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.56s 2.46s
% Output : CNFRefutation 7.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 26 unt; 0 def)
% Number of atoms : 68 ( 44 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 50 ( 18 ~; 14 |; 11 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 52 ( 2 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( addition(multiplication(X4,c(X6)),multiplication(c(X5),X4)) = multiplication(c(X5),X4)
=> multiplication(multiplication(X5,X4),c(X6)) = zero ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( addition(multiplication(X4,c(X6)),multiplication(c(X5),X4)) = multiplication(c(X5),X4)
=> multiplication(multiplication(X5,X4),c(X6)) = zero ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,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_10,negated_conjecture,
( test(esk3_0)
& test(esk4_0)
& addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0)) = multiplication(c(esk3_0),esk2_0)
& multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) != zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_11,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_14,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_15,negated_conjecture,
( complement(esk3_0,X1)
| c(esk3_0) != X1 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,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_17,negated_conjecture,
addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0)) = multiplication(c(esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_20,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
complement(esk3_0,c(esk3_0)),
inference(er,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X26] : multiplication(zero,X26) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_23,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_24,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
addition(multiplication(c(esk3_0),esk2_0),multiplication(esk2_0,c(esk4_0))) = multiplication(c(esk3_0),esk2_0),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
multiplication(esk3_0,c(esk3_0)) = zero,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) != zero,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
addition(multiplication(X1,multiplication(c(esk3_0),esk2_0)),multiplication(X1,multiplication(esk2_0,c(esk4_0)))) = multiplication(X1,multiplication(c(esk3_0),esk2_0)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
multiplication(esk3_0,multiplication(c(esk3_0),X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_33,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_18]) ).
cnf(c_0_34,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))) != zero,
inference(rw,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : KLE024+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 16 13:38:11 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.56/2.46 # ENIGMATIC: Solved by autoschedule:
% 7.56/2.46 # No SInE strategy applied
% 7.56/2.46 # Trying AutoSched0 for 150 seconds
% 7.56/2.46 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 7.56/2.46 # and selection function SelectCQArEqLast.
% 7.56/2.46 #
% 7.56/2.46 # Preprocessing time : 0.025 s
% 7.56/2.46 # Presaturation interreduction done
% 7.56/2.46
% 7.56/2.46 # Proof found!
% 7.56/2.46 # SZS status Theorem
% 7.56/2.46 # SZS output start CNFRefutation
% See solution above
% 7.56/2.46 # Training examples: 0 positive, 0 negative
% 7.56/2.46
% 7.56/2.46 # -------------------------------------------------
% 7.56/2.46 # User time : 0.041 s
% 7.56/2.46 # System time : 0.009 s
% 7.56/2.46 # Total time : 0.049 s
% 7.56/2.46 # Maximum resident set size: 7124 pages
% 7.56/2.46
%------------------------------------------------------------------------------