TSTP Solution File: KLE099+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE099+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:15:53 EST 2010
% Result : Theorem 184.79s
% Output : CNFRefutation 184.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 77 ( 72 unt; 0 def)
% Number of atoms : 82 ( 80 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 0 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 118 ( 6 sgn 54 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',left_annihilation) ).
fof(3,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',multiplicative_left_identity) ).
fof(4,axiom,
! [X1] : addition(X1,zero) = X1,
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',additive_identity) ).
fof(5,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',left_distributivity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',additive_commutativity) ).
fof(8,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',multiplicative_associativity) ).
fof(12,axiom,
! [X4,X5] : forward_diamond(X4,X5) = domain(multiplication(X4,domain(X5))),
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',forward_diamond) ).
fof(13,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',additive_associativity) ).
fof(14,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',multiplicative_right_identity) ).
fof(15,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',domain3) ).
fof(17,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',right_distributivity) ).
fof(18,axiom,
! [X1] : addition(X1,X1) = X1,
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',additive_idempotence) ).
fof(19,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',domain1) ).
fof(20,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',domain4) ).
fof(21,conjecture,
! [X4,X5,X6] :
( addition(forward_diamond(X4,domain(X5)),domain(X6)) = domain(X6)
=> multiplication(antidomain(X6),multiplication(X4,domain(X5))) = zero ),
file('/tmp/tmpiRqT3p/sel_KLE099+1.p_4',goals) ).
fof(22,negated_conjecture,
~ ! [X4,X5,X6] :
( addition(forward_diamond(X4,domain(X5)),domain(X6)) = domain(X6)
=> multiplication(antidomain(X6),multiplication(X4,domain(X5))) = zero ),
inference(assume_negation,[status(cth)],[21]) ).
fof(23,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[1]) ).
cnf(24,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[23]) ).
fof(27,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[3]) ).
cnf(28,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[27]) ).
fof(29,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[4]) ).
cnf(30,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[29]) ).
fof(31,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[5]) ).
cnf(32,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[31]) ).
fof(33,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[6]) ).
cnf(34,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[33]) ).
fof(37,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[8]) ).
cnf(38,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[37]) ).
fof(45,plain,
! [X6,X7] : forward_diamond(X6,X7) = domain(multiplication(X6,domain(X7))),
inference(variable_rename,[status(thm)],[12]) ).
cnf(46,plain,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[45]) ).
fof(47,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[13]) ).
cnf(48,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[47]) ).
fof(49,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[14]) ).
cnf(50,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[49]) ).
fof(51,plain,
! [X5] : addition(antidomain(antidomain(X5)),antidomain(X5)) = one,
inference(variable_rename,[status(thm)],[15]) ).
cnf(52,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[51]) ).
fof(55,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[17]) ).
cnf(56,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[55]) ).
fof(57,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[18]) ).
cnf(58,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[57]) ).
fof(59,plain,
! [X5] : multiplication(antidomain(X5),X5) = zero,
inference(variable_rename,[status(thm)],[19]) ).
cnf(60,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[59]) ).
fof(61,plain,
! [X5] : domain(X5) = antidomain(antidomain(X5)),
inference(variable_rename,[status(thm)],[20]) ).
cnf(62,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[61]) ).
fof(63,negated_conjecture,
? [X4,X5,X6] :
( addition(forward_diamond(X4,domain(X5)),domain(X6)) = domain(X6)
& multiplication(antidomain(X6),multiplication(X4,domain(X5))) != zero ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(64,negated_conjecture,
? [X7,X8,X9] :
( addition(forward_diamond(X7,domain(X8)),domain(X9)) = domain(X9)
& multiplication(antidomain(X9),multiplication(X7,domain(X8))) != zero ),
inference(variable_rename,[status(thm)],[63]) ).
fof(65,negated_conjecture,
( addition(forward_diamond(esk1_0,domain(esk2_0)),domain(esk3_0)) = domain(esk3_0)
& multiplication(antidomain(esk3_0),multiplication(esk1_0,domain(esk2_0))) != zero ),
inference(skolemize,[status(esa)],[64]) ).
cnf(66,negated_conjecture,
multiplication(antidomain(esk3_0),multiplication(esk1_0,domain(esk2_0))) != zero,
inference(split_conjunct,[status(thm)],[65]) ).
cnf(67,negated_conjecture,
addition(forward_diamond(esk1_0,domain(esk2_0)),domain(esk3_0)) = domain(esk3_0),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(68,plain,
antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2))))) = forward_diamond(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[46,62,theory(equality)]),62,theory(equality)]),
[unfolding] ).
cnf(69,negated_conjecture,
addition(forward_diamond(esk1_0,antidomain(antidomain(esk2_0))),antidomain(antidomain(esk3_0))) = antidomain(antidomain(esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[67,62,theory(equality)]),62,theory(equality)]),62,theory(equality)]),
[unfolding] ).
cnf(70,negated_conjecture,
multiplication(antidomain(esk3_0),multiplication(esk1_0,antidomain(antidomain(esk2_0)))) != zero,
inference(rw,[status(thm)],[66,62,theory(equality)]),
[unfolding] ).
cnf(71,negated_conjecture,
addition(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))),antidomain(antidomain(esk3_0))) = antidomain(antidomain(esk3_0)),
inference(rw,[status(thm)],[69,68,theory(equality)]),
[unfolding] ).
cnf(80,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[52,34,theory(equality)]) ).
cnf(106,plain,
addition(X1,X2) = addition(X1,addition(X1,X2)),
inference(spm,[status(thm)],[48,58,theory(equality)]) ).
cnf(118,negated_conjecture,
addition(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0)))))))) = antidomain(antidomain(esk3_0)),
inference(rw,[status(thm)],[71,34,theory(equality)]) ).
cnf(132,plain,
addition(multiplication(antidomain(X1),X2),zero) = multiplication(antidomain(X1),addition(X2,X1)),
inference(spm,[status(thm)],[56,60,theory(equality)]) ).
cnf(152,plain,
multiplication(antidomain(X1),X2) = multiplication(antidomain(X1),addition(X2,X1)),
inference(rw,[status(thm)],[132,30,theory(equality)]) ).
cnf(170,plain,
addition(multiplication(X1,X2),zero) = multiplication(addition(X1,antidomain(X2)),X2),
inference(spm,[status(thm)],[32,60,theory(equality)]) ).
cnf(191,plain,
multiplication(X1,X2) = multiplication(addition(X1,antidomain(X2)),X2),
inference(rw,[status(thm)],[170,30,theory(equality)]) ).
cnf(366,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[106,34,theory(equality)]) ).
cnf(498,plain,
multiplication(addition(antidomain(X2),X1),X2) = multiplication(X1,X2),
inference(spm,[status(thm)],[191,34,theory(equality)]) ).
cnf(539,plain,
multiplication(one,X1) = multiplication(antidomain(antidomain(X1)),X1),
inference(spm,[status(thm)],[498,80,theory(equality)]) ).
cnf(560,plain,
X1 = multiplication(antidomain(antidomain(X1)),X1),
inference(rw,[status(thm)],[539,28,theory(equality)]) ).
cnf(724,plain,
multiplication(antidomain(antidomain(antidomain(X1))),one) = multiplication(antidomain(antidomain(antidomain(X1))),antidomain(X1)),
inference(spm,[status(thm)],[152,80,theory(equality)]) ).
cnf(744,plain,
multiplication(antidomain(addition(X1,X2)),addition(X1,X2)) = multiplication(antidomain(addition(X1,X2)),X2),
inference(spm,[status(thm)],[152,366,theory(equality)]) ).
cnf(748,plain,
antidomain(antidomain(antidomain(X1))) = multiplication(antidomain(antidomain(antidomain(X1))),antidomain(X1)),
inference(rw,[status(thm)],[724,50,theory(equality)]) ).
cnf(749,plain,
antidomain(antidomain(antidomain(X1))) = antidomain(X1),
inference(rw,[status(thm)],[748,560,theory(equality)]) ).
cnf(766,plain,
zero = multiplication(antidomain(addition(X1,X2)),X2),
inference(rw,[status(thm)],[744,60,theory(equality)]) ).
cnf(788,negated_conjecture,
addition(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(esk2_0)))))) = antidomain(antidomain(esk3_0)),
inference(rw,[status(thm)],[118,749,theory(equality)]) ).
cnf(978,plain,
multiplication(zero,X3) = multiplication(antidomain(addition(X1,X2)),multiplication(X2,X3)),
inference(spm,[status(thm)],[38,766,theory(equality)]) ).
cnf(1009,plain,
zero = multiplication(antidomain(addition(X1,X2)),multiplication(X2,X3)),
inference(rw,[status(thm)],[978,24,theory(equality)]) ).
cnf(1966,plain,
multiplication(antidomain(addition(X1,antidomain(antidomain(X2)))),X2) = zero,
inference(spm,[status(thm)],[1009,560,theory(equality)]) ).
cnf(2144,negated_conjecture,
multiplication(antidomain(antidomain(antidomain(esk3_0))),multiplication(esk1_0,antidomain(antidomain(esk2_0)))) = zero,
inference(spm,[status(thm)],[1966,788,theory(equality)]) ).
cnf(2175,negated_conjecture,
multiplication(antidomain(esk3_0),multiplication(esk1_0,antidomain(antidomain(esk2_0)))) = zero,
inference(rw,[status(thm)],[2144,749,theory(equality)]) ).
cnf(2176,negated_conjecture,
$false,
inference(sr,[status(thm)],[2175,70,theory(equality)]) ).
cnf(2177,negated_conjecture,
$false,
2176,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE099+1.p
% --creating new selector for [KLE001+0.ax, KLE001+4.ax, KLE001+6.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpiRqT3p/sel_KLE099+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpiRqT3p/sel_KLE099+1.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+4.ax, KLE001+6.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpiRqT3p/sel_KLE099+1.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+4.ax, KLE001+6.ax]
% -running prover on /tmp/tmpiRqT3p/sel_KLE099+1.p_4 with time limit 55
% -prover status Theorem
% Problem KLE099+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE099+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE099+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
%
%------------------------------------------------------------------------------