TSTP Solution File: KLE064+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE064+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:07:39 EST 2010
% Result : Theorem 0.38s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 21 unt; 0 def)
% Number of atoms : 33 ( 31 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 6 ~; 0 |; 3 &)
% ( 0 <=>; 1 =>; 2 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 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 : 43 ( 0 sgn 24 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmpS4bPN1/sel_KLE064+1.p_1',left_distributivity) ).
fof(5,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmpS4bPN1/sel_KLE064+1.p_1',additive_associativity) ).
fof(8,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/tmp/tmpS4bPN1/sel_KLE064+1.p_1',domain1) ).
fof(9,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/tmp/tmpS4bPN1/sel_KLE064+1.p_1',domain5) ).
fof(10,conjecture,
! [X4,X5] :
( addition(X4,multiplication(domain(X5),X4)) = multiplication(domain(X5),X4)
<= addition(domain(X4),domain(X5)) = domain(X5) ),
file('/tmp/tmpS4bPN1/sel_KLE064+1.p_1',goals) ).
fof(11,negated_conjecture,
~ ! [X4,X5] :
( addition(X4,multiplication(domain(X5),X4)) = multiplication(domain(X5),X4)
<= addition(domain(X4),domain(X5)) = domain(X5) ),
inference(assume_negation,[status(cth)],[10]) ).
fof(12,negated_conjecture,
~ ! [X4,X5] :
( addition(domain(X4),domain(X5)) = domain(X5)
=> addition(X4,multiplication(domain(X5),X4)) = multiplication(domain(X5),X4) ),
inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).
fof(13,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[1]) ).
cnf(14,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[13]) ).
fof(21,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[5]) ).
cnf(22,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[21]) ).
fof(27,plain,
! [X5] : addition(X5,multiplication(domain(X5),X5)) = multiplication(domain(X5),X5),
inference(variable_rename,[status(thm)],[8]) ).
cnf(28,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[27]) ).
fof(29,plain,
! [X6,X7] : domain(addition(X6,X7)) = addition(domain(X6),domain(X7)),
inference(variable_rename,[status(thm)],[9]) ).
cnf(30,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[29]) ).
fof(31,negated_conjecture,
? [X4,X5] :
( addition(domain(X4),domain(X5)) = domain(X5)
& addition(X4,multiplication(domain(X5),X4)) != multiplication(domain(X5),X4) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(32,negated_conjecture,
? [X6,X7] :
( addition(domain(X6),domain(X7)) = domain(X7)
& addition(X6,multiplication(domain(X7),X6)) != multiplication(domain(X7),X6) ),
inference(variable_rename,[status(thm)],[31]) ).
fof(33,negated_conjecture,
( addition(domain(esk1_0),domain(esk2_0)) = domain(esk2_0)
& addition(esk1_0,multiplication(domain(esk2_0),esk1_0)) != multiplication(domain(esk2_0),esk1_0) ),
inference(skolemize,[status(esa)],[32]) ).
cnf(34,negated_conjecture,
addition(esk1_0,multiplication(domain(esk2_0),esk1_0)) != multiplication(domain(esk2_0),esk1_0),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(35,negated_conjecture,
addition(domain(esk1_0),domain(esk2_0)) = domain(esk2_0),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(43,negated_conjecture,
domain(addition(esk1_0,esk2_0)) = domain(esk2_0),
inference(rw,[status(thm)],[35,30,theory(equality)]) ).
cnf(58,plain,
addition(multiplication(domain(X1),X1),X2) = addition(X1,addition(multiplication(domain(X1),X1),X2)),
inference(spm,[status(thm)],[22,28,theory(equality)]) ).
cnf(2076,plain,
addition(X1,multiplication(addition(domain(X1),X2),X1)) = multiplication(addition(domain(X1),X2),X1),
inference(spm,[status(thm)],[58,14,theory(equality)]) ).
cnf(3785,plain,
addition(X1,multiplication(domain(addition(X1,X2)),X1)) = multiplication(domain(addition(X1,X2)),X1),
inference(spm,[status(thm)],[2076,30,theory(equality)]) ).
cnf(4617,negated_conjecture,
addition(esk1_0,multiplication(domain(esk2_0),esk1_0)) = multiplication(domain(esk2_0),esk1_0),
inference(spm,[status(thm)],[3785,43,theory(equality)]) ).
cnf(4706,negated_conjecture,
$false,
inference(sr,[status(thm)],[4617,34,theory(equality)]) ).
cnf(4707,negated_conjecture,
$false,
4706,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE064+1.p
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmpS4bPN1/sel_KLE064+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE064+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE064+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE064+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
%
%------------------------------------------------------------------------------