TSTP Solution File: KLE025+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE025+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:49:55 EST 2010
% Result : Theorem 225.47s
% Output : CNFRefutation 225.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 12
% Syntax : Number of formulae : 110 ( 40 unt; 0 def)
% Number of atoms : 259 ( 139 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 254 ( 105 ~; 110 |; 30 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 136 ( 3 sgn 61 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1] : addition(X1,zero) = X1,
file('/tmp/tmpNtUoFZ/sel_KLE025+2.p_4',additive_identity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpNtUoFZ/sel_KLE025+2.p_4',additive_commutativity) ).
fof(7,axiom,
! [X1] : addition(X1,X1) = X1,
file('/tmp/tmpNtUoFZ/sel_KLE025+2.p_4',additive_idempotence) ).
fof(8,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/tmp/tmpNtUoFZ/sel_KLE025+2.p_4',multiplicative_associativity) ).
fof(9,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/tmp/tmpNtUoFZ/sel_KLE025+2.p_4',left_annihilation) ).
fof(11,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/tmp/tmpNtUoFZ/sel_KLE025+2.p_4',test_3) ).
fof(12,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/tmp/tmpNtUoFZ/sel_KLE025+2.p_4',test_2) ).
fof(13,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/tmp/tmpNtUoFZ/sel_KLE025+2.p_4',test_1) ).
fof(14,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpNtUoFZ/sel_KLE025+2.p_4',multiplicative_right_identity) ).
fof(16,axiom,
! [X4,X5] :
( ( test(X4)
& test(X5) )
=> c(multiplication(X4,X5)) = addition(c(X4),c(X5)) ),
file('/tmp/tmpNtUoFZ/sel_KLE025+2.p_4',test_deMorgan2) ).
fof(17,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmpNtUoFZ/sel_KLE025+2.p_4',right_distributivity) ).
fof(18,conjecture,
! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( multiplication(multiplication(X5,X4),c(X6)) = zero
=> multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6) ) ),
file('/tmp/tmpNtUoFZ/sel_KLE025+2.p_4',goals) ).
fof(19,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( multiplication(multiplication(X5,X4),c(X6)) = zero
=> multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6) ) ),
inference(assume_negation,[status(cth)],[18]) ).
fof(25,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[3]) ).
cnf(26,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[25]) ).
fof(31,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[6]) ).
cnf(32,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[31]) ).
fof(33,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[7]) ).
cnf(34,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[33]) ).
fof(35,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[8]) ).
cnf(36,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[35]) ).
fof(37,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[9]) ).
cnf(38,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[37]) ).
fof(42,plain,
! [X4,X5] :
( ~ test(X4)
| ( ( c(X4) != X5
| complement(X4,X5) )
& ( ~ complement(X4,X5)
| c(X4) = X5 ) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(43,plain,
! [X6,X7] :
( ~ test(X6)
| ( ( c(X6) != X7
| complement(X6,X7) )
& ( ~ complement(X6,X7)
| c(X6) = X7 ) ) ),
inference(variable_rename,[status(thm)],[42]) ).
fof(44,plain,
! [X6,X7] :
( ( c(X6) != X7
| complement(X6,X7)
| ~ test(X6) )
& ( ~ complement(X6,X7)
| c(X6) = X7
| ~ test(X6) ) ),
inference(distribute,[status(thm)],[43]) ).
cnf(45,plain,
( c(X1) = X2
| ~ test(X1)
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[44]) ).
cnf(46,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[44]) ).
fof(47,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)],[12]) ).
fof(48,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)],[47]) ).
fof(49,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)],[48]) ).
cnf(50,plain,
( complement(X1,X2)
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(51,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(52,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(53,plain,
( multiplication(X2,X1) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[49]) ).
fof(54,plain,
! [X4] :
( ( ~ test(X4)
| ? [X5] : complement(X5,X4) )
& ( ! [X5] : ~ complement(X5,X4)
| test(X4) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(55,plain,
! [X6] :
( ( ~ test(X6)
| ? [X7] : complement(X7,X6) )
& ( ! [X8] : ~ complement(X8,X6)
| test(X6) ) ),
inference(variable_rename,[status(thm)],[54]) ).
fof(56,plain,
! [X6] :
( ( ~ test(X6)
| complement(esk1_1(X6),X6) )
& ( ! [X8] : ~ complement(X8,X6)
| test(X6) ) ),
inference(skolemize,[status(esa)],[55]) ).
fof(57,plain,
! [X6,X8] :
( ( ~ complement(X8,X6)
| test(X6) )
& ( ~ test(X6)
| complement(esk1_1(X6),X6) ) ),
inference(shift_quantors,[status(thm)],[56]) ).
cnf(58,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(59,plain,
( test(X1)
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[57]) ).
fof(60,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[14]) ).
cnf(61,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[60]) ).
fof(65,plain,
! [X4,X5] :
( ~ test(X4)
| ~ test(X5)
| c(multiplication(X4,X5)) = addition(c(X4),c(X5)) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(66,plain,
! [X6,X7] :
( ~ test(X6)
| ~ test(X7)
| c(multiplication(X6,X7)) = addition(c(X6),c(X7)) ),
inference(variable_rename,[status(thm)],[65]) ).
cnf(67,plain,
( c(multiplication(X1,X2)) = addition(c(X1),c(X2))
| ~ test(X2)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(68,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[17]) ).
cnf(69,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[68]) ).
fof(70,negated_conjecture,
? [X4,X5,X6] :
( test(X5)
& test(X6)
& multiplication(multiplication(X5,X4),c(X6)) = zero
& multiplication(X5,X4) != multiplication(multiplication(X5,X4),X6) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(71,negated_conjecture,
? [X7,X8,X9] :
( test(X8)
& test(X9)
& multiplication(multiplication(X8,X7),c(X9)) = zero
& multiplication(X8,X7) != multiplication(multiplication(X8,X7),X9) ),
inference(variable_rename,[status(thm)],[70]) ).
fof(72,negated_conjecture,
( test(esk3_0)
& test(esk4_0)
& multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) = zero
& multiplication(esk3_0,esk2_0) != multiplication(multiplication(esk3_0,esk2_0),esk4_0) ),
inference(skolemize,[status(esa)],[71]) ).
cnf(73,negated_conjecture,
multiplication(esk3_0,esk2_0) != multiplication(multiplication(esk3_0,esk2_0),esk4_0),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(74,negated_conjecture,
multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) = zero,
inference(split_conjunct,[status(thm)],[72]) ).
cnf(75,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(81,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[26,32,theory(equality)]) ).
cnf(87,plain,
( multiplication(X1,esk1_1(X1)) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[53,58,theory(equality)]) ).
cnf(90,plain,
( multiplication(X1,X2) = zero
| c(X2) != X1
| ~ test(X2) ),
inference(spm,[status(thm)],[53,46,theory(equality)]) ).
cnf(91,plain,
( multiplication(X1,X2) = zero
| c(X1) != X2
| ~ test(X1) ),
inference(spm,[status(thm)],[52,46,theory(equality)]) ).
cnf(92,plain,
( addition(X1,esk1_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[51,58,theory(equality)]) ).
cnf(93,plain,
( addition(X1,X2) = one
| c(X2) != X1
| ~ test(X2) ),
inference(spm,[status(thm)],[51,46,theory(equality)]) ).
cnf(103,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))) = zero,
inference(rw,[status(thm)],[74,36,theory(equality)]) ).
cnf(104,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,esk4_0)) != multiplication(esk3_0,esk2_0),
inference(rw,[status(thm)],[73,36,theory(equality)]) ).
cnf(120,plain,
( c(multiplication(X1,X1)) = c(X1)
| ~ test(X1) ),
inference(spm,[status(thm)],[34,67,theory(equality)]) ).
cnf(208,plain,
( test(X1)
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one ),
inference(spm,[status(thm)],[59,50,theory(equality)]) ).
cnf(212,plain,
( c(X1) = X2
| ~ test(X1)
| multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero
| addition(X2,X1) != one ),
inference(spm,[status(thm)],[45,50,theory(equality)]) ).
cnf(214,negated_conjecture,
addition(zero,multiplication(esk3_0,X1)) = multiplication(esk3_0,addition(multiplication(esk2_0,c(esk4_0)),X1)),
inference(spm,[status(thm)],[69,103,theory(equality)]) ).
cnf(258,plain,
( addition(multiplication(X1,X2),zero) = multiplication(X1,addition(X2,esk1_1(X1)))
| ~ test(X1) ),
inference(spm,[status(thm)],[69,87,theory(equality)]) ).
cnf(263,plain,
( multiplication(X1,X2) = multiplication(X1,addition(X2,esk1_1(X1)))
| ~ test(X1) ),
inference(rw,[status(thm)],[258,26,theory(equality)]) ).
cnf(305,plain,
( multiplication(c(X1),X1) = zero
| ~ test(X1) ),
inference(er,[status(thm)],[90,theory(equality)]) ).
cnf(311,plain,
( multiplication(zero,X2) = multiplication(c(X1),multiplication(X1,X2))
| ~ test(X1) ),
inference(spm,[status(thm)],[36,305,theory(equality)]) ).
cnf(320,plain,
( zero = multiplication(c(X1),multiplication(X1,X2))
| ~ test(X1) ),
inference(rw,[status(thm)],[311,38,theory(equality)]) ).
cnf(352,plain,
( multiplication(X1,c(X1)) = zero
| ~ test(X1) ),
inference(er,[status(thm)],[91,theory(equality)]) ).
cnf(369,plain,
( zero = multiplication(X1,multiplication(X2,c(multiplication(X1,X2))))
| ~ test(multiplication(X1,X2)) ),
inference(spm,[status(thm)],[36,352,theory(equality)]) ).
cnf(521,plain,
( addition(c(X1),X1) = one
| ~ test(X1) ),
inference(er,[status(thm)],[93,theory(equality)]) ).
cnf(526,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[521,32,theory(equality)]) ).
cnf(534,plain,
( addition(multiplication(X1,X1),c(X1)) = one
| ~ test(multiplication(X1,X1))
| ~ test(X1) ),
inference(spm,[status(thm)],[526,120,theory(equality)]) ).
cnf(4139,plain,
( test(X1)
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X2,X1) != one ),
inference(spm,[status(thm)],[208,32,theory(equality)]) ).
cnf(4991,negated_conjecture,
multiplication(esk3_0,addition(multiplication(esk2_0,c(esk4_0)),X1)) = multiplication(esk3_0,X1),
inference(rw,[status(thm)],[214,81,theory(equality)]) ).
cnf(4996,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,addition(c(esk4_0),X1))) = multiplication(esk3_0,multiplication(esk2_0,X1)),
inference(spm,[status(thm)],[4991,69,theory(equality)]) ).
cnf(7754,plain,
( multiplication(X1,one) = multiplication(X1,X1)
| ~ test(X1) ),
inference(spm,[status(thm)],[263,92,theory(equality)]) ).
cnf(7806,plain,
( X1 = multiplication(X1,X1)
| ~ test(X1) ),
inference(rw,[status(thm)],[7754,61,theory(equality)]) ).
cnf(7814,negated_conjecture,
multiplication(esk4_0,esk4_0) = esk4_0,
inference(spm,[status(thm)],[7806,75,theory(equality)]) ).
cnf(7883,negated_conjecture,
multiplication(esk4_0,X1) = multiplication(esk4_0,multiplication(esk4_0,X1)),
inference(spm,[status(thm)],[36,7814,theory(equality)]) ).
cnf(7899,negated_conjecture,
( multiplication(c(esk4_0),esk4_0) = zero
| ~ test(esk4_0) ),
inference(spm,[status(thm)],[320,7814,theory(equality)]) ).
cnf(7921,negated_conjecture,
( multiplication(c(esk4_0),esk4_0) = zero
| $false ),
inference(rw,[status(thm)],[7899,75,theory(equality)]) ).
cnf(7922,negated_conjecture,
multiplication(c(esk4_0),esk4_0) = zero,
inference(cn,[status(thm)],[7921,theory(equality)]) ).
cnf(12358,negated_conjecture,
( multiplication(esk4_0,multiplication(esk4_0,c(esk4_0))) = zero
| ~ test(esk4_0) ),
inference(spm,[status(thm)],[369,7814,theory(equality)]) ).
cnf(12505,negated_conjecture,
( multiplication(esk4_0,c(esk4_0)) = zero
| ~ test(esk4_0) ),
inference(rw,[status(thm)],[12358,7883,theory(equality)]) ).
cnf(12506,negated_conjecture,
( multiplication(esk4_0,c(esk4_0)) = zero
| $false ),
inference(rw,[status(thm)],[12505,75,theory(equality)]) ).
cnf(12507,negated_conjecture,
multiplication(esk4_0,c(esk4_0)) = zero,
inference(cn,[status(thm)],[12506,theory(equality)]) ).
cnf(21718,negated_conjecture,
( addition(esk4_0,c(esk4_0)) = one
| ~ test(esk4_0) ),
inference(spm,[status(thm)],[534,7814,theory(equality)]) ).
cnf(21808,negated_conjecture,
( addition(esk4_0,c(esk4_0)) = one
| $false ),
inference(rw,[status(thm)],[21718,75,theory(equality)]) ).
cnf(21809,negated_conjecture,
addition(esk4_0,c(esk4_0)) = one,
inference(cn,[status(thm)],[21808,theory(equality)]) ).
cnf(22553,negated_conjecture,
( c(c(esk4_0)) = esk4_0
| multiplication(esk4_0,c(esk4_0)) != zero
| multiplication(c(esk4_0),esk4_0) != zero
| ~ test(c(esk4_0)) ),
inference(spm,[status(thm)],[212,21809,theory(equality)]) ).
cnf(22602,negated_conjecture,
( c(c(esk4_0)) = esk4_0
| $false
| multiplication(c(esk4_0),esk4_0) != zero
| ~ test(c(esk4_0)) ),
inference(rw,[status(thm)],[22553,12507,theory(equality)]) ).
cnf(22603,negated_conjecture,
( c(c(esk4_0)) = esk4_0
| $false
| $false
| ~ test(c(esk4_0)) ),
inference(rw,[status(thm)],[22602,7922,theory(equality)]) ).
cnf(22604,negated_conjecture,
( c(c(esk4_0)) = esk4_0
| ~ test(c(esk4_0)) ),
inference(cn,[status(thm)],[22603,theory(equality)]) ).
cnf(746777,negated_conjecture,
( test(c(esk4_0))
| multiplication(c(esk4_0),esk4_0) != zero
| multiplication(esk4_0,c(esk4_0)) != zero ),
inference(spm,[status(thm)],[4139,21809,theory(equality)]) ).
cnf(747198,negated_conjecture,
( test(c(esk4_0))
| $false
| multiplication(esk4_0,c(esk4_0)) != zero ),
inference(rw,[status(thm)],[746777,7922,theory(equality)]) ).
cnf(747199,negated_conjecture,
( test(c(esk4_0))
| $false
| $false ),
inference(rw,[status(thm)],[747198,12507,theory(equality)]) ).
cnf(747200,negated_conjecture,
test(c(esk4_0)),
inference(cn,[status(thm)],[747199,theory(equality)]) ).
cnf(747619,negated_conjecture,
( c(c(esk4_0)) = esk4_0
| $false ),
inference(rw,[status(thm)],[22604,747200,theory(equality)]) ).
cnf(747620,negated_conjecture,
c(c(esk4_0)) = esk4_0,
inference(cn,[status(thm)],[747619,theory(equality)]) ).
cnf(831526,negated_conjecture,
( multiplication(esk3_0,multiplication(esk2_0,one)) = multiplication(esk3_0,multiplication(esk2_0,c(c(esk4_0))))
| ~ test(c(esk4_0)) ),
inference(spm,[status(thm)],[4996,526,theory(equality)]) ).
cnf(831864,negated_conjecture,
( multiplication(esk3_0,esk2_0) = multiplication(esk3_0,multiplication(esk2_0,c(c(esk4_0))))
| ~ test(c(esk4_0)) ),
inference(rw,[status(thm)],[831526,61,theory(equality)]) ).
cnf(831865,negated_conjecture,
( multiplication(esk3_0,esk2_0) = multiplication(esk3_0,multiplication(esk2_0,esk4_0))
| ~ test(c(esk4_0)) ),
inference(rw,[status(thm)],[831864,747620,theory(equality)]) ).
cnf(831866,negated_conjecture,
( multiplication(esk3_0,esk2_0) = multiplication(esk3_0,multiplication(esk2_0,esk4_0))
| $false ),
inference(rw,[status(thm)],[831865,747200,theory(equality)]) ).
cnf(831867,negated_conjecture,
multiplication(esk3_0,esk2_0) = multiplication(esk3_0,multiplication(esk2_0,esk4_0)),
inference(cn,[status(thm)],[831866,theory(equality)]) ).
cnf(831868,negated_conjecture,
$false,
inference(sr,[status(thm)],[831867,104,theory(equality)]) ).
cnf(831869,negated_conjecture,
$false,
831868,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE025+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/tmpNtUoFZ/sel_KLE025+2.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpNtUoFZ/sel_KLE025+2.p_2 with time limit 81
% -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/tmpNtUoFZ/sel_KLE025+2.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+1.ax, KLE001+2.ax]
% -running prover on /tmp/tmpNtUoFZ/sel_KLE025+2.p_4 with time limit 55
% -prover status Theorem
% Problem KLE025+2.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE025+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE025+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
%
%------------------------------------------------------------------------------