TSTP Solution File: KLE019+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE019+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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 7.76s 2.23s
% Output : CNFRefutation 7.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 55 ( 39 unt; 0 def)
% Number of atoms : 98 ( 53 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 66 ( 23 ~; 20 |; 15 &)
% ( 3 <=>; 3 =>; 2 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 96 ( 2 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X4)
& test(X5)
& test(X6) )
=> ( leq(multiplication(X4,c(X5)),X6)
<= leq(X4,addition(X5,X6)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
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(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
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(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(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_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
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(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(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(c_0_11,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X4)
& test(X5)
& test(X6) )
=> ( leq(multiplication(X4,c(X5)),X6)
<= leq(X4,addition(X5,X6)) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
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,plain,
! [X27,X28] :
( ( ~ leq(X27,X28)
| addition(X27,X28) = X28 )
& ( addition(X27,X28) != X28
| leq(X27,X28) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_14,negated_conjecture,
( test(esk2_0)
& test(esk3_0)
& test(esk4_0)
& leq(esk2_0,addition(esk3_0,esk4_0))
& ~ leq(multiplication(esk2_0,c(esk3_0)),esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_15,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_17,plain,
! [X9,X10,X11] : addition(X11,addition(X10,X9)) = addition(addition(X11,X10),X9),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_18,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_19,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
leq(esk2_0,addition(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,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_22,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_25,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
addition(esk2_0,addition(esk3_0,esk4_0)) = addition(esk3_0,esk4_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
complement(esk3_0,c(esk3_0)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_32,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_33,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
addition(multiplication(esk2_0,X1),addition(multiplication(esk3_0,X1),multiplication(esk4_0,X1))) = addition(multiplication(esk3_0,X1),multiplication(esk4_0,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_27]),c_0_27]) ).
cnf(c_0_36,negated_conjecture,
multiplication(esk3_0,c(esk3_0)) = zero,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_38,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( leq(X1,addition(X2,X3))
| addition(X3,addition(X1,X2)) != addition(X2,X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
addition(multiplication(esk2_0,c(esk3_0)),multiplication(esk4_0,c(esk3_0))) = multiplication(esk4_0,c(esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_37]) ).
cnf(c_0_41,plain,
addition(X1,X2) = addition(X2,X1),
c_0_25 ).
cnf(c_0_42,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
c_0_26 ).
cnf(c_0_43,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
c_0_38 ).
fof(c_0_44,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_45,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_46,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_47,negated_conjecture,
leq(multiplication(esk2_0,c(esk3_0)),addition(multiplication(esk4_0,c(esk3_0)),X1)),
inference(ar,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41,c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,negated_conjecture,
addition(esk3_0,c(esk3_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_30]),c_0_25]) ).
cnf(c_0_50,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,negated_conjecture,
leq(multiplication(esk2_0,c(esk3_0)),addition(X1,multiplication(esk4_0,c(esk3_0)))),
inference(spm,[status(thm)],[c_0_47,c_0_25]) ).
cnf(c_0_52,negated_conjecture,
addition(multiplication(X1,esk3_0),multiplication(X1,c(esk3_0))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_53,negated_conjecture,
~ leq(multiplication(esk2_0,c(esk3_0)),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE019+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n007.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 14:18:43 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.76/2.23 # ENIGMATIC: Solved by autoschedule:
% 7.76/2.23 # No SInE strategy applied
% 7.76/2.23 # Trying AutoSched0 for 150 seconds
% 7.76/2.23 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 7.76/2.23 # and selection function SelectComplexG.
% 7.76/2.23 #
% 7.76/2.23 # Preprocessing time : 0.025 s
% 7.76/2.23
% 7.76/2.23 # Proof found!
% 7.76/2.23 # SZS status Theorem
% 7.76/2.23 # SZS output start CNFRefutation
% See solution above
% 7.76/2.23 # Training examples: 1 positive, 3 negative
% 7.76/2.23
% 7.76/2.23 # -------------------------------------------------
% 7.76/2.23 # User time : 0.051 s
% 7.76/2.23 # System time : 0.013 s
% 7.76/2.23 # Total time : 0.064 s
% 7.76/2.23 # Maximum resident set size: 7120 pages
% 7.76/2.23
%------------------------------------------------------------------------------