TSTP Solution File: KLE085+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE085+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:13:23 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 30 unt; 0 def)
% Number of atoms : 30 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 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 : 33 ( 2 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpjeIPNN/sel_KLE085+1.p_1',additive_commutativity) ).
fof(6,axiom,
! [X1] : addition(X1,X1) = X1,
file('/tmp/tmpjeIPNN/sel_KLE085+1.p_1',additive_idempotence) ).
fof(11,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmpjeIPNN/sel_KLE085+1.p_1',additive_associativity) ).
fof(13,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/tmp/tmpjeIPNN/sel_KLE085+1.p_1',domain3) ).
fof(18,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/tmp/tmpjeIPNN/sel_KLE085+1.p_1',domain4) ).
fof(19,conjecture,
! [X4] : addition(domain(X4),one) = one,
file('/tmp/tmpjeIPNN/sel_KLE085+1.p_1',goals) ).
fof(20,negated_conjecture,
~ ! [X4] : addition(domain(X4),one) = one,
inference(assume_negation,[status(cth)],[19]) ).
fof(29,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[5]) ).
cnf(30,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[29]) ).
fof(31,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[6]) ).
cnf(32,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[31]) ).
fof(41,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[11]) ).
cnf(42,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[41]) ).
fof(45,plain,
! [X5] : addition(antidomain(antidomain(X5)),antidomain(X5)) = one,
inference(variable_rename,[status(thm)],[13]) ).
cnf(46,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[45]) ).
fof(55,plain,
! [X5] : domain(X5) = antidomain(antidomain(X5)),
inference(variable_rename,[status(thm)],[18]) ).
cnf(56,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[55]) ).
fof(57,negated_conjecture,
? [X4] : addition(domain(X4),one) != one,
inference(fof_nnf,[status(thm)],[20]) ).
fof(58,negated_conjecture,
? [X5] : addition(domain(X5),one) != one,
inference(variable_rename,[status(thm)],[57]) ).
fof(59,negated_conjecture,
addition(domain(esk1_0),one) != one,
inference(skolemize,[status(esa)],[58]) ).
cnf(60,negated_conjecture,
addition(domain(esk1_0),one) != one,
inference(split_conjunct,[status(thm)],[59]) ).
cnf(61,negated_conjecture,
addition(antidomain(antidomain(esk1_0)),one) != one,
inference(rw,[status(thm)],[60,56,theory(equality)]),
[unfolding] ).
cnf(68,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[46,30,theory(equality)]) ).
cnf(71,negated_conjecture,
addition(one,antidomain(antidomain(esk1_0))) != one,
inference(rw,[status(thm)],[61,30,theory(equality)]) ).
cnf(74,plain,
addition(X1,X2) = addition(X1,addition(X1,X2)),
inference(spm,[status(thm)],[42,32,theory(equality)]) ).
cnf(340,plain,
addition(antidomain(X1),one) = one,
inference(spm,[status(thm)],[74,68,theory(equality)]) ).
cnf(361,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[340,30,theory(equality)]) ).
cnf(374,negated_conjecture,
$false,
inference(rw,[status(thm)],[71,361,theory(equality)]) ).
cnf(375,negated_conjecture,
$false,
inference(cn,[status(thm)],[374,theory(equality)]) ).
cnf(376,negated_conjecture,
$false,
375,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE085+1.p
% --creating new selector for [KLE001+0.ax, KLE001+4.ax]
% -running prover on /tmp/tmpjeIPNN/sel_KLE085+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE085+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE085+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE085+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
%
%------------------------------------------------------------------------------