TSTP Solution File: KLE148+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE148+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 12:38:06 EST 2010
% Result : Theorem 0.84s
% Output : CNFRefutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 32 unt; 0 def)
% Number of atoms : 42 ( 40 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 5 ~; 0 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 51 ( 4 sgn 28 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/tmp/tmpgfK6ZL/sel_KLE148+1.p_1',left_annihilation) ).
fof(3,axiom,
! [X1] : addition(X1,zero) = X1,
file('/tmp/tmpgfK6ZL/sel_KLE148+1.p_1',additive_identity) ).
fof(4,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpgfK6ZL/sel_KLE148+1.p_1',additive_commutativity) ).
fof(6,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpgfK6ZL/sel_KLE148+1.p_1',multiplicative_right_identity) ).
fof(10,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/tmp/tmpgfK6ZL/sel_KLE148+1.p_1',infty_unfold1) ).
fof(14,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmpgfK6ZL/sel_KLE148+1.p_1',distributivity1) ).
fof(17,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/tmp/tmpgfK6ZL/sel_KLE148+1.p_1',multiplicative_associativity) ).
fof(19,conjecture,
! [X4,X5] :
( multiplication(X4,X5) = zero
=> multiplication(X4,strong_iteration(X5)) = X4 ),
file('/tmp/tmpgfK6ZL/sel_KLE148+1.p_1',goals) ).
fof(20,negated_conjecture,
~ ! [X4,X5] :
( multiplication(X4,X5) = zero
=> multiplication(X4,strong_iteration(X5)) = X4 ),
inference(assume_negation,[status(cth)],[19]) ).
fof(21,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[1]) ).
cnf(22,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[21]) ).
fof(25,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[3]) ).
cnf(26,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[25]) ).
fof(27,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[4]) ).
cnf(28,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[27]) ).
fof(31,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[6]) ).
cnf(32,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[31]) ).
fof(41,plain,
! [X2] : strong_iteration(X2) = addition(multiplication(X2,strong_iteration(X2)),one),
inference(variable_rename,[status(thm)],[10]) ).
cnf(42,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[41]) ).
fof(50,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[14]) ).
cnf(51,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[50]) ).
fof(58,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[17]) ).
cnf(59,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[58]) ).
fof(62,negated_conjecture,
? [X4,X5] :
( multiplication(X4,X5) = zero
& multiplication(X4,strong_iteration(X5)) != X4 ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(63,negated_conjecture,
? [X6,X7] :
( multiplication(X6,X7) = zero
& multiplication(X6,strong_iteration(X7)) != X6 ),
inference(variable_rename,[status(thm)],[62]) ).
fof(64,negated_conjecture,
( multiplication(esk1_0,esk2_0) = zero
& multiplication(esk1_0,strong_iteration(esk2_0)) != esk1_0 ),
inference(skolemize,[status(esa)],[63]) ).
cnf(65,negated_conjecture,
multiplication(esk1_0,strong_iteration(esk2_0)) != esk1_0,
inference(split_conjunct,[status(thm)],[64]) ).
cnf(66,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
inference(split_conjunct,[status(thm)],[64]) ).
cnf(77,negated_conjecture,
multiplication(zero,X1) = multiplication(esk1_0,multiplication(esk2_0,X1)),
inference(spm,[status(thm)],[59,66,theory(equality)]) ).
cnf(83,negated_conjecture,
zero = multiplication(esk1_0,multiplication(esk2_0,X1)),
inference(rw,[status(thm)],[77,22,theory(equality)]) ).
cnf(115,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[42,28,theory(equality)]) ).
cnf(405,negated_conjecture,
addition(multiplication(esk1_0,X1),zero) = multiplication(esk1_0,addition(X1,multiplication(esk2_0,X2))),
inference(spm,[status(thm)],[51,83,theory(equality)]) ).
cnf(415,negated_conjecture,
multiplication(esk1_0,X1) = multiplication(esk1_0,addition(X1,multiplication(esk2_0,X2))),
inference(rw,[status(thm)],[405,26,theory(equality)]) ).
cnf(21249,negated_conjecture,
multiplication(esk1_0,strong_iteration(esk2_0)) = multiplication(esk1_0,one),
inference(spm,[status(thm)],[415,115,theory(equality)]) ).
cnf(21321,negated_conjecture,
multiplication(esk1_0,strong_iteration(esk2_0)) = esk1_0,
inference(rw,[status(thm)],[21249,32,theory(equality)]) ).
cnf(21322,negated_conjecture,
$false,
inference(sr,[status(thm)],[21321,65,theory(equality)]) ).
cnf(21323,negated_conjecture,
$false,
21322,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE148+1.p
% --creating new selector for [KLE004+0.ax]
% -running prover on /tmp/tmpgfK6ZL/sel_KLE148+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE148+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE148+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE148+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------