TSTP Solution File: KLE063+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE063+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:07:27 EST 2010
% Result : Theorem 239.81s
% Output : CNFRefutation 239.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 56 ( 51 unt; 0 def)
% Number of atoms : 61 ( 59 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 0 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 73 ( 5 sgn 36 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmpnUSEQ-/sel_KLE063+1.p_5',left_distributivity) ).
fof(4,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpnUSEQ-/sel_KLE063+1.p_5',additive_commutativity) ).
fof(9,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpnUSEQ-/sel_KLE063+1.p_5',multiplicative_right_identity) ).
fof(10,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/tmp/tmpnUSEQ-/sel_KLE063+1.p_5',domain3) ).
fof(11,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/tmp/tmpnUSEQ-/sel_KLE063+1.p_5',domain2) ).
fof(12,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmpnUSEQ-/sel_KLE063+1.p_5',right_distributivity) ).
fof(13,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpnUSEQ-/sel_KLE063+1.p_5',multiplicative_left_identity) ).
fof(14,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/tmp/tmpnUSEQ-/sel_KLE063+1.p_5',domain1) ).
fof(15,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/tmp/tmpnUSEQ-/sel_KLE063+1.p_5',domain5) ).
fof(17,conjecture,
! [X4,X5] :
( addition(X4,multiplication(domain(X5),X4)) = multiplication(domain(X5),X4)
=> addition(domain(X4),domain(X5)) = domain(X5) ),
file('/tmp/tmpnUSEQ-/sel_KLE063+1.p_5',goals) ).
fof(18,negated_conjecture,
~ ! [X4,X5] :
( addition(X4,multiplication(domain(X5),X4)) = multiplication(domain(X5),X4)
=> addition(domain(X4),domain(X5)) = domain(X5) ),
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(35,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[9]) ).
cnf(36,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[35]) ).
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(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(41,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[12]) ).
cnf(42,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[41]) ).
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(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] :
( addition(X4,multiplication(domain(X5),X4)) = multiplication(domain(X5),X4)
& addition(domain(X4),domain(X5)) != domain(X5) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(51,negated_conjecture,
? [X6,X7] :
( addition(X6,multiplication(domain(X7),X6)) = multiplication(domain(X7),X6)
& addition(domain(X6),domain(X7)) != domain(X7) ),
inference(variable_rename,[status(thm)],[50]) ).
fof(52,negated_conjecture,
( addition(esk1_0,multiplication(domain(esk2_0),esk1_0)) = multiplication(domain(esk2_0),esk1_0)
& addition(domain(esk1_0),domain(esk2_0)) != domain(esk2_0) ),
inference(skolemize,[status(esa)],[51]) ).
cnf(53,negated_conjecture,
addition(domain(esk1_0),domain(esk2_0)) != domain(esk2_0),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(54,negated_conjecture,
addition(esk1_0,multiplication(domain(esk2_0),esk1_0)) = multiplication(domain(esk2_0),esk1_0),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(60,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[38,26,theory(equality)]) ).
cnf(100,negated_conjecture,
domain(addition(esk1_0,esk2_0)) != domain(esk2_0),
inference(rw,[status(thm)],[53,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(121,plain,
addition(one,domain(one)) = domain(one),
inference(spm,[status(thm)],[46,36,theory(equality)]) ).
cnf(132,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
inference(spm,[status(thm)],[42,36,theory(equality)]) ).
cnf(167,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[24,44,theory(equality)]) ).
cnf(203,plain,
one = domain(one),
inference(rw,[status(thm)],[121,60,theory(equality)]) ).
cnf(206,plain,
addition(one,domain(X1)) = domain(addition(one,X1)),
inference(spm,[status(thm)],[48,203,theory(equality)]) ).
cnf(210,plain,
one = domain(addition(one,X1)),
inference(rw,[status(thm)],[206,60,theory(equality)]) ).
cnf(217,plain,
addition(domain(X1),domain(X2)) = domain(addition(X1,domain(X2))),
inference(spm,[status(thm)],[48,114,theory(equality)]) ).
cnf(225,plain,
domain(addition(X1,X2)) = domain(addition(X1,domain(X2))),
inference(rw,[status(thm)],[217,48,theory(equality)]) ).
cnf(234,plain,
domain(multiplication(X1,one)) = domain(multiplication(X1,addition(one,X2))),
inference(spm,[status(thm)],[40,210,theory(equality)]) ).
cnf(247,plain,
domain(X1) = domain(multiplication(X1,addition(one,X2))),
inference(rw,[status(thm)],[234,36,theory(equality)]) ).
cnf(532,negated_conjecture,
esk1_0 = multiplication(domain(esk2_0),esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[54,167,theory(equality)]),60,theory(equality)]),44,theory(equality)]) ).
cnf(595,negated_conjecture,
addition(domain(esk2_0),esk1_0) = multiplication(domain(esk2_0),addition(one,esk1_0)),
inference(spm,[status(thm)],[132,532,theory(equality)]) ).
cnf(600,negated_conjecture,
addition(esk1_0,domain(esk2_0)) = multiplication(domain(esk2_0),addition(one,esk1_0)),
inference(rw,[status(thm)],[595,26,theory(equality)]) ).
cnf(865,negated_conjecture,
domain(addition(esk1_0,domain(esk2_0))) = domain(domain(esk2_0)),
inference(spm,[status(thm)],[247,600,theory(equality)]) ).
cnf(873,negated_conjecture,
domain(addition(esk1_0,domain(esk2_0))) = domain(esk2_0),
inference(rw,[status(thm)],[865,114,theory(equality)]) ).
cnf(1039,negated_conjecture,
domain(addition(esk1_0,esk2_0)) = domain(esk2_0),
inference(rw,[status(thm)],[873,225,theory(equality)]) ).
cnf(1040,negated_conjecture,
$false,
inference(sr,[status(thm)],[1039,100,theory(equality)]) ).
cnf(1041,negated_conjecture,
$false,
1040,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE063+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/tmpnUSEQ-/sel_KLE063+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpnUSEQ-/sel_KLE063+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/tmpnUSEQ-/sel_KLE063+1.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpnUSEQ-/sel_KLE063+1.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmpnUSEQ-/sel_KLE063+1.p_5 with time limit 54
% -prover status Theorem
% Problem KLE063+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE063+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE063+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
%
%------------------------------------------------------------------------------