TSTP Solution File: KLE034+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE034+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:45 EDT 2022
% Result : Theorem 7.69s 2.31s
% Output : CNFRefutation 7.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 53 ( 39 unt; 0 def)
% Number of atoms : 97 ( 49 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 66 ( 22 ~; 18 |; 20 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 71 ( 2 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X6)
& test(X8)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& leq(multiplication(multiplication(X7,X5),c(X8)),zero) )
=> leq(multiplication(multiplication(multiplication(X6,X4),X5),c(X8)),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(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(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(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(c_0_11,negated_conjecture,
~ ! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X6)
& test(X8)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& leq(multiplication(multiplication(X7,X5),c(X8)),zero) )
=> leq(multiplication(multiplication(multiplication(X6,X4),X5),c(X8)),zero) ),
inference(assume_negation,[status(cth)],[goals]) ).
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,
( test(esk5_0)
& test(esk4_0)
& test(esk6_0)
& leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero)
& leq(multiplication(multiplication(esk5_0,esk3_0),c(esk6_0)),zero)
& ~ leq(multiplication(multiplication(multiplication(esk4_0,esk2_0),esk3_0),c(esk6_0)),zero) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_14,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
test(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X16,X17,X18] : multiplication(X16,multiplication(X17,X18)) = multiplication(multiplication(X16,X17),X18),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_17,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_18,negated_conjecture,
( complement(esk5_0,X1)
| c(esk5_0) != X1 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,plain,
! [X9,X10] : addition(X9,X10) = addition(X10,X9),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_20,plain,
! [X29,X30] :
( ( ~ leq(X29,X30)
| addition(X29,X30) = X30 )
& ( addition(X29,X30) != X30
| leq(X29,X30) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_21,negated_conjecture,
leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,plain,
! [X14] : addition(X14,zero) = X14,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_24,plain,
! [X24,X25,X26] : multiplication(addition(X24,X25),X26) = addition(multiplication(X24,X26),multiplication(X25,X26)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_25,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
complement(esk5_0,c(esk5_0)),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_28,plain,
! [X20] : multiplication(one,X20) = X20,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_29,negated_conjecture,
leq(multiplication(multiplication(esk5_0,esk3_0),c(esk6_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,negated_conjecture,
leq(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_32,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_33,plain,
! [X28] : multiplication(zero,X28) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_34,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,negated_conjecture,
addition(esk5_0,c(esk5_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_36,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,negated_conjecture,
leq(multiplication(esk5_0,multiplication(esk3_0,c(esk6_0))),zero),
inference(rw,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_38,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_39,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
addition(multiplication(esk5_0,X1),multiplication(c(esk5_0),X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_41,negated_conjecture,
multiplication(esk5_0,multiplication(esk3_0,c(esk6_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_37]),c_0_32]) ).
cnf(c_0_42,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_27]) ).
fof(c_0_43,plain,
! [X15] : addition(X15,X15) = X15,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_44,negated_conjecture,
~ leq(multiplication(multiplication(multiplication(esk4_0,esk2_0),esk3_0),c(esk6_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_45,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,multiplication(c(esk5_0),X1))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_38]),c_0_39]),c_0_22]) ).
cnf(c_0_46,negated_conjecture,
multiplication(c(esk5_0),multiplication(esk3_0,c(esk6_0))) = multiplication(esk3_0,c(esk6_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_47,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_48,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,negated_conjecture,
~ leq(multiplication(esk4_0,multiplication(esk2_0,multiplication(esk3_0,c(esk6_0)))),zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_50,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,multiplication(esk3_0,c(esk6_0)))) = zero,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KLE034+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 11:51:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.69/2.31 # ENIGMATIC: Solved by autoschedule:
% 7.69/2.31 # No SInE strategy applied
% 7.69/2.31 # Trying AutoSched0 for 150 seconds
% 7.69/2.31 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 7.69/2.31 # and selection function SelectCQArEqLast.
% 7.69/2.31 #
% 7.69/2.31 # Preprocessing time : 0.025 s
% 7.69/2.31 # Presaturation interreduction done
% 7.69/2.31
% 7.69/2.31 # Proof found!
% 7.69/2.31 # SZS status Theorem
% 7.69/2.31 # SZS output start CNFRefutation
% See solution above
% 7.69/2.31 # Training examples: 0 positive, 0 negative
% 7.69/2.31
% 7.69/2.31 # -------------------------------------------------
% 7.69/2.31 # User time : 0.059 s
% 7.69/2.31 # System time : 0.006 s
% 7.69/2.31 # Total time : 0.065 s
% 7.69/2.31 # Maximum resident set size: 7120 pages
% 7.69/2.31
%------------------------------------------------------------------------------