TSTP Solution File: KLE021+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE021+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:34 EST 2010
% Result : Theorem 183.71s
% Output : CNFRefutation 183.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 14 unt; 0 def)
% Number of atoms : 91 ( 51 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 96 ( 40 ~; 34 |; 17 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 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/tmp340n1e/sel_KLE021+3.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/tmp340n1e/sel_KLE021+3.p_4',left_distributivity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmp340n1e/sel_KLE021+3.p_4',additive_commutativity) ).
fof(11,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/tmp/tmp340n1e/sel_KLE021+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/tmp340n1e/sel_KLE021+3.p_4',test_2) ).
fof(18,conjecture,
! [X4,X5] :
( test(X5)
=> X4 = addition(multiplication(X5,X4),multiplication(c(X5),X4)) ),
file('/tmp/tmp340n1e/sel_KLE021+3.p_4',goals) ).
fof(19,negated_conjecture,
~ ! [X4,X5] :
( test(X5)
=> X4 = addition(multiplication(X5,X4),multiplication(c(X5),X4)) ),
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(27,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[4]) ).
cnf(28,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[27]) ).
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(70,negated_conjecture,
? [X4,X5] :
( test(X5)
& X4 != addition(multiplication(X5,X4),multiplication(c(X5),X4)) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(71,negated_conjecture,
? [X6,X7] :
( test(X7)
& X6 != addition(multiplication(X7,X6),multiplication(c(X7),X6)) ),
inference(variable_rename,[status(thm)],[70]) ).
fof(72,negated_conjecture,
( test(esk3_0)
& esk2_0 != addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)) ),
inference(skolemize,[status(esa)],[71]) ).
cnf(73,negated_conjecture,
esk2_0 != addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(74,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(90,plain,
( addition(X1,X2) = one
| c(X2) != X1
| ~ test(X2) ),
inference(spm,[status(thm)],[51,46,theory(equality)]) ).
cnf(188,negated_conjecture,
multiplication(addition(esk3_0,c(esk3_0)),esk2_0) != esk2_0,
inference(rw,[status(thm)],[73,28,theory(equality)]) ).
cnf(582,plain,
( addition(c(X1),X1) = one
| ~ test(X1) ),
inference(er,[status(thm)],[90,theory(equality)]) ).
cnf(590,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[582,32,theory(equality)]) ).
cnf(599,negated_conjecture,
( multiplication(one,esk2_0) != esk2_0
| ~ test(esk3_0) ),
inference(spm,[status(thm)],[188,590,theory(equality)]) ).
cnf(610,negated_conjecture,
( $false
| ~ test(esk3_0) ),
inference(rw,[status(thm)],[599,24,theory(equality)]) ).
cnf(611,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[610,74,theory(equality)]) ).
cnf(612,negated_conjecture,
$false,
inference(cn,[status(thm)],[611,theory(equality)]) ).
cnf(613,negated_conjecture,
$false,
612,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE021+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/tmp340n1e/sel_KLE021+3.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmp340n1e/sel_KLE021+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/tmp340n1e/sel_KLE021+3.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+1.ax, KLE001+2.ax]
% -running prover on /tmp/tmp340n1e/sel_KLE021+3.p_4 with time limit 55
% -prover status Theorem
% Problem KLE021+3.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE021+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE021+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
%
%------------------------------------------------------------------------------