TSTP Solution File: KLE068+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE068+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:09:28 EST 2010
% Result : Theorem 250.46s
% Output : CNFRefutation 250.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 13
% Syntax : Number of formulae : 104 ( 104 unt; 0 def)
% Number of atoms : 104 ( 101 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 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 : 181 ( 12 sgn 50 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',left_distributivity) ).
fof(4,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',additive_commutativity) ).
fof(5,axiom,
! [X1] : addition(X1,X1) = X1,
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',additive_idempotence) ).
fof(6,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',multiplicative_associativity) ).
fof(8,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',additive_associativity) ).
fof(9,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',multiplicative_right_identity) ).
fof(10,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',domain3) ).
fof(11,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',domain2) ).
fof(12,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',right_distributivity) ).
fof(13,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',multiplicative_left_identity) ).
fof(14,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',domain1) ).
fof(15,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',domain5) ).
fof(17,conjecture,
! [X4,X5] : domain(multiplication(domain(X4),domain(X5))) = multiplication(domain(X4),domain(X5)),
file('/tmp/tmpdl7uGU/sel_KLE068+1.p_5',goals) ).
fof(18,negated_conjecture,
~ ! [X4,X5] : domain(multiplication(domain(X4),domain(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),domain(X5))) != multiplication(domain(X4),domain(X5)),
inference(fof_nnf,[status(thm)],[18]) ).
fof(51,negated_conjecture,
? [X6,X7] : domain(multiplication(domain(X6),domain(X7))) != multiplication(domain(X6),domain(X7)),
inference(variable_rename,[status(thm)],[50]) ).
fof(52,negated_conjecture,
domain(multiplication(domain(esk1_0),domain(esk2_0))) != multiplication(domain(esk1_0),domain(esk2_0)),
inference(skolemize,[status(esa)],[51]) ).
cnf(53,negated_conjecture,
domain(multiplication(domain(esk1_0),domain(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(110,negated_conjecture,
domain(multiplication(domain(esk1_0),esk2_0)) != multiplication(domain(esk1_0),domain(esk2_0)),
inference(rw,[status(thm)],[53,40,theory(equality)]) ).
cnf(113,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[105,44,theory(equality)]) ).
cnf(120,plain,
addition(one,domain(one)) = domain(one),
inference(spm,[status(thm)],[46,36,theory(equality)]) ).
cnf(131,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
inference(spm,[status(thm)],[42,36,theory(equality)]) ).
cnf(165,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[24,44,theory(equality)]) ).
cnf(168,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(202,plain,
one = domain(one),
inference(rw,[status(thm)],[120,59,theory(equality)]) ).
cnf(203,plain,
addition(one,domain(X1)) = domain(addition(one,X1)),
inference(spm,[status(thm)],[48,202,theory(equality)]) ).
cnf(207,plain,
one = domain(addition(one,X1)),
inference(rw,[status(thm)],[203,59,theory(equality)]) ).
cnf(213,plain,
addition(domain(X1),domain(X2)) = domain(addition(domain(X1),X2)),
inference(spm,[status(thm)],[48,113,theory(equality)]) ).
cnf(221,plain,
domain(addition(X1,X2)) = domain(addition(domain(X1),X2)),
inference(rw,[status(thm)],[213,48,theory(equality)]) ).
cnf(231,plain,
domain(multiplication(X1,one)) = domain(multiplication(X1,addition(one,X2))),
inference(spm,[status(thm)],[40,207,theory(equality)]) ).
cnf(244,plain,
domain(X1) = domain(multiplication(X1,addition(one,X2))),
inference(rw,[status(thm)],[231,36,theory(equality)]) ).
cnf(289,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[82,26,theory(equality)]) ).
cnf(525,plain,
multiplication(one,X1) = multiplication(domain(X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[46,165,theory(equality)]),59,theory(equality)]) ).
cnf(526,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[525,44,theory(equality)]) ).
cnf(547,plain,
addition(X1,multiplication(domain(X1),X2)) = multiplication(domain(X1),addition(X1,X2)),
inference(spm,[status(thm)],[42,526,theory(equality)]) ).
cnf(549,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(domain(X1),X2),X1),
inference(spm,[status(thm)],[24,526,theory(equality)]) ).
cnf(552,plain,
multiplication(domain(X1),domain(X1)) = domain(X1),
inference(spm,[status(thm)],[526,113,theory(equality)]) ).
cnf(555,plain,
addition(domain(X1),X1) = multiplication(domain(X1),addition(one,X1)),
inference(spm,[status(thm)],[131,526,theory(equality)]) ).
cnf(568,plain,
multiplication(addition(one,X2),X1) = multiplication(addition(domain(X1),X2),X1),
inference(rw,[status(thm)],[549,165,theory(equality)]) ).
cnf(573,plain,
addition(X1,domain(X1)) = multiplication(domain(X1),addition(one,X1)),
inference(rw,[status(thm)],[555,26,theory(equality)]) ).
cnf(586,plain,
addition(domain(X1),multiplication(domain(X1),X2)) = multiplication(domain(X1),addition(domain(X1),X2)),
inference(spm,[status(thm)],[42,552,theory(equality)]) ).
cnf(604,plain,
multiplication(domain(X1),addition(one,X2)) = multiplication(domain(X1),addition(domain(X1),X2)),
inference(rw,[status(thm)],[586,131,theory(equality)]) ).
cnf(635,plain,
domain(multiplication(domain(X1),addition(one,X2))) = domain(addition(X1,multiplication(domain(X1),X2))),
inference(spm,[status(thm)],[221,131,theory(equality)]) ).
cnf(665,plain,
domain(X1) = domain(addition(X1,multiplication(domain(X1),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[635,244,theory(equality)]),113,theory(equality)]) ).
cnf(1476,plain,
multiplication(domain(addition(X1,X2)),X1) = multiplication(addition(one,domain(X2)),X1),
inference(spm,[status(thm)],[568,48,theory(equality)]) ).
cnf(1514,plain,
multiplication(domain(addition(X1,X2)),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[1476,59,theory(equality)]),44,theory(equality)]) ).
cnf(1552,plain,
multiplication(domain(addition(X2,X1)),X1) = X1,
inference(spm,[status(thm)],[1514,289,theory(equality)]) ).
cnf(1618,plain,
multiplication(domain(multiplication(addition(X1,X3),X2)),multiplication(X3,X2)) = multiplication(X3,X2),
inference(spm,[status(thm)],[1552,24,theory(equality)]) ).
cnf(1716,plain,
multiplication(domain(X1),addition(X1,one)) = addition(X1,domain(X1)),
inference(spm,[status(thm)],[573,26,theory(equality)]) ).
cnf(1784,plain,
multiplication(addition(X1,domain(X1)),X2) = multiplication(domain(X1),multiplication(addition(X1,one),X2)),
inference(spm,[status(thm)],[30,1716,theory(equality)]) ).
cnf(3778,plain,
domain(multiplication(domain(X1),addition(X1,X2))) = domain(X1),
inference(rw,[status(thm)],[665,547,theory(equality)]) ).
cnf(14952,plain,
multiplication(domain(X1),domain(addition(X1,X2))) = multiplication(domain(X1),addition(one,domain(X2))),
inference(spm,[status(thm)],[604,48,theory(equality)]) ).
cnf(15045,plain,
multiplication(domain(X1),domain(addition(X1,X2))) = domain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[14952,59,theory(equality)]),36,theory(equality)]) ).
cnf(15152,plain,
multiplication(domain(X1),domain(addition(X2,X1))) = domain(X1),
inference(spm,[status(thm)],[15045,289,theory(equality)]) ).
cnf(15383,plain,
multiplication(domain(multiplication(X1,X2)),domain(multiplication(X1,addition(one,X2)))) = domain(multiplication(X1,X2)),
inference(spm,[status(thm)],[15152,131,theory(equality)]) ).
cnf(15411,plain,
multiplication(domain(multiplication(domain(X1),X2)),domain(multiplication(domain(X1),addition(X1,X2)))) = domain(multiplication(domain(X1),X2)),
inference(spm,[status(thm)],[15152,547,theory(equality)]) ).
cnf(15508,plain,
multiplication(domain(multiplication(X1,X2)),domain(X1)) = domain(multiplication(X1,X2)),
inference(rw,[status(thm)],[15383,244,theory(equality)]) ).
cnf(15537,plain,
multiplication(domain(multiplication(domain(X1),X2)),domain(X1)) = domain(multiplication(domain(X1),X2)),
inference(rw,[status(thm)],[15411,3778,theory(equality)]) ).
cnf(15597,plain,
domain(domain(multiplication(X1,X2))) = domain(multiplication(domain(multiplication(X1,X2)),X1)),
inference(spm,[status(thm)],[40,15508,theory(equality)]) ).
cnf(15718,plain,
domain(multiplication(X1,X2)) = domain(multiplication(domain(multiplication(X1,X2)),X1)),
inference(rw,[status(thm)],[15597,113,theory(equality)]) ).
cnf(15859,plain,
domain(multiplication(domain(X1),X2)) = domain(multiplication(domain(multiplication(domain(X1),X2)),X1)),
inference(spm,[status(thm)],[40,15718,theory(equality)]) ).
cnf(64602,plain,
multiplication(domain(multiplication(one,X2)),multiplication(domain(X1),X2)) = multiplication(domain(X1),X2),
inference(spm,[status(thm)],[1618,59,theory(equality)]) ).
cnf(64885,plain,
multiplication(domain(X2),multiplication(domain(X1),X2)) = multiplication(domain(X1),X2),
inference(rw,[status(thm)],[64602,44,theory(equality)]) ).
cnf(65191,plain,
addition(multiplication(domain(X2),X1),multiplication(X3,X1)) = multiplication(addition(multiplication(domain(X1),domain(X2)),X3),X1),
inference(spm,[status(thm)],[168,64885,theory(equality)]) ).
cnf(65433,plain,
multiplication(addition(domain(X2),X3),X1) = multiplication(addition(multiplication(domain(X1),domain(X2)),X3),X1),
inference(rw,[status(thm)],[65191,24,theory(equality)]) ).
cnf(342918,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)],[1784,65433,theory(equality)]) ).
cnf(343598,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)],[342918,40,theory(equality)]),26,theory(equality)]),59,theory(equality)]),44,theory(equality)]) ).
cnf(343599,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)],[343598,40,theory(equality)]),65433,theory(equality)]),48,theory(equality)]),165,theory(equality)]),59,theory(equality)]),44,theory(equality)]) ).
cnf(344010,plain,
multiplication(domain(multiplication(domain(X1),X2)),domain(X1)) = multiplication(domain(X2),domain(X1)),
inference(spm,[status(thm)],[343599,113,theory(equality)]) ).
cnf(344508,plain,
domain(multiplication(domain(X2),X1)) = domain(multiplication(domain(X1),X2)),
inference(rw,[status(thm)],[15859,343599,theory(equality)]) ).
cnf(344526,plain,
domain(multiplication(domain(X1),X2)) = multiplication(domain(X2),domain(X1)),
inference(rw,[status(thm)],[344010,15537,theory(equality)]) ).
cnf(347274,negated_conjecture,
multiplication(domain(esk2_0),domain(esk1_0)) != multiplication(domain(esk1_0),domain(esk2_0)),
inference(rw,[status(thm)],[110,344526,theory(equality)]) ).
cnf(347844,plain,
multiplication(domain(X1),domain(X2)) = domain(multiplication(domain(X1),X2)),
inference(rw,[status(thm)],[344508,344526,theory(equality)]) ).
cnf(347845,plain,
multiplication(domain(X1),domain(X2)) = multiplication(domain(X2),domain(X1)),
inference(rw,[status(thm)],[347844,344526,theory(equality)]) ).
cnf(348509,negated_conjecture,
$false,
inference(rw,[status(thm)],[347274,347845,theory(equality)]) ).
cnf(348510,negated_conjecture,
$false,
inference(cn,[status(thm)],[348509,theory(equality)]) ).
cnf(348511,negated_conjecture,
$false,
348510,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE068+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/tmpdl7uGU/sel_KLE068+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpdl7uGU/sel_KLE068+1.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpdl7uGU/sel_KLE068+1.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpdl7uGU/sel_KLE068+1.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmpdl7uGU/sel_KLE068+1.p_5 with time limit 54
% -prover status Theorem
% Problem KLE068+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE068+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE068+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
%
%------------------------------------------------------------------------------