TSTP Solution File: KLE114+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE114+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:22:24 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 50 ( 50 unt; 0 def)
% Number of atoms : 50 ( 47 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 8 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 1 sgn 28 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/tmp/tmpggAiYM/sel_KLE114+1.p_1',right_annihilation) ).
fof(4,axiom,
! [X1] : addition(X1,zero) = X1,
file('/tmp/tmpggAiYM/sel_KLE114+1.p_1',additive_identity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpggAiYM/sel_KLE114+1.p_1',additive_commutativity) ).
fof(7,axiom,
! [X4] : c(X4) = antidomain(domain(X4)),
file('/tmp/tmpggAiYM/sel_KLE114+1.p_1',complement) ).
fof(12,axiom,
! [X4,X5] : forward_diamond(X4,X5) = domain(multiplication(X4,domain(X5))),
file('/tmp/tmpggAiYM/sel_KLE114+1.p_1',forward_diamond) ).
fof(13,axiom,
! [X4,X5] : forward_box(X4,X5) = c(forward_diamond(X4,c(X5))),
file('/tmp/tmpggAiYM/sel_KLE114+1.p_1',forward_box) ).
fof(15,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpggAiYM/sel_KLE114+1.p_1',multiplicative_right_identity) ).
fof(16,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/tmp/tmpggAiYM/sel_KLE114+1.p_1',domain3) ).
fof(20,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/tmp/tmpggAiYM/sel_KLE114+1.p_1',domain1) ).
fof(21,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/tmp/tmpggAiYM/sel_KLE114+1.p_1',domain4) ).
fof(22,conjecture,
! [X4] : forward_box(X4,one) = one,
file('/tmp/tmpggAiYM/sel_KLE114+1.p_1',goals) ).
fof(23,negated_conjecture,
~ ! [X4] : forward_box(X4,one) = one,
inference(assume_negation,[status(cth)],[22]) ).
fof(26,plain,
! [X2] : multiplication(X2,zero) = zero,
inference(variable_rename,[status(thm)],[2]) ).
cnf(27,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[26]) ).
fof(30,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[4]) ).
cnf(31,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[30]) ).
fof(34,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[6]) ).
cnf(35,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[34]) ).
fof(36,plain,
! [X5] : c(X5) = antidomain(domain(X5)),
inference(variable_rename,[status(thm)],[7]) ).
cnf(37,plain,
c(X1) = antidomain(domain(X1)),
inference(split_conjunct,[status(thm)],[36]) ).
fof(46,plain,
! [X6,X7] : forward_diamond(X6,X7) = domain(multiplication(X6,domain(X7))),
inference(variable_rename,[status(thm)],[12]) ).
cnf(47,plain,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[46]) ).
fof(48,plain,
! [X6,X7] : forward_box(X6,X7) = c(forward_diamond(X6,c(X7))),
inference(variable_rename,[status(thm)],[13]) ).
cnf(49,plain,
forward_box(X1,X2) = c(forward_diamond(X1,c(X2))),
inference(split_conjunct,[status(thm)],[48]) ).
fof(52,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[15]) ).
cnf(53,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[52]) ).
fof(54,plain,
! [X5] : addition(antidomain(antidomain(X5)),antidomain(X5)) = one,
inference(variable_rename,[status(thm)],[16]) ).
cnf(55,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[54]) ).
fof(62,plain,
! [X5] : multiplication(antidomain(X5),X5) = zero,
inference(variable_rename,[status(thm)],[20]) ).
cnf(63,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[62]) ).
fof(64,plain,
! [X5] : domain(X5) = antidomain(antidomain(X5)),
inference(variable_rename,[status(thm)],[21]) ).
cnf(65,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[64]) ).
fof(66,negated_conjecture,
? [X4] : forward_box(X4,one) != one,
inference(fof_nnf,[status(thm)],[23]) ).
fof(67,negated_conjecture,
? [X5] : forward_box(X5,one) != one,
inference(variable_rename,[status(thm)],[66]) ).
fof(68,negated_conjecture,
forward_box(esk1_0,one) != one,
inference(skolemize,[status(esa)],[67]) ).
cnf(69,negated_conjecture,
forward_box(esk1_0,one) != one,
inference(split_conjunct,[status(thm)],[68]) ).
cnf(70,plain,
antidomain(domain(forward_diamond(X1,antidomain(domain(X2))))) = forward_box(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[49,37,theory(equality)]),37,theory(equality)]),
[unfolding] ).
cnf(71,plain,
antidomain(antidomain(antidomain(forward_diamond(X1,antidomain(antidomain(antidomain(X2))))))) = forward_box(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[70,65,theory(equality)]),65,theory(equality)]),
[unfolding] ).
cnf(72,plain,
antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2))))) = forward_diamond(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[47,65,theory(equality)]),65,theory(equality)]),
[unfolding] ).
cnf(73,negated_conjecture,
antidomain(antidomain(antidomain(forward_diamond(esk1_0,antidomain(antidomain(antidomain(one))))))) != one,
inference(rw,[status(thm)],[69,71,theory(equality)]),
[unfolding] ).
cnf(74,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(antidomain(one))))))))))) != one,
inference(rw,[status(thm)],[73,72,theory(equality)]),
[unfolding] ).
cnf(75,plain,
zero = antidomain(one),
inference(spm,[status(thm)],[53,63,theory(equality)]) ).
cnf(79,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[31,35,theory(equality)]) ).
cnf(83,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[55,35,theory(equality)]) ).
cnf(239,plain,
addition(zero,antidomain(zero)) = one,
inference(spm,[status(thm)],[83,75,theory(equality)]) ).
cnf(241,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(zero)))))))))) != one,
inference(rw,[status(thm)],[74,75,theory(equality)]) ).
cnf(256,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[239,79,theory(equality)]) ).
cnf(260,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[241,256,theory(equality)]),75,theory(equality)]),256,theory(equality)]),75,theory(equality)]),27,theory(equality)]),256,theory(equality)]),75,theory(equality)]),256,theory(equality)]),75,theory(equality)]),256,theory(equality)]) ).
cnf(261,negated_conjecture,
$false,
inference(cn,[status(thm)],[260,theory(equality)]) ).
cnf(262,negated_conjecture,
$false,
261,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE114+1.p
% --creating new selector for [KLE001+0.ax, KLE001+4.ax, KLE001+6.ax]
% -running prover on /tmp/tmpggAiYM/sel_KLE114+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE114+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE114+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE114+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
%
%------------------------------------------------------------------------------