TSTP Solution File: COM003+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM003+1 : TPTP v5.0.0. Released v2.0.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:22 EST 2010
% Result : Theorem 3.08s
% Output : Solution 3.08s
% 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/SystemOnTPTP24359/COM003+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24359/COM003+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24359/COM003+1.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 24455
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.92 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(?[X1]:(algorithm(X1)&![X2]:(program(X2)=>![X3]:decides(X1,X2,X3)))=>?[X4]:(program(X4)&![X2]:(program(X2)=>![X3]:decides(X4,X2,X3)))),file('/tmp/SRASS.s.p', p1)).
% fof(2, axiom,(?[X4]:(program(X4)&![X2]:(((program(X2)&halts2(X2,X2))=>(halts3(X4,X2,X2)&outputs(X4,good)))&((program(X2)&~(halts2(X2,X2)))=>(halts3(X4,X2,X2)&outputs(X4,bad)))))=>?[X5]:(program(X5)&![X2]:(((program(X2)&halts2(X2,X2))=>(halts2(X5,X2)&outputs(X5,good)))&((program(X2)&~(halts2(X2,X2)))=>(halts2(X5,X2)&outputs(X5,bad)))))),file('/tmp/SRASS.s.p', p3)).
% fof(3, axiom,(?[X5]:(program(X5)&![X2]:(((program(X2)&halts2(X2,X2))=>(halts2(X5,X2)&outputs(X5,good)))&((program(X2)&~(halts2(X2,X2)))=>(halts2(X5,X2)&outputs(X5,bad)))))=>?[X6]:(program(X6)&![X2]:(((program(X2)&halts2(X2,X2))=>~(halts2(X6,X2)))&((program(X2)&~(halts2(X2,X2)))=>(halts2(X6,X2)&outputs(X6,bad)))))),file('/tmp/SRASS.s.p', p4)).
% fof(4, axiom,![X4]:((program(X4)&![X2]:(program(X2)=>![X3]:decides(X4,X2,X3)))=>![X2]:![X3]:(((program(X2)&halts2(X2,X3))=>(halts3(X4,X2,X3)&outputs(X4,good)))&((program(X2)&~(halts2(X2,X3)))=>(halts3(X4,X2,X3)&outputs(X4,bad))))),file('/tmp/SRASS.s.p', p2)).
% fof(5, conjecture,~(?[X7]:(algorithm(X7)&![X8]:(program(X8)=>![X9]:decides(X7,X8,X9)))),file('/tmp/SRASS.s.p', prove_this)).
% fof(6, negated_conjecture,~(~(?[X7]:(algorithm(X7)&![X8]:(program(X8)=>![X9]:decides(X7,X8,X9))))),inference(assume_negation,[status(cth)],[5])).
% fof(7, plain,(?[X4]:(program(X4)&![X2]:(((program(X2)&halts2(X2,X2))=>(halts3(X4,X2,X2)&outputs(X4,good)))&((program(X2)&~(halts2(X2,X2)))=>(halts3(X4,X2,X2)&outputs(X4,bad)))))=>?[X5]:(program(X5)&![X2]:(((program(X2)&halts2(X2,X2))=>(halts2(X5,X2)&outputs(X5,good)))&((program(X2)&~(halts2(X2,X2)))=>(halts2(X5,X2)&outputs(X5,bad)))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(8, plain,(?[X5]:(program(X5)&![X2]:(((program(X2)&halts2(X2,X2))=>(halts2(X5,X2)&outputs(X5,good)))&((program(X2)&~(halts2(X2,X2)))=>(halts2(X5,X2)&outputs(X5,bad)))))=>?[X6]:(program(X6)&![X2]:(((program(X2)&halts2(X2,X2))=>~(halts2(X6,X2)))&((program(X2)&~(halts2(X2,X2)))=>(halts2(X6,X2)&outputs(X6,bad)))))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(9, plain,![X4]:((program(X4)&![X2]:(program(X2)=>![X3]:decides(X4,X2,X3)))=>![X2]:![X3]:(((program(X2)&halts2(X2,X3))=>(halts3(X4,X2,X3)&outputs(X4,good)))&((program(X2)&~(halts2(X2,X3)))=>(halts3(X4,X2,X3)&outputs(X4,bad))))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(10, plain,(![X1]:(~(algorithm(X1))|?[X2]:(program(X2)&?[X3]:~(decides(X1,X2,X3))))|?[X4]:(program(X4)&![X2]:(~(program(X2))|![X3]:decides(X4,X2,X3)))),inference(fof_nnf,[status(thm)],[1])).
% fof(11, plain,(![X5]:(~(algorithm(X5))|?[X6]:(program(X6)&?[X7]:~(decides(X5,X6,X7))))|?[X8]:(program(X8)&![X9]:(~(program(X9))|![X10]:decides(X8,X9,X10)))),inference(variable_rename,[status(thm)],[10])).
% fof(12, plain,(![X5]:(~(algorithm(X5))|(program(esk1_1(X5))&~(decides(X5,esk1_1(X5),esk2_1(X5)))))|(program(esk3_0)&![X9]:(~(program(X9))|![X10]:decides(esk3_0,X9,X10)))),inference(skolemize,[status(esa)],[11])).
% fof(13, plain,![X5]:![X9]:![X10]:(((decides(esk3_0,X9,X10)|~(program(X9)))&program(esk3_0))|(~(algorithm(X5))|(program(esk1_1(X5))&~(decides(X5,esk1_1(X5),esk2_1(X5)))))),inference(shift_quantors,[status(thm)],[12])).
% fof(14, plain,![X5]:![X9]:![X10]:((((program(esk1_1(X5))|~(algorithm(X5)))|(decides(esk3_0,X9,X10)|~(program(X9))))&((~(decides(X5,esk1_1(X5),esk2_1(X5)))|~(algorithm(X5)))|(decides(esk3_0,X9,X10)|~(program(X9)))))&(((program(esk1_1(X5))|~(algorithm(X5)))|program(esk3_0))&((~(decides(X5,esk1_1(X5),esk2_1(X5)))|~(algorithm(X5)))|program(esk3_0)))),inference(distribute,[status(thm)],[13])).
% cnf(15,plain,(program(esk3_0)|~algorithm(X1)|~decides(X1,esk1_1(X1),esk2_1(X1))),inference(split_conjunct,[status(thm)],[14])).
% cnf(16,plain,(program(esk3_0)|program(esk1_1(X1))|~algorithm(X1)),inference(split_conjunct,[status(thm)],[14])).
% cnf(17,plain,(decides(esk3_0,X1,X2)|~program(X1)|~algorithm(X3)|~decides(X3,esk1_1(X3),esk2_1(X3))),inference(split_conjunct,[status(thm)],[14])).
% cnf(18,plain,(decides(esk3_0,X1,X2)|program(esk1_1(X3))|~program(X1)|~algorithm(X3)),inference(split_conjunct,[status(thm)],[14])).
% fof(19, plain,(![X4]:(~(program(X4))|?[X2]:(((program(X2)&halts2(X2,X2))&(~(halts3(X4,X2,X2))|~(outputs(X4,good))))|((program(X2)&~(halts2(X2,X2)))&(~(halts3(X4,X2,X2))|~(outputs(X4,bad))))))|?[X5]:(program(X5)&![X2]:(((~(program(X2))|~(halts2(X2,X2)))|(halts2(X5,X2)&outputs(X5,good)))&((~(program(X2))|halts2(X2,X2))|(halts2(X5,X2)&outputs(X5,bad)))))),inference(fof_nnf,[status(thm)],[7])).
% fof(20, plain,(![X6]:(~(program(X6))|?[X7]:(((program(X7)&halts2(X7,X7))&(~(halts3(X6,X7,X7))|~(outputs(X6,good))))|((program(X7)&~(halts2(X7,X7)))&(~(halts3(X6,X7,X7))|~(outputs(X6,bad))))))|?[X8]:(program(X8)&![X9]:(((~(program(X9))|~(halts2(X9,X9)))|(halts2(X8,X9)&outputs(X8,good)))&((~(program(X9))|halts2(X9,X9))|(halts2(X8,X9)&outputs(X8,bad)))))),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,(![X6]:(~(program(X6))|(((program(esk4_1(X6))&halts2(esk4_1(X6),esk4_1(X6)))&(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|((program(esk4_1(X6))&~(halts2(esk4_1(X6),esk4_1(X6))))&(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad))))))|(program(esk5_0)&![X9]:(((~(program(X9))|~(halts2(X9,X9)))|(halts2(esk5_0,X9)&outputs(esk5_0,good)))&((~(program(X9))|halts2(X9,X9))|(halts2(esk5_0,X9)&outputs(esk5_0,bad)))))),inference(skolemize,[status(esa)],[20])).
% fof(22, plain,![X6]:![X9]:(((((~(program(X9))|~(halts2(X9,X9)))|(halts2(esk5_0,X9)&outputs(esk5_0,good)))&((~(program(X9))|halts2(X9,X9))|(halts2(esk5_0,X9)&outputs(esk5_0,bad))))&program(esk5_0))|(~(program(X6))|(((program(esk4_1(X6))&halts2(esk4_1(X6),esk4_1(X6)))&(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|((program(esk4_1(X6))&~(halts2(esk4_1(X6),esk4_1(X6))))&(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad))))))),inference(shift_quantors,[status(thm)],[21])).
% fof(23, plain,![X6]:![X9]:((((((((((program(esk4_1(X6))|program(esk4_1(X6)))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|~(halts2(X9,X9)))))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|program(esk4_1(X6)))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|~(halts2(X9,X9))))))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|program(esk4_1(X6)))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|~(halts2(X9,X9))))))&(((((program(esk4_1(X6))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|~(halts2(X9,X9)))))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|~(halts2(X9,X9))))))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|~(halts2(X9,X9)))))))&(((((program(esk4_1(X6))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|~(halts2(X9,X9)))))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|~(halts2(X9,X9))))))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|~(halts2(X9,X9)))))))&(((((((program(esk4_1(X6))|program(esk4_1(X6)))|~(program(X6)))|(outputs(esk5_0,good)|(~(program(X9))|~(halts2(X9,X9)))))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|program(esk4_1(X6)))|~(program(X6)))|(outputs(esk5_0,good)|(~(program(X9))|~(halts2(X9,X9))))))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|program(esk4_1(X6)))|~(program(X6)))|(outputs(esk5_0,good)|(~(program(X9))|~(halts2(X9,X9))))))&(((((program(esk4_1(X6))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|(outputs(esk5_0,good)|(~(program(X9))|~(halts2(X9,X9)))))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|(outputs(esk5_0,good)|(~(program(X9))|~(halts2(X9,X9))))))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|(outputs(esk5_0,good)|(~(program(X9))|~(halts2(X9,X9)))))))&(((((program(esk4_1(X6))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|(outputs(esk5_0,good)|(~(program(X9))|~(halts2(X9,X9)))))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|(outputs(esk5_0,good)|(~(program(X9))|~(halts2(X9,X9))))))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|(outputs(esk5_0,good)|(~(program(X9))|~(halts2(X9,X9))))))))&((((((((program(esk4_1(X6))|program(esk4_1(X6)))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|halts2(X9,X9))))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|program(esk4_1(X6)))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|halts2(X9,X9)))))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|program(esk4_1(X6)))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|halts2(X9,X9)))))&(((((program(esk4_1(X6))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|halts2(X9,X9))))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|halts2(X9,X9)))))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|halts2(X9,X9))))))&(((((program(esk4_1(X6))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|halts2(X9,X9))))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|halts2(X9,X9)))))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|(halts2(esk5_0,X9)|(~(program(X9))|halts2(X9,X9))))))&(((((((program(esk4_1(X6))|program(esk4_1(X6)))|~(program(X6)))|(outputs(esk5_0,bad)|(~(program(X9))|halts2(X9,X9))))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|program(esk4_1(X6)))|~(program(X6)))|(outputs(esk5_0,bad)|(~(program(X9))|halts2(X9,X9)))))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|program(esk4_1(X6)))|~(program(X6)))|(outputs(esk5_0,bad)|(~(program(X9))|halts2(X9,X9)))))&(((((program(esk4_1(X6))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|(outputs(esk5_0,bad)|(~(program(X9))|halts2(X9,X9))))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|(outputs(esk5_0,bad)|(~(program(X9))|halts2(X9,X9)))))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|(outputs(esk5_0,bad)|(~(program(X9))|halts2(X9,X9))))))&(((((program(esk4_1(X6))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|(outputs(esk5_0,bad)|(~(program(X9))|halts2(X9,X9))))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|(outputs(esk5_0,bad)|(~(program(X9))|halts2(X9,X9)))))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|(outputs(esk5_0,bad)|(~(program(X9))|halts2(X9,X9))))))))&(((((((program(esk4_1(X6))|program(esk4_1(X6)))|~(program(X6)))|program(esk5_0))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|program(esk4_1(X6)))|~(program(X6)))|program(esk5_0)))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|program(esk4_1(X6)))|~(program(X6)))|program(esk5_0)))&(((((program(esk4_1(X6))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|program(esk5_0))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|program(esk5_0)))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|halts2(esk4_1(X6),esk4_1(X6)))|~(program(X6)))|program(esk5_0))))&(((((program(esk4_1(X6))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|program(esk5_0))&(((~(halts2(esk4_1(X6),esk4_1(X6)))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|program(esk5_0)))&((((~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,bad)))|(~(halts3(X6,esk4_1(X6),esk4_1(X6)))|~(outputs(X6,good))))|~(program(X6)))|program(esk5_0))))),inference(distribute,[status(thm)],[22])).
% cnf(24,plain,(program(esk5_0)|~program(X1)|~outputs(X1,good)|~halts3(X1,esk4_1(X1),esk4_1(X1))|~outputs(X1,bad)|~halts3(X1,esk4_1(X1),esk4_1(X1))),inference(split_conjunct,[status(thm)],[23])).
% cnf(25,plain,(program(esk5_0)|~program(X1)|~outputs(X1,good)|~halts3(X1,esk4_1(X1),esk4_1(X1))|~halts2(esk4_1(X1),esk4_1(X1))),inference(split_conjunct,[status(thm)],[23])).
% cnf(27,plain,(program(esk5_0)|halts2(esk4_1(X1),esk4_1(X1))|~program(X1)|~outputs(X1,bad)|~halts3(X1,esk4_1(X1),esk4_1(X1))),inference(split_conjunct,[status(thm)],[23])).
% cnf(32,plain,(program(esk5_0)|program(esk4_1(X1))|program(esk4_1(X1))|~program(X1)),inference(split_conjunct,[status(thm)],[23])).
% cnf(33,plain,(halts2(X1,X1)|outputs(esk5_0,bad)|~program(X1)|~program(X2)|~outputs(X2,good)|~halts3(X2,esk4_1(X2),esk4_1(X2))|~outputs(X2,bad)|~halts3(X2,esk4_1(X2),esk4_1(X2))),inference(split_conjunct,[status(thm)],[23])).
% cnf(41,plain,(halts2(X1,X1)|outputs(esk5_0,bad)|program(esk4_1(X2))|program(esk4_1(X2))|~program(X1)|~program(X2)),inference(split_conjunct,[status(thm)],[23])).
% cnf(42,plain,(halts2(X1,X1)|halts2(esk5_0,X1)|~program(X1)|~program(X2)|~outputs(X2,good)|~halts3(X2,esk4_1(X2),esk4_1(X2))|~outputs(X2,bad)|~halts3(X2,esk4_1(X2),esk4_1(X2))),inference(split_conjunct,[status(thm)],[23])).
% cnf(45,plain,(halts2(X1,X1)|halts2(esk5_0,X1)|halts2(esk4_1(X2),esk4_1(X2))|~program(X1)|~program(X2)|~outputs(X2,bad)|~halts3(X2,esk4_1(X2),esk4_1(X2))),inference(split_conjunct,[status(thm)],[23])).
% cnf(50,plain,(halts2(X1,X1)|halts2(esk5_0,X1)|program(esk4_1(X2))|program(esk4_1(X2))|~program(X1)|~program(X2)),inference(split_conjunct,[status(thm)],[23])).
% cnf(52,plain,(outputs(esk5_0,good)|~halts2(X1,X1)|~program(X1)|~program(X2)|~outputs(X2,good)|~halts3(X2,esk4_1(X2),esk4_1(X2))|~halts2(esk4_1(X2),esk4_1(X2))),inference(split_conjunct,[status(thm)],[23])).
% cnf(54,plain,(outputs(esk5_0,good)|halts2(esk4_1(X2),esk4_1(X2))|~halts2(X1,X1)|~program(X1)|~program(X2)|~outputs(X2,bad)|~halts3(X2,esk4_1(X2),esk4_1(X2))),inference(split_conjunct,[status(thm)],[23])).
% cnf(59,plain,(outputs(esk5_0,good)|program(esk4_1(X2))|program(esk4_1(X2))|~halts2(X1,X1)|~program(X1)|~program(X2)),inference(split_conjunct,[status(thm)],[23])).
% cnf(60,plain,(halts2(esk5_0,X1)|~halts2(X1,X1)|~program(X1)|~program(X2)|~outputs(X2,good)|~halts3(X2,esk4_1(X2),esk4_1(X2))|~outputs(X2,bad)|~halts3(X2,esk4_1(X2),esk4_1(X2))),inference(split_conjunct,[status(thm)],[23])).
% cnf(63,plain,(halts2(esk5_0,X1)|halts2(esk4_1(X2),esk4_1(X2))|~halts2(X1,X1)|~program(X1)|~program(X2)|~outputs(X2,bad)|~halts3(X2,esk4_1(X2),esk4_1(X2))),inference(split_conjunct,[status(thm)],[23])).
% cnf(68,plain,(halts2(esk5_0,X1)|program(esk4_1(X2))|program(esk4_1(X2))|~halts2(X1,X1)|~program(X1)|~program(X2)),inference(split_conjunct,[status(thm)],[23])).
% fof(69, plain,(![X5]:(~(program(X5))|?[X2]:(((program(X2)&halts2(X2,X2))&(~(halts2(X5,X2))|~(outputs(X5,good))))|((program(X2)&~(halts2(X2,X2)))&(~(halts2(X5,X2))|~(outputs(X5,bad))))))|?[X6]:(program(X6)&![X2]:(((~(program(X2))|~(halts2(X2,X2)))|~(halts2(X6,X2)))&((~(program(X2))|halts2(X2,X2))|(halts2(X6,X2)&outputs(X6,bad)))))),inference(fof_nnf,[status(thm)],[8])).
% fof(70, plain,(![X7]:(~(program(X7))|?[X8]:(((program(X8)&halts2(X8,X8))&(~(halts2(X7,X8))|~(outputs(X7,good))))|((program(X8)&~(halts2(X8,X8)))&(~(halts2(X7,X8))|~(outputs(X7,bad))))))|?[X9]:(program(X9)&![X10]:(((~(program(X10))|~(halts2(X10,X10)))|~(halts2(X9,X10)))&((~(program(X10))|halts2(X10,X10))|(halts2(X9,X10)&outputs(X9,bad)))))),inference(variable_rename,[status(thm)],[69])).
% fof(71, plain,(![X7]:(~(program(X7))|(((program(esk6_1(X7))&halts2(esk6_1(X7),esk6_1(X7)))&(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|((program(esk6_1(X7))&~(halts2(esk6_1(X7),esk6_1(X7))))&(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad))))))|(program(esk7_0)&![X10]:(((~(program(X10))|~(halts2(X10,X10)))|~(halts2(esk7_0,X10)))&((~(program(X10))|halts2(X10,X10))|(halts2(esk7_0,X10)&outputs(esk7_0,bad)))))),inference(skolemize,[status(esa)],[70])).
% fof(72, plain,![X7]:![X10]:(((((~(program(X10))|~(halts2(X10,X10)))|~(halts2(esk7_0,X10)))&((~(program(X10))|halts2(X10,X10))|(halts2(esk7_0,X10)&outputs(esk7_0,bad))))&program(esk7_0))|(~(program(X7))|(((program(esk6_1(X7))&halts2(esk6_1(X7),esk6_1(X7)))&(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|((program(esk6_1(X7))&~(halts2(esk6_1(X7),esk6_1(X7))))&(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad))))))),inference(shift_quantors,[status(thm)],[71])).
% fof(73, plain,![X7]:![X10]:(((((((((program(esk6_1(X7))|program(esk6_1(X7)))|~(program(X7)))|((~(program(X10))|~(halts2(X10,X10)))|~(halts2(esk7_0,X10))))&(((~(halts2(esk6_1(X7),esk6_1(X7)))|program(esk6_1(X7)))|~(program(X7)))|((~(program(X10))|~(halts2(X10,X10)))|~(halts2(esk7_0,X10)))))&((((~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad)))|program(esk6_1(X7)))|~(program(X7)))|((~(program(X10))|~(halts2(X10,X10)))|~(halts2(esk7_0,X10)))))&(((((program(esk6_1(X7))|halts2(esk6_1(X7),esk6_1(X7)))|~(program(X7)))|((~(program(X10))|~(halts2(X10,X10)))|~(halts2(esk7_0,X10))))&(((~(halts2(esk6_1(X7),esk6_1(X7)))|halts2(esk6_1(X7),esk6_1(X7)))|~(program(X7)))|((~(program(X10))|~(halts2(X10,X10)))|~(halts2(esk7_0,X10)))))&((((~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad)))|halts2(esk6_1(X7),esk6_1(X7)))|~(program(X7)))|((~(program(X10))|~(halts2(X10,X10)))|~(halts2(esk7_0,X10))))))&(((((program(esk6_1(X7))|(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|~(program(X7)))|((~(program(X10))|~(halts2(X10,X10)))|~(halts2(esk7_0,X10))))&(((~(halts2(esk6_1(X7),esk6_1(X7)))|(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|~(program(X7)))|((~(program(X10))|~(halts2(X10,X10)))|~(halts2(esk7_0,X10)))))&((((~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad)))|(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|~(program(X7)))|((~(program(X10))|~(halts2(X10,X10)))|~(halts2(esk7_0,X10))))))&((((((((program(esk6_1(X7))|program(esk6_1(X7)))|~(program(X7)))|(halts2(esk7_0,X10)|(~(program(X10))|halts2(X10,X10))))&(((~(halts2(esk6_1(X7),esk6_1(X7)))|program(esk6_1(X7)))|~(program(X7)))|(halts2(esk7_0,X10)|(~(program(X10))|halts2(X10,X10)))))&((((~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad)))|program(esk6_1(X7)))|~(program(X7)))|(halts2(esk7_0,X10)|(~(program(X10))|halts2(X10,X10)))))&(((((program(esk6_1(X7))|halts2(esk6_1(X7),esk6_1(X7)))|~(program(X7)))|(halts2(esk7_0,X10)|(~(program(X10))|halts2(X10,X10))))&(((~(halts2(esk6_1(X7),esk6_1(X7)))|halts2(esk6_1(X7),esk6_1(X7)))|~(program(X7)))|(halts2(esk7_0,X10)|(~(program(X10))|halts2(X10,X10)))))&((((~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad)))|halts2(esk6_1(X7),esk6_1(X7)))|~(program(X7)))|(halts2(esk7_0,X10)|(~(program(X10))|halts2(X10,X10))))))&(((((program(esk6_1(X7))|(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|~(program(X7)))|(halts2(esk7_0,X10)|(~(program(X10))|halts2(X10,X10))))&(((~(halts2(esk6_1(X7),esk6_1(X7)))|(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|~(program(X7)))|(halts2(esk7_0,X10)|(~(program(X10))|halts2(X10,X10)))))&((((~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad)))|(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|~(program(X7)))|(halts2(esk7_0,X10)|(~(program(X10))|halts2(X10,X10))))))&(((((((program(esk6_1(X7))|program(esk6_1(X7)))|~(program(X7)))|(outputs(esk7_0,bad)|(~(program(X10))|halts2(X10,X10))))&(((~(halts2(esk6_1(X7),esk6_1(X7)))|program(esk6_1(X7)))|~(program(X7)))|(outputs(esk7_0,bad)|(~(program(X10))|halts2(X10,X10)))))&((((~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad)))|program(esk6_1(X7)))|~(program(X7)))|(outputs(esk7_0,bad)|(~(program(X10))|halts2(X10,X10)))))&(((((program(esk6_1(X7))|halts2(esk6_1(X7),esk6_1(X7)))|~(program(X7)))|(outputs(esk7_0,bad)|(~(program(X10))|halts2(X10,X10))))&(((~(halts2(esk6_1(X7),esk6_1(X7)))|halts2(esk6_1(X7),esk6_1(X7)))|~(program(X7)))|(outputs(esk7_0,bad)|(~(program(X10))|halts2(X10,X10)))))&((((~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad)))|halts2(esk6_1(X7),esk6_1(X7)))|~(program(X7)))|(outputs(esk7_0,bad)|(~(program(X10))|halts2(X10,X10))))))&(((((program(esk6_1(X7))|(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|~(program(X7)))|(outputs(esk7_0,bad)|(~(program(X10))|halts2(X10,X10))))&(((~(halts2(esk6_1(X7),esk6_1(X7)))|(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|~(program(X7)))|(outputs(esk7_0,bad)|(~(program(X10))|halts2(X10,X10)))))&((((~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad)))|(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|~(program(X7)))|(outputs(esk7_0,bad)|(~(program(X10))|halts2(X10,X10))))))))&(((((((program(esk6_1(X7))|program(esk6_1(X7)))|~(program(X7)))|program(esk7_0))&(((~(halts2(esk6_1(X7),esk6_1(X7)))|program(esk6_1(X7)))|~(program(X7)))|program(esk7_0)))&((((~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad)))|program(esk6_1(X7)))|~(program(X7)))|program(esk7_0)))&(((((program(esk6_1(X7))|halts2(esk6_1(X7),esk6_1(X7)))|~(program(X7)))|program(esk7_0))&(((~(halts2(esk6_1(X7),esk6_1(X7)))|halts2(esk6_1(X7),esk6_1(X7)))|~(program(X7)))|program(esk7_0)))&((((~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad)))|halts2(esk6_1(X7),esk6_1(X7)))|~(program(X7)))|program(esk7_0))))&(((((program(esk6_1(X7))|(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|~(program(X7)))|program(esk7_0))&(((~(halts2(esk6_1(X7),esk6_1(X7)))|(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|~(program(X7)))|program(esk7_0)))&((((~(halts2(X7,esk6_1(X7)))|~(outputs(X7,bad)))|(~(halts2(X7,esk6_1(X7)))|~(outputs(X7,good))))|~(program(X7)))|program(esk7_0))))),inference(distribute,[status(thm)],[72])).
% cnf(74,plain,(program(esk7_0)|~program(X1)|~outputs(X1,good)|~halts2(X1,esk6_1(X1))|~outputs(X1,bad)|~halts2(X1,esk6_1(X1))),inference(split_conjunct,[status(thm)],[73])).
% cnf(75,plain,(program(esk7_0)|~program(X1)|~outputs(X1,good)|~halts2(X1,esk6_1(X1))|~halts2(esk6_1(X1),esk6_1(X1))),inference(split_conjunct,[status(thm)],[73])).
% cnf(82,plain,(program(esk7_0)|program(esk6_1(X1))|program(esk6_1(X1))|~program(X1)),inference(split_conjunct,[status(thm)],[73])).
% cnf(92,plain,(halts2(X1,X1)|halts2(esk7_0,X1)|~program(X1)|~program(X2)|~outputs(X2,good)|~halts2(X2,esk6_1(X2))|~outputs(X2,bad)|~halts2(X2,esk6_1(X2))),inference(split_conjunct,[status(thm)],[73])).
% cnf(100,plain,(halts2(X1,X1)|halts2(esk7_0,X1)|program(esk6_1(X2))|program(esk6_1(X2))|~program(X1)|~program(X2)),inference(split_conjunct,[status(thm)],[73])).
% cnf(101,plain,(~halts2(esk7_0,X1)|~halts2(X1,X1)|~program(X1)|~program(X2)|~outputs(X2,good)|~halts2(X2,esk6_1(X2))|~outputs(X2,bad)|~halts2(X2,esk6_1(X2))),inference(split_conjunct,[status(thm)],[73])).
% cnf(102,plain,(~halts2(esk7_0,X1)|~halts2(X1,X1)|~program(X1)|~program(X2)|~outputs(X2,good)|~halts2(X2,esk6_1(X2))|~halts2(esk6_1(X2),esk6_1(X2))),inference(split_conjunct,[status(thm)],[73])).
% cnf(109,plain,(program(esk6_1(X2))|program(esk6_1(X2))|~halts2(esk7_0,X1)|~halts2(X1,X1)|~program(X1)|~program(X2)),inference(split_conjunct,[status(thm)],[73])).
% fof(110, plain,![X4]:((~(program(X4))|?[X2]:(program(X2)&?[X3]:~(decides(X4,X2,X3))))|![X2]:![X3]:(((~(program(X2))|~(halts2(X2,X3)))|(halts3(X4,X2,X3)&outputs(X4,good)))&((~(program(X2))|halts2(X2,X3))|(halts3(X4,X2,X3)&outputs(X4,bad))))),inference(fof_nnf,[status(thm)],[9])).
% fof(111, plain,![X5]:((~(program(X5))|?[X6]:(program(X6)&?[X7]:~(decides(X5,X6,X7))))|![X8]:![X9]:(((~(program(X8))|~(halts2(X8,X9)))|(halts3(X5,X8,X9)&outputs(X5,good)))&((~(program(X8))|halts2(X8,X9))|(halts3(X5,X8,X9)&outputs(X5,bad))))),inference(variable_rename,[status(thm)],[110])).
% fof(112, plain,![X5]:((~(program(X5))|(program(esk8_1(X5))&~(decides(X5,esk8_1(X5),esk9_1(X5)))))|![X8]:![X9]:(((~(program(X8))|~(halts2(X8,X9)))|(halts3(X5,X8,X9)&outputs(X5,good)))&((~(program(X8))|halts2(X8,X9))|(halts3(X5,X8,X9)&outputs(X5,bad))))),inference(skolemize,[status(esa)],[111])).
% fof(113, plain,![X5]:![X8]:![X9]:((((~(program(X8))|~(halts2(X8,X9)))|(halts3(X5,X8,X9)&outputs(X5,good)))&((~(program(X8))|halts2(X8,X9))|(halts3(X5,X8,X9)&outputs(X5,bad))))|(~(program(X5))|(program(esk8_1(X5))&~(decides(X5,esk8_1(X5),esk9_1(X5)))))),inference(shift_quantors,[status(thm)],[112])).
% fof(114, plain,![X5]:![X8]:![X9]:(((((program(esk8_1(X5))|~(program(X5)))|(halts3(X5,X8,X9)|(~(program(X8))|~(halts2(X8,X9)))))&((~(decides(X5,esk8_1(X5),esk9_1(X5)))|~(program(X5)))|(halts3(X5,X8,X9)|(~(program(X8))|~(halts2(X8,X9))))))&(((program(esk8_1(X5))|~(program(X5)))|(outputs(X5,good)|(~(program(X8))|~(halts2(X8,X9)))))&((~(decides(X5,esk8_1(X5),esk9_1(X5)))|~(program(X5)))|(outputs(X5,good)|(~(program(X8))|~(halts2(X8,X9)))))))&((((program(esk8_1(X5))|~(program(X5)))|(halts3(X5,X8,X9)|(~(program(X8))|halts2(X8,X9))))&((~(decides(X5,esk8_1(X5),esk9_1(X5)))|~(program(X5)))|(halts3(X5,X8,X9)|(~(program(X8))|halts2(X8,X9)))))&(((program(esk8_1(X5))|~(program(X5)))|(outputs(X5,bad)|(~(program(X8))|halts2(X8,X9))))&((~(decides(X5,esk8_1(X5),esk9_1(X5)))|~(program(X5)))|(outputs(X5,bad)|(~(program(X8))|halts2(X8,X9))))))),inference(distribute,[status(thm)],[113])).
% cnf(115,plain,(halts2(X1,X2)|outputs(X3,bad)|~program(X1)|~program(X3)|~decides(X3,esk8_1(X3),esk9_1(X3))),inference(split_conjunct,[status(thm)],[114])).
% cnf(116,plain,(halts2(X1,X2)|outputs(X3,bad)|program(esk8_1(X3))|~program(X1)|~program(X3)),inference(split_conjunct,[status(thm)],[114])).
% cnf(117,plain,(halts2(X1,X2)|halts3(X3,X1,X2)|~program(X1)|~program(X3)|~decides(X3,esk8_1(X3),esk9_1(X3))),inference(split_conjunct,[status(thm)],[114])).
% cnf(118,plain,(halts2(X1,X2)|halts3(X3,X1,X2)|program(esk8_1(X3))|~program(X1)|~program(X3)),inference(split_conjunct,[status(thm)],[114])).
% cnf(119,plain,(outputs(X3,good)|~halts2(X1,X2)|~program(X1)|~program(X3)|~decides(X3,esk8_1(X3),esk9_1(X3))),inference(split_conjunct,[status(thm)],[114])).
% cnf(120,plain,(outputs(X3,good)|program(esk8_1(X3))|~halts2(X1,X2)|~program(X1)|~program(X3)),inference(split_conjunct,[status(thm)],[114])).
% cnf(121,plain,(halts3(X3,X1,X2)|~halts2(X1,X2)|~program(X1)|~program(X3)|~decides(X3,esk8_1(X3),esk9_1(X3))),inference(split_conjunct,[status(thm)],[114])).
% cnf(122,plain,(halts3(X3,X1,X2)|program(esk8_1(X3))|~halts2(X1,X2)|~program(X1)|~program(X3)),inference(split_conjunct,[status(thm)],[114])).
% fof(123, negated_conjecture,?[X7]:(algorithm(X7)&![X8]:(~(program(X8))|![X9]:decides(X7,X8,X9))),inference(fof_nnf,[status(thm)],[6])).
% fof(124, negated_conjecture,?[X10]:(algorithm(X10)&![X11]:(~(program(X11))|![X12]:decides(X10,X11,X12))),inference(variable_rename,[status(thm)],[123])).
% fof(125, negated_conjecture,(algorithm(esk10_0)&![X11]:(~(program(X11))|![X12]:decides(esk10_0,X11,X12))),inference(skolemize,[status(esa)],[124])).
% fof(126, negated_conjecture,![X11]:![X12]:((decides(esk10_0,X11,X12)|~(program(X11)))&algorithm(esk10_0)),inference(shift_quantors,[status(thm)],[125])).
% cnf(127,negated_conjecture,(algorithm(esk10_0)),inference(split_conjunct,[status(thm)],[126])).
% cnf(128,negated_conjecture,(decides(esk10_0,X1,X2)|~program(X1)),inference(split_conjunct,[status(thm)],[126])).
% cnf(133,plain,(halts2(esk5_0,X1)|program(esk4_1(X2))|~program(X2)|~program(X1)),inference(csr,[status(thm)],[68,50])).
% cnf(134,plain,(halts3(X3,X1,X2)|program(esk8_1(X3))|~program(X3)|~program(X1)),inference(csr,[status(thm)],[122,118])).
% cnf(140,plain,(halts3(X3,X1,X2)|~decides(X3,esk8_1(X3),esk9_1(X3))|~program(X3)|~program(X1)),inference(csr,[status(thm)],[121,117])).
% fof(178, plain,(~(epred1_0)<=>![X2]:(((~(outputs(X2,bad))|~(outputs(X2,good)))|~(halts2(X2,esk6_1(X2))))|~(program(X2)))),introduced(definition),['split']).
% cnf(179,plain,(epred1_0|~program(X2)|~halts2(X2,esk6_1(X2))|~outputs(X2,bad)|~outputs(X2,good)),inference(split_equiv,[status(thm)],[178])).
% fof(180, plain,(~(epred2_0)<=>![X1]:((~(halts2(esk7_0,X1))|~(halts2(X1,X1)))|~(program(X1)))),introduced(definition),['split']).
% cnf(181,plain,(epred2_0|~program(X1)|~halts2(X1,X1)|~halts2(esk7_0,X1)),inference(split_equiv,[status(thm)],[180])).
% cnf(182,plain,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[101,178,theory(equality)]),180,theory(equality)]),['split']).
% fof(199, plain,(~(epred3_0)<=>![X2]:(((~(outputs(X2,good))|~(halts2(esk6_1(X2),esk6_1(X2))))|~(halts2(X2,esk6_1(X2))))|~(program(X2)))),introduced(definition),['split']).
% cnf(200,plain,(epred3_0|~program(X2)|~halts2(X2,esk6_1(X2))|~halts2(esk6_1(X2),esk6_1(X2))|~outputs(X2,good)),inference(split_equiv,[status(thm)],[199])).
% cnf(201,plain,(~epred2_0|~epred3_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[102,199,theory(equality)]),180,theory(equality)]),['split']).
% cnf(202,plain,(halts2(esk5_0,X1)|~outputs(X2,good)|~outputs(X2,bad)|~halts3(X2,esk4_1(X2),esk4_1(X2))|~program(X2)|~program(X1)),inference(csr,[status(thm)],[60,42])).
% cnf(203,plain,(halts2(esk4_1(X2),esk4_1(X2))|halts2(esk5_0,X1)|~outputs(X2,bad)|~halts3(X2,esk4_1(X2),esk4_1(X2))|~program(X2)|~program(X1)),inference(csr,[status(thm)],[63,45])).
% cnf(205,negated_conjecture,(decides(esk3_0,X1,X2)|program(esk1_1(esk10_0))|~program(X1)),inference(spm,[status(thm)],[18,127,theory(equality)])).
% cnf(206,negated_conjecture,(program(esk3_0)|~algorithm(esk10_0)|~program(esk1_1(esk10_0))),inference(spm,[status(thm)],[15,128,theory(equality)])).
% cnf(207,negated_conjecture,(program(esk3_0)|$false|~program(esk1_1(esk10_0))),inference(rw,[status(thm)],[206,127,theory(equality)])).
% cnf(208,negated_conjecture,(program(esk3_0)|~program(esk1_1(esk10_0))),inference(cn,[status(thm)],[207,theory(equality)])).
% cnf(224,negated_conjecture,(decides(esk3_0,X1,X2)|~program(X1)|~algorithm(esk10_0)|~program(esk1_1(esk10_0))),inference(spm,[status(thm)],[17,128,theory(equality)])).
% cnf(225,negated_conjecture,(decides(esk3_0,X1,X2)|~program(X1)|$false|~program(esk1_1(esk10_0))),inference(rw,[status(thm)],[224,127,theory(equality)])).
% cnf(226,negated_conjecture,(decides(esk3_0,X1,X2)|~program(X1)|~program(esk1_1(esk10_0))),inference(cn,[status(thm)],[225,theory(equality)])).
% cnf(240,negated_conjecture,(program(esk3_0)|~algorithm(esk10_0)),inference(spm,[status(thm)],[208,16,theory(equality)])).
% cnf(241,negated_conjecture,(program(esk3_0)|$false),inference(rw,[status(thm)],[240,127,theory(equality)])).
% cnf(242,negated_conjecture,(program(esk3_0)),inference(cn,[status(thm)],[241,theory(equality)])).
% cnf(243,negated_conjecture,(outputs(esk3_0,bad)|halts2(X1,X2)|program(esk8_1(esk3_0))|~program(X1)),inference(spm,[status(thm)],[116,242,theory(equality)])).
% cnf(244,negated_conjecture,(halts3(esk3_0,X1,X2)|program(esk8_1(esk3_0))|~program(X1)),inference(spm,[status(thm)],[134,242,theory(equality)])).
% cnf(246,negated_conjecture,(outputs(esk5_0,bad)|halts2(X1,X1)|program(esk4_1(esk3_0))|~program(X1)),inference(spm,[status(thm)],[41,242,theory(equality)])).
% cnf(248,negated_conjecture,(halts2(esk5_0,X1)|program(esk4_1(esk3_0))|~program(X1)),inference(spm,[status(thm)],[133,242,theory(equality)])).
% cnf(266,negated_conjecture,(decides(esk3_0,X1,X2)|~program(X1)),inference(csr,[status(thm)],[226,205])).
% cnf(267,negated_conjecture,(outputs(esk3_0,bad)|halts2(X1,X2)|~program(esk3_0)|~program(X1)|~program(esk8_1(esk3_0))),inference(spm,[status(thm)],[115,266,theory(equality)])).
% cnf(268,negated_conjecture,(outputs(esk3_0,good)|~halts2(X1,X2)|~program(esk3_0)|~program(X1)|~program(esk8_1(esk3_0))),inference(spm,[status(thm)],[119,266,theory(equality)])).
% cnf(269,negated_conjecture,(halts3(esk3_0,X1,X2)|~program(esk3_0)|~program(X1)|~program(esk8_1(esk3_0))),inference(spm,[status(thm)],[140,266,theory(equality)])).
% cnf(270,negated_conjecture,(outputs(esk3_0,bad)|halts2(X1,X2)|$false|~program(X1)|~program(esk8_1(esk3_0))),inference(rw,[status(thm)],[267,242,theory(equality)])).
% cnf(271,negated_conjecture,(outputs(esk3_0,bad)|halts2(X1,X2)|~program(X1)|~program(esk8_1(esk3_0))),inference(cn,[status(thm)],[270,theory(equality)])).
% cnf(272,negated_conjecture,(outputs(esk3_0,good)|~halts2(X1,X2)|$false|~program(X1)|~program(esk8_1(esk3_0))),inference(rw,[status(thm)],[268,242,theory(equality)])).
% cnf(273,negated_conjecture,(outputs(esk3_0,good)|~halts2(X1,X2)|~program(X1)|~program(esk8_1(esk3_0))),inference(cn,[status(thm)],[272,theory(equality)])).
% cnf(274,negated_conjecture,(halts3(esk3_0,X1,X2)|$false|~program(X1)|~program(esk8_1(esk3_0))),inference(rw,[status(thm)],[269,242,theory(equality)])).
% cnf(275,negated_conjecture,(halts3(esk3_0,X1,X2)|~program(X1)|~program(esk8_1(esk3_0))),inference(cn,[status(thm)],[274,theory(equality)])).
% cnf(324,negated_conjecture,(halts3(esk3_0,X1,X2)|~program(X1)),inference(csr,[status(thm)],[275,244])).
% cnf(325,negated_conjecture,(program(esk5_0)|~outputs(esk3_0,good)|~outputs(esk3_0,bad)|~program(esk3_0)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[24,324,theory(equality)])).
% cnf(326,negated_conjecture,(halts2(esk4_1(esk3_0),esk4_1(esk3_0))|program(esk5_0)|~outputs(esk3_0,bad)|~program(esk3_0)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[27,324,theory(equality)])).
% cnf(327,negated_conjecture,(program(esk5_0)|~outputs(esk3_0,good)|~halts2(esk4_1(esk3_0),esk4_1(esk3_0))|~program(esk3_0)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[25,324,theory(equality)])).
% cnf(330,negated_conjecture,(outputs(esk5_0,good)|halts2(esk4_1(esk3_0),esk4_1(esk3_0))|~outputs(esk3_0,bad)|~halts2(X1,X1)|~program(esk3_0)|~program(X1)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[54,324,theory(equality)])).
% cnf(331,negated_conjecture,(halts2(esk4_1(esk3_0),esk4_1(esk3_0))|halts2(esk5_0,X1)|~outputs(esk3_0,bad)|~program(esk3_0)|~program(X1)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[203,324,theory(equality)])).
% cnf(332,negated_conjecture,(outputs(esk5_0,good)|~outputs(esk3_0,good)|~halts2(esk4_1(esk3_0),esk4_1(esk3_0))|~halts2(X1,X1)|~program(esk3_0)|~program(X1)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[52,324,theory(equality)])).
% cnf(333,negated_conjecture,(outputs(esk5_0,bad)|halts2(X1,X1)|~outputs(esk3_0,good)|~outputs(esk3_0,bad)|~program(esk3_0)|~program(X1)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[33,324,theory(equality)])).
% cnf(334,negated_conjecture,(halts2(esk5_0,X1)|~outputs(esk3_0,good)|~outputs(esk3_0,bad)|~program(esk3_0)|~program(X1)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[202,324,theory(equality)])).
% cnf(337,negated_conjecture,(program(esk5_0)|~outputs(esk3_0,good)|~outputs(esk3_0,bad)|$false|~program(esk4_1(esk3_0))),inference(rw,[status(thm)],[325,242,theory(equality)])).
% cnf(338,negated_conjecture,(program(esk5_0)|~outputs(esk3_0,good)|~outputs(esk3_0,bad)|~program(esk4_1(esk3_0))),inference(cn,[status(thm)],[337,theory(equality)])).
% cnf(339,negated_conjecture,(halts2(esk4_1(esk3_0),esk4_1(esk3_0))|program(esk5_0)|~outputs(esk3_0,bad)|$false|~program(esk4_1(esk3_0))),inference(rw,[status(thm)],[326,242,theory(equality)])).
% cnf(340,negated_conjecture,(halts2(esk4_1(esk3_0),esk4_1(esk3_0))|program(esk5_0)|~outputs(esk3_0,bad)|~program(esk4_1(esk3_0))),inference(cn,[status(thm)],[339,theory(equality)])).
% cnf(341,negated_conjecture,(program(esk5_0)|~outputs(esk3_0,good)|~halts2(esk4_1(esk3_0),esk4_1(esk3_0))|$false|~program(esk4_1(esk3_0))),inference(rw,[status(thm)],[327,242,theory(equality)])).
% cnf(342,negated_conjecture,(program(esk5_0)|~outputs(esk3_0,good)|~halts2(esk4_1(esk3_0),esk4_1(esk3_0))|~program(esk4_1(esk3_0))),inference(cn,[status(thm)],[341,theory(equality)])).
% cnf(347,negated_conjecture,(outputs(esk5_0,good)|halts2(esk4_1(esk3_0),esk4_1(esk3_0))|~outputs(esk3_0,bad)|~halts2(X1,X1)|$false|~program(X1)|~program(esk4_1(esk3_0))),inference(rw,[status(thm)],[330,242,theory(equality)])).
% cnf(348,negated_conjecture,(outputs(esk5_0,good)|halts2(esk4_1(esk3_0),esk4_1(esk3_0))|~outputs(esk3_0,bad)|~halts2(X1,X1)|~program(X1)|~program(esk4_1(esk3_0))),inference(cn,[status(thm)],[347,theory(equality)])).
% cnf(349,negated_conjecture,(halts2(esk4_1(esk3_0),esk4_1(esk3_0))|halts2(esk5_0,X1)|~outputs(esk3_0,bad)|$false|~program(X1)|~program(esk4_1(esk3_0))),inference(rw,[status(thm)],[331,242,theory(equality)])).
% cnf(350,negated_conjecture,(halts2(esk4_1(esk3_0),esk4_1(esk3_0))|halts2(esk5_0,X1)|~outputs(esk3_0,bad)|~program(X1)|~program(esk4_1(esk3_0))),inference(cn,[status(thm)],[349,theory(equality)])).
% cnf(351,negated_conjecture,(outputs(esk5_0,good)|~outputs(esk3_0,good)|~halts2(esk4_1(esk3_0),esk4_1(esk3_0))|~halts2(X1,X1)|$false|~program(X1)|~program(esk4_1(esk3_0))),inference(rw,[status(thm)],[332,242,theory(equality)])).
% cnf(352,negated_conjecture,(outputs(esk5_0,good)|~outputs(esk3_0,good)|~halts2(esk4_1(esk3_0),esk4_1(esk3_0))|~halts2(X1,X1)|~program(X1)|~program(esk4_1(esk3_0))),inference(cn,[status(thm)],[351,theory(equality)])).
% cnf(353,negated_conjecture,(outputs(esk5_0,bad)|halts2(X1,X1)|~outputs(esk3_0,good)|~outputs(esk3_0,bad)|$false|~program(X1)|~program(esk4_1(esk3_0))),inference(rw,[status(thm)],[333,242,theory(equality)])).
% cnf(354,negated_conjecture,(outputs(esk5_0,bad)|halts2(X1,X1)|~outputs(esk3_0,good)|~outputs(esk3_0,bad)|~program(X1)|~program(esk4_1(esk3_0))),inference(cn,[status(thm)],[353,theory(equality)])).
% cnf(355,negated_conjecture,(halts2(esk5_0,X1)|~outputs(esk3_0,good)|~outputs(esk3_0,bad)|$false|~program(X1)|~program(esk4_1(esk3_0))),inference(rw,[status(thm)],[334,242,theory(equality)])).
% cnf(356,negated_conjecture,(halts2(esk5_0,X1)|~outputs(esk3_0,good)|~outputs(esk3_0,bad)|~program(X1)|~program(esk4_1(esk3_0))),inference(cn,[status(thm)],[355,theory(equality)])).
% cnf(480,negated_conjecture,(outputs(esk3_0,bad)|halts2(X1,X2)|~program(X1)),inference(csr,[status(thm)],[271,243])).
% cnf(490,negated_conjecture,(outputs(esk3_0,bad)|halts2(esk3_0,X1)),inference(spm,[status(thm)],[480,242,theory(equality)])).
% cnf(1160,negated_conjecture,(halts2(esk4_1(esk3_0),esk4_1(esk3_0))|program(esk5_0)|~program(esk4_1(esk3_0))),inference(csr,[status(thm)],[340,480])).
% cnf(1162,negated_conjecture,(outputs(X1,good)|program(esk8_1(X1))|program(esk5_0)|~program(X1)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[120,1160,theory(equality)])).
% cnf(1193,negated_conjecture,(outputs(esk3_0,good)|program(esk5_0)|~halts2(X1,X2)|~program(X1)|~program(esk4_1(esk3_0))|~program(esk3_0)),inference(spm,[status(thm)],[273,1162,theory(equality)])).
% cnf(1194,negated_conjecture,(outputs(esk3_0,good)|program(esk5_0)|~halts2(X1,X2)|~program(X1)|~program(esk4_1(esk3_0))|$false),inference(rw,[status(thm)],[1193,242,theory(equality)])).
% cnf(1195,negated_conjecture,(outputs(esk3_0,good)|program(esk5_0)|~halts2(X1,X2)|~program(X1)|~program(esk4_1(esk3_0))),inference(cn,[status(thm)],[1194,theory(equality)])).
% cnf(1207,negated_conjecture,(outputs(esk3_0,good)|program(esk5_0)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[1195,1160,theory(equality)])).
% cnf(1215,negated_conjecture,(program(esk5_0)|~outputs(esk3_0,bad)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[338,1207,theory(equality)])).
% cnf(1216,negated_conjecture,(program(esk5_0)|halts2(esk3_0,X1)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[1215,490,theory(equality)])).
% cnf(1327,negated_conjecture,(halts2(esk3_0,X1)|program(esk5_0)|~program(esk3_0)),inference(spm,[status(thm)],[1216,32,theory(equality)])).
% cnf(1330,negated_conjecture,(halts2(esk3_0,X1)|program(esk5_0)|$false),inference(rw,[status(thm)],[1327,242,theory(equality)])).
% cnf(1331,negated_conjecture,(halts2(esk3_0,X1)|program(esk5_0)),inference(cn,[status(thm)],[1330,theory(equality)])).
% cnf(1340,negated_conjecture,(outputs(X1,good)|program(esk8_1(X1))|program(esk5_0)|~program(X1)|~program(esk3_0)),inference(spm,[status(thm)],[120,1331,theory(equality)])).
% cnf(1359,negated_conjecture,(outputs(X1,good)|program(esk8_1(X1))|program(esk5_0)|~program(X1)|$false),inference(rw,[status(thm)],[1340,242,theory(equality)])).
% cnf(1360,negated_conjecture,(outputs(X1,good)|program(esk8_1(X1))|program(esk5_0)|~program(X1)),inference(cn,[status(thm)],[1359,theory(equality)])).
% cnf(1542,negated_conjecture,(outputs(esk3_0,good)|program(esk5_0)|~halts2(X1,X2)|~program(X1)|~program(esk3_0)),inference(spm,[status(thm)],[273,1360,theory(equality)])).
% cnf(1543,negated_conjecture,(outputs(esk3_0,good)|program(esk5_0)|~halts2(X1,X2)|~program(X1)|$false),inference(rw,[status(thm)],[1542,242,theory(equality)])).
% cnf(1544,negated_conjecture,(outputs(esk3_0,good)|program(esk5_0)|~halts2(X1,X2)|~program(X1)),inference(cn,[status(thm)],[1543,theory(equality)])).
% cnf(2042,negated_conjecture,(outputs(esk3_0,good)|program(esk5_0)|~program(esk3_0)),inference(spm,[status(thm)],[1544,1331,theory(equality)])).
% cnf(2046,negated_conjecture,(outputs(esk3_0,good)|program(esk5_0)|$false),inference(rw,[status(thm)],[2042,242,theory(equality)])).
% cnf(2047,negated_conjecture,(outputs(esk3_0,good)|program(esk5_0)),inference(cn,[status(thm)],[2046,theory(equality)])).
% cnf(3883,negated_conjecture,(program(esk5_0)|~outputs(esk3_0,good)|~program(esk4_1(esk3_0))),inference(csr,[status(thm)],[342,1160])).
% cnf(3884,negated_conjecture,(program(esk5_0)|~program(esk4_1(esk3_0))),inference(csr,[status(thm)],[3883,2047])).
% cnf(3885,negated_conjecture,(program(esk5_0)|~program(esk3_0)),inference(spm,[status(thm)],[3884,32,theory(equality)])).
% cnf(3889,negated_conjecture,(program(esk5_0)|$false),inference(rw,[status(thm)],[3885,242,theory(equality)])).
% cnf(3890,negated_conjecture,(program(esk5_0)),inference(cn,[status(thm)],[3889,theory(equality)])).
% cnf(4002,negated_conjecture,(halts2(esk5_0,esk5_0)|program(esk4_1(esk3_0))),inference(spm,[status(thm)],[248,3890,theory(equality)])).
% cnf(4003,negated_conjecture,(outputs(esk3_0,bad)|halts2(esk5_0,X1)),inference(spm,[status(thm)],[480,3890,theory(equality)])).
% cnf(4025,negated_conjecture,(halts2(esk7_0,X1)|halts2(X1,X1)|program(esk6_1(esk5_0))|~program(X1)),inference(spm,[status(thm)],[100,3890,theory(equality)])).
% cnf(6309,negated_conjecture,(outputs(esk5_0,good)|halts2(esk4_1(esk3_0),esk4_1(esk3_0))|~halts2(X1,X1)|~program(esk4_1(esk3_0))|~program(X1)),inference(csr,[status(thm)],[348,480])).
% cnf(6575,negated_conjecture,(halts2(esk4_1(esk3_0),esk4_1(esk3_0))|halts2(esk5_0,X1)|~outputs(esk3_0,bad)|~program(X1)),inference(csr,[status(thm)],[350,248])).
% cnf(6576,negated_conjecture,(halts2(esk4_1(esk3_0),esk4_1(esk3_0))|halts2(esk5_0,X1)|~program(X1)),inference(csr,[status(thm)],[6575,4003])).
% cnf(6611,negated_conjecture,(halts2(esk4_1(esk3_0),esk4_1(esk3_0))|halts2(esk5_0,esk5_0)),inference(spm,[status(thm)],[6576,3890,theory(equality)])).
% cnf(6740,negated_conjecture,(outputs(X1,good)|program(esk8_1(X1))|halts2(esk5_0,esk5_0)|~program(X1)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[120,6611,theory(equality)])).
% cnf(6760,negated_conjecture,(outputs(esk5_0,good)|~outputs(esk3_0,good)|~halts2(X1,X1)|~program(esk4_1(esk3_0))|~program(X1)),inference(csr,[status(thm)],[352,6309])).
% cnf(6885,negated_conjecture,(outputs(esk5_0,bad)|halts2(X1,X1)|~outputs(esk3_0,good)|~outputs(esk3_0,bad)|~program(X1)),inference(csr,[status(thm)],[354,246])).
% cnf(6886,negated_conjecture,(outputs(esk5_0,bad)|halts2(X1,X1)|~outputs(esk3_0,good)|~program(X1)),inference(csr,[status(thm)],[6885,480])).
% cnf(7036,negated_conjecture,(halts2(esk5_0,X1)|~outputs(esk3_0,good)|~outputs(esk3_0,bad)|~program(X1)),inference(csr,[status(thm)],[356,248])).
% cnf(7037,negated_conjecture,(halts2(esk5_0,X1)|~outputs(esk3_0,good)|~program(X1)),inference(csr,[status(thm)],[7036,4003])).
% cnf(7324,negated_conjecture,(outputs(X1,good)|halts2(esk5_0,esk5_0)|program(esk8_1(X1))|~program(X1)),inference(csr,[status(thm)],[6740,4002])).
% cnf(7374,negated_conjecture,(outputs(esk3_0,good)|halts2(esk5_0,esk5_0)|~halts2(X1,X2)|~program(X1)|~program(esk3_0)),inference(spm,[status(thm)],[273,7324,theory(equality)])).
% cnf(7375,negated_conjecture,(outputs(esk3_0,good)|halts2(esk5_0,esk5_0)|~halts2(X1,X2)|~program(X1)|$false),inference(rw,[status(thm)],[7374,242,theory(equality)])).
% cnf(7376,negated_conjecture,(outputs(esk3_0,good)|halts2(esk5_0,esk5_0)|~halts2(X1,X2)|~program(X1)),inference(cn,[status(thm)],[7375,theory(equality)])).
% cnf(7403,negated_conjecture,(outputs(esk3_0,good)|halts2(esk5_0,esk5_0)|~program(esk4_1(esk3_0))),inference(spm,[status(thm)],[7376,6611,theory(equality)])).
% cnf(7531,negated_conjecture,(outputs(esk3_0,good)|halts2(esk5_0,esk5_0)),inference(csr,[status(thm)],[7403,4002])).
% cnf(7534,negated_conjecture,(halts2(esk5_0,X1)|halts2(esk5_0,esk5_0)|~program(X1)),inference(spm,[status(thm)],[7037,7531,theory(equality)])).
% cnf(7572,negated_conjecture,(halts2(esk5_0,esk5_0)),inference(spm,[status(thm)],[7534,3890,theory(equality)])).
% cnf(7592,negated_conjecture,(outputs(X1,good)|program(esk8_1(X1))|~program(X1)|~program(esk5_0)),inference(spm,[status(thm)],[120,7572,theory(equality)])).
% cnf(7594,negated_conjecture,(outputs(esk5_0,good)|program(esk4_1(X1))|~program(X1)|~program(esk5_0)),inference(spm,[status(thm)],[59,7572,theory(equality)])).
% cnf(7621,negated_conjecture,(outputs(X1,good)|program(esk8_1(X1))|~program(X1)|$false),inference(rw,[status(thm)],[7592,3890,theory(equality)])).
% cnf(7622,negated_conjecture,(outputs(X1,good)|program(esk8_1(X1))|~program(X1)),inference(cn,[status(thm)],[7621,theory(equality)])).
% cnf(7625,negated_conjecture,(outputs(esk5_0,good)|program(esk4_1(X1))|~program(X1)|$false),inference(rw,[status(thm)],[7594,3890,theory(equality)])).
% cnf(7626,negated_conjecture,(outputs(esk5_0,good)|program(esk4_1(X1))|~program(X1)),inference(cn,[status(thm)],[7625,theory(equality)])).
% cnf(7691,negated_conjecture,(outputs(esk3_0,good)|~halts2(X1,X2)|~program(X1)|~program(esk3_0)),inference(spm,[status(thm)],[273,7622,theory(equality)])).
% cnf(7692,negated_conjecture,(outputs(esk3_0,good)|~halts2(X1,X2)|~program(X1)|$false),inference(rw,[status(thm)],[7691,242,theory(equality)])).
% cnf(7693,negated_conjecture,(outputs(esk3_0,good)|~halts2(X1,X2)|~program(X1)),inference(cn,[status(thm)],[7692,theory(equality)])).
% cnf(7726,negated_conjecture,(outputs(esk5_0,good)|program(esk4_1(esk3_0))),inference(spm,[status(thm)],[7626,242,theory(equality)])).
% cnf(7909,negated_conjecture,(outputs(esk3_0,good)|~program(esk5_0)),inference(spm,[status(thm)],[7693,7572,theory(equality)])).
% cnf(7954,negated_conjecture,(outputs(esk3_0,good)|$false),inference(rw,[status(thm)],[7909,3890,theory(equality)])).
% cnf(7955,negated_conjecture,(outputs(esk3_0,good)),inference(cn,[status(thm)],[7954,theory(equality)])).
% cnf(8077,negated_conjecture,(halts2(esk5_0,X1)|$false|~program(X1)),inference(rw,[status(thm)],[7037,7955,theory(equality)])).
% cnf(8078,negated_conjecture,(halts2(esk5_0,X1)|~program(X1)),inference(cn,[status(thm)],[8077,theory(equality)])).
% cnf(8079,negated_conjecture,(outputs(esk5_0,bad)|halts2(X1,X1)|$false|~program(X1)),inference(rw,[status(thm)],[6886,7955,theory(equality)])).
% cnf(8080,negated_conjecture,(outputs(esk5_0,bad)|halts2(X1,X1)|~program(X1)),inference(cn,[status(thm)],[8079,theory(equality)])).
% cnf(8081,negated_conjecture,(outputs(esk5_0,good)|$false|~halts2(X1,X1)|~program(esk4_1(esk3_0))|~program(X1)),inference(rw,[status(thm)],[6760,7955,theory(equality)])).
% cnf(8082,negated_conjecture,(outputs(esk5_0,good)|~halts2(X1,X1)|~program(esk4_1(esk3_0))|~program(X1)),inference(cn,[status(thm)],[8081,theory(equality)])).
% cnf(8083,negated_conjecture,(program(esk7_0)|~outputs(esk5_0,good)|~outputs(esk5_0,bad)|~program(esk5_0)|~program(esk6_1(esk5_0))),inference(spm,[status(thm)],[74,8078,theory(equality)])).
% cnf(8086,negated_conjecture,(epred1_0|~outputs(esk5_0,bad)|~outputs(esk5_0,good)|~program(esk5_0)|~program(esk6_1(esk5_0))),inference(spm,[status(thm)],[179,8078,theory(equality)])).
% cnf(8088,negated_conjecture,(halts2(esk7_0,X1)|halts2(X1,X1)|~outputs(esk5_0,good)|~outputs(esk5_0,bad)|~program(esk5_0)|~program(X1)|~program(esk6_1(esk5_0))),inference(spm,[status(thm)],[92,8078,theory(equality)])).
% cnf(8090,negated_conjecture,(program(esk7_0)|~outputs(esk5_0,good)|~outputs(esk5_0,bad)|$false|~program(esk6_1(esk5_0))),inference(rw,[status(thm)],[8083,3890,theory(equality)])).
% cnf(8091,negated_conjecture,(program(esk7_0)|~outputs(esk5_0,good)|~outputs(esk5_0,bad)|~program(esk6_1(esk5_0))),inference(cn,[status(thm)],[8090,theory(equality)])).
% cnf(8096,negated_conjecture,(epred1_0|~outputs(esk5_0,bad)|~outputs(esk5_0,good)|$false|~program(esk6_1(esk5_0))),inference(rw,[status(thm)],[8086,3890,theory(equality)])).
% cnf(8097,negated_conjecture,(epred1_0|~outputs(esk5_0,bad)|~outputs(esk5_0,good)|~program(esk6_1(esk5_0))),inference(cn,[status(thm)],[8096,theory(equality)])).
% cnf(8100,negated_conjecture,(halts2(esk7_0,X1)|halts2(X1,X1)|~outputs(esk5_0,good)|~outputs(esk5_0,bad)|$false|~program(X1)|~program(esk6_1(esk5_0))),inference(rw,[status(thm)],[8088,3890,theory(equality)])).
% cnf(8101,negated_conjecture,(halts2(esk7_0,X1)|halts2(X1,X1)|~outputs(esk5_0,good)|~outputs(esk5_0,bad)|~program(X1)|~program(esk6_1(esk5_0))),inference(cn,[status(thm)],[8100,theory(equality)])).
% cnf(8127,negated_conjecture,(outputs(esk5_0,bad)|halts2(esk6_1(X1),esk6_1(X1))|program(esk7_0)|~program(X1)),inference(spm,[status(thm)],[8080,82,theory(equality)])).
% cnf(8143,negated_conjecture,(outputs(esk5_0,good)|~halts2(X1,X1)|~program(X1)),inference(csr,[status(thm)],[8082,7726])).
% cnf(8149,negated_conjecture,(outputs(esk5_0,good)|~program(esk5_0)),inference(spm,[status(thm)],[8143,7572,theory(equality)])).
% cnf(8154,negated_conjecture,(outputs(esk5_0,good)|$false),inference(rw,[status(thm)],[8149,3890,theory(equality)])).
% cnf(8155,negated_conjecture,(outputs(esk5_0,good)),inference(cn,[status(thm)],[8154,theory(equality)])).
% cnf(8167,negated_conjecture,(epred1_0|~outputs(esk5_0,bad)|$false|~program(esk6_1(esk5_0))),inference(rw,[status(thm)],[8097,8155,theory(equality)])).
% cnf(8168,negated_conjecture,(epred1_0|~outputs(esk5_0,bad)|~program(esk6_1(esk5_0))),inference(cn,[status(thm)],[8167,theory(equality)])).
% cnf(8223,negated_conjecture,(program(esk7_0)|$false|~outputs(esk5_0,bad)|~program(esk6_1(esk5_0))),inference(rw,[status(thm)],[8091,8155,theory(equality)])).
% cnf(8224,negated_conjecture,(program(esk7_0)|~outputs(esk5_0,bad)|~program(esk6_1(esk5_0))),inference(cn,[status(thm)],[8223,theory(equality)])).
% cnf(8225,negated_conjecture,(program(esk7_0)|~outputs(esk5_0,bad)|~program(esk5_0)),inference(spm,[status(thm)],[8224,82,theory(equality)])).
% cnf(8228,negated_conjecture,(program(esk7_0)|~outputs(esk5_0,bad)|$false),inference(rw,[status(thm)],[8225,3890,theory(equality)])).
% cnf(8229,negated_conjecture,(program(esk7_0)|~outputs(esk5_0,bad)),inference(cn,[status(thm)],[8228,theory(equality)])).
% cnf(9121,negated_conjecture,(halts2(esk6_1(X1),esk6_1(X1))|program(esk7_0)|~program(X1)),inference(csr,[status(thm)],[8127,8229])).
% cnf(9122,negated_conjecture,(program(esk7_0)|~outputs(X1,good)|~halts2(X1,esk6_1(X1))|~program(X1)),inference(spm,[status(thm)],[75,9121,theory(equality)])).
% cnf(9703,negated_conjecture,(program(esk7_0)|~outputs(esk5_0,good)|~program(esk5_0)|~program(esk6_1(esk5_0))),inference(spm,[status(thm)],[9122,8078,theory(equality)])).
% cnf(9711,negated_conjecture,(program(esk7_0)|$false|~program(esk5_0)|~program(esk6_1(esk5_0))),inference(rw,[status(thm)],[9703,8155,theory(equality)])).
% cnf(9712,negated_conjecture,(program(esk7_0)|$false|$false|~program(esk6_1(esk5_0))),inference(rw,[status(thm)],[9711,3890,theory(equality)])).
% cnf(9713,negated_conjecture,(program(esk7_0)|~program(esk6_1(esk5_0))),inference(cn,[status(thm)],[9712,theory(equality)])).
% cnf(9729,negated_conjecture,(program(esk7_0)|~program(esk5_0)),inference(spm,[status(thm)],[9713,82,theory(equality)])).
% cnf(9734,negated_conjecture,(program(esk7_0)|$false),inference(rw,[status(thm)],[9729,3890,theory(equality)])).
% cnf(9735,negated_conjecture,(program(esk7_0)),inference(cn,[status(thm)],[9734,theory(equality)])).
% cnf(9855,negated_conjecture,(outputs(esk5_0,bad)|halts2(esk7_0,esk7_0)),inference(spm,[status(thm)],[8080,9735,theory(equality)])).
% cnf(9860,negated_conjecture,(halts2(esk7_0,esk7_0)|program(esk6_1(esk5_0))),inference(spm,[status(thm)],[4025,9735,theory(equality)])).
% cnf(9959,negated_conjecture,(epred1_0|halts2(esk7_0,esk7_0)|~outputs(esk5_0,bad)),inference(spm,[status(thm)],[8168,9860,theory(equality)])).
% cnf(9981,negated_conjecture,(epred1_0|halts2(esk7_0,esk7_0)),inference(spm,[status(thm)],[9959,9855,theory(equality)])).
% cnf(9984,negated_conjecture,(program(esk6_1(X1))|epred1_0|~halts2(esk7_0,esk7_0)|~program(X1)|~program(esk7_0)),inference(spm,[status(thm)],[109,9981,theory(equality)])).
% cnf(9988,negated_conjecture,(program(esk6_1(X1))|epred1_0|~halts2(esk7_0,esk7_0)|~program(X1)|$false),inference(rw,[status(thm)],[9984,9735,theory(equality)])).
% cnf(9989,negated_conjecture,(program(esk6_1(X1))|epred1_0|~halts2(esk7_0,esk7_0)|~program(X1)),inference(cn,[status(thm)],[9988,theory(equality)])).
% cnf(10000,negated_conjecture,(epred1_0|program(esk6_1(X1))|~program(X1)),inference(csr,[status(thm)],[9989,9981])).
% cnf(10015,negated_conjecture,(outputs(esk5_0,bad)|halts2(esk6_1(X1),esk6_1(X1))|epred1_0|~program(X1)),inference(spm,[status(thm)],[8080,10000,theory(equality)])).
% cnf(10028,negated_conjecture,(epred1_0|~outputs(esk5_0,bad)|~program(esk5_0)),inference(spm,[status(thm)],[8168,10000,theory(equality)])).
% cnf(10029,negated_conjecture,(epred1_0|~outputs(esk5_0,bad)|$false),inference(rw,[status(thm)],[10028,3890,theory(equality)])).
% cnf(10030,negated_conjecture,(epred1_0|~outputs(esk5_0,bad)),inference(cn,[status(thm)],[10029,theory(equality)])).
% cnf(10248,negated_conjecture,(epred1_0|halts2(esk6_1(X1),esk6_1(X1))|~program(X1)),inference(csr,[status(thm)],[10015,10030])).
% cnf(10249,negated_conjecture,(epred3_0|epred1_0|~outputs(X1,good)|~halts2(X1,esk6_1(X1))|~program(X1)),inference(spm,[status(thm)],[200,10248,theory(equality)])).
% cnf(10258,negated_conjecture,(epred3_0|epred1_0|~outputs(esk5_0,good)|~program(esk5_0)|~program(esk6_1(esk5_0))),inference(spm,[status(thm)],[10249,8078,theory(equality)])).
% cnf(10266,negated_conjecture,(epred3_0|epred1_0|$false|~program(esk5_0)|~program(esk6_1(esk5_0))),inference(rw,[status(thm)],[10258,8155,theory(equality)])).
% cnf(10267,negated_conjecture,(epred3_0|epred1_0|$false|$false|~program(esk6_1(esk5_0))),inference(rw,[status(thm)],[10266,3890,theory(equality)])).
% cnf(10268,negated_conjecture,(epred3_0|epred1_0|~program(esk6_1(esk5_0))),inference(cn,[status(thm)],[10267,theory(equality)])).
% cnf(10278,negated_conjecture,(epred3_0|epred1_0|~program(esk5_0)),inference(spm,[status(thm)],[10268,10000,theory(equality)])).
% cnf(10282,negated_conjecture,(epred3_0|epred1_0|$false),inference(rw,[status(thm)],[10278,3890,theory(equality)])).
% cnf(10283,negated_conjecture,(epred3_0|epred1_0),inference(cn,[status(thm)],[10282,theory(equality)])).
% cnf(10284,negated_conjecture,(epred3_0|~epred2_0),inference(spm,[status(thm)],[182,10283,theory(equality)])).
% cnf(10285,negated_conjecture,(~epred2_0),inference(csr,[status(thm)],[10284,201])).
% cnf(39565,negated_conjecture,(halts2(esk7_0,X1)|halts2(X1,X1)|$false|~outputs(esk5_0,bad)|~program(X1)|~program(esk6_1(esk5_0))),inference(rw,[status(thm)],[8101,8155,theory(equality)])).
% cnf(39566,negated_conjecture,(halts2(esk7_0,X1)|halts2(X1,X1)|~outputs(esk5_0,bad)|~program(X1)|~program(esk6_1(esk5_0))),inference(cn,[status(thm)],[39565,theory(equality)])).
% cnf(39567,negated_conjecture,(halts2(esk7_0,X1)|halts2(X1,X1)|~outputs(esk5_0,bad)|~program(X1)),inference(csr,[status(thm)],[39566,4025])).
% cnf(39568,negated_conjecture,(halts2(esk7_0,X1)|halts2(X1,X1)|~program(X1)),inference(csr,[status(thm)],[39567,8080])).
% cnf(39674,negated_conjecture,(halts2(esk7_0,esk7_0)),inference(spm,[status(thm)],[39568,9735,theory(equality)])).
% cnf(39948,negated_conjecture,(epred2_0|~halts2(esk7_0,esk7_0)|~program(esk7_0)),inference(spm,[status(thm)],[181,39674,theory(equality)])).
% cnf(40172,negated_conjecture,(epred2_0|$false|~program(esk7_0)),inference(rw,[status(thm)],[39948,39674,theory(equality)])).
% cnf(40173,negated_conjecture,(epred2_0|$false|$false),inference(rw,[status(thm)],[40172,9735,theory(equality)])).
% cnf(40174,negated_conjecture,(epred2_0),inference(cn,[status(thm)],[40173,theory(equality)])).
% cnf(40175,negated_conjecture,($false),inference(sr,[status(thm)],[40174,10285,theory(equality)])).
% cnf(40176,negated_conjecture,($false),40175,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2399
% # ...of these trivial : 6
% # ...subsumed : 708
% # ...remaining for further processing: 1685
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 725
% # Backward-rewritten : 365
% # Generated clauses : 37393
% # ...of the previous two non-trivial : 37207
% # Contextual simplify-reflections : 1391
% # Paramodulations : 37339
% # Factorizations : 38
% # Equation resolutions : 0
% # Current number of processed clauses: 535
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 524
% # Current number of unprocessed clauses: 4113
% # ...number of literals in the above : 24011
% # Clause-clause subsumption calls (NU) : 49946
% # Rec. Clause-clause subsumption calls : 6729
% # Unit Clause-clause subsumption calls : 470
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 348 leaves, 1.20+/-0.653 terms/leaf
% # Paramod-from index: 237 leaves, 1.23+/-0.608 terms/leaf
% # Paramod-into index: 286 leaves, 1.20+/-0.566 terms/leaf
% # -------------------------------------------------
% # User time : 1.646 s
% # System time : 0.038 s
% # Total time : 1.684 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.27 CPU 2.38 WC
% FINAL PrfWatch: 2.27 CPU 2.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP24359/COM003+1.tptp
%
%------------------------------------------------------------------------------