TSTP Solution File: KLE150+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KLE150+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n002.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 : 300s
% DateTime : Thu Aug 31 05:26:38 EDT 2023
% Result : Theorem 0.19s 0.60s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of formulae : 79 ( 54 unt; 8 typ; 0 def)
% Number of atoms : 90 ( 54 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 18 ~; 15 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 106 ( 4 sgn; 54 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
addition: ( $i * $i ) > $i ).
tff(decl_23,type,
zero: $i ).
tff(decl_24,type,
multiplication: ( $i * $i ) > $i ).
tff(decl_25,type,
one: $i ).
tff(decl_26,type,
star: $i > $i ).
tff(decl_27,type,
leq: ( $i * $i ) > $o ).
tff(decl_28,type,
strong_iteration: $i > $i ).
tff(decl_29,type,
esk1_0: $i ).
fof(star_induction2,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X3,X1),X2),X3)
=> leq(multiplication(X2,star(X1)),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_induction2) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_right_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(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_commutativity) ).
fof(star_induction1,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X3),X2),X3)
=> leq(multiplication(star(X1),X2),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_induction1) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_left_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',order) ).
fof(star_unfold2,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_unfold2) ).
fof(distributivity2,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',distributivity2) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
fof(goals,conjecture,
! [X4] : strong_iteration(multiplication(X4,zero)) = addition(one,multiplication(X4,zero)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(c_0_15,plain,
! [X29,X30,X31] :
( ~ leq(addition(multiplication(X31,X29),X30),X31)
| leq(multiplication(X30,star(X29)),X31) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction2])]) ).
fof(c_0_16,plain,
! [X10] : addition(X10,zero) = X10,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_17,plain,
! [X23] : multiplication(zero,X23) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_18,plain,
! [X15] : multiplication(X15,one) = X15,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_19,plain,
! [X7,X8,X9] : addition(X9,addition(X8,X7)) = addition(addition(X9,X8),X7),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_20,plain,
! [X11] : addition(X11,X11) = X11,
inference(variable_rename,[status(thm)],[idempotence]) ).
fof(c_0_21,plain,
! [X32] : strong_iteration(X32) = addition(multiplication(X32,strong_iteration(X32)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
fof(c_0_22,plain,
! [X5,X6] : addition(X5,X6) = addition(X6,X5),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_23,plain,
! [X26,X27,X28] :
( ~ leq(addition(multiplication(X26,X28),X27),X28)
| leq(multiplication(star(X26),X27),X28) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction1])]) ).
fof(c_0_24,plain,
! [X16] : multiplication(one,X16) = X16,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_25,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( leq(multiplication(star(X1),X3),X2)
| ~ leq(addition(multiplication(X1,X2),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
( leq(zero,X1)
| ~ leq(multiplication(X1,X2),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
fof(c_0_36,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_37,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_38,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
( leq(multiplication(star(one),X1),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( leq(zero,X1)
| ~ leq(X1,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
cnf(c_0_42,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_44,plain,
addition(one,strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( leq(multiplication(star(one),zero),X1)
| ~ leq(X1,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_26]) ).
cnf(c_0_46,plain,
leq(zero,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_30])]) ).
cnf(c_0_47,plain,
( leq(star(one),strong_iteration(X1))
| ~ leq(strong_iteration(X1),strong_iteration(X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_34]) ).
fof(c_0_48,plain,
! [X25] : addition(one,multiplication(star(X25),X25)) = star(X25),
inference(variable_rename,[status(thm)],[star_unfold2]) ).
fof(c_0_49,plain,
! [X20,X21,X22] : multiplication(addition(X20,X21),X22) = addition(multiplication(X20,X22),multiplication(X21,X22)),
inference(variable_rename,[status(thm)],[distributivity2]) ).
cnf(c_0_50,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_51,plain,
leq(multiplication(star(one),zero),zero),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
leq(star(one),strong_iteration(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_42]),c_0_30])]) ).
cnf(c_0_53,plain,
strong_iteration(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_27]),c_0_26]) ).
cnf(c_0_54,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
fof(c_0_55,plain,
! [X12,X13,X14] : multiplication(X12,multiplication(X13,X14)) = multiplication(multiplication(X12,X13),X14),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_56,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,plain,
multiplication(star(one),zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_26]) ).
cnf(c_0_58,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_59,plain,
leq(star(one),one),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_38,c_0_54]) ).
fof(c_0_61,negated_conjecture,
~ ! [X4] : strong_iteration(multiplication(X4,zero)) = addition(one,multiplication(X4,zero)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_62,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_63,plain,
multiplication(addition(star(one),X1),zero) = multiplication(X1,zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_64,plain,
star(one) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_59]),c_0_32]),c_0_60]) ).
fof(c_0_65,negated_conjecture,
strong_iteration(multiplication(esk1_0,zero)) != addition(one,multiplication(esk1_0,zero)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])]) ).
cnf(c_0_66,plain,
addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))) = strong_iteration(multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_39,c_0_62]) ).
cnf(c_0_67,plain,
multiplication(addition(one,X1),zero) = multiplication(X1,zero),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
strong_iteration(multiplication(esk1_0,zero)) != addition(one,multiplication(esk1_0,zero)),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_69,plain,
strong_iteration(multiplication(X1,zero)) = addition(one,multiplication(X1,zero)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_63]),c_0_64]),c_0_27]),c_0_67]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE150+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n002.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 : 300
% 0.13/0.34 % DateTime : Tue Aug 29 11:12:35 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.60 % Version : CSE_E---1.5
% 0.19/0.60 % Problem : theBenchmark.p
% 0.19/0.60 % Proof found
% 0.19/0.60 % SZS status Theorem for theBenchmark.p
% 0.19/0.60 % SZS output start Proof
% See solution above
% 0.19/0.60 % Total time : 0.021000 s
% 0.19/0.60 % SZS output end Proof
% 0.19/0.60 % Total time : 0.024000 s
%------------------------------------------------------------------------------