TSTP Solution File: COM003+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : COM003+2 : TPTP v5.0.0. Bugfixed v2.2.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 05:43:56 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 12
% Syntax : Number of formulae : 125 ( 23 unt; 0 def)
% Number of atoms : 418 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 486 ( 193 ~; 205 |; 72 &)
% ( 8 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 3 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 197 ( 49 sgn 93 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( program_program_decides(X1)
=> ! [X2,X3] :
( program_halts2_halts3_outputs(X1,X2,X3,good)
& program_not_halts2_halts3_outputs(X1,X2,X3,bad) ) ),
file('/tmp/tmpuP0HLT/sel_COM003+2.p_1',p2) ).
fof(4,axiom,
( ? [X5] :
( program(X5)
& ! [X2] :
( program_halts2_halts2_outputs(X5,X2,good)
& program_not_halts2_halts2_outputs(X5,X2,bad) ) )
=> ? [X6] :
( program(X6)
& ! [X2] :
( ( program_halts2(X2,X2)
=> ~ halts2(X6,X2) )
& program_not_halts2_halts2_outputs(X6,X2,good) ) ) ),
file('/tmp/tmpuP0HLT/sel_COM003+2.p_1',p4) ).
fof(5,axiom,
( ? [X1] :
( program(X1)
& ! [X2] :
( program_halts2_halts3_outputs(X1,X2,X2,good)
& program_not_halts2_halts3_outputs(X1,X2,X2,bad) ) )
=> ? [X5] :
( program(X5)
& ! [X2] :
( program_halts2_halts2_outputs(X5,X2,good)
& program_not_halts2_halts2_outputs(X5,X2,bad) ) ) ),
file('/tmp/tmpuP0HLT/sel_COM003+2.p_1',p3) ).
fof(6,axiom,
! [X4] :
( program_program_decides(X4)
<=> ( program(X4)
& program_decides(X4) ) ),
file('/tmp/tmpuP0HLT/sel_COM003+2.p_1',program_program_decides_def) ).
fof(8,axiom,
! [X4,X2] :
( program_not_halts2(X4,X2)
<=> ( program(X4)
& ~ halts2(X4,X2) ) ),
file('/tmp/tmpuP0HLT/sel_COM003+2.p_1',program_not_halts2_def) ).
fof(9,axiom,
! [X4,X2] :
( program_halts2(X4,X2)
<=> ( program(X4)
& halts2(X4,X2) ) ),
file('/tmp/tmpuP0HLT/sel_COM003+2.p_1',program_halts2_def) ).
fof(11,axiom,
! [X4,X2,X1] :
( program_not_halts2_halts2_outputs(X4,X2,X1)
<=> ( program_not_halts2(X2,X2)
=> halts2_outputs(X4,X2,X1) ) ),
file('/tmp/tmpuP0HLT/sel_COM003+2.p_1',program_not_halts2_halts2_outputs_def) ).
fof(12,axiom,
( ? [X4] : algorithm_program_decides(X4)
=> ? [X1] : program_program_decides(X1) ),
file('/tmp/tmpuP0HLT/sel_COM003+2.p_1',p1) ).
fof(13,conjecture,
~ ? [X4] : algorithm_program_decides(X4),
file('/tmp/tmpuP0HLT/sel_COM003+2.p_1',prove_this) ).
fof(14,axiom,
! [X4,X2,X1] :
( halts2_outputs(X4,X2,X1)
<=> ( halts2(X4,X2)
& outputs(X4,X1) ) ),
file('/tmp/tmpuP0HLT/sel_COM003+2.p_1',halts2_outputs_def) ).
fof(17,negated_conjecture,
~ ~ ? [X4] : algorithm_program_decides(X4),
inference(assume_negation,[status(cth)],[13]) ).
fof(18,plain,
( ? [X5] :
( program(X5)
& ! [X2] :
( program_halts2_halts2_outputs(X5,X2,good)
& program_not_halts2_halts2_outputs(X5,X2,bad) ) )
=> ? [X6] :
( program(X6)
& ! [X2] :
( ( program_halts2(X2,X2)
=> ~ halts2(X6,X2) )
& program_not_halts2_halts2_outputs(X6,X2,good) ) ) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(19,plain,
! [X4,X2] :
( program_not_halts2(X4,X2)
<=> ( program(X4)
& ~ halts2(X4,X2) ) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(20,plain,
! [X1] :
( ~ program_program_decides(X1)
| ! [X2,X3] :
( program_halts2_halts3_outputs(X1,X2,X3,good)
& program_not_halts2_halts3_outputs(X1,X2,X3,bad) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(21,plain,
! [X4] :
( ~ program_program_decides(X4)
| ! [X5,X6] :
( program_halts2_halts3_outputs(X4,X5,X6,good)
& program_not_halts2_halts3_outputs(X4,X5,X6,bad) ) ),
inference(variable_rename,[status(thm)],[20]) ).
fof(22,plain,
! [X4,X5,X6] :
( ( program_halts2_halts3_outputs(X4,X5,X6,good)
& program_not_halts2_halts3_outputs(X4,X5,X6,bad) )
| ~ program_program_decides(X4) ),
inference(shift_quantors,[status(thm)],[21]) ).
fof(23,plain,
! [X4,X5,X6] :
( ( program_halts2_halts3_outputs(X4,X5,X6,good)
| ~ program_program_decides(X4) )
& ( program_not_halts2_halts3_outputs(X4,X5,X6,bad)
| ~ program_program_decides(X4) ) ),
inference(distribute,[status(thm)],[22]) ).
cnf(24,plain,
( program_not_halts2_halts3_outputs(X1,X2,X3,bad)
| ~ program_program_decides(X1) ),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(25,plain,
( program_halts2_halts3_outputs(X1,X2,X3,good)
| ~ program_program_decides(X1) ),
inference(split_conjunct,[status(thm)],[23]) ).
fof(38,plain,
( ! [X5] :
( ~ program(X5)
| ? [X2] :
( ~ program_halts2_halts2_outputs(X5,X2,good)
| ~ program_not_halts2_halts2_outputs(X5,X2,bad) ) )
| ? [X6] :
( program(X6)
& ! [X2] :
( ( ~ program_halts2(X2,X2)
| ~ halts2(X6,X2) )
& program_not_halts2_halts2_outputs(X6,X2,good) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(39,plain,
( ! [X7] :
( ~ program(X7)
| ? [X8] :
( ~ program_halts2_halts2_outputs(X7,X8,good)
| ~ program_not_halts2_halts2_outputs(X7,X8,bad) ) )
| ? [X9] :
( program(X9)
& ! [X10] :
( ( ~ program_halts2(X10,X10)
| ~ halts2(X9,X10) )
& program_not_halts2_halts2_outputs(X9,X10,good) ) ) ),
inference(variable_rename,[status(thm)],[38]) ).
fof(40,plain,
( ! [X7] :
( ~ program(X7)
| ~ program_halts2_halts2_outputs(X7,esk1_1(X7),good)
| ~ program_not_halts2_halts2_outputs(X7,esk1_1(X7),bad) )
| ( program(esk2_0)
& ! [X10] :
( ( ~ program_halts2(X10,X10)
| ~ halts2(esk2_0,X10) )
& program_not_halts2_halts2_outputs(esk2_0,X10,good) ) ) ),
inference(skolemize,[status(esa)],[39]) ).
fof(41,plain,
! [X7,X10] :
( ( ( ~ program_halts2(X10,X10)
| ~ halts2(esk2_0,X10) )
& program_not_halts2_halts2_outputs(esk2_0,X10,good)
& program(esk2_0) )
| ~ program(X7)
| ~ program_halts2_halts2_outputs(X7,esk1_1(X7),good)
| ~ program_not_halts2_halts2_outputs(X7,esk1_1(X7),bad) ),
inference(shift_quantors,[status(thm)],[40]) ).
fof(42,plain,
! [X7,X10] :
( ( ~ program_halts2(X10,X10)
| ~ halts2(esk2_0,X10)
| ~ program(X7)
| ~ program_halts2_halts2_outputs(X7,esk1_1(X7),good)
| ~ program_not_halts2_halts2_outputs(X7,esk1_1(X7),bad) )
& ( program_not_halts2_halts2_outputs(esk2_0,X10,good)
| ~ program(X7)
| ~ program_halts2_halts2_outputs(X7,esk1_1(X7),good)
| ~ program_not_halts2_halts2_outputs(X7,esk1_1(X7),bad) )
& ( program(esk2_0)
| ~ program(X7)
| ~ program_halts2_halts2_outputs(X7,esk1_1(X7),good)
| ~ program_not_halts2_halts2_outputs(X7,esk1_1(X7),bad) ) ),
inference(distribute,[status(thm)],[41]) ).
cnf(43,plain,
( program(esk2_0)
| ~ program_not_halts2_halts2_outputs(X1,esk1_1(X1),bad)
| ~ program_halts2_halts2_outputs(X1,esk1_1(X1),good)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(44,plain,
( program_not_halts2_halts2_outputs(esk2_0,X2,good)
| ~ program_not_halts2_halts2_outputs(X1,esk1_1(X1),bad)
| ~ program_halts2_halts2_outputs(X1,esk1_1(X1),good)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(45,plain,
( ~ program_not_halts2_halts2_outputs(X1,esk1_1(X1),bad)
| ~ program_halts2_halts2_outputs(X1,esk1_1(X1),good)
| ~ program(X1)
| ~ halts2(esk2_0,X2)
| ~ program_halts2(X2,X2) ),
inference(split_conjunct,[status(thm)],[42]) ).
fof(46,plain,
( ! [X1] :
( ~ program(X1)
| ? [X2] :
( ~ program_halts2_halts3_outputs(X1,X2,X2,good)
| ~ program_not_halts2_halts3_outputs(X1,X2,X2,bad) ) )
| ? [X5] :
( program(X5)
& ! [X2] :
( program_halts2_halts2_outputs(X5,X2,good)
& program_not_halts2_halts2_outputs(X5,X2,bad) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(47,plain,
( ! [X6] :
( ~ program(X6)
| ? [X7] :
( ~ program_halts2_halts3_outputs(X6,X7,X7,good)
| ~ program_not_halts2_halts3_outputs(X6,X7,X7,bad) ) )
| ? [X8] :
( program(X8)
& ! [X9] :
( program_halts2_halts2_outputs(X8,X9,good)
& program_not_halts2_halts2_outputs(X8,X9,bad) ) ) ),
inference(variable_rename,[status(thm)],[46]) ).
fof(48,plain,
( ! [X6] :
( ~ program(X6)
| ~ program_halts2_halts3_outputs(X6,esk3_1(X6),esk3_1(X6),good)
| ~ program_not_halts2_halts3_outputs(X6,esk3_1(X6),esk3_1(X6),bad) )
| ( program(esk4_0)
& ! [X9] :
( program_halts2_halts2_outputs(esk4_0,X9,good)
& program_not_halts2_halts2_outputs(esk4_0,X9,bad) ) ) ),
inference(skolemize,[status(esa)],[47]) ).
fof(49,plain,
! [X6,X9] :
( ( program_halts2_halts2_outputs(esk4_0,X9,good)
& program_not_halts2_halts2_outputs(esk4_0,X9,bad)
& program(esk4_0) )
| ~ program(X6)
| ~ program_halts2_halts3_outputs(X6,esk3_1(X6),esk3_1(X6),good)
| ~ program_not_halts2_halts3_outputs(X6,esk3_1(X6),esk3_1(X6),bad) ),
inference(shift_quantors,[status(thm)],[48]) ).
fof(50,plain,
! [X6,X9] :
( ( program_halts2_halts2_outputs(esk4_0,X9,good)
| ~ program(X6)
| ~ program_halts2_halts3_outputs(X6,esk3_1(X6),esk3_1(X6),good)
| ~ program_not_halts2_halts3_outputs(X6,esk3_1(X6),esk3_1(X6),bad) )
& ( program_not_halts2_halts2_outputs(esk4_0,X9,bad)
| ~ program(X6)
| ~ program_halts2_halts3_outputs(X6,esk3_1(X6),esk3_1(X6),good)
| ~ program_not_halts2_halts3_outputs(X6,esk3_1(X6),esk3_1(X6),bad) )
& ( program(esk4_0)
| ~ program(X6)
| ~ program_halts2_halts3_outputs(X6,esk3_1(X6),esk3_1(X6),good)
| ~ program_not_halts2_halts3_outputs(X6,esk3_1(X6),esk3_1(X6),bad) ) ),
inference(distribute,[status(thm)],[49]) ).
cnf(51,plain,
( program(esk4_0)
| ~ program_not_halts2_halts3_outputs(X1,esk3_1(X1),esk3_1(X1),bad)
| ~ program_halts2_halts3_outputs(X1,esk3_1(X1),esk3_1(X1),good)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[50]) ).
cnf(52,plain,
( program_not_halts2_halts2_outputs(esk4_0,X2,bad)
| ~ program_not_halts2_halts3_outputs(X1,esk3_1(X1),esk3_1(X1),bad)
| ~ program_halts2_halts3_outputs(X1,esk3_1(X1),esk3_1(X1),good)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[50]) ).
cnf(53,plain,
( program_halts2_halts2_outputs(esk4_0,X2,good)
| ~ program_not_halts2_halts3_outputs(X1,esk3_1(X1),esk3_1(X1),bad)
| ~ program_halts2_halts3_outputs(X1,esk3_1(X1),esk3_1(X1),good)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[50]) ).
fof(54,plain,
! [X4] :
( ( ~ program_program_decides(X4)
| ( program(X4)
& program_decides(X4) ) )
& ( ~ program(X4)
| ~ program_decides(X4)
| program_program_decides(X4) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(55,plain,
! [X5] :
( ( ~ program_program_decides(X5)
| ( program(X5)
& program_decides(X5) ) )
& ( ~ program(X5)
| ~ program_decides(X5)
| program_program_decides(X5) ) ),
inference(variable_rename,[status(thm)],[54]) ).
fof(56,plain,
! [X5] :
( ( program(X5)
| ~ program_program_decides(X5) )
& ( program_decides(X5)
| ~ program_program_decides(X5) )
& ( ~ program(X5)
| ~ program_decides(X5)
| program_program_decides(X5) ) ),
inference(distribute,[status(thm)],[55]) ).
cnf(59,plain,
( program(X1)
| ~ program_program_decides(X1) ),
inference(split_conjunct,[status(thm)],[56]) ).
fof(66,plain,
! [X4,X2] :
( ( ~ program_not_halts2(X4,X2)
| ( program(X4)
& ~ halts2(X4,X2) ) )
& ( ~ program(X4)
| halts2(X4,X2)
| program_not_halts2(X4,X2) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(67,plain,
! [X5,X6] :
( ( ~ program_not_halts2(X5,X6)
| ( program(X5)
& ~ halts2(X5,X6) ) )
& ( ~ program(X5)
| halts2(X5,X6)
| program_not_halts2(X5,X6) ) ),
inference(variable_rename,[status(thm)],[66]) ).
fof(68,plain,
! [X5,X6] :
( ( program(X5)
| ~ program_not_halts2(X5,X6) )
& ( ~ halts2(X5,X6)
| ~ program_not_halts2(X5,X6) )
& ( ~ program(X5)
| halts2(X5,X6)
| program_not_halts2(X5,X6) ) ),
inference(distribute,[status(thm)],[67]) ).
cnf(69,plain,
( program_not_halts2(X1,X2)
| halts2(X1,X2)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[68]) ).
cnf(70,plain,
( ~ program_not_halts2(X1,X2)
| ~ halts2(X1,X2) ),
inference(split_conjunct,[status(thm)],[68]) ).
fof(72,plain,
! [X4,X2] :
( ( ~ program_halts2(X4,X2)
| ( program(X4)
& halts2(X4,X2) ) )
& ( ~ program(X4)
| ~ halts2(X4,X2)
| program_halts2(X4,X2) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(73,plain,
! [X5,X6] :
( ( ~ program_halts2(X5,X6)
| ( program(X5)
& halts2(X5,X6) ) )
& ( ~ program(X5)
| ~ halts2(X5,X6)
| program_halts2(X5,X6) ) ),
inference(variable_rename,[status(thm)],[72]) ).
fof(74,plain,
! [X5,X6] :
( ( program(X5)
| ~ program_halts2(X5,X6) )
& ( halts2(X5,X6)
| ~ program_halts2(X5,X6) )
& ( ~ program(X5)
| ~ halts2(X5,X6)
| program_halts2(X5,X6) ) ),
inference(distribute,[status(thm)],[73]) ).
cnf(75,plain,
( program_halts2(X1,X2)
| ~ halts2(X1,X2)
| ~ program(X1) ),
inference(split_conjunct,[status(thm)],[74]) ).
cnf(76,plain,
( halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
inference(split_conjunct,[status(thm)],[74]) ).
fof(86,plain,
! [X4,X2,X1] :
( ( ~ program_not_halts2_halts2_outputs(X4,X2,X1)
| ~ program_not_halts2(X2,X2)
| halts2_outputs(X4,X2,X1) )
& ( ( program_not_halts2(X2,X2)
& ~ halts2_outputs(X4,X2,X1) )
| program_not_halts2_halts2_outputs(X4,X2,X1) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(87,plain,
! [X5,X6,X7] :
( ( ~ program_not_halts2_halts2_outputs(X5,X6,X7)
| ~ program_not_halts2(X6,X6)
| halts2_outputs(X5,X6,X7) )
& ( ( program_not_halts2(X6,X6)
& ~ halts2_outputs(X5,X6,X7) )
| program_not_halts2_halts2_outputs(X5,X6,X7) ) ),
inference(variable_rename,[status(thm)],[86]) ).
fof(88,plain,
! [X5,X6,X7] :
( ( ~ program_not_halts2_halts2_outputs(X5,X6,X7)
| ~ program_not_halts2(X6,X6)
| halts2_outputs(X5,X6,X7) )
& ( program_not_halts2(X6,X6)
| program_not_halts2_halts2_outputs(X5,X6,X7) )
& ( ~ halts2_outputs(X5,X6,X7)
| program_not_halts2_halts2_outputs(X5,X6,X7) ) ),
inference(distribute,[status(thm)],[87]) ).
cnf(90,plain,
( program_not_halts2_halts2_outputs(X1,X2,X3)
| program_not_halts2(X2,X2) ),
inference(split_conjunct,[status(thm)],[88]) ).
cnf(91,plain,
( halts2_outputs(X1,X2,X3)
| ~ program_not_halts2(X2,X2)
| ~ program_not_halts2_halts2_outputs(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[88]) ).
fof(92,plain,
( ! [X4] : ~ algorithm_program_decides(X4)
| ? [X1] : program_program_decides(X1) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(93,plain,
( ! [X5] : ~ algorithm_program_decides(X5)
| ? [X6] : program_program_decides(X6) ),
inference(variable_rename,[status(thm)],[92]) ).
fof(94,plain,
( ! [X5] : ~ algorithm_program_decides(X5)
| program_program_decides(esk7_0) ),
inference(skolemize,[status(esa)],[93]) ).
fof(95,plain,
! [X5] :
( ~ algorithm_program_decides(X5)
| program_program_decides(esk7_0) ),
inference(shift_quantors,[status(thm)],[94]) ).
cnf(96,plain,
( program_program_decides(esk7_0)
| ~ algorithm_program_decides(X1) ),
inference(split_conjunct,[status(thm)],[95]) ).
fof(97,negated_conjecture,
? [X4] : algorithm_program_decides(X4),
inference(fof_nnf,[status(thm)],[17]) ).
fof(98,negated_conjecture,
? [X5] : algorithm_program_decides(X5),
inference(variable_rename,[status(thm)],[97]) ).
fof(99,negated_conjecture,
algorithm_program_decides(esk8_0),
inference(skolemize,[status(esa)],[98]) ).
cnf(100,negated_conjecture,
algorithm_program_decides(esk8_0),
inference(split_conjunct,[status(thm)],[99]) ).
fof(101,plain,
! [X4,X2,X1] :
( ( ~ halts2_outputs(X4,X2,X1)
| ( halts2(X4,X2)
& outputs(X4,X1) ) )
& ( ~ halts2(X4,X2)
| ~ outputs(X4,X1)
| halts2_outputs(X4,X2,X1) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(102,plain,
! [X5,X6,X7] :
( ( ~ halts2_outputs(X5,X6,X7)
| ( halts2(X5,X6)
& outputs(X5,X7) ) )
& ( ~ halts2(X5,X6)
| ~ outputs(X5,X7)
| halts2_outputs(X5,X6,X7) ) ),
inference(variable_rename,[status(thm)],[101]) ).
fof(103,plain,
! [X5,X6,X7] :
( ( halts2(X5,X6)
| ~ halts2_outputs(X5,X6,X7) )
& ( outputs(X5,X7)
| ~ halts2_outputs(X5,X6,X7) )
& ( ~ halts2(X5,X6)
| ~ outputs(X5,X7)
| halts2_outputs(X5,X6,X7) ) ),
inference(distribute,[status(thm)],[102]) ).
cnf(106,plain,
( halts2(X1,X2)
| ~ halts2_outputs(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[103]) ).
cnf(120,negated_conjecture,
program_program_decides(esk7_0),
inference(spm,[status(thm)],[96,100,theory(equality)]) ).
cnf(128,plain,
( program_halts2(X1,X2)
| program_not_halts2(X1,X2)
| ~ program(X1) ),
inference(spm,[status(thm)],[75,69,theory(equality)]) ).
fof(137,plain,
( ~ epred1_0
<=> ! [X2] :
( ~ program_halts2(X2,X2)
| ~ halts2(esk2_0,X2) ) ),
introduced(definition),
[split] ).
cnf(138,plain,
( epred1_0
| ~ program_halts2(X2,X2)
| ~ halts2(esk2_0,X2) ),
inference(split_equiv,[status(thm)],[137]) ).
fof(139,plain,
( ~ epred2_0
<=> ! [X1] :
( ~ program(X1)
| ~ program_halts2_halts2_outputs(X1,esk1_1(X1),good)
| ~ program_not_halts2_halts2_outputs(X1,esk1_1(X1),bad) ) ),
introduced(definition),
[split] ).
cnf(140,plain,
( epred2_0
| ~ program(X1)
| ~ program_halts2_halts2_outputs(X1,esk1_1(X1),good)
| ~ program_not_halts2_halts2_outputs(X1,esk1_1(X1),bad) ),
inference(split_equiv,[status(thm)],[139]) ).
cnf(141,plain,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[45,137,theory(equality)]),139,theory(equality)]),
[split] ).
cnf(146,negated_conjecture,
program(esk7_0),
inference(spm,[status(thm)],[59,120,theory(equality)]) ).
cnf(147,negated_conjecture,
program_halts2_halts3_outputs(esk7_0,X1,X2,good),
inference(spm,[status(thm)],[25,120,theory(equality)]) ).
cnf(148,negated_conjecture,
program_not_halts2_halts3_outputs(esk7_0,X1,X2,bad),
inference(spm,[status(thm)],[24,120,theory(equality)]) ).
cnf(153,negated_conjecture,
( program(esk4_0)
| ~ program(esk7_0)
| ~ program_halts2_halts3_outputs(esk7_0,esk3_1(esk7_0),esk3_1(esk7_0),good) ),
inference(spm,[status(thm)],[51,148,theory(equality)]) ).
cnf(154,negated_conjecture,
( program_halts2_halts2_outputs(esk4_0,X1,good)
| ~ program(esk7_0)
| ~ program_halts2_halts3_outputs(esk7_0,esk3_1(esk7_0),esk3_1(esk7_0),good) ),
inference(spm,[status(thm)],[53,148,theory(equality)]) ).
cnf(155,negated_conjecture,
( program_not_halts2_halts2_outputs(esk4_0,X1,bad)
| ~ program(esk7_0)
| ~ program_halts2_halts3_outputs(esk7_0,esk3_1(esk7_0),esk3_1(esk7_0),good) ),
inference(spm,[status(thm)],[52,148,theory(equality)]) ).
cnf(156,negated_conjecture,
( program(esk4_0)
| $false
| ~ program_halts2_halts3_outputs(esk7_0,esk3_1(esk7_0),esk3_1(esk7_0),good) ),
inference(rw,[status(thm)],[153,146,theory(equality)]) ).
cnf(157,negated_conjecture,
( program(esk4_0)
| $false
| $false ),
inference(rw,[status(thm)],[156,147,theory(equality)]) ).
cnf(158,negated_conjecture,
program(esk4_0),
inference(cn,[status(thm)],[157,theory(equality)]) ).
cnf(159,negated_conjecture,
( program_halts2_halts2_outputs(esk4_0,X1,good)
| $false
| ~ program_halts2_halts3_outputs(esk7_0,esk3_1(esk7_0),esk3_1(esk7_0),good) ),
inference(rw,[status(thm)],[154,146,theory(equality)]) ).
cnf(160,negated_conjecture,
( program_halts2_halts2_outputs(esk4_0,X1,good)
| $false
| $false ),
inference(rw,[status(thm)],[159,147,theory(equality)]) ).
cnf(161,negated_conjecture,
program_halts2_halts2_outputs(esk4_0,X1,good),
inference(cn,[status(thm)],[160,theory(equality)]) ).
cnf(162,negated_conjecture,
( program_not_halts2_halts2_outputs(esk4_0,X1,bad)
| $false
| ~ program_halts2_halts3_outputs(esk7_0,esk3_1(esk7_0),esk3_1(esk7_0),good) ),
inference(rw,[status(thm)],[155,146,theory(equality)]) ).
cnf(163,negated_conjecture,
( program_not_halts2_halts2_outputs(esk4_0,X1,bad)
| $false
| $false ),
inference(rw,[status(thm)],[162,147,theory(equality)]) ).
cnf(164,negated_conjecture,
program_not_halts2_halts2_outputs(esk4_0,X1,bad),
inference(cn,[status(thm)],[163,theory(equality)]) ).
cnf(172,negated_conjecture,
( program_not_halts2_halts2_outputs(esk2_0,X1,good)
| ~ program_not_halts2_halts2_outputs(esk4_0,esk1_1(esk4_0),bad)
| ~ program(esk4_0) ),
inference(spm,[status(thm)],[44,161,theory(equality)]) ).
cnf(174,negated_conjecture,
( program_not_halts2_halts2_outputs(esk2_0,X1,good)
| ~ program_not_halts2_halts2_outputs(esk4_0,esk1_1(esk4_0),bad)
| $false ),
inference(rw,[status(thm)],[172,158,theory(equality)]) ).
cnf(175,negated_conjecture,
( program_not_halts2_halts2_outputs(esk2_0,X1,good)
| ~ program_not_halts2_halts2_outputs(esk4_0,esk1_1(esk4_0),bad) ),
inference(cn,[status(thm)],[174,theory(equality)]) ).
cnf(177,negated_conjecture,
( program(esk2_0)
| ~ program_halts2_halts2_outputs(esk4_0,esk1_1(esk4_0),good)
| ~ program(esk4_0) ),
inference(spm,[status(thm)],[43,164,theory(equality)]) ).
cnf(178,negated_conjecture,
( epred2_0
| ~ program_halts2_halts2_outputs(esk4_0,esk1_1(esk4_0),good)
| ~ program(esk4_0) ),
inference(spm,[status(thm)],[140,164,theory(equality)]) ).
cnf(180,negated_conjecture,
( program(esk2_0)
| $false
| ~ program(esk4_0) ),
inference(rw,[status(thm)],[177,161,theory(equality)]) ).
cnf(181,negated_conjecture,
( program(esk2_0)
| $false
| $false ),
inference(rw,[status(thm)],[180,158,theory(equality)]) ).
cnf(182,negated_conjecture,
program(esk2_0),
inference(cn,[status(thm)],[181,theory(equality)]) ).
cnf(183,negated_conjecture,
( epred2_0
| $false
| ~ program(esk4_0) ),
inference(rw,[status(thm)],[178,161,theory(equality)]) ).
cnf(184,negated_conjecture,
( epred2_0
| $false
| $false ),
inference(rw,[status(thm)],[183,158,theory(equality)]) ).
cnf(185,negated_conjecture,
epred2_0,
inference(cn,[status(thm)],[184,theory(equality)]) ).
cnf(188,plain,
( $false
| ~ epred1_0 ),
inference(rw,[status(thm)],[141,185,theory(equality)]) ).
cnf(189,plain,
~ epred1_0,
inference(cn,[status(thm)],[188,theory(equality)]) ).
cnf(371,negated_conjecture,
( program_not_halts2_halts2_outputs(esk2_0,X1,good)
| $false ),
inference(rw,[status(thm)],[175,164,theory(equality)]) ).
cnf(372,negated_conjecture,
program_not_halts2_halts2_outputs(esk2_0,X1,good),
inference(cn,[status(thm)],[371,theory(equality)]) ).
cnf(373,negated_conjecture,
( halts2_outputs(esk2_0,X1,good)
| ~ program_not_halts2(X1,X1) ),
inference(spm,[status(thm)],[91,372,theory(equality)]) ).
cnf(525,negated_conjecture,
( halts2_outputs(esk2_0,X1,good)
| program_not_halts2_halts2_outputs(X2,X1,X3) ),
inference(spm,[status(thm)],[373,90,theory(equality)]) ).
cnf(995,negated_conjecture,
( halts2(esk2_0,X1)
| program_not_halts2_halts2_outputs(X2,X1,X3) ),
inference(spm,[status(thm)],[106,525,theory(equality)]) ).
cnf(1001,negated_conjecture,
( program_not_halts2_halts2_outputs(X2,X1,X3)
| ~ program_not_halts2(esk2_0,X1) ),
inference(spm,[status(thm)],[70,995,theory(equality)]) ).
cnf(1020,negated_conjecture,
( program_not_halts2_halts2_outputs(X1,esk2_0,X2)
| program_not_halts2_halts2_outputs(X3,esk2_0,X4) ),
inference(spm,[status(thm)],[1001,90,theory(equality)]) ).
cnf(1027,negated_conjecture,
program_not_halts2_halts2_outputs(X5,esk2_0,X6),
inference(ef,[status(thm)],[1020,theory(equality)]) ).
cnf(1031,negated_conjecture,
( halts2_outputs(X1,esk2_0,X2)
| ~ program_not_halts2(esk2_0,esk2_0) ),
inference(spm,[status(thm)],[91,1027,theory(equality)]) ).
cnf(1036,negated_conjecture,
( halts2_outputs(X1,esk2_0,X2)
| program_halts2(esk2_0,esk2_0)
| ~ program(esk2_0) ),
inference(spm,[status(thm)],[1031,128,theory(equality)]) ).
cnf(1039,negated_conjecture,
( halts2_outputs(X1,esk2_0,X2)
| program_halts2(esk2_0,esk2_0)
| $false ),
inference(rw,[status(thm)],[1036,182,theory(equality)]) ).
cnf(1040,negated_conjecture,
( halts2_outputs(X1,esk2_0,X2)
| program_halts2(esk2_0,esk2_0) ),
inference(cn,[status(thm)],[1039,theory(equality)]) ).
cnf(1044,negated_conjecture,
( halts2(X1,esk2_0)
| program_halts2(esk2_0,esk2_0) ),
inference(spm,[status(thm)],[106,1040,theory(equality)]) ).
cnf(1061,negated_conjecture,
( program_halts2(X1,esk2_0)
| program_halts2(esk2_0,esk2_0)
| ~ program(X1) ),
inference(spm,[status(thm)],[75,1044,theory(equality)]) ).
cnf(1555,negated_conjecture,
( program_halts2(esk2_0,esk2_0)
| ~ program(esk2_0) ),
inference(ef,[status(thm)],[1061,theory(equality)]) ).
cnf(1570,negated_conjecture,
( program_halts2(esk2_0,esk2_0)
| $false ),
inference(rw,[status(thm)],[1555,182,theory(equality)]) ).
cnf(1571,negated_conjecture,
program_halts2(esk2_0,esk2_0),
inference(cn,[status(thm)],[1570,theory(equality)]) ).
cnf(1578,negated_conjecture,
halts2(esk2_0,esk2_0),
inference(spm,[status(thm)],[76,1571,theory(equality)]) ).
cnf(1617,negated_conjecture,
( epred1_0
| ~ program_halts2(esk2_0,esk2_0) ),
inference(spm,[status(thm)],[138,1578,theory(equality)]) ).
cnf(1621,negated_conjecture,
( epred1_0
| $false ),
inference(rw,[status(thm)],[1617,1571,theory(equality)]) ).
cnf(1622,negated_conjecture,
epred1_0,
inference(cn,[status(thm)],[1621,theory(equality)]) ).
cnf(1623,negated_conjecture,
$false,
inference(sr,[status(thm)],[1622,189,theory(equality)]) ).
cnf(1624,negated_conjecture,
$false,
1623,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/COM/COM003+2.p
% --creating new selector for []
% -running prover on /tmp/tmpuP0HLT/sel_COM003+2.p_1 with time limit 29
% -prover status Theorem
% Problem COM003+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/COM/COM003+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/COM/COM003+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
%
%------------------------------------------------------------------------------