TSTP Solution File: KLE005+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE005+1 : 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:37:36 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 83 ( 46 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 88 ( 35 ~; 34 |; 14 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
! [X4] :
( ~ test(X4)
=> c(X4) = zero ),
file('/tmp/tmpRNqPDj/sel_KLE005+1.p_1',test_4) ).
fof(11,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/tmp/tmpRNqPDj/sel_KLE005+1.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/tmpRNqPDj/sel_KLE005+1.p_1',test_2) ).
fof(14,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpRNqPDj/sel_KLE005+1.p_1',multiplicative_right_identity) ).
fof(16,conjecture,
c(one) = zero,
file('/tmp/tmpRNqPDj/sel_KLE005+1.p_1',goals) ).
fof(17,negated_conjecture,
c(one) != zero,
inference(assume_negation,[status(cth)],[16]) ).
fof(18,plain,
! [X4] :
( ~ test(X4)
=> c(X4) = zero ),
inference(fof_simplification,[status(thm)],[10,theory(equality)]) ).
fof(19,negated_conjecture,
c(one) != zero,
inference(fof_simplification,[status(thm)],[17,theory(equality)]) ).
fof(38,plain,
! [X4] :
( test(X4)
| c(X4) = zero ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(39,plain,
! [X5] :
( test(X5)
| c(X5) = zero ),
inference(variable_rename,[status(thm)],[38]) ).
cnf(40,plain,
( c(X1) = zero
| test(X1) ),
inference(split_conjunct,[status(thm)],[39]) ).
fof(41,plain,
! [X4,X5] :
( ~ test(X4)
| ( ( c(X4) != X5
| complement(X4,X5) )
& ( ~ complement(X4,X5)
| c(X4) = X5 ) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(42,plain,
! [X6,X7] :
( ~ test(X6)
| ( ( c(X6) != X7
| complement(X6,X7) )
& ( ~ complement(X6,X7)
| c(X6) = X7 ) ) ),
inference(variable_rename,[status(thm)],[41]) ).
fof(43,plain,
! [X6,X7] :
( ( c(X6) != X7
| complement(X6,X7)
| ~ test(X6) )
& ( ~ complement(X6,X7)
| c(X6) = X7
| ~ test(X6) ) ),
inference(distribute,[status(thm)],[42]) ).
cnf(45,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[43]) ).
fof(46,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(47,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)],[46]) ).
fof(48,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)],[47]) ).
cnf(52,plain,
( multiplication(X2,X1) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[48]) ).
fof(59,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[14]) ).
cnf(60,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[59]) ).
cnf(63,negated_conjecture,
c(one) != zero,
inference(split_conjunct,[status(thm)],[19]) ).
cnf(64,negated_conjecture,
test(one),
inference(spm,[status(thm)],[63,40,theory(equality)]) ).
cnf(75,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[45,theory(equality)]) ).
cnf(186,plain,
( multiplication(c(X1),X1) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[52,75,theory(equality)]) ).
cnf(227,plain,
( zero = c(one)
| ~ test(one) ),
inference(spm,[status(thm)],[60,186,theory(equality)]) ).
cnf(235,plain,
( zero = c(one)
| $false ),
inference(rw,[status(thm)],[227,64,theory(equality)]) ).
cnf(236,plain,
zero = c(one),
inference(cn,[status(thm)],[235,theory(equality)]) ).
cnf(237,plain,
$false,
inference(sr,[status(thm)],[236,63,theory(equality)]) ).
cnf(238,plain,
$false,
237,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE005+1.p
% --creating new selector for [KLE001+0.ax, KLE001+1.ax]
% -running prover on /tmp/tmpRNqPDj/sel_KLE005+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE005+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE005+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE005+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
%
%------------------------------------------------------------------------------