TSTP Solution File: KLE052+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE052+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:04:44 EST 2010
% Result : Theorem 239.82s
% Output : CNFRefutation 239.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 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(3,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmpG96cce/sel_KLE052+1.p_5',left_distributivity) ).
fof(4,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpG96cce/sel_KLE052+1.p_5',additive_commutativity) ).
fof(10,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/tmp/tmpG96cce/sel_KLE052+1.p_5',domain3) ).
fof(13,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpG96cce/sel_KLE052+1.p_5',multiplicative_left_identity) ).
fof(14,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/tmp/tmpG96cce/sel_KLE052+1.p_5',domain1) ).
fof(17,conjecture,
! [X4] : multiplication(domain(X4),X4) = X4,
file('/tmp/tmpG96cce/sel_KLE052+1.p_5',goals) ).
fof(18,negated_conjecture,
~ ! [X4] : multiplication(domain(X4),X4) = X4,
inference(assume_negation,[status(cth)],[17]) ).
fof(23,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(24,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[23]) ).
fof(25,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[4]) ).
cnf(26,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[25]) ).
fof(37,plain,
! [X5] : addition(domain(X5),one) = one,
inference(variable_rename,[status(thm)],[10]) ).
cnf(38,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[37]) ).
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(45,plain,
! [X5] : addition(X5,multiplication(domain(X5),X5)) = multiplication(domain(X5),X5),
inference(variable_rename,[status(thm)],[14]) ).
cnf(46,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[45]) ).
fof(50,negated_conjecture,
? [X4] : multiplication(domain(X4),X4) != X4,
inference(fof_nnf,[status(thm)],[18]) ).
fof(51,negated_conjecture,
? [X5] : multiplication(domain(X5),X5) != X5,
inference(variable_rename,[status(thm)],[50]) ).
fof(52,negated_conjecture,
multiplication(domain(esk1_0),esk1_0) != esk1_0,
inference(skolemize,[status(esa)],[51]) ).
cnf(53,negated_conjecture,
multiplication(domain(esk1_0),esk1_0) != esk1_0,
inference(split_conjunct,[status(thm)],[52]) ).
cnf(59,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[38,26,theory(equality)]) ).
cnf(164,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[24,44,theory(equality)]) ).
cnf(384,plain,
multiplication(one,X1) = multiplication(domain(X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[46,164,theory(equality)]),59,theory(equality)]) ).
cnf(385,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[384,44,theory(equality)]) ).
cnf(414,negated_conjecture,
$false,
inference(rw,[status(thm)],[53,385,theory(equality)]) ).
cnf(415,negated_conjecture,
$false,
inference(cn,[status(thm)],[414,theory(equality)]) ).
cnf(416,negated_conjecture,
$false,
415,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE052+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/tmpG96cce/sel_KLE052+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpG96cce/sel_KLE052+1.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpG96cce/sel_KLE052+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/tmpG96cce/sel_KLE052+1.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmpG96cce/sel_KLE052+1.p_5 with time limit 54
% -prover status Theorem
% Problem KLE052+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE052+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE052+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
%
%------------------------------------------------------------------------------