TSTP Solution File: COM003+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COM003+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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 : 600s
% DateTime : Fri Jul 15 01:38:17 EDT 2022
% Result : Timeout 300.07s 300.34s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : COM003+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 16 19:00:12 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.50/1.05 ============================== Prover9 ===============================
% 0.50/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.50/1.05 Process 10935 was started by sandbox on n028.cluster.edu,
% 0.50/1.05 Thu Jun 16 19:00:12 2022
% 0.50/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10782_n028.cluster.edu".
% 0.50/1.05 ============================== end of head ===========================
% 0.50/1.05
% 0.50/1.05 ============================== INPUT =================================
% 0.50/1.05
% 0.50/1.05 % Reading from file /tmp/Prover9_10782_n028.cluster.edu
% 0.50/1.05
% 0.50/1.05 set(prolog_style_variables).
% 0.50/1.05 set(auto2).
% 0.50/1.05 % set(auto2) -> set(auto).
% 0.50/1.05 % set(auto) -> set(auto_inference).
% 0.50/1.05 % set(auto) -> set(auto_setup).
% 0.50/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.50/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.50/1.05 % set(auto) -> set(auto_limits).
% 0.50/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.50/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.50/1.05 % set(auto) -> set(auto_denials).
% 0.50/1.05 % set(auto) -> set(auto_process).
% 0.50/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.50/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.50/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.50/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.50/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.50/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.50/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.50/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.50/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.50/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.50/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.50/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.50/1.05 % set(auto2) -> assign(stats, some).
% 0.50/1.05 % set(auto2) -> clear(echo_input).
% 0.50/1.05 % set(auto2) -> set(quiet).
% 0.50/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.50/1.05 % set(auto2) -> clear(print_given).
% 0.50/1.05 assign(lrs_ticks,-1).
% 0.50/1.05 assign(sos_limit,10000).
% 0.50/1.05 assign(order,kbo).
% 0.50/1.05 set(lex_order_vars).
% 0.50/1.05 clear(print_given).
% 0.50/1.05
% 0.50/1.05 % formulas(sos). % not echoed (5 formulas)
% 0.50/1.05
% 0.50/1.05 ============================== end of input ==========================
% 0.50/1.05
% 0.50/1.05 % From the command line: assign(max_seconds, 300).
% 0.50/1.05
% 0.50/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.50/1.05
% 0.50/1.05 % Formulas that are not ordinary clauses:
% 0.50/1.05 1 (exists X (algorithm(X) & (all Y (program(Y) -> (all Z decides(X,Y,Z)))))) -> (exists W (program(W) & (all Y (program(Y) -> (all Z decides(W,Y,Z)))))) # label(p1) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.05 2 (all W (program(W) & (all Y (program(Y) -> (all Z decides(W,Y,Z)))) -> (all Y all Z ((program(Y) & halts2(Y,Z) -> halts3(W,Y,Z) & outputs(W,good)) & (program(Y) & -halts2(Y,Z) -> halts3(W,Y,Z) & outputs(W,bad)))))) # label(p2) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.05 3 (exists W (program(W) & (all Y ((program(Y) & halts2(Y,Y) -> halts3(W,Y,Y) & outputs(W,good)) & (program(Y) & -halts2(Y,Y) -> halts3(W,Y,Y) & outputs(W,bad)))))) -> (exists V (program(V) & (all Y ((program(Y) & halts2(Y,Y) -> halts2(V,Y) & outputs(V,good)) & (program(Y) & -halts2(Y,Y) -> halts2(V,Y) & outputs(V,bad)))))) # label(p3) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.05 4 (exists V (program(V) & (all Y ((program(Y) & halts2(Y,Y) -> halts2(V,Y) & outputs(V,good)) & (program(Y) & -halts2(Y,Y) -> halts2(V,Y) & outputs(V,bad)))))) -> (exists U (program(U) & (all Y ((program(Y) & halts2(Y,Y) -> -halts2(U,Y)) & (program(Y) & -halts2(Y,Y) -> halts2(U,Y) & outputs(U,bad)))))) # label(p4) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.05 5 --(exists X1 (algorithm(X1) & (all Y1 (program(Y1) -> (all Z1 decides(X1,Y1,Z1)))))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.50/1.05
% 0.50/1.05 ============================== end of process non-clausal formulas ===
% 0.50/1.05
% 0.50/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.50/1.05
% 0.50/1.05 ============================== PREDICATE ELIMINATION =================
% 0.50/1.05 6 -algorithm(A) | program(f1(A)) | program(c1) # label(p1) # label(axiom). [clausify(1)].
% 0.50/1.05 7 algorithm(c4) # label(prove_this) # label(negated_conjecture). [clausify(5)].
% 0.50/1.05 Derived: program(f1(c4)) | program(c1). [resolve(6,a,7,a)].
% 0.50/1.05 8 -algorithm(A) | -decides(A,f1(A),f2(A)) | program(c1) # label(p1) # label(axiom). [clausify(1)].
% 0.50/1.05 Derived: -decides(c4,f1(c4),f2(c4)) | program(c1). [resolve(8,a,7,a)].
% 0.50/1.05 9 -algorithm(A) | program(f1(A)) | -program(B) | decides(c1,B,C) # label(p1) # label(axiom). [clausify(1)].
% 0.50/1.05 Derived: program(f1(c4)) | -program(A) | decides(c1,A,B). [resolve(9,a,7,a)].
% 0.50/1.05 10 -algorithm(A) | -decides(A,f1(A),f2(A)) | -program(B) | decides(c1,B,C) # label(p1) # label(axiom). [clausify(1)].
% 0.50/1.05 Derived: -decides(c4,f1(c4),f2(c4)) | -program(A) | decides(c1,A,B). [resolve(10,a,7,a)].
% 0.50/1.05 11 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -outputs(A,bad) | program(c2) # label(p3) # label(axiom). [clausify(3)].
% 0.50/1.05 12 -program(A) | program(f3(A)) | -program(B) | -halts2(B,C) | halts3(A,B,C) # label(p2) # label(axiom). [clausify(2)].
% 0.50/1.05 13 -program(A) | program(f3(A)) | -program(B) | halts2(B,C) | halts3(A,B,C) # label(p2) # label(axiom). [clausify(2)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | program(c2) | -program(A) | program(f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(11,b,12,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | program(c2) | -program(A) | program(f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(11,b,13,e)].
% 0.50/1.05 14 -program(A) | -decides(A,f3(A),f4(A)) | -program(B) | -halts2(B,C) | halts3(A,B,C) # label(p2) # label(axiom). [clausify(2)].
% 0.50/1.05 Derived: -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)) | -program(A) | -outputs(A,good) | -outputs(A,bad) | program(c2). [resolve(14,e,11,b)].
% 0.50/1.05 15 -program(A) | -decides(A,f3(A),f4(A)) | -program(B) | halts2(B,C) | halts3(A,B,C) # label(p2) # label(axiom). [clausify(2)].
% 0.50/1.05 Derived: -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)) | -program(A) | -outputs(A,good) | -outputs(A,bad) | program(c2). [resolve(15,e,11,b)].
% 0.50/1.05 16 -program(A) | halts2(f5(A),f5(A)) | -halts3(A,f5(A),f5(A)) | -outputs(A,bad) | program(c2) # label(p3) # label(axiom). [clausify(3)].
% 0.50/1.05 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | program(c2) | -program(A) | program(f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(16,c,13,e)].
% 0.50/1.05 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | program(c2) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(16,c,15,e)].
% 0.50/1.05 17 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -halts2(f5(A),f5(A)) | program(c2) # label(p3) # label(axiom). [clausify(3)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | program(c2) | -program(A) | program(f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(17,b,12,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | program(c2) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(17,b,14,e)].
% 0.50/1.05 18 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) # label(p3) # label(axiom). [clausify(3)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | program(f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(18,b,12,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | program(f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(18,b,13,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(18,b,14,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(18,b,15,e)].
% 0.50/1.05 19 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) # label(p3) # label(axiom). [clausify(3)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | program(f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(19,b,12,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | program(f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(19,b,13,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(19,b,14,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(19,b,15,e)].
% 0.50/1.05 20 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) # label(p3) # label(axiom). [clausify(3)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | program(f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(20,b,12,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | program(f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(20,b,13,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(20,b,14,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(20,b,15,e)].
% 0.50/1.05 21 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) # label(p3) # label(axiom). [clausify(3)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | program(f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(21,b,12,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | program(f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(21,b,13,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(21,b,14,e)].
% 0.50/1.05 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(21,b,15,e)].
% 0.50/1.05 22 -program(A) | halts2(f5(A),f5(A)) | -halts3(A,f5(A),f5(A)) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) # label(p3) # label(axiom). [clausify(3)].
% 0.50/1.05 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | program(f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(22,c,13,e)].
% 0.50/1.05 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(22,c,15,e)].
% 0.50/1.05 23 -program(A) | halts2(f5(A),f5(A)) | -halts3(A,f5(A),f5(A)) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) # label(p3) # label(axiom). [clausify(3)].
% 0.50/1.05 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | program(f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(23,c,13,e)].
% 0.50/1.05 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(23,c,15,e)].
% 0.50/1.05 24 -program(A) | halts2(f5(A),f5(A)) | -halts3(A,f5(A),f5(A)) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) # label(p3) # label(axiom). [clausify(3)].
% 0.50/1.05 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | program(f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(24,c,13,e)].
% 3.57/3.86 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(24,c,15,e)].
% 3.57/3.86 25 -program(A) | halts2(f5(A),f5(A)) | -halts3(A,f5(A),f5(A)) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) # label(p3) # label(axiom). [clausify(3)].
% 3.57/3.86 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | program(f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(25,c,13,e)].
% 3.57/3.86 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(25,c,15,e)].
% 3.57/3.86 26 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | -halts2(B,B) | halts2(c2,B) # label(p3) # label(axiom). [clausify(3)].
% 3.57/3.86 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | program(f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(26,b,12,e)].
% 3.57/3.86 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(26,b,14,e)].
% 3.57/3.86 27 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | -halts2(B,B) | outputs(c2,good) # label(p3) # label(axiom). [clausify(3)].
% 3.57/3.86 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | program(f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(27,b,12,e)].
% 3.57/3.86 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(27,b,14,e)].
% 3.57/3.86 28 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | halts2(B,B) | halts2(c2,B) # label(p3) # label(axiom). [clausify(3)].
% 3.57/3.86 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | program(f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(28,b,12,e)].
% 3.57/3.86 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(28,b,14,e)].
% 3.57/3.86 29 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | halts2(B,B) | outputs(c2,bad) # label(p3) # label(axiom). [clausify(3)].
% 3.57/3.86 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | program(f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(29,b,12,e)].
% 3.57/3.86 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | -decides(A,f3(A),f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(29,b,14,e)].
% 3.57/3.86
% 3.57/3.86 ============================== end predicate elimination =============
% 3.57/3.86
% 3.57/3.86 Auto_denials: (non-Horn, no changes).
% 3.57/3.86
% 3.57/3.86 Term ordering decisions:
% 3.57/3.86 Function symbol KB weights: bad=1. good=1. c1=1. c2=1. c3=1. c4=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1.
% 3.57/3.86
% 3.57/3.86 ============================== end of process initial clauses ========
% 3.57/3.86
% 3.57/3.86 ============================== CLAUSES FOR SEARCH ====================
% 3.57/3.86
% 3.57/3.86 ============================== end of clauses for search =============
% 3.57/3.86
% 3.57/3.86 ============================== SEARCH ================================
% 3.57/3.86
% 3.57/3.86 % Starting search at 0.03 seconds.
% 3.57/3.86
% 3.57/3.86 Low Water (keep): wt=38.000, iters=3334
% 3.57/3.86
% 3.57/3.86 Low Water (keep): wt=37.000, iters=3342
% 3.57/3.86
% 3.57/3.86 Low Water (keep): wt=36.000, iters=3339
% 3.57/3.86
% 3.57/3.86 Low Water (keep): wt=35.000, iters=3336
% 3.57/3.86
% 3.57/3.86 Low Water (keep): wt=34.000, iters=3339
% 3.57/3.86
% 3.57/3.86 Low Water (keep): wt=30.000, iters=3364
% 3.57/3.86
% 3.57/3.86 Low Water (keep): wt=29.000, iters=3416
% 3.57/3.86
% 3.57/3.86 Low Water (keep): wt=28.000, iters=3342
% 3.57/3.86
% 3.57/3.86 Low Water (keepCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------