TSTP Solution File: KLE065+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE065+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:07:49 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 22 unt; 0 def)
% Number of atoms : 32 ( 30 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 5 ~; 0 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 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 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/tmp/tmp2GoC4u/sel_KLE065+1.p_1',left_annihilation) ).
fof(2,axiom,
! [X1] : addition(X1,zero) = X1,
file('/tmp/tmp2GoC4u/sel_KLE065+1.p_1',additive_identity) ).
fof(9,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/tmp/tmp2GoC4u/sel_KLE065+1.p_1',domain2) ).
fof(11,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/tmp/tmp2GoC4u/sel_KLE065+1.p_1',domain1) ).
fof(13,axiom,
domain(zero) = zero,
file('/tmp/tmp2GoC4u/sel_KLE065+1.p_1',domain4) ).
fof(14,conjecture,
! [X4,X5] :
( multiplication(X4,X5) = zero
=> multiplication(X4,domain(X5)) = zero ),
file('/tmp/tmp2GoC4u/sel_KLE065+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,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[1]) ).
cnf(17,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[16]) ).
fof(18,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(19,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[18]) ).
fof(32,plain,
! [X6,X7] : domain(multiplication(X6,X7)) = domain(multiplication(X6,domain(X7))),
inference(variable_rename,[status(thm)],[9]) ).
cnf(33,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[32]) ).
fof(36,plain,
! [X5] : addition(X5,multiplication(domain(X5),X5)) = multiplication(domain(X5),X5),
inference(variable_rename,[status(thm)],[11]) ).
cnf(37,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(40,plain,
domain(zero) = zero,
inference(split_conjunct,[status(thm)],[13]) ).
fof(41,negated_conjecture,
? [X4,X5] :
( multiplication(X4,X5) = zero
& multiplication(X4,domain(X5)) != zero ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(42,negated_conjecture,
? [X6,X7] :
( multiplication(X6,X7) = zero
& multiplication(X6,domain(X7)) != zero ),
inference(variable_rename,[status(thm)],[41]) ).
fof(43,negated_conjecture,
( multiplication(esk1_0,esk2_0) = zero
& multiplication(esk1_0,domain(esk2_0)) != zero ),
inference(skolemize,[status(esa)],[42]) ).
cnf(44,negated_conjecture,
multiplication(esk1_0,domain(esk2_0)) != zero,
inference(split_conjunct,[status(thm)],[43]) ).
cnf(45,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
inference(split_conjunct,[status(thm)],[43]) ).
cnf(105,plain,
addition(multiplication(X1,domain(X2)),multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2)))) = multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2))),
inference(spm,[status(thm)],[37,33,theory(equality)]) ).
cnf(1817,negated_conjecture,
addition(multiplication(esk1_0,domain(esk2_0)),multiplication(domain(zero),multiplication(esk1_0,domain(esk2_0)))) = multiplication(domain(zero),multiplication(esk1_0,domain(esk2_0))),
inference(spm,[status(thm)],[105,45,theory(equality)]) ).
cnf(1862,negated_conjecture,
multiplication(esk1_0,domain(esk2_0)) = multiplication(domain(zero),multiplication(esk1_0,domain(esk2_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1817,40,theory(equality)]),17,theory(equality)]),19,theory(equality)]) ).
cnf(1863,negated_conjecture,
multiplication(esk1_0,domain(esk2_0)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[1862,40,theory(equality)]),17,theory(equality)]) ).
cnf(1864,negated_conjecture,
$false,
inference(sr,[status(thm)],[1863,44,theory(equality)]) ).
cnf(1865,negated_conjecture,
$false,
1864,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE065+1.p
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmp2GoC4u/sel_KLE065+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE065+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE065+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE065+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
%
%------------------------------------------------------------------------------