TSTP Solution File: KLE139+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE139+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 25 12:39:11 EST 2010
% Result : Theorem 7.45s
% Output : CNFRefutation 7.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 35 unt; 0 def)
% Number of atoms : 35 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 1 sgn 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/tmp/tmpzmGSu0/sel_KLE139+1.p_1',left_annihilation) ).
fof(4,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpzmGSu0/sel_KLE139+1.p_1',additive_commutativity) ).
fof(5,axiom,
! [X1] : strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
file('/tmp/tmpzmGSu0/sel_KLE139+1.p_1',isolation) ).
fof(11,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmpzmGSu0/sel_KLE139+1.p_1',additive_associativity) ).
fof(13,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmpzmGSu0/sel_KLE139+1.p_1',distributivity2) ).
fof(17,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/tmp/tmpzmGSu0/sel_KLE139+1.p_1',multiplicative_associativity) ).
fof(18,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/tmp/tmpzmGSu0/sel_KLE139+1.p_1',star_unfold2) ).
fof(19,conjecture,
! [X4] : strong_iteration(X4) = addition(multiplication(strong_iteration(X4),X4),one),
file('/tmp/tmpzmGSu0/sel_KLE139+1.p_1',goals) ).
fof(20,negated_conjecture,
~ ! [X4] : strong_iteration(X4) = addition(multiplication(strong_iteration(X4),X4),one),
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(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(29,plain,
! [X2] : strong_iteration(X2) = addition(star(X2),multiplication(strong_iteration(X2),zero)),
inference(variable_rename,[status(thm)],[5]) ).
cnf(30,plain,
strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
inference(split_conjunct,[status(thm)],[29]) ).
fof(43,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[11]) ).
cnf(44,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[43]) ).
fof(48,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[13]) ).
cnf(49,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[48]) ).
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(60,plain,
! [X2] : addition(one,multiplication(star(X2),X2)) = star(X2),
inference(variable_rename,[status(thm)],[18]) ).
cnf(61,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[60]) ).
fof(62,negated_conjecture,
? [X4] : strong_iteration(X4) != addition(multiplication(strong_iteration(X4),X4),one),
inference(fof_nnf,[status(thm)],[20]) ).
fof(63,negated_conjecture,
? [X5] : strong_iteration(X5) != addition(multiplication(strong_iteration(X5),X5),one),
inference(variable_rename,[status(thm)],[62]) ).
fof(64,negated_conjecture,
strong_iteration(esk1_0) != addition(multiplication(strong_iteration(esk1_0),esk1_0),one),
inference(skolemize,[status(esa)],[63]) ).
cnf(65,negated_conjecture,
strong_iteration(esk1_0) != addition(multiplication(strong_iteration(esk1_0),esk1_0),one),
inference(split_conjunct,[status(thm)],[64]) ).
cnf(74,negated_conjecture,
addition(one,multiplication(strong_iteration(esk1_0),esk1_0)) != strong_iteration(esk1_0),
inference(rw,[status(thm)],[65,28,theory(equality)]) ).
cnf(111,plain,
addition(star(X1),X2) = addition(one,addition(multiplication(star(X1),X1),X2)),
inference(spm,[status(thm)],[44,61,theory(equality)]) ).
cnf(2332,plain,
addition(one,multiplication(addition(star(X1),X2),X1)) = addition(star(X1),multiplication(X2,X1)),
inference(spm,[status(thm)],[111,49,theory(equality)]) ).
cnf(261822,plain,
addition(one,multiplication(strong_iteration(X1),X1)) = addition(star(X1),multiplication(multiplication(strong_iteration(X1),zero),X1)),
inference(spm,[status(thm)],[2332,30,theory(equality)]) ).
cnf(262570,plain,
addition(one,multiplication(strong_iteration(X1),X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[261822,59,theory(equality)]),22,theory(equality)]),30,theory(equality)]) ).
cnf(263843,negated_conjecture,
$false,
inference(rw,[status(thm)],[74,262570,theory(equality)]) ).
cnf(263844,negated_conjecture,
$false,
inference(cn,[status(thm)],[263843,theory(equality)]) ).
cnf(263845,negated_conjecture,
$false,
263844,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE139+1.p
% --creating new selector for [KLE004+0.ax]
% -running prover on /tmp/tmpzmGSu0/sel_KLE139+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE139+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE139+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE139+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
%
%------------------------------------------------------------------------------