%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE004+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:22 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 21 unt; 0 def)
% Number of atoms : 125 ( 64 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 136 ( 58 ~; 56 |; 18 &)
% ( 3 <=>; 1 =>; 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 62 ( 6 sgn 35 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/tmp/tmpdjzaqx/sel_KLE004+1.p_1',right_annihilation) ).
fof(3,axiom,
! [X1] : addition(X1,zero) = X1,
file('/tmp/tmpdjzaqx/sel_KLE004+1.p_1',additive_identity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpdjzaqx/sel_KLE004+1.p_1',additive_commutativity) ).
fof(9,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/tmp/tmpdjzaqx/sel_KLE004+1.p_1',left_annihilation) ).
fof(11,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/tmp/tmpdjzaqx/sel_KLE004+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/tmpdjzaqx/sel_KLE004+1.p_1',test_2) ).
fof(13,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/tmp/tmpdjzaqx/sel_KLE004+1.p_1',test_1) ).
fof(16,conjecture,
c(zero) = one,
file('/tmp/tmpdjzaqx/sel_KLE004+1.p_1',goals) ).
fof(17,negated_conjecture,
c(zero) != one,
inference(assume_negation,[status(cth)],[16]) ).
fof(19,negated_conjecture,
c(zero) != one,
inference(fof_simplification,[status(thm)],[17,theory(equality)]) ).
fof(20,plain,
! [X2] : multiplication(X2,zero) = zero,
inference(variable_rename,[status(thm)],[1]) ).
cnf(21,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[20]) ).
fof(24,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[3]) ).
cnf(25,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[24]) ).
fof(30,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[6]) ).
cnf(31,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[30]) ).
fof(36,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[9]) ).
cnf(37,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[36]) ).
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(49,plain,
( complement(X1,X2)
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(50,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[48]) ).
fof(53,plain,
! [X4] :
( ( ~ test(X4)
| ? [X5] : complement(X5,X4) )
& ( ! [X5] : ~ complement(X5,X4)
| test(X4) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(54,plain,
! [X6] :
( ( ~ test(X6)
| ? [X7] : complement(X7,X6) )
& ( ! [X8] : ~ complement(X8,X6)
| test(X6) ) ),
inference(variable_rename,[status(thm)],[53]) ).
fof(55,plain,
! [X6] :
( ( ~ test(X6)
| complement(esk1_1(X6),X6) )
& ( ! [X8] : ~ complement(X8,X6)
| test(X6) ) ),
inference(skolemize,[status(esa)],[54]) ).
fof(56,plain,
! [X6,X8] :
( ( ~ complement(X8,X6)
| test(X6) )
& ( ~ test(X6)
| complement(esk1_1(X6),X6) ) ),
inference(shift_quantors,[status(thm)],[55]) ).
cnf(58,plain,
( test(X1)
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[56]) ).
cnf(63,negated_conjecture,
c(zero) != one,
inference(split_conjunct,[status(thm)],[19]) ).
cnf(65,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[25,31,theory(equality)]) ).
cnf(75,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[45,theory(equality)]) ).
cnf(172,plain,
( test(X1)
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one ),
inference(spm,[status(thm)],[58,49,theory(equality)]) ).
cnf(188,plain,
( addition(c(X1),X1) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[50,75,theory(equality)]) ).
cnf(189,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[188,31,theory(equality)]) ).
cnf(279,plain,
( one = c(zero)
| ~ test(zero) ),
inference(spm,[status(thm)],[65,189,theory(equality)]) ).
cnf(282,plain,
~ test(zero),
inference(sr,[status(thm)],[279,63,theory(equality)]) ).
cnf(2205,plain,
( test(zero)
| multiplication(zero,X1) != zero
| multiplication(X1,zero) != zero
| X1 != one ),
inference(spm,[status(thm)],[172,65,theory(equality)]) ).
cnf(2231,plain,
( test(zero)
| $false
| multiplication(X1,zero) != zero
| X1 != one ),
inference(rw,[status(thm)],[2205,37,theory(equality)]) ).
cnf(2232,plain,
( test(zero)
| $false
| $false
| X1 != one ),
inference(rw,[status(thm)],[2231,21,theory(equality)]) ).
cnf(2233,plain,
( test(zero)
| X1 != one ),
inference(cn,[status(thm)],[2232,theory(equality)]) ).
cnf(2234,plain,
X1 != one,
inference(sr,[status(thm)],[2233,282,theory(equality)]) ).
cnf(2251,plain,
$false,
inference(er,[status(thm)],[2234,theory(equality)]) ).
cnf(2252,plain,
$false,
2251,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE004+1.p
% --creating new selector for [KLE001+0.ax, KLE001+1.ax]
% -running prover on /tmp/tmpdjzaqx/sel_KLE004+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE004+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE004+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE004+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
%
%------------------------------------------------------------------------------