TSTP Solution File: KLE060+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE060+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:06:50 EST 2010
% Result : Theorem 249.81s
% Output : CNFRefutation 249.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 13
% Syntax : Number of formulae : 109 ( 109 unt; 0 def)
% Number of atoms : 109 ( 106 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 : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 195 ( 19 sgn 50 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',left_distributivity) ).
fof(4,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',additive_commutativity) ).
fof(5,axiom,
! [X1] : addition(X1,X1) = X1,
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',additive_idempotence) ).
fof(6,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',multiplicative_associativity) ).
fof(8,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',additive_associativity) ).
fof(9,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',multiplicative_right_identity) ).
fof(10,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',domain3) ).
fof(11,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',domain2) ).
fof(12,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',right_distributivity) ).
fof(13,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',multiplicative_left_identity) ).
fof(14,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',domain1) ).
fof(15,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',domain5) ).
fof(17,conjecture,
! [X4,X5] : domain(multiplication(domain(X4),X5)) = multiplication(domain(X4),domain(X5)),
file('/tmp/tmpFqrFK_/sel_KLE060+1.p_5',goals) ).
fof(18,negated_conjecture,
~ ! [X4,X5] : domain(multiplication(domain(X4),X5)) = multiplication(domain(X4),domain(X5)),
inference(assume_negation,[status(cth)],[17]) ).
fof(23,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(24,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[23]) ).
fof(25,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[4]) ).
cnf(26,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[25]) ).
fof(27,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[5]) ).
cnf(28,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[27]) ).
fof(29,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[6]) ).
cnf(30,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[29]) ).
fof(33,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[8]) ).
cnf(34,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[33]) ).
fof(35,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[9]) ).
cnf(36,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[35]) ).
fof(37,plain,
! [X5] : addition(domain(X5),one) = one,
inference(variable_rename,[status(thm)],[10]) ).
cnf(38,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[37]) ).
fof(39,plain,
! [X6,X7] : domain(multiplication(X6,X7)) = domain(multiplication(X6,domain(X7))),
inference(variable_rename,[status(thm)],[11]) ).
cnf(40,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[39]) ).
fof(41,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[12]) ).
cnf(42,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[41]) ).
fof(43,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[13]) ).
cnf(44,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[43]) ).
fof(45,plain,
! [X5] : addition(X5,multiplication(domain(X5),X5)) = multiplication(domain(X5),X5),
inference(variable_rename,[status(thm)],[14]) ).
cnf(46,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[45]) ).
fof(47,plain,
! [X6,X7] : domain(addition(X6,X7)) = addition(domain(X6),domain(X7)),
inference(variable_rename,[status(thm)],[15]) ).
cnf(48,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[47]) ).
fof(50,negated_conjecture,
? [X4,X5] : domain(multiplication(domain(X4),X5)) != multiplication(domain(X4),domain(X5)),
inference(fof_nnf,[status(thm)],[18]) ).
fof(51,negated_conjecture,
? [X6,X7] : domain(multiplication(domain(X6),X7)) != multiplication(domain(X6),domain(X7)),
inference(variable_rename,[status(thm)],[50]) ).
fof(52,negated_conjecture,
domain(multiplication(domain(esk1_0),esk2_0)) != multiplication(domain(esk1_0),domain(esk2_0)),
inference(skolemize,[status(esa)],[51]) ).
cnf(53,negated_conjecture,
domain(multiplication(domain(esk1_0),esk2_0)) != multiplication(domain(esk1_0),domain(esk2_0)),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(59,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[38,26,theory(equality)]) ).
cnf(82,plain,
addition(X1,X2) = addition(X1,addition(X1,X2)),
inference(spm,[status(thm)],[34,28,theory(equality)]) ).
cnf(105,plain,
domain(domain(X1)) = domain(multiplication(one,X1)),
inference(spm,[status(thm)],[40,44,theory(equality)]) ).
cnf(112,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[105,44,theory(equality)]) ).
cnf(119,plain,
addition(one,domain(one)) = domain(one),
inference(spm,[status(thm)],[46,36,theory(equality)]) ).
cnf(130,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
inference(spm,[status(thm)],[42,36,theory(equality)]) ).
cnf(164,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[24,44,theory(equality)]) ).
cnf(167,plain,
addition(multiplication(X1,multiplication(X2,X3)),multiplication(X4,X3)) = multiplication(addition(multiplication(X1,X2),X4),X3),
inference(spm,[status(thm)],[24,30,theory(equality)]) ).
cnf(201,plain,
one = domain(one),
inference(rw,[status(thm)],[119,59,theory(equality)]) ).
cnf(202,plain,
addition(one,domain(X1)) = domain(addition(one,X1)),
inference(spm,[status(thm)],[48,201,theory(equality)]) ).
cnf(206,plain,
one = domain(addition(one,X1)),
inference(rw,[status(thm)],[202,59,theory(equality)]) ).
cnf(212,plain,
addition(domain(X1),domain(X2)) = domain(addition(domain(X1),X2)),
inference(spm,[status(thm)],[48,112,theory(equality)]) ).
cnf(220,plain,
domain(addition(X1,X2)) = domain(addition(domain(X1),X2)),
inference(rw,[status(thm)],[212,48,theory(equality)]) ).
cnf(229,plain,
addition(domain(X1),one) = domain(addition(X1,addition(one,X2))),
inference(spm,[status(thm)],[48,206,theory(equality)]) ).
cnf(230,plain,
domain(multiplication(X1,one)) = domain(multiplication(X1,addition(one,X2))),
inference(spm,[status(thm)],[40,206,theory(equality)]) ).
cnf(242,plain,
one = domain(addition(X1,addition(one,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[229,26,theory(equality)]),59,theory(equality)]) ).
cnf(243,plain,
domain(X1) = domain(multiplication(X1,addition(one,X2))),
inference(rw,[status(thm)],[230,36,theory(equality)]) ).
cnf(288,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[82,26,theory(equality)]) ).
cnf(384,plain,
multiplication(one,X1) = multiplication(domain(X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[46,164,theory(equality)]),59,theory(equality)]) ).
cnf(385,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[384,44,theory(equality)]) ).
cnf(404,plain,
addition(X1,multiplication(domain(X1),X2)) = multiplication(domain(X1),addition(X1,X2)),
inference(spm,[status(thm)],[42,385,theory(equality)]) ).
cnf(406,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(domain(X1),X2),X1),
inference(spm,[status(thm)],[24,385,theory(equality)]) ).
cnf(409,plain,
multiplication(domain(X1),domain(X1)) = domain(X1),
inference(spm,[status(thm)],[385,112,theory(equality)]) ).
cnf(412,plain,
addition(domain(X1),X1) = multiplication(domain(X1),addition(one,X1)),
inference(spm,[status(thm)],[130,385,theory(equality)]) ).
cnf(419,plain,
multiplication(addition(one,X2),X1) = multiplication(addition(domain(X1),X2),X1),
inference(rw,[status(thm)],[406,164,theory(equality)]) ).
cnf(424,plain,
addition(X1,domain(X1)) = multiplication(domain(X1),addition(one,X1)),
inference(rw,[status(thm)],[412,26,theory(equality)]) ).
cnf(434,plain,
domain(multiplication(X1,one)) = domain(multiplication(X1,addition(X2,addition(one,X3)))),
inference(spm,[status(thm)],[40,242,theory(equality)]) ).
cnf(456,plain,
domain(X1) = domain(multiplication(X1,addition(X2,addition(one,X3)))),
inference(rw,[status(thm)],[434,36,theory(equality)]) ).
cnf(510,plain,
addition(domain(X1),multiplication(domain(X1),X2)) = multiplication(domain(X1),addition(domain(X1),X2)),
inference(spm,[status(thm)],[42,409,theory(equality)]) ).
cnf(526,plain,
multiplication(domain(X1),addition(one,X2)) = multiplication(domain(X1),addition(domain(X1),X2)),
inference(rw,[status(thm)],[510,130,theory(equality)]) ).
cnf(556,plain,
domain(addition(domain(X1),X2)) = domain(addition(X1,addition(domain(X1),X2))),
inference(spm,[status(thm)],[220,82,theory(equality)]) ).
cnf(585,plain,
domain(addition(X1,X2)) = domain(addition(X1,addition(domain(X1),X2))),
inference(rw,[status(thm)],[556,220,theory(equality)]) ).
cnf(1389,plain,
multiplication(domain(addition(X1,X2)),X1) = multiplication(addition(one,domain(X2)),X1),
inference(spm,[status(thm)],[419,48,theory(equality)]) ).
cnf(1426,plain,
multiplication(domain(addition(X1,X2)),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[1389,59,theory(equality)]),44,theory(equality)]) ).
cnf(1464,plain,
multiplication(domain(addition(X2,X1)),X1) = X1,
inference(spm,[status(thm)],[1426,288,theory(equality)]) ).
cnf(1526,plain,
multiplication(domain(multiplication(addition(X1,X3),X2)),multiplication(X3,X2)) = multiplication(X3,X2),
inference(spm,[status(thm)],[1464,24,theory(equality)]) ).
cnf(1712,plain,
multiplication(domain(X1),addition(X1,one)) = addition(X1,domain(X1)),
inference(spm,[status(thm)],[424,26,theory(equality)]) ).
cnf(1778,plain,
multiplication(addition(X1,domain(X1)),X2) = multiplication(domain(X1),multiplication(addition(X1,one),X2)),
inference(spm,[status(thm)],[30,1712,theory(equality)]) ).
cnf(3887,plain,
domain(addition(X1,multiplication(domain(X1),addition(one,X2)))) = domain(addition(X1,multiplication(domain(X1),X2))),
inference(spm,[status(thm)],[585,130,theory(equality)]) ).
cnf(3975,plain,
domain(X1) = domain(addition(X1,multiplication(domain(X1),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3887,404,theory(equality)]),456,theory(equality)]),112,theory(equality)]) ).
cnf(3976,plain,
domain(X1) = domain(multiplication(domain(X1),addition(X1,X2))),
inference(rw,[status(thm)],[3975,404,theory(equality)]) ).
cnf(14447,plain,
multiplication(domain(X1),domain(addition(X1,X2))) = multiplication(domain(X1),addition(one,domain(X2))),
inference(spm,[status(thm)],[526,48,theory(equality)]) ).
cnf(14537,plain,
multiplication(domain(X1),domain(addition(X1,X2))) = domain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[14447,59,theory(equality)]),36,theory(equality)]) ).
cnf(14640,plain,
multiplication(domain(X1),domain(addition(X2,X1))) = domain(X1),
inference(spm,[status(thm)],[14537,288,theory(equality)]) ).
cnf(14887,plain,
multiplication(domain(multiplication(X1,X2)),domain(multiplication(X1,addition(one,X2)))) = domain(multiplication(X1,X2)),
inference(spm,[status(thm)],[14640,130,theory(equality)]) ).
cnf(14913,plain,
multiplication(domain(multiplication(domain(X1),X2)),domain(multiplication(domain(X1),addition(X1,X2)))) = domain(multiplication(domain(X1),X2)),
inference(spm,[status(thm)],[14640,404,theory(equality)]) ).
cnf(15021,plain,
multiplication(domain(multiplication(X1,X2)),domain(X1)) = domain(multiplication(X1,X2)),
inference(rw,[status(thm)],[14887,243,theory(equality)]) ).
cnf(15051,plain,
multiplication(domain(multiplication(domain(X1),X2)),domain(X1)) = domain(multiplication(domain(X1),X2)),
inference(rw,[status(thm)],[14913,3976,theory(equality)]) ).
cnf(15129,plain,
domain(domain(multiplication(X1,X2))) = domain(multiplication(domain(multiplication(X1,X2)),X1)),
inference(spm,[status(thm)],[40,15021,theory(equality)]) ).
cnf(15251,plain,
domain(multiplication(X1,X2)) = domain(multiplication(domain(multiplication(X1,X2)),X1)),
inference(rw,[status(thm)],[15129,112,theory(equality)]) ).
cnf(15396,plain,
domain(multiplication(domain(X1),X2)) = domain(multiplication(domain(multiplication(domain(X1),X2)),X1)),
inference(spm,[status(thm)],[40,15251,theory(equality)]) ).
cnf(61350,plain,
multiplication(domain(multiplication(one,X2)),multiplication(domain(X1),X2)) = multiplication(domain(X1),X2),
inference(spm,[status(thm)],[1526,59,theory(equality)]) ).
cnf(61623,plain,
multiplication(domain(X2),multiplication(domain(X1),X2)) = multiplication(domain(X1),X2),
inference(rw,[status(thm)],[61350,44,theory(equality)]) ).
cnf(61913,plain,
addition(multiplication(domain(X2),X1),multiplication(X3,X1)) = multiplication(addition(multiplication(domain(X1),domain(X2)),X3),X1),
inference(spm,[status(thm)],[167,61623,theory(equality)]) ).
cnf(62144,plain,
multiplication(addition(domain(X2),X3),X1) = multiplication(addition(multiplication(domain(X1),domain(X2)),X3),X1),
inference(rw,[status(thm)],[61913,24,theory(equality)]) ).
cnf(318738,plain,
multiplication(domain(multiplication(domain(X1),domain(X2))),multiplication(addition(domain(X2),one),X1)) = multiplication(addition(multiplication(domain(X1),domain(X2)),domain(multiplication(domain(X1),domain(X2)))),X1),
inference(spm,[status(thm)],[1778,62144,theory(equality)]) ).
cnf(319400,plain,
multiplication(domain(multiplication(domain(X1),X2)),X1) = multiplication(addition(multiplication(domain(X1),domain(X2)),domain(multiplication(domain(X1),domain(X2)))),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[318738,40,theory(equality)]),26,theory(equality)]),59,theory(equality)]),44,theory(equality)]) ).
cnf(319401,plain,
multiplication(domain(multiplication(domain(X1),X2)),X1) = multiplication(domain(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[319400,40,theory(equality)]),62144,theory(equality)]),48,theory(equality)]),164,theory(equality)]),59,theory(equality)]),44,theory(equality)]) ).
cnf(319777,plain,
multiplication(domain(multiplication(domain(X1),X2)),domain(X1)) = multiplication(domain(X2),domain(X1)),
inference(spm,[status(thm)],[319401,112,theory(equality)]) ).
cnf(320260,plain,
domain(multiplication(domain(X2),X1)) = domain(multiplication(domain(X1),X2)),
inference(rw,[status(thm)],[15396,319401,theory(equality)]) ).
cnf(320278,plain,
domain(multiplication(domain(X1),X2)) = multiplication(domain(X2),domain(X1)),
inference(rw,[status(thm)],[319777,15051,theory(equality)]) ).
cnf(322494,negated_conjecture,
multiplication(domain(esk2_0),domain(esk1_0)) != multiplication(domain(esk1_0),domain(esk2_0)),
inference(rw,[status(thm)],[53,320278,theory(equality)]) ).
cnf(323062,plain,
multiplication(domain(X1),domain(X2)) = domain(multiplication(domain(X1),X2)),
inference(rw,[status(thm)],[320260,320278,theory(equality)]) ).
cnf(323063,plain,
multiplication(domain(X1),domain(X2)) = multiplication(domain(X2),domain(X1)),
inference(rw,[status(thm)],[323062,320278,theory(equality)]) ).
cnf(324223,negated_conjecture,
$false,
inference(rw,[status(thm)],[322494,323063,theory(equality)]) ).
cnf(324224,negated_conjecture,
$false,
inference(cn,[status(thm)],[324223,theory(equality)]) ).
cnf(324225,negated_conjecture,
$false,
324224,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE060+1.p
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpFqrFK_/sel_KLE060+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpFqrFK_/sel_KLE060+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpFqrFK_/sel_KLE060+1.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpFqrFK_/sel_KLE060+1.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmpFqrFK_/sel_KLE060+1.p_5 with time limit 53
% -prover status Theorem
% Problem KLE060+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE060+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE060+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
%
%------------------------------------------------------------------------------