TSTP Solution File: KLE035+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE035+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:46 EDT 2022
% Result : Theorem 7.96s 2.42s
% Output : CNFRefutation 7.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 20 unt; 0 def)
% Number of atoms : 43 ( 17 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 24 ( 7 ~; 3 |; 11 &)
% ( 1 <=>; 2 =>; 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 : 44 ( 0 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6,X7] :
( ( test(X7)
& test(X6)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& leq(multiplication(multiplication(X6,X5),c(X7)),zero) )
=> leq(multiplication(multiplication(X6,addition(X4,X5)),c(X7)),zero) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
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(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(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(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(c_0_6,negated_conjecture,
~ ! [X4,X5,X6,X7] :
( ( test(X7)
& test(X6)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& leq(multiplication(multiplication(X6,X5),c(X7)),zero) )
=> leq(multiplication(multiplication(X6,addition(X4,X5)),c(X7)),zero) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,negated_conjecture,
( test(esk5_0)
& test(esk4_0)
& leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero)
& leq(multiplication(multiplication(esk4_0,esk3_0),c(esk5_0)),zero)
& ~ leq(multiplication(multiplication(esk4_0,addition(esk2_0,esk3_0)),c(esk5_0)),zero) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X15,X16,X17] : multiplication(X15,multiplication(X16,X17)) = multiplication(multiplication(X15,X16),X17),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_9,plain,
! [X20,X21,X22] : multiplication(X20,addition(X21,X22)) = addition(multiplication(X20,X21),multiplication(X20,X22)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_10,plain,
! [X23,X24,X25] : multiplication(addition(X23,X24),X25) = addition(multiplication(X23,X25),multiplication(X24,X25)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_11,plain,
! [X28,X29] :
( ( ~ leq(X28,X29)
| addition(X28,X29) = X29 )
& ( addition(X28,X29) != X29
| leq(X28,X29) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_12,negated_conjecture,
leq(multiplication(multiplication(esk4_0,esk3_0),c(esk5_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X13] : addition(X13,zero) = X13,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_15,negated_conjecture,
~ leq(multiplication(multiplication(esk4_0,addition(esk2_0,esk3_0)),c(esk5_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
leq(multiplication(esk4_0,multiplication(esk3_0,c(esk5_0))),zero),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
~ leq(addition(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),multiplication(esk4_0,multiplication(esk3_0,c(esk5_0)))),zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_13]),c_0_13]) ).
cnf(c_0_23,negated_conjecture,
multiplication(esk4_0,multiplication(esk3_0,c(esk5_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
leq(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero),
inference(rw,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_20]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE035+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 12:48:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.96/2.42 # ENIGMATIC: Solved by autoschedule:
% 7.96/2.42 # No SInE strategy applied
% 7.96/2.42 # Trying AutoSched0 for 150 seconds
% 7.96/2.42 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 7.96/2.42 # and selection function SelectCQArEqLast.
% 7.96/2.42 #
% 7.96/2.42 # Preprocessing time : 0.025 s
% 7.96/2.42 # Presaturation interreduction done
% 7.96/2.42
% 7.96/2.42 # Proof found!
% 7.96/2.42 # SZS status Theorem
% 7.96/2.42 # SZS output start CNFRefutation
% See solution above
% 7.96/2.42 # Training examples: 0 positive, 0 negative
% 7.96/2.42
% 7.96/2.42 # -------------------------------------------------
% 7.96/2.42 # User time : 0.028 s
% 7.96/2.42 # System time : 0.008 s
% 7.96/2.42 # Total time : 0.037 s
% 7.96/2.42 # Maximum resident set size: 7120 pages
% 7.96/2.42
%------------------------------------------------------------------------------