TSTP Solution File: KLE007+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE007+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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 11:38:10 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 18 unt; 0 def)
% Number of atoms : 100 ( 54 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 105 ( 44 ~; 34 |; 22 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 32 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpvjEUrx/sel_KLE007+3.p_1',multiplicative_left_identity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpvjEUrx/sel_KLE007+3.p_1',additive_commutativity) ).
fof(11,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/tmp/tmpvjEUrx/sel_KLE007+3.p_1',test_3) ).
fof(12,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/tmp/tmpvjEUrx/sel_KLE007+3.p_1',test_2) ).
fof(17,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmpvjEUrx/sel_KLE007+3.p_1',right_distributivity) ).
fof(18,conjecture,
! [X4,X5] :
( ( test(X5)
& test(X4) )
=> one = addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))) ),
file('/tmp/tmpvjEUrx/sel_KLE007+3.p_1',goals) ).
fof(19,negated_conjecture,
~ ! [X4,X5] :
( ( test(X5)
& test(X4) )
=> one = addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))) ),
inference(assume_negation,[status(cth)],[18]) ).
fof(23,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(24,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[23]) ).
fof(31,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[6]) ).
cnf(32,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[31]) ).
fof(42,plain,
! [X4,X5] :
( ~ test(X4)
| ( ( c(X4) != X5
| complement(X4,X5) )
& ( ~ complement(X4,X5)
| c(X4) = X5 ) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(43,plain,
! [X6,X7] :
( ~ test(X6)
| ( ( c(X6) != X7
| complement(X6,X7) )
& ( ~ complement(X6,X7)
| c(X6) = X7 ) ) ),
inference(variable_rename,[status(thm)],[42]) ).
fof(44,plain,
! [X6,X7] :
( ( c(X6) != X7
| complement(X6,X7)
| ~ test(X6) )
& ( ~ complement(X6,X7)
| c(X6) = X7
| ~ test(X6) ) ),
inference(distribute,[status(thm)],[43]) ).
cnf(46,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[44]) ).
fof(47,plain,
! [X4,X5] :
( ( ~ complement(X5,X4)
| ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) )
& ( multiplication(X4,X5) != zero
| multiplication(X5,X4) != zero
| addition(X4,X5) != one
| complement(X5,X4) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(48,plain,
! [X6,X7] :
( ( ~ complement(X7,X6)
| ( multiplication(X6,X7) = zero
& multiplication(X7,X6) = zero
& addition(X6,X7) = one ) )
& ( multiplication(X6,X7) != zero
| multiplication(X7,X6) != zero
| addition(X6,X7) != one
| complement(X7,X6) ) ),
inference(variable_rename,[status(thm)],[47]) ).
fof(49,plain,
! [X6,X7] :
( ( multiplication(X6,X7) = zero
| ~ complement(X7,X6) )
& ( multiplication(X7,X6) = zero
| ~ complement(X7,X6) )
& ( addition(X6,X7) = one
| ~ complement(X7,X6) )
& ( multiplication(X6,X7) != zero
| multiplication(X7,X6) != zero
| addition(X6,X7) != one
| complement(X7,X6) ) ),
inference(distribute,[status(thm)],[48]) ).
cnf(51,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[49]) ).
fof(68,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[17]) ).
cnf(69,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[68]) ).
fof(70,negated_conjecture,
? [X4,X5] :
( test(X5)
& test(X4)
& one != addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(71,negated_conjecture,
? [X6,X7] :
( test(X7)
& test(X6)
& one != addition(multiplication(addition(X6,c(X6)),X7),multiplication(addition(X6,c(X6)),c(X7))) ),
inference(variable_rename,[status(thm)],[70]) ).
fof(72,negated_conjecture,
( test(esk3_0)
& test(esk2_0)
& one != addition(multiplication(addition(esk2_0,c(esk2_0)),esk3_0),multiplication(addition(esk2_0,c(esk2_0)),c(esk3_0))) ),
inference(skolemize,[status(esa)],[71]) ).
cnf(73,negated_conjecture,
one != addition(multiplication(addition(esk2_0,c(esk2_0)),esk3_0),multiplication(addition(esk2_0,c(esk2_0)),c(esk3_0))),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(74,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(75,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(87,plain,
( addition(X1,X2) = one
| c(X2) != X1
| ~ test(X2) ),
inference(spm,[status(thm)],[51,46,theory(equality)]) ).
cnf(200,negated_conjecture,
multiplication(addition(esk2_0,c(esk2_0)),addition(esk3_0,c(esk3_0))) != one,
inference(rw,[status(thm)],[73,69,theory(equality)]) ).
cnf(293,plain,
( addition(c(X1),X1) = one
| ~ test(X1) ),
inference(er,[status(thm)],[87,theory(equality)]) ).
cnf(296,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[293,32,theory(equality)]) ).
cnf(300,negated_conjecture,
( multiplication(one,addition(esk3_0,c(esk3_0))) != one
| ~ test(esk2_0) ),
inference(spm,[status(thm)],[200,296,theory(equality)]) ).
cnf(305,negated_conjecture,
( addition(esk3_0,c(esk3_0)) != one
| ~ test(esk2_0) ),
inference(rw,[status(thm)],[300,24,theory(equality)]) ).
cnf(306,negated_conjecture,
( addition(esk3_0,c(esk3_0)) != one
| $false ),
inference(rw,[status(thm)],[305,74,theory(equality)]) ).
cnf(307,negated_conjecture,
addition(esk3_0,c(esk3_0)) != one,
inference(cn,[status(thm)],[306,theory(equality)]) ).
cnf(312,negated_conjecture,
~ test(esk3_0),
inference(spm,[status(thm)],[307,296,theory(equality)]) ).
cnf(313,negated_conjecture,
$false,
inference(rw,[status(thm)],[312,75,theory(equality)]) ).
cnf(314,negated_conjecture,
$false,
inference(cn,[status(thm)],[313,theory(equality)]) ).
cnf(315,negated_conjecture,
$false,
314,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE007+3.p
% --creating new selector for [KLE001+0.ax, KLE001+1.ax, KLE001+2.ax]
% -running prover on /tmp/tmpvjEUrx/sel_KLE007+3.p_1 with time limit 29
% -prover status Theorem
% Problem KLE007+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE007+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE007+3.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
%
%------------------------------------------------------------------------------