TSTP Solution File: COM003+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM003+2 : TPTP v5.0.0. Bugfixed v2.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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 : Tue Dec 28 22:37:38 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP24618/COM003+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24618/COM003+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24618/COM003+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 24714
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(?[X1]:algorithm_program_decides(X1)=>?[X2]:program_program_decides(X2)),file('/tmp/SRASS.s.p', p1)).
% fof(3, axiom,(?[X2]:(program(X2)&![X3]:(program_halts2_halts3_outputs(X2,X3,X3,good)&program_not_halts2_halts3_outputs(X2,X3,X3,bad)))=>?[X4]:(program(X4)&![X3]:(program_halts2_halts2_outputs(X4,X3,good)&program_not_halts2_halts2_outputs(X4,X3,bad)))),file('/tmp/SRASS.s.p', p3)).
% fof(4, axiom,![X1]:(program_program_decides(X1)<=>(program(X1)&program_decides(X1))),file('/tmp/SRASS.s.p', program_program_decides_def)).
% fof(6, axiom,![X1]:![X3]:(program_halts2(X1,X3)<=>(program(X1)&halts2(X1,X3))),file('/tmp/SRASS.s.p', program_halts2_def)).
% fof(7, axiom,![X2]:(program_program_decides(X2)=>![X3]:![X5]:(program_halts2_halts3_outputs(X2,X3,X5,good)&program_not_halts2_halts3_outputs(X2,X3,X5,bad))),file('/tmp/SRASS.s.p', p2)).
% fof(8, axiom,(?[X4]:(program(X4)&![X3]:(program_halts2_halts2_outputs(X4,X3,good)&program_not_halts2_halts2_outputs(X4,X3,bad)))=>?[X6]:(program(X6)&![X3]:((program_halts2(X3,X3)=>~(halts2(X6,X3)))&program_not_halts2_halts2_outputs(X6,X3,good)))),file('/tmp/SRASS.s.p', p4)).
% fof(9, axiom,![X1]:![X3]:(program_not_halts2(X1,X3)<=>(program(X1)&~(halts2(X1,X3)))),file('/tmp/SRASS.s.p', program_not_halts2_def)).
% fof(10, axiom,![X1]:![X3]:![X2]:(halts2_outputs(X1,X3,X2)<=>(halts2(X1,X3)&outputs(X1,X2))),file('/tmp/SRASS.s.p', halts2_outputs_def)).
% fof(14, axiom,![X1]:![X3]:![X2]:(program_not_halts2_halts2_outputs(X1,X3,X2)<=>(program_not_halts2(X3,X3)=>halts2_outputs(X1,X3,X2))),file('/tmp/SRASS.s.p', program_not_halts2_halts2_outputs_def)).
% fof(16, conjecture,~(?[X1]:algorithm_program_decides(X1)),file('/tmp/SRASS.s.p', prove_this)).
% fof(17, negated_conjecture,~(~(?[X1]:algorithm_program_decides(X1))),inference(assume_negation,[status(cth)],[16])).
% fof(18, plain,(?[X4]:(program(X4)&![X3]:(program_halts2_halts2_outputs(X4,X3,good)&program_not_halts2_halts2_outputs(X4,X3,bad)))=>?[X6]:(program(X6)&![X3]:((program_halts2(X3,X3)=>~(halts2(X6,X3)))&program_not_halts2_halts2_outputs(X6,X3,good)))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(19, plain,![X1]:![X3]:(program_not_halts2(X1,X3)<=>(program(X1)&~(halts2(X1,X3)))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(20, plain,(![X1]:~(algorithm_program_decides(X1))|?[X2]:program_program_decides(X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(21, plain,(![X3]:~(algorithm_program_decides(X3))|?[X4]:program_program_decides(X4)),inference(variable_rename,[status(thm)],[20])).
% fof(22, plain,(![X3]:~(algorithm_program_decides(X3))|program_program_decides(esk1_0)),inference(skolemize,[status(esa)],[21])).
% fof(23, plain,![X3]:(~(algorithm_program_decides(X3))|program_program_decides(esk1_0)),inference(shift_quantors,[status(thm)],[22])).
% cnf(24,plain,(program_program_decides(esk1_0)|~algorithm_program_decides(X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(31, plain,(![X2]:(~(program(X2))|?[X3]:(~(program_halts2_halts3_outputs(X2,X3,X3,good))|~(program_not_halts2_halts3_outputs(X2,X3,X3,bad))))|?[X4]:(program(X4)&![X3]:(program_halts2_halts2_outputs(X4,X3,good)&program_not_halts2_halts2_outputs(X4,X3,bad)))),inference(fof_nnf,[status(thm)],[3])).
% fof(32, plain,(![X5]:(~(program(X5))|?[X6]:(~(program_halts2_halts3_outputs(X5,X6,X6,good))|~(program_not_halts2_halts3_outputs(X5,X6,X6,bad))))|?[X7]:(program(X7)&![X8]:(program_halts2_halts2_outputs(X7,X8,good)&program_not_halts2_halts2_outputs(X7,X8,bad)))),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,(![X5]:(~(program(X5))|(~(program_halts2_halts3_outputs(X5,esk2_1(X5),esk2_1(X5),good))|~(program_not_halts2_halts3_outputs(X5,esk2_1(X5),esk2_1(X5),bad))))|(program(esk3_0)&![X8]:(program_halts2_halts2_outputs(esk3_0,X8,good)&program_not_halts2_halts2_outputs(esk3_0,X8,bad)))),inference(skolemize,[status(esa)],[32])).
% fof(34, plain,![X5]:![X8]:(((program_halts2_halts2_outputs(esk3_0,X8,good)&program_not_halts2_halts2_outputs(esk3_0,X8,bad))&program(esk3_0))|(~(program(X5))|(~(program_halts2_halts3_outputs(X5,esk2_1(X5),esk2_1(X5),good))|~(program_not_halts2_halts3_outputs(X5,esk2_1(X5),esk2_1(X5),bad))))),inference(shift_quantors,[status(thm)],[33])).
% fof(35, plain,![X5]:![X8]:(((program_halts2_halts2_outputs(esk3_0,X8,good)|(~(program(X5))|(~(program_halts2_halts3_outputs(X5,esk2_1(X5),esk2_1(X5),good))|~(program_not_halts2_halts3_outputs(X5,esk2_1(X5),esk2_1(X5),bad)))))&(program_not_halts2_halts2_outputs(esk3_0,X8,bad)|(~(program(X5))|(~(program_halts2_halts3_outputs(X5,esk2_1(X5),esk2_1(X5),good))|~(program_not_halts2_halts3_outputs(X5,esk2_1(X5),esk2_1(X5),bad))))))&(program(esk3_0)|(~(program(X5))|(~(program_halts2_halts3_outputs(X5,esk2_1(X5),esk2_1(X5),good))|~(program_not_halts2_halts3_outputs(X5,esk2_1(X5),esk2_1(X5),bad)))))),inference(distribute,[status(thm)],[34])).
% cnf(36,plain,(program(esk3_0)|~program_not_halts2_halts3_outputs(X1,esk2_1(X1),esk2_1(X1),bad)|~program_halts2_halts3_outputs(X1,esk2_1(X1),esk2_1(X1),good)|~program(X1)),inference(split_conjunct,[status(thm)],[35])).
% cnf(37,plain,(program_not_halts2_halts2_outputs(esk3_0,X2,bad)|~program_not_halts2_halts3_outputs(X1,esk2_1(X1),esk2_1(X1),bad)|~program_halts2_halts3_outputs(X1,esk2_1(X1),esk2_1(X1),good)|~program(X1)),inference(split_conjunct,[status(thm)],[35])).
% cnf(38,plain,(program_halts2_halts2_outputs(esk3_0,X2,good)|~program_not_halts2_halts3_outputs(X1,esk2_1(X1),esk2_1(X1),bad)|~program_halts2_halts3_outputs(X1,esk2_1(X1),esk2_1(X1),good)|~program(X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(39, plain,![X1]:((~(program_program_decides(X1))|(program(X1)&program_decides(X1)))&((~(program(X1))|~(program_decides(X1)))|program_program_decides(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(40, plain,![X2]:((~(program_program_decides(X2))|(program(X2)&program_decides(X2)))&((~(program(X2))|~(program_decides(X2)))|program_program_decides(X2))),inference(variable_rename,[status(thm)],[39])).
% fof(41, plain,![X2]:(((program(X2)|~(program_program_decides(X2)))&(program_decides(X2)|~(program_program_decides(X2))))&((~(program(X2))|~(program_decides(X2)))|program_program_decides(X2))),inference(distribute,[status(thm)],[40])).
% cnf(44,plain,(program(X1)|~program_program_decides(X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(53, plain,![X1]:![X3]:((~(program_halts2(X1,X3))|(program(X1)&halts2(X1,X3)))&((~(program(X1))|~(halts2(X1,X3)))|program_halts2(X1,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(54, plain,![X4]:![X5]:((~(program_halts2(X4,X5))|(program(X4)&halts2(X4,X5)))&((~(program(X4))|~(halts2(X4,X5)))|program_halts2(X4,X5))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X4]:![X5]:(((program(X4)|~(program_halts2(X4,X5)))&(halts2(X4,X5)|~(program_halts2(X4,X5))))&((~(program(X4))|~(halts2(X4,X5)))|program_halts2(X4,X5))),inference(distribute,[status(thm)],[54])).
% cnf(56,plain,(program_halts2(X1,X2)|~halts2(X1,X2)|~program(X1)),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,plain,(halts2(X1,X2)|~program_halts2(X1,X2)),inference(split_conjunct,[status(thm)],[55])).
% fof(59, plain,![X2]:(~(program_program_decides(X2))|![X3]:![X5]:(program_halts2_halts3_outputs(X2,X3,X5,good)&program_not_halts2_halts3_outputs(X2,X3,X5,bad))),inference(fof_nnf,[status(thm)],[7])).
% fof(60, plain,![X6]:(~(program_program_decides(X6))|![X7]:![X8]:(program_halts2_halts3_outputs(X6,X7,X8,good)&program_not_halts2_halts3_outputs(X6,X7,X8,bad))),inference(variable_rename,[status(thm)],[59])).
% fof(61, plain,![X6]:![X7]:![X8]:((program_halts2_halts3_outputs(X6,X7,X8,good)&program_not_halts2_halts3_outputs(X6,X7,X8,bad))|~(program_program_decides(X6))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,![X6]:![X7]:![X8]:((program_halts2_halts3_outputs(X6,X7,X8,good)|~(program_program_decides(X6)))&(program_not_halts2_halts3_outputs(X6,X7,X8,bad)|~(program_program_decides(X6)))),inference(distribute,[status(thm)],[61])).
% cnf(63,plain,(program_not_halts2_halts3_outputs(X1,X2,X3,bad)|~program_program_decides(X1)),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,plain,(program_halts2_halts3_outputs(X1,X2,X3,good)|~program_program_decides(X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(65, plain,(![X4]:(~(program(X4))|?[X3]:(~(program_halts2_halts2_outputs(X4,X3,good))|~(program_not_halts2_halts2_outputs(X4,X3,bad))))|?[X6]:(program(X6)&![X3]:((~(program_halts2(X3,X3))|~(halts2(X6,X3)))&program_not_halts2_halts2_outputs(X6,X3,good)))),inference(fof_nnf,[status(thm)],[18])).
% fof(66, 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)],[65])).
% fof(67, plain,(![X7]:(~(program(X7))|(~(program_halts2_halts2_outputs(X7,esk6_1(X7),good))|~(program_not_halts2_halts2_outputs(X7,esk6_1(X7),bad))))|(program(esk7_0)&![X10]:((~(program_halts2(X10,X10))|~(halts2(esk7_0,X10)))&program_not_halts2_halts2_outputs(esk7_0,X10,good)))),inference(skolemize,[status(esa)],[66])).
% fof(68, plain,![X7]:![X10]:((((~(program_halts2(X10,X10))|~(halts2(esk7_0,X10)))&program_not_halts2_halts2_outputs(esk7_0,X10,good))&program(esk7_0))|(~(program(X7))|(~(program_halts2_halts2_outputs(X7,esk6_1(X7),good))|~(program_not_halts2_halts2_outputs(X7,esk6_1(X7),bad))))),inference(shift_quantors,[status(thm)],[67])).
% fof(69, plain,![X7]:![X10]:((((~(program_halts2(X10,X10))|~(halts2(esk7_0,X10)))|(~(program(X7))|(~(program_halts2_halts2_outputs(X7,esk6_1(X7),good))|~(program_not_halts2_halts2_outputs(X7,esk6_1(X7),bad)))))&(program_not_halts2_halts2_outputs(esk7_0,X10,good)|(~(program(X7))|(~(program_halts2_halts2_outputs(X7,esk6_1(X7),good))|~(program_not_halts2_halts2_outputs(X7,esk6_1(X7),bad))))))&(program(esk7_0)|(~(program(X7))|(~(program_halts2_halts2_outputs(X7,esk6_1(X7),good))|~(program_not_halts2_halts2_outputs(X7,esk6_1(X7),bad)))))),inference(distribute,[status(thm)],[68])).
% cnf(70,plain,(program(esk7_0)|~program_not_halts2_halts2_outputs(X1,esk6_1(X1),bad)|~program_halts2_halts2_outputs(X1,esk6_1(X1),good)|~program(X1)),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,plain,(program_not_halts2_halts2_outputs(esk7_0,X2,good)|~program_not_halts2_halts2_outputs(X1,esk6_1(X1),bad)|~program_halts2_halts2_outputs(X1,esk6_1(X1),good)|~program(X1)),inference(split_conjunct,[status(thm)],[69])).
% cnf(72,plain,(~program_not_halts2_halts2_outputs(X1,esk6_1(X1),bad)|~program_halts2_halts2_outputs(X1,esk6_1(X1),good)|~program(X1)|~halts2(esk7_0,X2)|~program_halts2(X2,X2)),inference(split_conjunct,[status(thm)],[69])).
% fof(73, plain,![X1]:![X3]:((~(program_not_halts2(X1,X3))|(program(X1)&~(halts2(X1,X3))))&((~(program(X1))|halts2(X1,X3))|program_not_halts2(X1,X3))),inference(fof_nnf,[status(thm)],[19])).
% fof(74, plain,![X4]:![X5]:((~(program_not_halts2(X4,X5))|(program(X4)&~(halts2(X4,X5))))&((~(program(X4))|halts2(X4,X5))|program_not_halts2(X4,X5))),inference(variable_rename,[status(thm)],[73])).
% fof(75, plain,![X4]:![X5]:(((program(X4)|~(program_not_halts2(X4,X5)))&(~(halts2(X4,X5))|~(program_not_halts2(X4,X5))))&((~(program(X4))|halts2(X4,X5))|program_not_halts2(X4,X5))),inference(distribute,[status(thm)],[74])).
% cnf(76,plain,(program_not_halts2(X1,X2)|halts2(X1,X2)|~program(X1)),inference(split_conjunct,[status(thm)],[75])).
% cnf(77,plain,(~program_not_halts2(X1,X2)|~halts2(X1,X2)),inference(split_conjunct,[status(thm)],[75])).
% fof(79, plain,![X1]:![X3]:![X2]:((~(halts2_outputs(X1,X3,X2))|(halts2(X1,X3)&outputs(X1,X2)))&((~(halts2(X1,X3))|~(outputs(X1,X2)))|halts2_outputs(X1,X3,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(80, plain,![X4]:![X5]:![X6]:((~(halts2_outputs(X4,X5,X6))|(halts2(X4,X5)&outputs(X4,X6)))&((~(halts2(X4,X5))|~(outputs(X4,X6)))|halts2_outputs(X4,X5,X6))),inference(variable_rename,[status(thm)],[79])).
% fof(81, plain,![X4]:![X5]:![X6]:(((halts2(X4,X5)|~(halts2_outputs(X4,X5,X6)))&(outputs(X4,X6)|~(halts2_outputs(X4,X5,X6))))&((~(halts2(X4,X5))|~(outputs(X4,X6)))|halts2_outputs(X4,X5,X6))),inference(distribute,[status(thm)],[80])).
% cnf(84,plain,(halts2(X1,X2)|~halts2_outputs(X1,X2,X3)),inference(split_conjunct,[status(thm)],[81])).
% fof(103, plain,![X1]:![X3]:![X2]:((~(program_not_halts2_halts2_outputs(X1,X3,X2))|(~(program_not_halts2(X3,X3))|halts2_outputs(X1,X3,X2)))&((program_not_halts2(X3,X3)&~(halts2_outputs(X1,X3,X2)))|program_not_halts2_halts2_outputs(X1,X3,X2))),inference(fof_nnf,[status(thm)],[14])).
% fof(104, plain,![X4]:![X5]:![X6]:((~(program_not_halts2_halts2_outputs(X4,X5,X6))|(~(program_not_halts2(X5,X5))|halts2_outputs(X4,X5,X6)))&((program_not_halts2(X5,X5)&~(halts2_outputs(X4,X5,X6)))|program_not_halts2_halts2_outputs(X4,X5,X6))),inference(variable_rename,[status(thm)],[103])).
% fof(105, plain,![X4]:![X5]:![X6]:((~(program_not_halts2_halts2_outputs(X4,X5,X6))|(~(program_not_halts2(X5,X5))|halts2_outputs(X4,X5,X6)))&((program_not_halts2(X5,X5)|program_not_halts2_halts2_outputs(X4,X5,X6))&(~(halts2_outputs(X4,X5,X6))|program_not_halts2_halts2_outputs(X4,X5,X6)))),inference(distribute,[status(thm)],[104])).
% cnf(108,plain,(halts2_outputs(X1,X2,X3)|~program_not_halts2(X2,X2)|~program_not_halts2_halts2_outputs(X1,X2,X3)),inference(split_conjunct,[status(thm)],[105])).
% fof(115, negated_conjecture,?[X1]:algorithm_program_decides(X1),inference(fof_nnf,[status(thm)],[17])).
% fof(116, negated_conjecture,?[X2]:algorithm_program_decides(X2),inference(variable_rename,[status(thm)],[115])).
% fof(117, negated_conjecture,algorithm_program_decides(esk8_0),inference(skolemize,[status(esa)],[116])).
% cnf(118,negated_conjecture,(algorithm_program_decides(esk8_0)),inference(split_conjunct,[status(thm)],[117])).
% cnf(119,negated_conjecture,(program_program_decides(esk1_0)),inference(spm,[status(thm)],[24,118,theory(equality)])).
% cnf(127,plain,(program_halts2(X1,X2)|program_not_halts2(X1,X2)|~program(X1)),inference(spm,[status(thm)],[56,76,theory(equality)])).
% cnf(150,plain,(program(esk3_0)|~program_halts2_halts3_outputs(X1,esk2_1(X1),esk2_1(X1),good)|~program(X1)|~program_program_decides(X1)),inference(spm,[status(thm)],[36,63,theory(equality)])).
% cnf(152,plain,(program_halts2_halts2_outputs(esk3_0,X1,good)|~program_halts2_halts3_outputs(X2,esk2_1(X2),esk2_1(X2),good)|~program(X2)|~program_program_decides(X2)),inference(spm,[status(thm)],[38,63,theory(equality)])).
% cnf(154,plain,(program_not_halts2_halts2_outputs(esk3_0,X1,bad)|~program_halts2_halts3_outputs(X2,esk2_1(X2),esk2_1(X2),good)|~program(X2)|~program_program_decides(X2)),inference(spm,[status(thm)],[37,63,theory(equality)])).
% fof(156, plain,(~(epred1_0)<=>![X2]:(~(halts2(esk7_0,X2))|~(program_halts2(X2,X2)))),introduced(definition),['split']).
% cnf(157,plain,(epred1_0|~program_halts2(X2,X2)|~halts2(esk7_0,X2)),inference(split_equiv,[status(thm)],[156])).
% fof(158, plain,(~(epred2_0)<=>![X1]:((~(program_not_halts2_halts2_outputs(X1,esk6_1(X1),bad))|~(program_halts2_halts2_outputs(X1,esk6_1(X1),good)))|~(program(X1)))),introduced(definition),['split']).
% cnf(159,plain,(epred2_0|~program(X1)|~program_halts2_halts2_outputs(X1,esk6_1(X1),good)|~program_not_halts2_halts2_outputs(X1,esk6_1(X1),bad)),inference(split_equiv,[status(thm)],[158])).
% cnf(160,plain,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[72,156,theory(equality)]),158,theory(equality)]),['split']).
% cnf(165,plain,(epred1_0|program_not_halts2(esk7_0,X1)|~program_halts2(X1,X1)|~program(esk7_0)),inference(spm,[status(thm)],[157,76,theory(equality)])).
% cnf(172,plain,(halts2_outputs(X1,X2,X3)|program_halts2(X2,X2)|~program_not_halts2_halts2_outputs(X1,X2,X3)|~program(X2)),inference(spm,[status(thm)],[108,127,theory(equality)])).
% cnf(377,plain,(program(esk3_0)|~program_halts2_halts3_outputs(X1,esk2_1(X1),esk2_1(X1),good)|~program_program_decides(X1)),inference(csr,[status(thm)],[150,44])).
% cnf(378,plain,(program(esk3_0)|~program_program_decides(X1)),inference(csr,[status(thm)],[377,64])).
% cnf(379,negated_conjecture,(program(esk3_0)),inference(spm,[status(thm)],[378,119,theory(equality)])).
% cnf(399,plain,(program_halts2_halts2_outputs(esk3_0,X1,good)|~program_halts2_halts3_outputs(X2,esk2_1(X2),esk2_1(X2),good)|~program_program_decides(X2)),inference(csr,[status(thm)],[152,44])).
% cnf(400,plain,(program_halts2_halts2_outputs(esk3_0,X1,good)|~program_program_decides(X2)),inference(csr,[status(thm)],[399,64])).
% cnf(401,negated_conjecture,(program_halts2_halts2_outputs(esk3_0,X1,good)),inference(spm,[status(thm)],[400,119,theory(equality)])).
% cnf(433,plain,(program_not_halts2_halts2_outputs(esk3_0,X1,bad)|~program_halts2_halts3_outputs(X2,esk2_1(X2),esk2_1(X2),good)|~program_program_decides(X2)),inference(csr,[status(thm)],[154,44])).
% cnf(434,plain,(program_not_halts2_halts2_outputs(esk3_0,X1,bad)|~program_program_decides(X2)),inference(csr,[status(thm)],[433,64])).
% cnf(435,negated_conjecture,(program_not_halts2_halts2_outputs(esk3_0,X1,bad)),inference(spm,[status(thm)],[434,119,theory(equality)])).
% cnf(445,negated_conjecture,(program(esk7_0)|~program_halts2_halts2_outputs(esk3_0,esk6_1(esk3_0),good)|~program(esk3_0)),inference(spm,[status(thm)],[70,435,theory(equality)])).
% cnf(446,negated_conjecture,(epred2_0|~program_halts2_halts2_outputs(esk3_0,esk6_1(esk3_0),good)|~program(esk3_0)),inference(spm,[status(thm)],[159,435,theory(equality)])).
% cnf(447,negated_conjecture,(program_not_halts2_halts2_outputs(esk7_0,X1,good)|~program_halts2_halts2_outputs(esk3_0,esk6_1(esk3_0),good)|~program(esk3_0)),inference(spm,[status(thm)],[71,435,theory(equality)])).
% cnf(451,negated_conjecture,(program(esk7_0)|$false|~program(esk3_0)),inference(rw,[status(thm)],[445,401,theory(equality)])).
% cnf(452,negated_conjecture,(program(esk7_0)|$false|$false),inference(rw,[status(thm)],[451,379,theory(equality)])).
% cnf(453,negated_conjecture,(program(esk7_0)),inference(cn,[status(thm)],[452,theory(equality)])).
% cnf(454,negated_conjecture,(epred2_0|$false|~program(esk3_0)),inference(rw,[status(thm)],[446,401,theory(equality)])).
% cnf(455,negated_conjecture,(epred2_0|$false|$false),inference(rw,[status(thm)],[454,379,theory(equality)])).
% cnf(456,negated_conjecture,(epred2_0),inference(cn,[status(thm)],[455,theory(equality)])).
% cnf(457,negated_conjecture,(program_not_halts2_halts2_outputs(esk7_0,X1,good)|$false|~program(esk3_0)),inference(rw,[status(thm)],[447,401,theory(equality)])).
% cnf(458,negated_conjecture,(program_not_halts2_halts2_outputs(esk7_0,X1,good)|$false|$false),inference(rw,[status(thm)],[457,379,theory(equality)])).
% cnf(459,negated_conjecture,(program_not_halts2_halts2_outputs(esk7_0,X1,good)),inference(cn,[status(thm)],[458,theory(equality)])).
% cnf(482,plain,($false|~epred1_0),inference(rw,[status(thm)],[160,456,theory(equality)])).
% cnf(483,plain,(~epred1_0),inference(cn,[status(thm)],[482,theory(equality)])).
% cnf(497,plain,(epred1_0|program_not_halts2(esk7_0,X1)|~program_halts2(X1,X1)|$false),inference(rw,[status(thm)],[165,453,theory(equality)])).
% cnf(498,plain,(epred1_0|program_not_halts2(esk7_0,X1)|~program_halts2(X1,X1)),inference(cn,[status(thm)],[497,theory(equality)])).
% cnf(509,plain,(program_not_halts2(esk7_0,X1)|~program_halts2(X1,X1)),inference(sr,[status(thm)],[498,483,theory(equality)])).
% cnf(528,negated_conjecture,(halts2_outputs(esk7_0,X1,good)|program_halts2(X1,X1)|~program(X1)),inference(spm,[status(thm)],[172,459,theory(equality)])).
% cnf(598,negated_conjecture,(halts2_outputs(esk7_0,esk7_0,good)|program_halts2(esk7_0,esk7_0)),inference(spm,[status(thm)],[528,453,theory(equality)])).
% cnf(602,negated_conjecture,(halts2(esk7_0,esk7_0)|program_halts2(esk7_0,esk7_0)),inference(spm,[status(thm)],[84,598,theory(equality)])).
% cnf(607,negated_conjecture,(halts2(esk7_0,esk7_0)),inference(csr,[status(thm)],[602,57])).
% cnf(608,negated_conjecture,(program_halts2(esk7_0,esk7_0)|~program(esk7_0)),inference(spm,[status(thm)],[56,607,theory(equality)])).
% cnf(609,negated_conjecture,(~program_not_halts2(esk7_0,esk7_0)),inference(spm,[status(thm)],[77,607,theory(equality)])).
% cnf(611,negated_conjecture,(program_halts2(esk7_0,esk7_0)|$false),inference(rw,[status(thm)],[608,453,theory(equality)])).
% cnf(612,negated_conjecture,(program_halts2(esk7_0,esk7_0)),inference(cn,[status(thm)],[611,theory(equality)])).
% cnf(622,negated_conjecture,(program_not_halts2(esk7_0,esk7_0)),inference(spm,[status(thm)],[509,612,theory(equality)])).
% cnf(626,negated_conjecture,($false),inference(sr,[status(thm)],[622,609,theory(equality)])).
% cnf(627,negated_conjecture,($false),626,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 230
% # ...of these trivial : 0
% # ...subsumed : 53
% # ...remaining for further processing: 177
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 16
% # Backward-rewritten : 42
% # Generated clauses : 344
% # ...of the previous two non-trivial : 303
% # Contextual simplify-reflections : 67
% # Paramodulations : 341
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 118
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 104
% # Current number of unprocessed clauses: 33
% # ...number of literals in the above : 110
% # Clause-clause subsumption calls (NU) : 578
% # Rec. Clause-clause subsumption calls : 385
% # Unit Clause-clause subsumption calls : 151
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 66 leaves, 1.48+/-1.048 terms/leaf
% # Paramod-from index: 35 leaves, 1.29+/-0.700 terms/leaf
% # Paramod-into index: 53 leaves, 1.38+/-0.916 terms/leaf
% # -------------------------------------------------
% # User time : 0.037 s
% # System time : 0.004 s
% # Total time : 0.041 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.22 WC
% FINAL PrfWatch: 0.12 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP24618/COM003+2.tptp
%
%------------------------------------------------------------------------------