TSTP Solution File: KLE021+4 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE021+4 : 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:46:41 EST 2010
% Result : Theorem 184.81s
% Output : CNFRefutation 184.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 48 ( 15 unt; 0 def)
% Number of atoms : 130 ( 61 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 146 ( 64 ~; 55 |; 21 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 40 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmp6e6KJu/sel_KLE021+4.p_4',multiplicative_left_identity) ).
fof(4,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmp6e6KJu/sel_KLE021+4.p_4',left_distributivity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmp6e6KJu/sel_KLE021+4.p_4',additive_commutativity) ).
fof(7,axiom,
! [X1] : addition(X1,X1) = X1,
file('/tmp/tmp6e6KJu/sel_KLE021+4.p_4',additive_idempotence) ).
fof(10,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/tmp/tmp6e6KJu/sel_KLE021+4.p_4',order) ).
fof(12,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/tmp/tmp6e6KJu/sel_KLE021+4.p_4',test_3) ).
fof(13,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/tmp/tmp6e6KJu/sel_KLE021+4.p_4',test_2) ).
fof(19,conjecture,
! [X4,X5] :
( test(X5)
=> ( leq(X4,addition(multiplication(X5,X4),multiplication(c(X5),X4)))
& leq(addition(multiplication(X5,X4),multiplication(c(X5),X4)),X4) ) ),
file('/tmp/tmp6e6KJu/sel_KLE021+4.p_4',goals) ).
fof(20,negated_conjecture,
~ ! [X4,X5] :
( test(X5)
=> ( leq(X4,addition(multiplication(X5,X4),multiplication(c(X5),X4)))
& leq(addition(multiplication(X5,X4),multiplication(c(X5),X4)),X4) ) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(24,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(25,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[24]) ).
fof(28,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[4]) ).
cnf(29,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[28]) ).
fof(32,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[6]) ).
cnf(33,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[32]) ).
fof(34,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[7]) ).
cnf(35,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[34]) ).
fof(40,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| addition(X1,X2) = X2 )
& ( addition(X1,X2) != X2
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(41,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| addition(X3,X4) = X4 )
& ( addition(X3,X4) != X4
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[40]) ).
cnf(42,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(47,plain,
! [X4,X5] :
( ~ test(X4)
| ( ( c(X4) != X5
| complement(X4,X5) )
& ( ~ complement(X4,X5)
| c(X4) = X5 ) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(48,plain,
! [X6,X7] :
( ~ test(X6)
| ( ( c(X6) != X7
| complement(X6,X7) )
& ( ~ complement(X6,X7)
| c(X6) = X7 ) ) ),
inference(variable_rename,[status(thm)],[47]) ).
fof(49,plain,
! [X6,X7] :
( ( c(X6) != X7
| complement(X6,X7)
| ~ test(X6) )
& ( ~ complement(X6,X7)
| c(X6) = X7
| ~ test(X6) ) ),
inference(distribute,[status(thm)],[48]) ).
cnf(51,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[49]) ).
fof(52,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)],[13]) ).
fof(53,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)],[52]) ).
fof(54,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)],[53]) ).
cnf(56,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[54]) ).
fof(75,negated_conjecture,
? [X4,X5] :
( test(X5)
& ( ~ leq(X4,addition(multiplication(X5,X4),multiplication(c(X5),X4)))
| ~ leq(addition(multiplication(X5,X4),multiplication(c(X5),X4)),X4) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(76,negated_conjecture,
? [X6,X7] :
( test(X7)
& ( ~ leq(X6,addition(multiplication(X7,X6),multiplication(c(X7),X6)))
| ~ leq(addition(multiplication(X7,X6),multiplication(c(X7),X6)),X6) ) ),
inference(variable_rename,[status(thm)],[75]) ).
fof(77,negated_conjecture,
( test(esk3_0)
& ( ~ leq(esk2_0,addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)))
| ~ leq(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),esk2_0) ) ),
inference(skolemize,[status(esa)],[76]) ).
cnf(78,negated_conjecture,
( ~ leq(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),esk2_0)
| ~ leq(esk2_0,addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0))) ),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(79,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(94,plain,
( addition(X1,X2) = one
| c(X2) != X1
| ~ test(X2) ),
inference(spm,[status(thm)],[56,51,theory(equality)]) ).
cnf(205,negated_conjecture,
( ~ leq(esk2_0,multiplication(addition(esk3_0,c(esk3_0)),esk2_0))
| ~ leq(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),esk2_0) ),
inference(rw,[status(thm)],[78,29,theory(equality)]) ).
cnf(206,negated_conjecture,
( ~ leq(esk2_0,multiplication(addition(esk3_0,c(esk3_0)),esk2_0))
| ~ leq(multiplication(addition(esk3_0,c(esk3_0)),esk2_0),esk2_0) ),
inference(rw,[status(thm)],[205,29,theory(equality)]) ).
cnf(207,negated_conjecture,
( ~ leq(esk2_0,multiplication(addition(esk3_0,c(esk3_0)),esk2_0))
| addition(multiplication(addition(esk3_0,c(esk3_0)),esk2_0),esk2_0) != esk2_0 ),
inference(spm,[status(thm)],[206,42,theory(equality)]) ).
cnf(208,negated_conjecture,
( ~ leq(esk2_0,multiplication(addition(esk3_0,c(esk3_0)),esk2_0))
| addition(esk2_0,multiplication(addition(esk3_0,c(esk3_0)),esk2_0)) != esk2_0 ),
inference(rw,[status(thm)],[207,33,theory(equality)]) ).
cnf(215,negated_conjecture,
( addition(esk2_0,multiplication(addition(esk3_0,c(esk3_0)),esk2_0)) != esk2_0
| addition(esk2_0,multiplication(addition(esk3_0,c(esk3_0)),esk2_0)) != multiplication(addition(esk3_0,c(esk3_0)),esk2_0) ),
inference(spm,[status(thm)],[208,42,theory(equality)]) ).
cnf(495,plain,
( addition(c(X1),X1) = one
| ~ test(X1) ),
inference(er,[status(thm)],[94,theory(equality)]) ).
cnf(500,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[495,33,theory(equality)]) ).
cnf(510,negated_conjecture,
( addition(esk2_0,multiplication(one,esk2_0)) != multiplication(one,esk2_0)
| addition(esk2_0,multiplication(one,esk2_0)) != esk2_0
| ~ test(esk3_0) ),
inference(spm,[status(thm)],[215,500,theory(equality)]) ).
cnf(525,negated_conjecture,
( esk2_0 != multiplication(one,esk2_0)
| addition(esk2_0,multiplication(one,esk2_0)) != esk2_0
| ~ test(esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[510,25,theory(equality)]),35,theory(equality)]) ).
cnf(526,negated_conjecture,
( $false
| addition(esk2_0,multiplication(one,esk2_0)) != esk2_0
| ~ test(esk3_0) ),
inference(rw,[status(thm)],[525,25,theory(equality)]) ).
cnf(527,negated_conjecture,
( $false
| $false
| ~ test(esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[526,25,theory(equality)]),35,theory(equality)]) ).
cnf(528,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[527,79,theory(equality)]) ).
cnf(529,negated_conjecture,
$false,
inference(cn,[status(thm)],[528,theory(equality)]) ).
cnf(530,negated_conjecture,
$false,
529,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE021+4.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/tmp6e6KJu/sel_KLE021+4.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmp6e6KJu/sel_KLE021+4.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/tmp6e6KJu/sel_KLE021+4.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/tmp6e6KJu/sel_KLE021+4.p_4 with time limit 55
% -prover status Theorem
% Problem KLE021+4.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE021+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE021+4.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
%
%------------------------------------------------------------------------------