%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE093+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 12:14:30 EST 2010
% Result : Theorem 0.33s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 50 ( 46 unt; 0 def)
% Number of atoms : 58 ( 46 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 5 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 4 sgn 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpjHDnqv/sel_KLE093+1.p_1',multiplicative_right_identity) ).
fof(3,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpjHDnqv/sel_KLE093+1.p_1',multiplicative_left_identity) ).
fof(4,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmpjHDnqv/sel_KLE093+1.p_1',left_distributivity) ).
fof(5,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpjHDnqv/sel_KLE093+1.p_1',additive_commutativity) ).
fof(8,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/tmp/tmpjHDnqv/sel_KLE093+1.p_1',order) ).
fof(10,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmpjHDnqv/sel_KLE093+1.p_1',additive_associativity) ).
fof(11,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/tmp/tmpjHDnqv/sel_KLE093+1.p_1',star_unfold_right) ).
fof(12,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/tmp/tmpjHDnqv/sel_KLE093+1.p_1',domain3) ).
fof(14,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/tmp/tmpjHDnqv/sel_KLE093+1.p_1',domain1) ).
fof(17,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/tmp/tmpjHDnqv/sel_KLE093+1.p_1',domain5) ).
fof(18,conjecture,
! [X4] : domain(star(X4)) = one,
file('/tmp/tmpjHDnqv/sel_KLE093+1.p_1',goals) ).
fof(19,negated_conjecture,
~ ! [X4] : domain(star(X4)) = one,
inference(assume_negation,[status(cth)],[18]) ).
fof(20,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[1]) ).
cnf(21,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[20]) ).
fof(24,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[3]) ).
cnf(25,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[24]) ).
fof(26,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[4]) ).
cnf(27,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[26]) ).
fof(28,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[5]) ).
cnf(29,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[28]) ).
fof(35,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| addition(X1,X2) = X2 )
& ( addition(X1,X2) != X2
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(36,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| addition(X3,X4) = X4 )
& ( addition(X3,X4) != X4
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[35]) ).
cnf(38,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[36]) ).
fof(41,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[10]) ).
cnf(42,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[41]) ).
fof(43,plain,
! [X2] : leq(addition(one,multiplication(X2,star(X2))),star(X2)),
inference(variable_rename,[status(thm)],[11]) ).
cnf(44,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[43]) ).
fof(45,plain,
! [X5] : addition(domain(X5),one) = one,
inference(variable_rename,[status(thm)],[12]) ).
cnf(46,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[45]) ).
fof(49,plain,
! [X5] : addition(X5,multiplication(domain(X5),X5)) = multiplication(domain(X5),X5),
inference(variable_rename,[status(thm)],[14]) ).
cnf(50,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[49]) ).
fof(56,plain,
! [X6,X7] : domain(addition(X6,X7)) = addition(domain(X6),domain(X7)),
inference(variable_rename,[status(thm)],[17]) ).
cnf(57,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[56]) ).
fof(58,negated_conjecture,
? [X4] : domain(star(X4)) != one,
inference(fof_nnf,[status(thm)],[19]) ).
fof(59,negated_conjecture,
? [X5] : domain(star(X5)) != one,
inference(variable_rename,[status(thm)],[58]) ).
fof(60,negated_conjecture,
domain(star(esk1_0)) != one,
inference(skolemize,[status(esa)],[59]) ).
cnf(61,negated_conjecture,
domain(star(esk1_0)) != one,
inference(split_conjunct,[status(thm)],[60]) ).
cnf(68,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[46,29,theory(equality)]) ).
cnf(110,plain,
addition(one,domain(one)) = domain(one),
inference(spm,[status(thm)],[50,21,theory(equality)]) ).
cnf(140,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[27,25,theory(equality)]) ).
cnf(162,plain,
addition(addition(one,multiplication(X1,star(X1))),star(X1)) = star(X1),
inference(spm,[status(thm)],[38,44,theory(equality)]) ).
cnf(163,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[162,42,theory(equality)]),29,theory(equality)]) ).
cnf(219,plain,
one = domain(one),
inference(rw,[status(thm)],[110,68,theory(equality)]) ).
cnf(222,plain,
addition(one,domain(X1)) = domain(addition(one,X1)),
inference(spm,[status(thm)],[57,219,theory(equality)]) ).
cnf(231,plain,
one = domain(addition(one,X1)),
inference(rw,[status(thm)],[222,68,theory(equality)]) ).
cnf(6850,plain,
addition(one,multiplication(addition(one,X1),star(X1))) = star(X1),
inference(rw,[status(thm)],[163,140,theory(equality)]) ).
cnf(6853,plain,
domain(star(X1)) = one,
inference(spm,[status(thm)],[231,6850,theory(equality)]) ).
cnf(7034,negated_conjecture,
$false,
inference(rw,[status(thm)],[61,6853,theory(equality)]) ).
cnf(7035,negated_conjecture,
$false,
inference(cn,[status(thm)],[7034,theory(equality)]) ).
cnf(7036,negated_conjecture,
$false,
7035,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE093+1.p
% --creating new selector for [KLE002+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmpjHDnqv/sel_KLE093+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE093+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE093+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE093+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
%
%------------------------------------------------------------------------------