TSTP Solution File: KLE113+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE113+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:21:59 EST 2010
% Result : Theorem 184.75s
% Output : CNFRefutation 184.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 40 unt; 0 def)
% Number of atoms : 40 ( 37 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 1 sgn 22 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/tmp/tmp6m7Fle/sel_KLE113+1.p_4',right_annihilation) ).
fof(4,axiom,
! [X1] : addition(X1,zero) = X1,
file('/tmp/tmp6m7Fle/sel_KLE113+1.p_4',additive_identity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmp6m7Fle/sel_KLE113+1.p_4',additive_commutativity) ).
fof(12,axiom,
! [X4,X5] : forward_diamond(X4,X5) = domain(multiplication(X4,domain(X5))),
file('/tmp/tmp6m7Fle/sel_KLE113+1.p_4',forward_diamond) ).
fof(14,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmp6m7Fle/sel_KLE113+1.p_4',multiplicative_right_identity) ).
fof(15,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/tmp/tmp6m7Fle/sel_KLE113+1.p_4',domain3) ).
fof(19,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/tmp/tmp6m7Fle/sel_KLE113+1.p_4',domain1) ).
fof(20,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/tmp/tmp6m7Fle/sel_KLE113+1.p_4',domain4) ).
fof(21,conjecture,
! [X4] : forward_diamond(X4,zero) = zero,
file('/tmp/tmp6m7Fle/sel_KLE113+1.p_4',goals) ).
fof(22,negated_conjecture,
~ ! [X4] : forward_diamond(X4,zero) = zero,
inference(assume_negation,[status(cth)],[21]) ).
fof(25,plain,
! [X2] : multiplication(X2,zero) = zero,
inference(variable_rename,[status(thm)],[2]) ).
cnf(26,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[25]) ).
fof(29,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[4]) ).
cnf(30,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[29]) ).
fof(33,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[6]) ).
cnf(34,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[33]) ).
fof(45,plain,
! [X6,X7] : forward_diamond(X6,X7) = domain(multiplication(X6,domain(X7))),
inference(variable_rename,[status(thm)],[12]) ).
cnf(46,plain,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[45]) ).
fof(49,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[14]) ).
cnf(50,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[49]) ).
fof(51,plain,
! [X5] : addition(antidomain(antidomain(X5)),antidomain(X5)) = one,
inference(variable_rename,[status(thm)],[15]) ).
cnf(52,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[51]) ).
fof(59,plain,
! [X5] : multiplication(antidomain(X5),X5) = zero,
inference(variable_rename,[status(thm)],[19]) ).
cnf(60,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[59]) ).
fof(61,plain,
! [X5] : domain(X5) = antidomain(antidomain(X5)),
inference(variable_rename,[status(thm)],[20]) ).
cnf(62,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[61]) ).
fof(63,negated_conjecture,
? [X4] : forward_diamond(X4,zero) != zero,
inference(fof_nnf,[status(thm)],[22]) ).
fof(64,negated_conjecture,
? [X5] : forward_diamond(X5,zero) != zero,
inference(variable_rename,[status(thm)],[63]) ).
fof(65,negated_conjecture,
forward_diamond(esk1_0,zero) != zero,
inference(skolemize,[status(esa)],[64]) ).
cnf(66,negated_conjecture,
forward_diamond(esk1_0,zero) != zero,
inference(split_conjunct,[status(thm)],[65]) ).
cnf(67,plain,
antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2))))) = forward_diamond(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[46,62,theory(equality)]),62,theory(equality)]),
[unfolding] ).
cnf(68,negated_conjecture,
antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(zero))))) != zero,
inference(rw,[status(thm)],[66,67,theory(equality)]),
[unfolding] ).
cnf(69,plain,
zero = antidomain(one),
inference(spm,[status(thm)],[50,60,theory(equality)]) ).
cnf(71,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[30,34,theory(equality)]) ).
cnf(77,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[52,34,theory(equality)]) ).
cnf(233,plain,
addition(zero,antidomain(zero)) = one,
inference(spm,[status(thm)],[77,69,theory(equality)]) ).
cnf(249,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[233,71,theory(equality)]) ).
cnf(253,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[68,249,theory(equality)]),69,theory(equality)]),26,theory(equality)]),249,theory(equality)]),69,theory(equality)]) ).
cnf(254,negated_conjecture,
$false,
inference(cn,[status(thm)],[253,theory(equality)]) ).
cnf(255,negated_conjecture,
$false,
254,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE113+1.p
% --creating new selector for [KLE001+0.ax, KLE001+4.ax, KLE001+6.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmp6m7Fle/sel_KLE113+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmp6m7Fle/sel_KLE113+1.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+4.ax, KLE001+6.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmp6m7Fle/sel_KLE113+1.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+4.ax, KLE001+6.ax]
% -running prover on /tmp/tmp6m7Fle/sel_KLE113+1.p_4 with time limit 55
% -prover status Theorem
% Problem KLE113+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE113+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE113+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
%
%------------------------------------------------------------------------------