TSTP Solution File: KLE067+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE067+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:08:10 EST 2010
% Result : Theorem 240.80s
% Output : CNFRefutation 240.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 22 unt; 0 def)
% Number of atoms : 22 ( 19 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(11,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/tmp/tmpDU0KDT/sel_KLE067+1.p_5',domain2) ).
fof(13,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpDU0KDT/sel_KLE067+1.p_5',multiplicative_left_identity) ).
fof(15,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/tmp/tmpDU0KDT/sel_KLE067+1.p_5',domain5) ).
fof(17,conjecture,
! [X4,X5] : domain(addition(domain(X4),domain(X5))) = addition(domain(X4),domain(X5)),
file('/tmp/tmpDU0KDT/sel_KLE067+1.p_5',goals) ).
fof(18,negated_conjecture,
~ ! [X4,X5] : domain(addition(domain(X4),domain(X5))) = addition(domain(X4),domain(X5)),
inference(assume_negation,[status(cth)],[17]) ).
fof(39,plain,
! [X6,X7] : domain(multiplication(X6,X7)) = domain(multiplication(X6,domain(X7))),
inference(variable_rename,[status(thm)],[11]) ).
cnf(40,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[39]) ).
fof(43,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[13]) ).
cnf(44,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[43]) ).
fof(47,plain,
! [X6,X7] : domain(addition(X6,X7)) = addition(domain(X6),domain(X7)),
inference(variable_rename,[status(thm)],[15]) ).
cnf(48,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[47]) ).
fof(50,negated_conjecture,
? [X4,X5] : domain(addition(domain(X4),domain(X5))) != addition(domain(X4),domain(X5)),
inference(fof_nnf,[status(thm)],[18]) ).
fof(51,negated_conjecture,
? [X6,X7] : domain(addition(domain(X6),domain(X7))) != addition(domain(X6),domain(X7)),
inference(variable_rename,[status(thm)],[50]) ).
fof(52,negated_conjecture,
domain(addition(domain(esk1_0),domain(esk2_0))) != addition(domain(esk1_0),domain(esk2_0)),
inference(skolemize,[status(esa)],[51]) ).
cnf(53,negated_conjecture,
domain(addition(domain(esk1_0),domain(esk2_0))) != addition(domain(esk1_0),domain(esk2_0)),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(99,negated_conjecture,
domain(domain(addition(esk1_0,esk2_0))) != addition(domain(esk1_0),domain(esk2_0)),
inference(rw,[status(thm)],[53,48,theory(equality)]) ).
cnf(100,negated_conjecture,
domain(domain(addition(esk1_0,esk2_0))) != domain(addition(esk1_0,esk2_0)),
inference(rw,[status(thm)],[99,48,theory(equality)]) ).
cnf(107,plain,
domain(domain(X1)) = domain(multiplication(one,X1)),
inference(spm,[status(thm)],[40,44,theory(equality)]) ).
cnf(114,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[107,44,theory(equality)]) ).
cnf(221,negated_conjecture,
$false,
inference(rw,[status(thm)],[100,114,theory(equality)]) ).
cnf(222,negated_conjecture,
$false,
inference(cn,[status(thm)],[221,theory(equality)]) ).
cnf(223,negated_conjecture,
$false,
222,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE067+1.p
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpDU0KDT/sel_KLE067+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpDU0KDT/sel_KLE067+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpDU0KDT/sel_KLE067+1.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpDU0KDT/sel_KLE067+1.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmpDU0KDT/sel_KLE067+1.p_5 with time limit 55
% -prover status Theorem
% Problem KLE067+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE067+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE067+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
%
%------------------------------------------------------------------------------