TSTP Solution File: KLE026+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE026+2 : 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 11:50:12 EST 2010
% Result : Theorem 183.70s
% Output : CNFRefutation 183.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 54 ( 32 unt; 0 def)
% Number of atoms : 120 ( 63 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 103 ( 37 ~; 31 |; 28 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn 55 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpjIIiO6/sel_KLE026+2.p_4',multiplicative_left_identity) ).
fof(4,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmpjIIiO6/sel_KLE026+2.p_4',left_distributivity) ).
fof(5,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmpjIIiO6/sel_KLE026+2.p_4',additive_associativity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpjIIiO6/sel_KLE026+2.p_4',additive_commutativity) ).
fof(7,axiom,
! [X1] : addition(X1,X1) = X1,
file('/tmp/tmpjIIiO6/sel_KLE026+2.p_4',additive_idempotence) ).
fof(8,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/tmp/tmpjIIiO6/sel_KLE026+2.p_4',multiplicative_associativity) ).
fof(10,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/tmp/tmpjIIiO6/sel_KLE026+2.p_4',order) ).
fof(13,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/tmp/tmpjIIiO6/sel_KLE026+2.p_4',test_2) ).
fof(14,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/tmp/tmpjIIiO6/sel_KLE026+2.p_4',test_1) ).
fof(19,conjecture,
! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6)
=> leq(multiplication(X5,X4),multiplication(X4,X6)) ) ),
file('/tmp/tmpjIIiO6/sel_KLE026+2.p_4',goals) ).
fof(20,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6)
=> leq(multiplication(X5,X4),multiplication(X4,X6)) ) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(24,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(25,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[24]) ).
fof(28,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[4]) ).
cnf(29,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[28]) ).
fof(30,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[5]) ).
cnf(31,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[30]) ).
fof(32,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[6]) ).
cnf(33,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[32]) ).
fof(34,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[7]) ).
cnf(35,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[34]) ).
fof(36,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[8]) ).
cnf(37,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[36]) ).
fof(40,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| addition(X1,X2) = X2 )
& ( addition(X1,X2) != X2
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(41,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| addition(X3,X4) = X4 )
& ( addition(X3,X4) != X4
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[40]) ).
cnf(42,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(52,plain,
! [X4,X5] :
( ( ~ complement(X5,X4)
| ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) )
& ( multiplication(X4,X5) != zero
| multiplication(X5,X4) != zero
| addition(X4,X5) != one
| complement(X5,X4) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(53,plain,
! [X6,X7] :
( ( ~ complement(X7,X6)
| ( multiplication(X6,X7) = zero
& multiplication(X7,X6) = zero
& addition(X6,X7) = one ) )
& ( multiplication(X6,X7) != zero
| multiplication(X7,X6) != zero
| addition(X6,X7) != one
| complement(X7,X6) ) ),
inference(variable_rename,[status(thm)],[52]) ).
fof(54,plain,
! [X6,X7] :
( ( multiplication(X6,X7) = zero
| ~ complement(X7,X6) )
& ( multiplication(X7,X6) = zero
| ~ complement(X7,X6) )
& ( addition(X6,X7) = one
| ~ complement(X7,X6) )
& ( multiplication(X6,X7) != zero
| multiplication(X7,X6) != zero
| addition(X6,X7) != one
| complement(X7,X6) ) ),
inference(distribute,[status(thm)],[53]) ).
cnf(56,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[54]) ).
fof(59,plain,
! [X4] :
( ( ~ test(X4)
| ? [X5] : complement(X5,X4) )
& ( ! [X5] : ~ complement(X5,X4)
| test(X4) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(60,plain,
! [X6] :
( ( ~ test(X6)
| ? [X7] : complement(X7,X6) )
& ( ! [X8] : ~ complement(X8,X6)
| test(X6) ) ),
inference(variable_rename,[status(thm)],[59]) ).
fof(61,plain,
! [X6] :
( ( ~ test(X6)
| complement(esk1_1(X6),X6) )
& ( ! [X8] : ~ complement(X8,X6)
| test(X6) ) ),
inference(skolemize,[status(esa)],[60]) ).
fof(62,plain,
! [X6,X8] :
( ( ~ complement(X8,X6)
| test(X6) )
& ( ~ test(X6)
| complement(esk1_1(X6),X6) ) ),
inference(shift_quantors,[status(thm)],[61]) ).
cnf(63,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[62]) ).
fof(75,negated_conjecture,
? [X4,X5,X6] :
( test(X5)
& test(X6)
& multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6)
& ~ leq(multiplication(X5,X4),multiplication(X4,X6)) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(76,negated_conjecture,
? [X7,X8,X9] :
( test(X8)
& test(X9)
& multiplication(X8,X7) = multiplication(multiplication(X8,X7),X9)
& ~ leq(multiplication(X8,X7),multiplication(X7,X9)) ),
inference(variable_rename,[status(thm)],[75]) ).
fof(77,negated_conjecture,
( test(esk3_0)
& test(esk4_0)
& multiplication(esk3_0,esk2_0) = multiplication(multiplication(esk3_0,esk2_0),esk4_0)
& ~ leq(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0)) ),
inference(skolemize,[status(esa)],[76]) ).
cnf(78,negated_conjecture,
~ leq(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0)),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(79,negated_conjecture,
multiplication(esk3_0,esk2_0) = multiplication(multiplication(esk3_0,esk2_0),esk4_0),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(81,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(82,negated_conjecture,
addition(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0)) != multiplication(esk2_0,esk4_0),
inference(spm,[status(thm)],[78,42,theory(equality)]) ).
cnf(105,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,esk4_0)) = multiplication(esk3_0,esk2_0),
inference(rw,[status(thm)],[79,37,theory(equality)]) ).
cnf(116,plain,
( addition(X1,esk1_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[56,63,theory(equality)]) ).
cnf(151,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[29,25,theory(equality)]) ).
cnf(182,plain,
addition(X1,X2) = addition(X1,addition(X1,X2)),
inference(spm,[status(thm)],[31,35,theory(equality)]) ).
cnf(917,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[182,116,theory(equality)]) ).
cnf(931,negated_conjecture,
addition(esk3_0,one) = one,
inference(spm,[status(thm)],[917,81,theory(equality)]) ).
cnf(942,negated_conjecture,
addition(one,esk3_0) = one,
inference(rw,[status(thm)],[931,33,theory(equality)]) ).
cnf(1056,negated_conjecture,
addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk2_0)) = multiplication(addition(one,esk3_0),multiplication(esk2_0,esk4_0)),
inference(spm,[status(thm)],[151,105,theory(equality)]) ).
cnf(1085,negated_conjecture,
addition(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0)) = multiplication(addition(one,esk3_0),multiplication(esk2_0,esk4_0)),
inference(rw,[status(thm)],[1056,33,theory(equality)]) ).
cnf(1086,negated_conjecture,
addition(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0)) = multiplication(esk2_0,esk4_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[1085,942,theory(equality)]),25,theory(equality)]) ).
cnf(1087,negated_conjecture,
$false,
inference(sr,[status(thm)],[1086,82,theory(equality)]) ).
cnf(1088,negated_conjecture,
$false,
1087,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE026+2.p
% --creating new selector for [KLE001+0.ax, KLE001+1.ax, KLE001+2.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpjIIiO6/sel_KLE026+2.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpjIIiO6/sel_KLE026+2.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+1.ax, KLE001+2.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpjIIiO6/sel_KLE026+2.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+1.ax, KLE001+2.ax]
% -running prover on /tmp/tmpjIIiO6/sel_KLE026+2.p_4 with time limit 55
% -prover status Theorem
% Problem KLE026+2.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE026+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE026+2.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
%
%------------------------------------------------------------------------------