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