TSTP Solution File: KLE055+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE055+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:06:06 EST 2010
% Result : Theorem 0.31s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 28 unt; 0 def)
% Number of atoms : 38 ( 36 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 5 ~; 0 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 22 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpvGOJaV/sel_KLE055+1.p_1',additive_commutativity) ).
fof(6,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmpvGOJaV/sel_KLE055+1.p_1',additive_associativity) ).
fof(7,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpvGOJaV/sel_KLE055+1.p_1',multiplicative_right_identity) ).
fof(10,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/tmp/tmpvGOJaV/sel_KLE055+1.p_1',domain1) ).
fof(11,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmpvGOJaV/sel_KLE055+1.p_1',right_distributivity) ).
fof(13,conjecture,
! [X4] :
( addition(X4,one) = one
=> addition(X4,domain(X4)) = domain(X4) ),
file('/tmp/tmpvGOJaV/sel_KLE055+1.p_1',goals) ).
fof(14,negated_conjecture,
~ ! [X4] :
( addition(X4,one) = one
=> addition(X4,domain(X4)) = domain(X4) ),
inference(assume_negation,[status(cth)],[13]) ).
fof(19,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[3]) ).
cnf(20,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[19]) ).
fof(25,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[6]) ).
cnf(26,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[25]) ).
fof(27,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[7]) ).
cnf(28,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[27]) ).
fof(33,plain,
! [X5] : addition(X5,multiplication(domain(X5),X5)) = multiplication(domain(X5),X5),
inference(variable_rename,[status(thm)],[10]) ).
cnf(34,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[33]) ).
fof(35,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[11]) ).
cnf(36,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[35]) ).
fof(39,negated_conjecture,
? [X4] :
( addition(X4,one) = one
& addition(X4,domain(X4)) != domain(X4) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(40,negated_conjecture,
? [X5] :
( addition(X5,one) = one
& addition(X5,domain(X5)) != domain(X5) ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,negated_conjecture,
( addition(esk1_0,one) = one
& addition(esk1_0,domain(esk1_0)) != domain(esk1_0) ),
inference(skolemize,[status(esa)],[40]) ).
cnf(42,negated_conjecture,
addition(esk1_0,domain(esk1_0)) != domain(esk1_0),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(43,negated_conjecture,
addition(esk1_0,one) = one,
inference(split_conjunct,[status(thm)],[41]) ).
cnf(47,negated_conjecture,
addition(one,esk1_0) = one,
inference(rw,[status(thm)],[43,20,theory(equality)]) ).
cnf(71,plain,
addition(addition(X2,X1),X3) = addition(X1,addition(X2,X3)),
inference(spm,[status(thm)],[26,20,theory(equality)]) ).
cnf(75,plain,
addition(X2,addition(X1,X3)) = addition(X1,addition(X2,X3)),
inference(rw,[status(thm)],[71,26,theory(equality)]) ).
cnf(91,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
inference(spm,[status(thm)],[36,28,theory(equality)]) ).
cnf(2143,negated_conjecture,
addition(X1,multiplication(X1,esk1_0)) = multiplication(X1,one),
inference(spm,[status(thm)],[91,47,theory(equality)]) ).
cnf(2191,negated_conjecture,
addition(X1,multiplication(X1,esk1_0)) = X1,
inference(rw,[status(thm)],[2143,28,theory(equality)]) ).
cnf(2313,negated_conjecture,
addition(X1,X2) = addition(X2,addition(X1,multiplication(X2,esk1_0))),
inference(spm,[status(thm)],[75,2191,theory(equality)]) ).
cnf(3834,negated_conjecture,
addition(domain(esk1_0),multiplication(domain(esk1_0),esk1_0)) = addition(esk1_0,domain(esk1_0)),
inference(spm,[status(thm)],[2313,34,theory(equality)]) ).
cnf(3887,negated_conjecture,
domain(esk1_0) = addition(esk1_0,domain(esk1_0)),
inference(rw,[status(thm)],[3834,2191,theory(equality)]) ).
cnf(3888,negated_conjecture,
$false,
inference(sr,[status(thm)],[3887,42,theory(equality)]) ).
cnf(3889,negated_conjecture,
$false,
3888,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE055+1.p
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmpvGOJaV/sel_KLE055+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE055+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE055+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE055+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
%
%------------------------------------------------------------------------------