TSTP Solution File: KLE027+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE027+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:50:42 EST 2010
% Result : Theorem 185.56s
% Output : CNFRefutation 185.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 63 ( 25 unt; 0 def)
% Number of atoms : 149 ( 73 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 146 ( 60 ~; 54 |; 26 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 112 ( 4 sgn 57 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1] : addition(X1,zero) = X1,
file('/tmp/tmpIceo8L/sel_KLE027+3.p_4',additive_identity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpIceo8L/sel_KLE027+3.p_4',additive_commutativity) ).
fof(8,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/tmp/tmpIceo8L/sel_KLE027+3.p_4',multiplicative_associativity) ).
fof(9,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/tmp/tmpIceo8L/sel_KLE027+3.p_4',left_annihilation) ).
fof(11,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/tmp/tmpIceo8L/sel_KLE027+3.p_4',test_3) ).
fof(12,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/tmp/tmpIceo8L/sel_KLE027+3.p_4',test_2) ).
fof(13,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/tmp/tmpIceo8L/sel_KLE027+3.p_4',test_1) ).
fof(14,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpIceo8L/sel_KLE027+3.p_4',multiplicative_right_identity) ).
fof(17,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmpIceo8L/sel_KLE027+3.p_4',right_distributivity) ).
fof(18,conjecture,
! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X8) )
=> addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)) = addition(multiplication(X7,X4),multiplication(c(X7),X6)) ),
file('/tmp/tmpIceo8L/sel_KLE027+3.p_4',goals) ).
fof(19,negated_conjecture,
~ ! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X8) )
=> addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)) = addition(multiplication(X7,X4),multiplication(c(X7),X6)) ),
inference(assume_negation,[status(cth)],[18]) ).
fof(25,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[3]) ).
cnf(26,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[25]) ).
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(35,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[8]) ).
cnf(36,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[35]) ).
fof(37,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[9]) ).
cnf(38,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[37]) ).
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]) ).
cnf(52,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(53,plain,
( multiplication(X2,X1) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[49]) ).
fof(54,plain,
! [X4] :
( ( ~ test(X4)
| ? [X5] : complement(X5,X4) )
& ( ! [X5] : ~ complement(X5,X4)
| test(X4) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(55,plain,
! [X6] :
( ( ~ test(X6)
| ? [X7] : complement(X7,X6) )
& ( ! [X8] : ~ complement(X8,X6)
| test(X6) ) ),
inference(variable_rename,[status(thm)],[54]) ).
fof(56,plain,
! [X6] :
( ( ~ test(X6)
| complement(esk1_1(X6),X6) )
& ( ! [X8] : ~ complement(X8,X6)
| test(X6) ) ),
inference(skolemize,[status(esa)],[55]) ).
fof(57,plain,
! [X6,X8] :
( ( ~ complement(X8,X6)
| test(X6) )
& ( ~ test(X6)
| complement(esk1_1(X6),X6) ) ),
inference(shift_quantors,[status(thm)],[56]) ).
cnf(58,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[57]) ).
fof(60,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[14]) ).
cnf(61,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[60]) ).
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,X6,X7,X8] :
( test(X7)
& test(X8)
& addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)) != addition(multiplication(X7,X4),multiplication(c(X7),X6)) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(71,negated_conjecture,
? [X9,X10,X11,X12,X13] :
( test(X12)
& test(X13)
& addition(multiplication(X12,addition(multiplication(X12,X9),multiplication(c(X12),X10))),multiplication(c(X12),X11)) != addition(multiplication(X12,X9),multiplication(c(X12),X11)) ),
inference(variable_rename,[status(thm)],[70]) ).
fof(72,negated_conjecture,
( test(esk5_0)
& test(esk6_0)
& addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
inference(skolemize,[status(esa)],[71]) ).
cnf(73,negated_conjecture,
addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(75,negated_conjecture,
test(esk5_0),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(84,plain,
( multiplication(X1,esk1_1(X1)) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[53,58,theory(equality)]) ).
cnf(87,plain,
( multiplication(X1,X2) = zero
| c(X1) != X2
| ~ test(X1) ),
inference(spm,[status(thm)],[52,46,theory(equality)]) ).
cnf(88,plain,
( addition(X1,esk1_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[51,58,theory(equality)]) ).
cnf(200,negated_conjecture,
addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),
inference(rw,[status(thm)],[73,32,theory(equality)]) ).
cnf(274,plain,
( addition(multiplication(X1,X2),zero) = multiplication(X1,addition(X2,esk1_1(X1)))
| ~ test(X1) ),
inference(spm,[status(thm)],[69,84,theory(equality)]) ).
cnf(279,plain,
( multiplication(X1,X2) = multiplication(X1,addition(X2,esk1_1(X1)))
| ~ test(X1) ),
inference(rw,[status(thm)],[274,26,theory(equality)]) ).
cnf(346,plain,
( multiplication(X1,c(X1)) = zero
| ~ test(X1) ),
inference(er,[status(thm)],[87,theory(equality)]) ).
cnf(352,plain,
( multiplication(zero,X2) = multiplication(X1,multiplication(c(X1),X2))
| ~ test(X1) ),
inference(spm,[status(thm)],[36,346,theory(equality)]) ).
cnf(362,plain,
( zero = multiplication(X1,multiplication(c(X1),X2))
| ~ test(X1) ),
inference(rw,[status(thm)],[352,38,theory(equality)]) ).
cnf(650,plain,
( addition(multiplication(X1,X2),zero) = multiplication(X1,addition(X2,multiplication(c(X1),X3)))
| ~ test(X1) ),
inference(spm,[status(thm)],[69,362,theory(equality)]) ).
cnf(674,plain,
( multiplication(X1,X2) = multiplication(X1,addition(X2,multiplication(c(X1),X3)))
| ~ test(X1) ),
inference(rw,[status(thm)],[650,26,theory(equality)]) ).
cnf(7876,plain,
( multiplication(X1,one) = multiplication(X1,X1)
| ~ test(X1) ),
inference(spm,[status(thm)],[279,88,theory(equality)]) ).
cnf(7920,plain,
( X1 = multiplication(X1,X1)
| ~ test(X1) ),
inference(rw,[status(thm)],[7876,61,theory(equality)]) ).
cnf(7928,negated_conjecture,
multiplication(esk5_0,esk5_0) = esk5_0,
inference(spm,[status(thm)],[7920,75,theory(equality)]) ).
cnf(7938,negated_conjecture,
multiplication(esk5_0,X1) = multiplication(esk5_0,multiplication(esk5_0,X1)),
inference(spm,[status(thm)],[36,7928,theory(equality)]) ).
cnf(27897,negated_conjecture,
( addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,multiplication(esk5_0,esk2_0))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))
| ~ test(esk5_0) ),
inference(spm,[status(thm)],[200,674,theory(equality)]) ).
cnf(28072,negated_conjecture,
( $false
| ~ test(esk5_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[27897,7938,theory(equality)]),32,theory(equality)]) ).
cnf(28073,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[28072,75,theory(equality)]) ).
cnf(28074,negated_conjecture,
$false,
inference(cn,[status(thm)],[28073,theory(equality)]) ).
cnf(28075,negated_conjecture,
$false,
28074,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE027+3.p
% --creating new selector for [KLE001+0.ax, KLE001+1.ax, KLE001+2.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpIceo8L/sel_KLE027+3.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpIceo8L/sel_KLE027+3.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+1.ax, KLE001+2.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpIceo8L/sel_KLE027+3.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+1.ax, KLE001+2.ax]
% -running prover on /tmp/tmpIceo8L/sel_KLE027+3.p_4 with time limit 55
% -prover status Theorem
% Problem KLE027+3.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE027+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE027+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
%
%------------------------------------------------------------------------------