TSTP Solution File: COM003-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COM003-1 : TPTP v8.1.0. Bugfixed v1.0.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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.09s 300.38s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COM003-1 : TPTP v8.1.0. Bugfixed v1.0.1.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n015.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 : 600
% 0.12/0.33 % DateTime : Thu Jun 16 17:18:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/1.00 ============================== Prover9 ===============================
% 0.69/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.69/1.00 Process 10389 was started by sandbox2 on n015.cluster.edu,
% 0.69/1.00 Thu Jun 16 17:18:27 2022
% 0.69/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_10236_n015.cluster.edu".
% 0.69/1.00 ============================== end of head ===========================
% 0.69/1.00
% 0.69/1.00 ============================== INPUT =================================
% 0.69/1.00
% 0.69/1.00 % Reading from file /tmp/Prover9_10236_n015.cluster.edu
% 0.69/1.00
% 0.69/1.00 set(prolog_style_variables).
% 0.69/1.00 set(auto2).
% 0.69/1.00 % set(auto2) -> set(auto).
% 0.69/1.00 % set(auto) -> set(auto_inference).
% 0.69/1.00 % set(auto) -> set(auto_setup).
% 0.69/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.69/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/1.00 % set(auto) -> set(auto_limits).
% 0.69/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/1.00 % set(auto) -> set(auto_denials).
% 0.69/1.00 % set(auto) -> set(auto_process).
% 0.69/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.69/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.69/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.69/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.69/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.69/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.69/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.69/1.00 % set(auto2) -> assign(stats, some).
% 0.69/1.00 % set(auto2) -> clear(echo_input).
% 0.69/1.00 % set(auto2) -> set(quiet).
% 0.69/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.69/1.00 % set(auto2) -> clear(print_given).
% 0.69/1.00 assign(lrs_ticks,-1).
% 0.69/1.00 assign(sos_limit,10000).
% 0.69/1.00 assign(order,kbo).
% 0.69/1.00 set(lex_order_vars).
% 0.69/1.00 clear(print_given).
% 0.69/1.00
% 0.69/1.00 % formulas(sos). % not echoed (50 formulas)
% 0.69/1.00
% 0.69/1.00 ============================== end of input ==========================
% 0.69/1.00
% 0.69/1.00 % From the command line: assign(max_seconds, 300).
% 0.69/1.00
% 0.69/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/1.00
% 0.69/1.00 % Formulas that are not ordinary clauses:
% 0.69/1.00
% 0.69/1.00 ============================== end of process non-clausal formulas ===
% 0.69/1.00
% 0.69/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/1.00
% 0.69/1.00 ============================== PREDICATE ELIMINATION =================
% 0.69/1.00 1 -algorithm(A) | program(f2(A)) | program(c1) # label(hypothesis_1_1) # label(hypothesis). [assumption].
% 0.69/1.00 2 algorithm(c4) # label(a_deciding_algorithm) # label(negated_conjecture). [assumption].
% 0.69/1.00 Derived: program(f2(c4)) | program(c1). [resolve(1,a,2,a)].
% 0.69/1.00 3 -algorithm(A) | -decides(A,f2(A),f1(A)) | program(c1) # label(hypothesis_1_3) # label(hypothesis). [assumption].
% 0.69/1.00 Derived: -decides(c4,f2(c4),f1(c4)) | program(c1). [resolve(3,a,2,a)].
% 0.69/1.00 4 -algorithm(A) | program(f2(A)) | -program(B) | decides(c1,B,C) # label(hypothesis_1_2) # label(hypothesis). [assumption].
% 0.69/1.00 Derived: program(f2(c4)) | -program(A) | decides(c1,A,B). [resolve(4,a,2,a)].
% 0.69/1.00 5 -algorithm(A) | -decides(A,f2(A),f1(A)) | -program(B) | decides(c1,B,C) # label(hypothesis_1_4) # label(hypothesis). [assumption].
% 0.69/1.00 Derived: -decides(c4,f2(c4),f1(c4)) | -program(A) | decides(c1,A,B). [resolve(5,a,2,a)].
% 0.69/1.00 6 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -outputs(A,bad) | program(c2) # label(hypothesis_3_16) # label(hypothesis). [assumption].
% 0.69/1.00 7 -program(A) | program(f4(A)) | -program(B) | -halts2(B,C) | halts3(A,B,C) # label(hypothesis_2_1) # label(hypothesis). [assumption].
% 0.69/1.00 8 -program(A) | program(f4(A)) | -program(B) | halts2(B,C) | halts3(A,B,C) # label(hypothesis_2_3) # label(hypothesis). [assumption].
% 0.69/1.00 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | program(c2) | -program(A) | program(f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(6,b,7,e)].
% 0.69/1.00 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | program(c2) | -program(A) | program(f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(6,b,8,e)].
% 0.69/1.00 9 -program(A) | -decides(A,f4(A),f3(A)) | -program(B) | -halts2(B,C) | halts3(A,B,C) # label(hypothesis_2_5) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)) | -program(A) | -outputs(A,good) | -outputs(A,bad) | program(c2). [resolve(9,e,6,b)].
% 0.69/1.01 10 -program(A) | -decides(A,f4(A),f3(A)) | -program(B) | halts2(B,C) | halts3(A,B,C) # label(hypothesis_2_7) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)) | -program(A) | -outputs(A,good) | -outputs(A,bad) | program(c2). [resolve(10,e,6,b)].
% 0.69/1.01 11 -program(A) | halts2(f5(A),f5(A)) | -halts3(A,f5(A),f5(A)) | -outputs(A,bad) | program(c2) # label(hypothesis_3_6) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | program(c2) | -program(A) | program(f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(11,c,8,e)].
% 0.69/1.01 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | program(c2) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(11,c,10,e)].
% 0.69/1.01 12 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -halts2(f5(A),f5(A)) | program(c2) # label(hypothesis_3_11) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | program(c2) | -program(A) | program(f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(12,b,7,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | program(c2) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(12,b,9,e)].
% 0.69/1.01 13 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) # label(hypothesis_3_17) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | program(f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(13,b,7,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | program(f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(13,b,8,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(13,b,9,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(13,b,10,e)].
% 0.69/1.01 14 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) # label(hypothesis_3_18) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | program(f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(14,b,7,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | program(f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(14,b,8,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(14,b,9,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(14,b,10,e)].
% 0.69/1.01 15 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) # label(hypothesis_3_19) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | program(f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(15,b,7,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | program(f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(15,b,8,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(15,b,9,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(15,b,10,e)].
% 0.69/1.01 16 -program(A) | -halts3(A,f5(A),f5(A)) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) # label(hypothesis_3_20) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | program(f4(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(16,b,7,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | program(f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(16,b,8,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | -halts2(f5(A),f5(A)). [resolve(16,b,9,e)].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(16,b,10,e)].
% 0.69/1.01 17 -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(hypothesis_3_7) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | program(f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(17,c,8,e)].
% 0.69/1.01 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | -halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(17,c,10,e)].
% 0.69/1.01 18 -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(hypothesis_3_8) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | program(f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(18,c,8,e)].
% 0.69/1.01 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | -halts2(B,B) | outputs(c2,good) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(18,c,10,e)].
% 0.69/1.01 19 -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(hypothesis_3_9) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | program(f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(19,c,8,e)].
% 0.69/1.01 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | halts2(B,B) | halts2(c2,B) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(19,c,10,e)].
% 0.69/1.01 20 -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(hypothesis_3_10) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | program(f4(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(20,c,8,e)].
% 0.69/1.01 Derived: -program(A) | halts2(f5(A),f5(A)) | -outputs(A,bad) | -program(B) | halts2(B,B) | outputs(c2,bad) | -program(A) | -decides(A,f4(A),f3(A)) | -program(f5(A)) | halts2(f5(A),f5(A)). [resolve(20,c,10,e)].
% 0.69/1.01 21 -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(hypothesis_3_12) # label(hypothesis). [assumption].
% 0.69/1.01 Derived: -program(A) | -outputs(A,good) | -halts2(f5(A),f5(A)) | -program(B) | -halts2(B,B) | halts2(c2,B) | -proCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------