TSTP Solution File: KLE137+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE137+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:50:29 EDT 2022
% Result : Theorem 7.64s 2.42s
% Output : CNFRefutation 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 20 unt; 0 def)
% Number of atoms : 36 ( 17 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 6 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 3 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(infty_coinduction,axiom,
! [X1,X2,X3] :
( leq(X3,addition(multiplication(X1,X3),X2))
=> leq(X3,multiplication(strong_iteration(X1),X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_coinduction) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_left_identity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_associativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',order) ).
fof(goals,conjecture,
! [X4] : leq(X4,strong_iteration(one)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
fof(c_0_7,plain,
! [X33,X34,X35] :
( ~ leq(X35,addition(multiplication(X33,X35),X34))
| leq(X35,multiplication(strong_iteration(X33),X34)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[infty_coinduction])]) ).
fof(c_0_8,plain,
! [X16] : multiplication(one,X16) = X16,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_9,plain,
! [X7,X8,X9] : addition(X9,addition(X8,X7)) = addition(addition(X9,X8),X7),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_10,plain,
! [X11] : addition(X11,X11) = X11,
inference(variable_rename,[status(thm)],[idempotence]) ).
cnf(c_0_11,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X37,X38] :
( ( ~ leq(X37,X38)
| addition(X37,X38) = X38 )
& ( addition(X37,X38) != X38
| leq(X37,X38) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_14,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,negated_conjecture,
~ ! [X4] : leq(X4,strong_iteration(one)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_17,plain,
( leq(X1,multiplication(strong_iteration(one),X2))
| ~ leq(X1,addition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_20,plain,
! [X15] : multiplication(X15,one) = X15,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_21,negated_conjecture,
~ leq(esk1_0,strong_iteration(one)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
cnf(c_0_22,plain,
leq(X1,multiplication(strong_iteration(one),X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ leq(esk1_0,strong_iteration(one)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
leq(X1,strong_iteration(one)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE137+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 08:23:43 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.45 # ENIGMATIC: Selected SinE mode:
% 0.21/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.64/2.42 # ENIGMATIC: Solved by autoschedule:
% 7.64/2.42 # No SInE strategy applied
% 7.64/2.42 # Trying AutoSched0 for 150 seconds
% 7.64/2.42 # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.64/2.42 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.64/2.42 #
% 7.64/2.42 # Preprocessing time : 0.013 s
% 7.64/2.42
% 7.64/2.42 # Proof found!
% 7.64/2.42 # SZS status Theorem
% 7.64/2.42 # SZS output start CNFRefutation
% See solution above
% 7.64/2.42 # Training examples: 0 positive, 0 negative
% 7.64/2.42
% 7.64/2.42 # -------------------------------------------------
% 7.64/2.42 # User time : 0.016 s
% 7.64/2.42 # System time : 0.003 s
% 7.64/2.42 # Total time : 0.019 s
% 7.64/2.42 # Maximum resident set size: 7124 pages
% 7.64/2.42
%------------------------------------------------------------------------------