TSTP Solution File: KLE066+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE066+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:08:04 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 23 unt; 0 def)
% Number of atoms : 35 ( 33 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 6 ~; 0 |; 3 &)
% ( 0 <=>; 1 =>; 2 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 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 : 25 ( 1 sgn 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/tmp/tmpTHO2-l/sel_KLE066+1.p_1',left_annihilation) ).
fof(2,axiom,
! [X1] : addition(X1,zero) = X1,
file('/tmp/tmpTHO2-l/sel_KLE066+1.p_1',additive_identity) ).
fof(9,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/tmp/tmpTHO2-l/sel_KLE066+1.p_1',domain2) ).
fof(11,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/tmp/tmpTHO2-l/sel_KLE066+1.p_1',domain1) ).
fof(13,axiom,
domain(zero) = zero,
file('/tmp/tmpTHO2-l/sel_KLE066+1.p_1',domain4) ).
fof(14,conjecture,
! [X4,X5] :
( multiplication(X4,X5) = zero
<= multiplication(X4,domain(X5)) = zero ),
file('/tmp/tmpTHO2-l/sel_KLE066+1.p_1',goals) ).
fof(15,negated_conjecture,
~ ! [X4,X5] :
( multiplication(X4,X5) = zero
<= multiplication(X4,domain(X5)) = zero ),
inference(assume_negation,[status(cth)],[14]) ).
fof(16,negated_conjecture,
~ ! [X4,X5] :
( multiplication(X4,domain(X5)) = zero
=> multiplication(X4,X5) = zero ),
inference(fof_simplification,[status(thm)],[15,theory(equality)]) ).
fof(17,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[1]) ).
cnf(18,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[17]) ).
fof(19,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(20,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[19]) ).
fof(33,plain,
! [X6,X7] : domain(multiplication(X6,X7)) = domain(multiplication(X6,domain(X7))),
inference(variable_rename,[status(thm)],[9]) ).
cnf(34,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[33]) ).
fof(37,plain,
! [X5] : addition(X5,multiplication(domain(X5),X5)) = multiplication(domain(X5),X5),
inference(variable_rename,[status(thm)],[11]) ).
cnf(38,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(41,plain,
domain(zero) = zero,
inference(split_conjunct,[status(thm)],[13]) ).
fof(42,negated_conjecture,
? [X4,X5] :
( multiplication(X4,domain(X5)) = zero
& multiplication(X4,X5) != zero ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(43,negated_conjecture,
? [X6,X7] :
( multiplication(X6,domain(X7)) = zero
& multiplication(X6,X7) != zero ),
inference(variable_rename,[status(thm)],[42]) ).
fof(44,negated_conjecture,
( multiplication(esk1_0,domain(esk2_0)) = zero
& multiplication(esk1_0,esk2_0) != zero ),
inference(skolemize,[status(esa)],[43]) ).
cnf(45,negated_conjecture,
multiplication(esk1_0,esk2_0) != zero,
inference(split_conjunct,[status(thm)],[44]) ).
cnf(46,negated_conjecture,
multiplication(esk1_0,domain(esk2_0)) = zero,
inference(split_conjunct,[status(thm)],[44]) ).
cnf(92,negated_conjecture,
domain(zero) = domain(multiplication(esk1_0,esk2_0)),
inference(spm,[status(thm)],[34,46,theory(equality)]) ).
cnf(99,negated_conjecture,
zero = domain(multiplication(esk1_0,esk2_0)),
inference(rw,[status(thm)],[92,41,theory(equality)]) ).
cnf(186,negated_conjecture,
addition(multiplication(esk1_0,esk2_0),multiplication(zero,multiplication(esk1_0,esk2_0))) = multiplication(zero,multiplication(esk1_0,esk2_0)),
inference(spm,[status(thm)],[38,99,theory(equality)]) ).
cnf(190,negated_conjecture,
multiplication(esk1_0,esk2_0) = multiplication(zero,multiplication(esk1_0,esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[186,18,theory(equality)]),20,theory(equality)]) ).
cnf(191,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
inference(rw,[status(thm)],[190,18,theory(equality)]) ).
cnf(192,negated_conjecture,
$false,
inference(sr,[status(thm)],[191,45,theory(equality)]) ).
cnf(193,negated_conjecture,
$false,
192,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE066+1.p
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmpTHO2-l/sel_KLE066+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE066+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE066+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE066+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
%
%------------------------------------------------------------------------------