TSTP Solution File: KLE143+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE143+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:36:24 EST 2010
% Result : Theorem 95.03s
% Output : CNFRefutation 95.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 14
% Syntax : Number of formulae : 88 ( 74 unt; 0 def)
% Number of atoms : 106 ( 71 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 36 ( 18 ~; 14 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 137 ( 3 sgn 57 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',multiplicative_left_identity) ).
fof(4,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',additive_commutativity) ).
fof(6,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',multiplicative_right_identity) ).
fof(7,axiom,
! [X1] : addition(X1,X1) = X1,
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',idempotence) ).
fof(10,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',infty_unfold1) ).
fof(11,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',additive_associativity) ).
fof(12,axiom,
! [X1,X2,X3] :
( leq(X3,addition(multiplication(X1,X3),X2))
=> leq(X3,multiplication(strong_iteration(X1),X2)) ),
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',infty_coinduction) ).
fof(13,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',distributivity2) ).
fof(14,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',distributivity1) ).
fof(15,axiom,
! [X1] : addition(one,multiplication(X1,star(X1))) = star(X1),
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',star_unfold1) ).
fof(16,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',order) ).
fof(17,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',multiplicative_associativity) ).
fof(18,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',star_unfold2) ).
fof(19,conjecture,
! [X4] : multiplication(strong_iteration(X4),strong_iteration(X4)) = strong_iteration(X4),
file('/tmp/tmp1R-ISo/sel_KLE143+1.p_2',goals) ).
fof(20,negated_conjecture,
~ ! [X4] : multiplication(strong_iteration(X4),strong_iteration(X4)) = strong_iteration(X4),
inference(assume_negation,[status(cth)],[19]) ).
fof(23,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(24,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[23]) ).
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(33,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[7]) ).
cnf(34,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[33]) ).
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(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(45,plain,
! [X1,X2,X3] :
( ~ leq(X3,addition(multiplication(X1,X3),X2))
| leq(X3,multiplication(strong_iteration(X1),X2)) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(46,plain,
! [X4,X5,X6] :
( ~ leq(X6,addition(multiplication(X4,X6),X5))
| leq(X6,multiplication(strong_iteration(X4),X5)) ),
inference(variable_rename,[status(thm)],[45]) ).
cnf(47,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
inference(split_conjunct,[status(thm)],[46]) ).
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(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(52,plain,
! [X2] : addition(one,multiplication(X2,star(X2))) = star(X2),
inference(variable_rename,[status(thm)],[15]) ).
cnf(53,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
inference(split_conjunct,[status(thm)],[52]) ).
fof(54,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| addition(X1,X2) = X2 )
& ( addition(X1,X2) != X2
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(55,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| addition(X3,X4) = X4 )
& ( addition(X3,X4) != X4
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[54]) ).
cnf(56,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(57,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[55]) ).
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] : multiplication(strong_iteration(X4),strong_iteration(X4)) != strong_iteration(X4),
inference(fof_nnf,[status(thm)],[20]) ).
fof(63,negated_conjecture,
? [X5] : multiplication(strong_iteration(X5),strong_iteration(X5)) != strong_iteration(X5),
inference(variable_rename,[status(thm)],[62]) ).
fof(64,negated_conjecture,
multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)) != strong_iteration(esk1_0),
inference(skolemize,[status(esa)],[63]) ).
cnf(65,negated_conjecture,
multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)) != strong_iteration(esk1_0),
inference(split_conjunct,[status(thm)],[64]) ).
cnf(67,plain,
leq(X1,X1),
inference(spm,[status(thm)],[56,34,theory(equality)]) ).
cnf(91,plain,
addition(X1,X2) = addition(X1,addition(X1,X2)),
inference(spm,[status(thm)],[44,34,theory(equality)]) ).
cnf(105,plain,
addition(one,multiplication(X1,multiplication(X2,star(multiplication(X1,X2))))) = star(multiplication(X1,X2)),
inference(spm,[status(thm)],[53,59,theory(equality)]) ).
cnf(106,plain,
addition(star(X1),X2) = addition(one,addition(multiplication(X1,star(X1)),X2)),
inference(spm,[status(thm)],[44,53,theory(equality)]) ).
cnf(110,plain,
addition(star(X1),X2) = addition(one,addition(multiplication(star(X1),X1),X2)),
inference(spm,[status(thm)],[44,61,theory(equality)]) ).
cnf(112,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[42,28,theory(equality)]) ).
cnf(116,plain,
addition(strong_iteration(X1),X2) = addition(one,addition(multiplication(X1,strong_iteration(X1)),X2)),
inference(spm,[status(thm)],[44,112,theory(equality)]) ).
cnf(123,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
inference(spm,[status(thm)],[51,32,theory(equality)]) ).
cnf(154,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[49,24,theory(equality)]) ).
cnf(184,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(X3,multiplication(X2,X1))) ),
inference(spm,[status(thm)],[47,28,theory(equality)]) ).
cnf(242,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[91,53,theory(equality)]) ).
cnf(252,plain,
leq(X1,addition(X1,X2)),
inference(spm,[status(thm)],[56,91,theory(equality)]) ).
cnf(970,plain,
leq(X1,multiplication(X1,addition(one,X2))),
inference(spm,[status(thm)],[252,123,theory(equality)]) ).
cnf(1241,plain,
leq(X1,multiplication(X1,star(X2))),
inference(spm,[status(thm)],[970,53,theory(equality)]) ).
cnf(1940,plain,
addition(one,multiplication(X1,star(X1))) = addition(star(X1),multiplication(X1,star(X1))),
inference(spm,[status(thm)],[106,34,theory(equality)]) ).
cnf(1994,plain,
star(X1) = addition(star(X1),multiplication(X1,star(X1))),
inference(rw,[status(thm)],[1940,53,theory(equality)]) ).
cnf(1995,plain,
star(X1) = multiplication(addition(one,X1),star(X1)),
inference(rw,[status(thm)],[1994,154,theory(equality)]) ).
cnf(2418,plain,
multiplication(strong_iteration(X1),star(multiplication(X1,strong_iteration(X1)))) = star(multiplication(X1,strong_iteration(X1))),
inference(spm,[status(thm)],[1995,112,theory(equality)]) ).
cnf(2431,plain,
leq(addition(one,X1),star(X1)),
inference(spm,[status(thm)],[1241,1995,theory(equality)]) ).
cnf(2495,plain,
leq(addition(X1,one),star(X1)),
inference(spm,[status(thm)],[2431,28,theory(equality)]) ).
cnf(2519,plain,
addition(one,multiplication(star(X1),X1)) = addition(star(X1),multiplication(star(X1),X1)),
inference(spm,[status(thm)],[110,34,theory(equality)]) ).
cnf(2575,plain,
star(X1) = addition(star(X1),multiplication(star(X1),X1)),
inference(rw,[status(thm)],[2519,61,theory(equality)]) ).
cnf(2576,plain,
star(X1) = multiplication(star(X1),addition(one,X1)),
inference(rw,[status(thm)],[2575,123,theory(equality)]) ).
cnf(2652,plain,
addition(addition(X1,one),star(X1)) = star(X1),
inference(spm,[status(thm)],[57,2495,theory(equality)]) ).
cnf(2660,plain,
addition(X1,star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[2652,44,theory(equality)]),242,theory(equality)]) ).
cnf(3313,plain,
addition(one,star(multiplication(X1,strong_iteration(X1)))) = addition(strong_iteration(X1),star(multiplication(X1,strong_iteration(X1)))),
inference(spm,[status(thm)],[116,2660,theory(equality)]) ).
cnf(3359,plain,
star(multiplication(X1,strong_iteration(X1))) = addition(strong_iteration(X1),star(multiplication(X1,strong_iteration(X1)))),
inference(rw,[status(thm)],[3313,242,theory(equality)]) ).
cnf(5564,plain,
multiplication(star(multiplication(X1,strong_iteration(X1))),strong_iteration(X1)) = star(multiplication(X1,strong_iteration(X1))),
inference(spm,[status(thm)],[2576,112,theory(equality)]) ).
cnf(10370,plain,
( leq(multiplication(X1,star(multiplication(X2,X1))),multiplication(strong_iteration(X2),one))
| ~ leq(multiplication(X1,star(multiplication(X2,X1))),star(multiplication(X2,X1))) ),
inference(spm,[status(thm)],[184,105,theory(equality)]) ).
cnf(10418,plain,
( leq(multiplication(X1,star(multiplication(X2,X1))),strong_iteration(X2))
| ~ leq(multiplication(X1,star(multiplication(X2,X1))),star(multiplication(X2,X1))) ),
inference(rw,[status(thm)],[10370,32,theory(equality)]) ).
cnf(1800919,plain,
( leq(star(multiplication(X1,strong_iteration(X1))),strong_iteration(X1))
| ~ leq(star(multiplication(X1,strong_iteration(X1))),star(multiplication(X1,strong_iteration(X1)))) ),
inference(spm,[status(thm)],[10418,2418,theory(equality)]) ).
cnf(1801155,plain,
( leq(star(multiplication(X1,strong_iteration(X1))),strong_iteration(X1))
| $false ),
inference(rw,[status(thm)],[1800919,67,theory(equality)]) ).
cnf(1801156,plain,
leq(star(multiplication(X1,strong_iteration(X1))),strong_iteration(X1)),
inference(cn,[status(thm)],[1801155,theory(equality)]) ).
cnf(1801585,plain,
addition(star(multiplication(X1,strong_iteration(X1))),strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[57,1801156,theory(equality)]) ).
cnf(1801646,plain,
star(multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[1801585,28,theory(equality)]),3359,theory(equality)]) ).
cnf(1803392,plain,
multiplication(strong_iteration(X1),strong_iteration(X1)) = star(multiplication(X1,strong_iteration(X1))),
inference(rw,[status(thm)],[5564,1801646,theory(equality)]) ).
cnf(1803393,plain,
multiplication(strong_iteration(X1),strong_iteration(X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[1803392,1801646,theory(equality)]) ).
cnf(1809852,negated_conjecture,
$false,
inference(rw,[status(thm)],[65,1803393,theory(equality)]) ).
cnf(1809853,negated_conjecture,
$false,
inference(cn,[status(thm)],[1809852,theory(equality)]) ).
cnf(1809854,negated_conjecture,
$false,
1809853,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE143+1.p
% --creating new selector for [KLE004+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmp1R-ISo/sel_KLE143+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmp1R-ISo/sel_KLE143+1.p_2 with time limit 80
% -prover status Theorem
% Problem KLE143+1.p solved in phase 1.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE143+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE143+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
%
%------------------------------------------------------------------------------