TSTP Solution File: COM003+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COM003+2 : TPTP v8.1.0. Bugfixed v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Jul 27 12:48:20 EDT 2022
% Result : Theorem 1.94s 2.15s
% Output : Refutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 31 ( 14 unt; 4 nHn; 19 RR)
% Number of literals : 64 ( 0 equ; 30 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 36 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ program_program_decides(A)
| program(A) ),
file('COM003+2.p',unknown),
[] ).
cnf(11,axiom,
( program_halts2(A,B)
| ~ program(A)
| ~ halts2(A,B) ),
file('COM003+2.p',unknown),
[] ).
cnf(17,axiom,
( program_not_halts2(A,B)
| ~ program(A)
| halts2(A,B) ),
file('COM003+2.p',unknown),
[] ).
cnf(18,axiom,
( ~ halts2_outputs(A,B,C)
| halts2(A,B) ),
file('COM003+2.p',unknown),
[] ).
cnf(27,axiom,
( ~ program_not_halts2_halts2_outputs(A,B,C)
| ~ program_not_halts2(B,B)
| halts2_outputs(A,B,C) ),
file('COM003+2.p',unknown),
[] ).
cnf(29,axiom,
( ~ algorithm_program_decides(A)
| program_program_decides(dollar_c1) ),
file('COM003+2.p',unknown),
[] ).
cnf(30,axiom,
( ~ program_program_decides(A)
| program_halts2_halts3_outputs(A,B,C,good) ),
file('COM003+2.p',unknown),
[] ).
cnf(31,axiom,
( ~ program_program_decides(A)
| program_not_halts2_halts3_outputs(A,B,C,bad) ),
file('COM003+2.p',unknown),
[] ).
cnf(32,axiom,
( ~ program(A)
| ~ program_halts2_halts3_outputs(A,dollar_f3(A),dollar_f3(A),good)
| ~ program_not_halts2_halts3_outputs(A,dollar_f3(A),dollar_f3(A),bad)
| program(dollar_c2) ),
file('COM003+2.p',unknown),
[] ).
cnf(33,axiom,
( ~ program(A)
| ~ program_halts2_halts3_outputs(A,dollar_f3(A),dollar_f3(A),good)
| ~ program_not_halts2_halts3_outputs(A,dollar_f3(A),dollar_f3(A),bad)
| program_halts2_halts2_outputs(dollar_c2,B,good) ),
file('COM003+2.p',unknown),
[] ).
cnf(34,axiom,
( ~ program(A)
| ~ program_halts2_halts3_outputs(A,dollar_f3(A),dollar_f3(A),good)
| ~ program_not_halts2_halts3_outputs(A,dollar_f3(A),dollar_f3(A),bad)
| program_not_halts2_halts2_outputs(dollar_c2,B,bad) ),
file('COM003+2.p',unknown),
[] ).
cnf(35,axiom,
( ~ program(A)
| ~ program_halts2_halts2_outputs(A,dollar_f4(A),good)
| ~ program_not_halts2_halts2_outputs(A,dollar_f4(A),bad)
| program(dollar_c3) ),
file('COM003+2.p',unknown),
[] ).
cnf(36,axiom,
( ~ program(A)
| ~ program_halts2_halts2_outputs(A,dollar_f4(A),good)
| ~ program_not_halts2_halts2_outputs(A,dollar_f4(A),bad)
| ~ program_halts2(B,B)
| ~ halts2(dollar_c3,B) ),
file('COM003+2.p',unknown),
[] ).
cnf(37,axiom,
( ~ program(A)
| ~ program_halts2_halts2_outputs(A,dollar_f4(A),good)
| ~ program_not_halts2_halts2_outputs(A,dollar_f4(A),bad)
| program_not_halts2_halts2_outputs(dollar_c3,B,good) ),
file('COM003+2.p',unknown),
[] ).
cnf(43,axiom,
algorithm_program_decides(dollar_c4),
file('COM003+2.p',unknown),
[] ).
cnf(44,plain,
program_program_decides(dollar_c1),
inference(hyper,[status(thm)],[43,29]),
[iquote('hyper,43,29')] ).
cnf(47,plain,
program_not_halts2_halts3_outputs(dollar_c1,A,B,bad),
inference(hyper,[status(thm)],[44,31]),
[iquote('hyper,44,31')] ).
cnf(48,plain,
program_halts2_halts3_outputs(dollar_c1,A,B,good),
inference(hyper,[status(thm)],[44,30]),
[iquote('hyper,44,30')] ).
cnf(50,plain,
program(dollar_c1),
inference(hyper,[status(thm)],[44,3]),
[iquote('hyper,44,3')] ).
cnf(59,plain,
program_not_halts2_halts2_outputs(dollar_c2,A,bad),
inference(hyper,[status(thm)],[48,34,50,47]),
[iquote('hyper,48,34,50,47')] ).
cnf(60,plain,
program_halts2_halts2_outputs(dollar_c2,A,good),
inference(hyper,[status(thm)],[48,33,50,47]),
[iquote('hyper,48,33,50,47')] ).
cnf(61,plain,
program(dollar_c2),
inference(hyper,[status(thm)],[48,32,50,47]),
[iquote('hyper,48,32,50,47')] ).
cnf(72,plain,
program_not_halts2_halts2_outputs(dollar_c3,A,good),
inference(hyper,[status(thm)],[60,37,61,59]),
[iquote('hyper,60,37,61,59')] ).
cnf(73,plain,
program(dollar_c3),
inference(hyper,[status(thm)],[60,35,61,59]),
[iquote('hyper,60,35,61,59')] ).
cnf(76,plain,
( program_not_halts2(dollar_c3,A)
| halts2(dollar_c3,A) ),
inference(hyper,[status(thm)],[73,17]),
[iquote('hyper,73,17')] ).
cnf(114,plain,
( halts2(dollar_c3,dollar_c3)
| halts2_outputs(dollar_c3,dollar_c3,good) ),
inference(hyper,[status(thm)],[76,27,72]),
[iquote('hyper,76,27,72')] ).
cnf(168,plain,
( halts2_outputs(dollar_c3,dollar_c3,good)
| program_halts2(dollar_c3,dollar_c3) ),
inference(hyper,[status(thm)],[114,11,73]),
[iquote('hyper,114,11,73')] ).
cnf(216,plain,
halts2_outputs(dollar_c3,dollar_c3,good),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[168,36,61,60,59,114])]),
[iquote('hyper,168,36,61,60,59,114,factor_simp')] ).
cnf(218,plain,
halts2(dollar_c3,dollar_c3),
inference(hyper,[status(thm)],[216,18]),
[iquote('hyper,216,18')] ).
cnf(222,plain,
program_halts2(dollar_c3,dollar_c3),
inference(hyper,[status(thm)],[218,11,73]),
[iquote('hyper,218,11,73')] ).
cnf(233,plain,
$false,
inference(hyper,[status(thm)],[222,36,61,60,59,218]),
[iquote('hyper,222,36,61,60,59,218')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : COM003+2 : TPTP v8.1.0. Bugfixed v2.2.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 06:58:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.94/2.14 ----- Otter 3.3f, August 2004 -----
% 1.94/2.14 The process was started by sandbox2 on n023.cluster.edu,
% 1.94/2.14 Wed Jul 27 06:58:33 2022
% 1.94/2.14 The command was "./otter". The process ID is 20068.
% 1.94/2.14
% 1.94/2.14 set(prolog_style_variables).
% 1.94/2.14 set(auto).
% 1.94/2.14 dependent: set(auto1).
% 1.94/2.14 dependent: set(process_input).
% 1.94/2.14 dependent: clear(print_kept).
% 1.94/2.14 dependent: clear(print_new_demod).
% 1.94/2.14 dependent: clear(print_back_demod).
% 1.94/2.14 dependent: clear(print_back_sub).
% 1.94/2.14 dependent: set(control_memory).
% 1.94/2.14 dependent: assign(max_mem, 12000).
% 1.94/2.14 dependent: assign(pick_given_ratio, 4).
% 1.94/2.14 dependent: assign(stats_level, 1).
% 1.94/2.14 dependent: assign(max_seconds, 10800).
% 1.94/2.14 clear(print_given).
% 1.94/2.14
% 1.94/2.14 formula_list(usable).
% 1.94/2.14 all X (program_decides(X)<-> (all Y (program(Y)-> (all Z decides(X,Y,Z))))).
% 1.94/2.14 all X (program_program_decides(X)<->program(X)&program_decides(X)).
% 1.94/2.14 all X (algorithm_program_decides(X)<->algorithm(X)&program_decides(X)).
% 1.94/2.14 all X Y (program_halts2(X,Y)<->program(X)&halts2(X,Y)).
% 1.94/2.14 all X Y Z W (halts3_outputs(X,Y,Z,W)<->halts3(X,Y,Z)&outputs(X,W)).
% 1.94/2.14 all X Y (program_not_halts2(X,Y)<->program(X)& -halts2(X,Y)).
% 1.94/2.14 all X Y W (halts2_outputs(X,Y,W)<->halts2(X,Y)&outputs(X,W)).
% 1.94/2.14 all X Y Z W (program_halts2_halts3_outputs(X,Y,Z,W)<-> (program_halts2(Y,Z)->halts3_outputs(X,Y,Z,W))).
% 1.94/2.14 all X Y Z W (program_not_halts2_halts3_outputs(X,Y,Z,W)<-> (program_not_halts2(Y,Z)->halts3_outputs(X,Y,Z,W))).
% 1.94/2.14 all X Y W (program_halts2_halts2_outputs(X,Y,W)<-> (program_halts2(Y,Y)->halts2_outputs(X,Y,W))).
% 1.94/2.14 all X Y W (program_not_halts2_halts2_outputs(X,Y,W)<-> (program_not_halts2(Y,Y)->halts2_outputs(X,Y,W))).
% 1.94/2.14 (exists X algorithm_program_decides(X))-> (exists W program_program_decides(W)).
% 1.94/2.14 all W (program_program_decides(W)-> (all Y Z (program_halts2_halts3_outputs(W,Y,Z,good)&program_not_halts2_halts3_outputs(W,Y,Z,bad)))).
% 1.94/2.14 (exists W (program(W)& (all Y (program_halts2_halts3_outputs(W,Y,Y,good)&program_not_halts2_halts3_outputs(W,Y,Y,bad)))))-> (exists V (program(V)& (all Y (program_halts2_halts2_outputs(V,Y,good)&program_not_halts2_halts2_outputs(V,Y,bad))))).
% 1.94/2.14 (exists V (program(V)& (all Y (program_halts2_halts2_outputs(V,Y,good)&program_not_halts2_halts2_outputs(V,Y,bad)))))-> (exists U (program(U)& (all Y ((program_halts2(Y,Y)-> -halts2(U,Y))&program_not_halts2_halts2_outputs(U,Y,good))))).
% 1.94/2.14 -(-(exists X algorithm_program_decides(X))).
% 1.94/2.14 end_of_list.
% 1.94/2.14
% 1.94/2.14 -------> usable clausifies to:
% 1.94/2.14
% 1.94/2.14 list(usable).
% 1.94/2.14 0 [] -program_decides(X)| -program(Y)|decides(X,Y,Z).
% 1.94/2.14 0 [] program_decides(X)|program($f2(X)).
% 1.94/2.14 0 [] program_decides(X)| -decides(X,$f2(X),$f1(X)).
% 1.94/2.14 0 [] -program_program_decides(X)|program(X).
% 1.94/2.14 0 [] -program_program_decides(X)|program_decides(X).
% 1.94/2.14 0 [] program_program_decides(X)| -program(X)| -program_decides(X).
% 1.94/2.14 0 [] -algorithm_program_decides(X)|algorithm(X).
% 1.94/2.14 0 [] -algorithm_program_decides(X)|program_decides(X).
% 1.94/2.14 0 [] algorithm_program_decides(X)| -algorithm(X)| -program_decides(X).
% 1.94/2.14 0 [] -program_halts2(X,Y)|program(X).
% 1.94/2.14 0 [] -program_halts2(X,Y)|halts2(X,Y).
% 1.94/2.14 0 [] program_halts2(X,Y)| -program(X)| -halts2(X,Y).
% 1.94/2.14 0 [] -halts3_outputs(X,Y,Z,W)|halts3(X,Y,Z).
% 1.94/2.14 0 [] -halts3_outputs(X,Y,Z,W)|outputs(X,W).
% 1.94/2.14 0 [] halts3_outputs(X,Y,Z,W)| -halts3(X,Y,Z)| -outputs(X,W).
% 1.94/2.14 0 [] -program_not_halts2(X,Y)|program(X).
% 1.94/2.14 0 [] -program_not_halts2(X,Y)| -halts2(X,Y).
% 1.94/2.14 0 [] program_not_halts2(X,Y)| -program(X)|halts2(X,Y).
% 1.94/2.14 0 [] -halts2_outputs(X,Y,W)|halts2(X,Y).
% 1.94/2.14 0 [] -halts2_outputs(X,Y,W)|outputs(X,W).
% 1.94/2.14 0 [] halts2_outputs(X,Y,W)| -halts2(X,Y)| -outputs(X,W).
% 1.94/2.14 0 [] -program_halts2_halts3_outputs(X,Y,Z,W)| -program_halts2(Y,Z)|halts3_outputs(X,Y,Z,W).
% 1.94/2.14 0 [] program_halts2_halts3_outputs(X,Y,Z,W)|program_halts2(Y,Z).
% 1.94/2.14 0 [] program_halts2_halts3_outputs(X,Y,Z,W)| -halts3_outputs(X,Y,Z,W).
% 1.94/2.14 0 [] -program_not_halts2_halts3_outputs(X,Y,Z,W)| -program_not_halts2(Y,Z)|halts3_outputs(X,Y,Z,W).
% 1.94/2.14 0 [] program_not_halts2_halts3_outputs(X,Y,Z,W)|program_not_halts2(Y,Z).
% 1.94/2.14 0 [] program_not_halts2_halts3_outputs(X,Y,Z,W)| -halts3_outputs(X,Y,Z,W).
% 1.94/2.14 0 [] -program_halts2_halts2_outputs(X,Y,W)| -program_halts2(Y,Y)|halts2_outputs(X,Y,W).
% 1.94/2.14 0 [] program_halts2_halts2_outputs(X,Y,W)|program_halts2(Y,Y).
% 1.94/2.14 0 [] program_halts2_halts2_outputs(X,Y,W)| -halts2_outputs(X,Y,W).
% 1.94/2.14 0 [] -program_not_halts2_halts2_outputs(X,Y,W)| -program_not_halts2(Y,Y)|halts2_outputs(X,Y,W).
% 1.94/2.14 0 [] program_not_halts2_halts2_outputs(X,Y,W)|program_not_halts2(Y,Y).
% 1.94/2.14 0 [] program_not_halts2_halts2_outputs(X,Y,W)| -halts2_outputs(X,Y,W).
% 1.94/2.14 0 [] -algorithm_program_decides(X)|program_program_decides($c1).
% 1.94/2.14 0 [] -program_program_decides(W)|program_halts2_halts3_outputs(W,Y,Z,good).
% 1.94/2.14 0 [] -program_program_decides(W)|program_not_halts2_halts3_outputs(W,Y,Z,bad).
% 1.94/2.14 0 [] -program(W)| -program_halts2_halts3_outputs(W,$f3(W),$f3(W),good)| -program_not_halts2_halts3_outputs(W,$f3(W),$f3(W),bad)|program($c2).
% 1.94/2.14 0 [] -program(W)| -program_halts2_halts3_outputs(W,$f3(W),$f3(W),good)| -program_not_halts2_halts3_outputs(W,$f3(W),$f3(W),bad)|program_halts2_halts2_outputs($c2,Y,good).
% 1.94/2.14 0 [] -program(W)| -program_halts2_halts3_outputs(W,$f3(W),$f3(W),good)| -program_not_halts2_halts3_outputs(W,$f3(W),$f3(W),bad)|program_not_halts2_halts2_outputs($c2,Y,bad).
% 1.94/2.14 0 [] -program(V)| -program_halts2_halts2_outputs(V,$f4(V),good)| -program_not_halts2_halts2_outputs(V,$f4(V),bad)|program($c3).
% 1.94/2.14 0 [] -program(V)| -program_halts2_halts2_outputs(V,$f4(V),good)| -program_not_halts2_halts2_outputs(V,$f4(V),bad)| -program_halts2(Y,Y)| -halts2($c3,Y).
% 1.94/2.14 0 [] -program(V)| -program_halts2_halts2_outputs(V,$f4(V),good)| -program_not_halts2_halts2_outputs(V,$f4(V),bad)|program_not_halts2_halts2_outputs($c3,Y,good).
% 1.94/2.14 0 [] algorithm_program_decides($c4).
% 1.94/2.14 end_of_list.
% 1.94/2.14
% 1.94/2.14 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.94/2.14
% 1.94/2.14 This is a non-Horn set without equality. The strategy will
% 1.94/2.14 be ordered hyper_res, unit deletion, and factoring, with
% 1.94/2.14 satellites in sos and with nuclei in usable.
% 1.94/2.14
% 1.94/2.14 dependent: set(hyper_res).
% 1.94/2.14 dependent: set(factor).
% 1.94/2.14 dependent: set(unit_deletion).
% 1.94/2.14
% 1.94/2.14 ------------> process usable:
% 1.94/2.14 ** KEPT (pick-wt=8): 1 [] -program_decides(A)| -program(B)|decides(A,B,C).
% 1.94/2.14 ** KEPT (pick-wt=8): 2 [] program_decides(A)| -decides(A,$f2(A),$f1(A)).
% 1.94/2.14 ** KEPT (pick-wt=4): 3 [] -program_program_decides(A)|program(A).
% 1.94/2.14 ** KEPT (pick-wt=4): 4 [] -program_program_decides(A)|program_decides(A).
% 1.94/2.14 ** KEPT (pick-wt=6): 5 [] program_program_decides(A)| -program(A)| -program_decides(A).
% 1.94/2.14 ** KEPT (pick-wt=4): 6 [] -algorithm_program_decides(A)|algorithm(A).
% 1.94/2.14 ** KEPT (pick-wt=4): 7 [] -algorithm_program_decides(A)|program_decides(A).
% 1.94/2.14 ** KEPT (pick-wt=6): 8 [] algorithm_program_decides(A)| -algorithm(A)| -program_decides(A).
% 1.94/2.14 ** KEPT (pick-wt=5): 9 [] -program_halts2(A,B)|program(A).
% 1.94/2.14 ** KEPT (pick-wt=6): 10 [] -program_halts2(A,B)|halts2(A,B).
% 1.94/2.14 ** KEPT (pick-wt=8): 11 [] program_halts2(A,B)| -program(A)| -halts2(A,B).
% 1.94/2.14 ** KEPT (pick-wt=9): 12 [] -halts3_outputs(A,B,C,D)|halts3(A,B,C).
% 1.94/2.14 ** KEPT (pick-wt=8): 13 [] -halts3_outputs(A,B,C,D)|outputs(A,D).
% 1.94/2.14 ** KEPT (pick-wt=12): 14 [] halts3_outputs(A,B,C,D)| -halts3(A,B,C)| -outputs(A,D).
% 1.94/2.14 ** KEPT (pick-wt=5): 15 [] -program_not_halts2(A,B)|program(A).
% 1.94/2.14 ** KEPT (pick-wt=6): 16 [] -program_not_halts2(A,B)| -halts2(A,B).
% 1.94/2.14 ** KEPT (pick-wt=8): 17 [] program_not_halts2(A,B)| -program(A)|halts2(A,B).
% 1.94/2.14 ** KEPT (pick-wt=7): 18 [] -halts2_outputs(A,B,C)|halts2(A,B).
% 1.94/2.14 ** KEPT (pick-wt=7): 19 [] -halts2_outputs(A,B,C)|outputs(A,C).
% 1.94/2.14 ** KEPT (pick-wt=10): 20 [] halts2_outputs(A,B,C)| -halts2(A,B)| -outputs(A,C).
% 1.94/2.14 ** KEPT (pick-wt=13): 21 [] -program_halts2_halts3_outputs(A,B,C,D)| -program_halts2(B,C)|halts3_outputs(A,B,C,D).
% 1.94/2.14 ** KEPT (pick-wt=10): 22 [] program_halts2_halts3_outputs(A,B,C,D)| -halts3_outputs(A,B,C,D).
% 1.94/2.14 ** KEPT (pick-wt=13): 23 [] -program_not_halts2_halts3_outputs(A,B,C,D)| -program_not_halts2(B,C)|halts3_outputs(A,B,C,D).
% 1.94/2.14 ** KEPT (pick-wt=10): 24 [] program_not_halts2_halts3_outputs(A,B,C,D)| -halts3_outputs(A,B,C,D).
% 1.94/2.14 ** KEPT (pick-wt=11): 25 [] -program_halts2_halts2_outputs(A,B,C)| -program_halts2(B,B)|halts2_outputs(A,B,C).
% 1.94/2.14 ** KEPT (pick-wt=8): 26 [] program_halts2_halts2_outputs(A,B,C)| -halts2_outputs(A,B,C).
% 1.94/2.14 ** KEPT (pick-wt=11): 27 [] -program_not_halts2_halts2_outputs(A,B,C)| -program_not_halts2(B,B)|halts2_outputs(A,B,C).
% 1.94/2.14 ** KEPT (pick-wt=8): 28 [] program_not_halts2_halts2_outputs(A,B,C)| -halts2_outputs(A,B,C).
% 1.94/2.14 ** KEPT (pick-wt=4): 29 [] -algorithm_program_decides(A)|program_program_decides($c1).
% 1.94/2.15 ** KEPT (pick-wt=7): 30 [] -program_program_decides(A)|program_halts2_halts3_outputs(A,B,C,good).
% 1.94/2.15 ** KEPT (pick-wt=7): 31 [] -program_program_decides(A)|program_not_halts2_halts3_outputs(A,B,C,bad).
% 1.94/2.15 ** KEPT (pick-wt=18): 32 [] -program(A)| -program_halts2_halts3_outputs(A,$f3(A),$f3(A),good)| -program_not_halts2_halts3_outputs(A,$f3(A),$f3(A),bad)|program($c2).
% 1.94/2.15 ** KEPT (pick-wt=20): 33 [] -program(A)| -program_halts2_halts3_outputs(A,$f3(A),$f3(A),good)| -program_not_halts2_halts3_outputs(A,$f3(A),$f3(A),bad)|program_halts2_halts2_outputs($c2,B,good).
% 1.94/2.15 ** KEPT (pick-wt=20): 34 [] -program(A)| -program_halts2_halts3_outputs(A,$f3(A),$f3(A),good)| -program_not_halts2_halts3_outputs(A,$f3(A),$f3(A),bad)|program_not_halts2_halts2_outputs($c2,B,bad).
% 1.94/2.15 ** KEPT (pick-wt=14): 35 [] -program(A)| -program_halts2_halts2_outputs(A,$f4(A),good)| -program_not_halts2_halts2_outputs(A,$f4(A),bad)|program($c3).
% 1.94/2.15 ** KEPT (pick-wt=18): 36 [] -program(A)| -program_halts2_halts2_outputs(A,$f4(A),good)| -program_not_halts2_halts2_outputs(A,$f4(A),bad)| -program_halts2(B,B)| -halts2($c3,B).
% 1.94/2.15 ** KEPT (pick-wt=16): 37 [] -program(A)| -program_halts2_halts2_outputs(A,$f4(A),good)| -program_not_halts2_halts2_outputs(A,$f4(A),bad)|program_not_halts2_halts2_outputs($c3,B,good).
% 1.94/2.15
% 1.94/2.15 ------------> process sos:
% 1.94/2.15 ** KEPT (pick-wt=5): 38 [] program_decides(A)|program($f2(A)).
% 1.94/2.15 ** KEPT (pick-wt=8): 39 [] program_halts2_halts3_outputs(A,B,C,D)|program_halts2(B,C).
% 1.94/2.15 ** KEPT (pick-wt=8): 40 [] program_not_halts2_halts3_outputs(A,B,C,D)|program_not_halts2(B,C).
% 1.94/2.15 ** KEPT (pick-wt=7): 41 [] program_halts2_halts2_outputs(A,B,C)|program_halts2(B,B).
% 1.94/2.15 ** KEPT (pick-wt=7): 42 [] program_not_halts2_halts2_outputs(A,B,C)|program_not_halts2(B,B).
% 1.94/2.15 ** KEPT (pick-wt=2): 43 [] algorithm_program_decides($c4).
% 1.94/2.15
% 1.94/2.15 ======= end of input processing =======
% 1.94/2.15
% 1.94/2.15 =========== start of search ===========
% 1.94/2.15
% 1.94/2.15 -------- PROOF --------
% 1.94/2.15
% 1.94/2.15 -----> EMPTY CLAUSE at 0.01 sec ----> 233 [hyper,222,36,61,60,59,218] $F.
% 1.94/2.15
% 1.94/2.15 Length of proof is 15. Level of proof is 10.
% 1.94/2.15
% 1.94/2.15 ---------------- PROOF ----------------
% 1.94/2.15 % SZS status Theorem
% 1.94/2.15 % SZS output start Refutation
% See solution above
% 1.94/2.15 ------------ end of proof -------------
% 1.94/2.15
% 1.94/2.15
% 1.94/2.15 Search stopped by max_proofs option.
% 1.94/2.15
% 1.94/2.15
% 1.94/2.15 Search stopped by max_proofs option.
% 1.94/2.15
% 1.94/2.15 ============ end of search ============
% 1.94/2.15
% 1.94/2.15 -------------- statistics -------------
% 1.94/2.15 clauses given 67
% 1.94/2.15 clauses generated 580
% 1.94/2.15 clauses kept 232
% 1.94/2.15 clauses forward subsumed 390
% 1.94/2.15 clauses back subsumed 48
% 1.94/2.15 Kbytes malloced 976
% 1.94/2.15
% 1.94/2.15 ----------- times (seconds) -----------
% 1.94/2.15 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.94/2.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.15 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.94/2.15
% 1.94/2.15 That finishes the proof of the theorem.
% 1.94/2.15
% 1.94/2.15 Process 20068 finished Wed Jul 27 06:58:35 2022
% 1.94/2.15 Otter interrupted
% 1.94/2.15 PROOF FOUND
%------------------------------------------------------------------------------