TSTP Solution File: GRP129-3.005 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP129-3.005 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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 : Sat Jul 16 11:17:33 EDT 2022
% Result : Timeout 300.07s 300.35s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP129-3.005 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n005.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 : Mon Jun 13 16:36:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/0.97 ============================== Prover9 ===============================
% 0.69/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.97 Process 24632 was started by sandbox on n005.cluster.edu,
% 0.69/0.97 Mon Jun 13 16:36:24 2022
% 0.69/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24479_n005.cluster.edu".
% 0.69/0.97 ============================== end of head ===========================
% 0.69/0.97
% 0.69/0.97 ============================== INPUT =================================
% 0.69/0.97
% 0.69/0.97 % Reading from file /tmp/Prover9_24479_n005.cluster.edu
% 0.69/0.97
% 0.69/0.97 set(prolog_style_variables).
% 0.69/0.97 set(auto2).
% 0.69/0.97 % set(auto2) -> set(auto).
% 0.69/0.97 % set(auto) -> set(auto_inference).
% 0.69/0.97 % set(auto) -> set(auto_setup).
% 0.69/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.69/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.97 % set(auto) -> set(auto_limits).
% 0.69/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.97 % set(auto) -> set(auto_denials).
% 0.69/0.97 % set(auto) -> set(auto_process).
% 0.69/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.69/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.69/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.69/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.69/0.98 % set(auto2) -> assign(stats, some).
% 0.69/0.98 % set(auto2) -> clear(echo_input).
% 0.69/0.98 % set(auto2) -> set(quiet).
% 0.69/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.98 % set(auto2) -> clear(print_given).
% 0.69/0.98 assign(lrs_ticks,-1).
% 0.69/0.98 assign(sos_limit,10000).
% 0.69/0.98 assign(order,kbo).
% 0.69/0.98 set(lex_order_vars).
% 0.69/0.98 clear(print_given).
% 0.69/0.98
% 0.69/0.98 % formulas(sos). % not echoed (57 formulas)
% 0.69/0.98
% 0.69/0.98 ============================== end of input ==========================
% 0.69/0.98
% 0.69/0.98 % From the command line: assign(max_seconds, 300).
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.98
% 0.69/0.98 % Formulas that are not ordinary clauses:
% 0.69/0.98
% 0.69/0.98 ============================== end of process non-clausal formulas ===
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.98
% 0.69/0.98 ============================== PREDICATE ELIMINATION =================
% 0.69/0.98 1 -cycle(A,B) | -cycle(A,C) | equalish(B,C) # label(cycle1) # label(axiom). [assumption].
% 0.69/0.98 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.69/0.98 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.69/0.98 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.69/0.98 5 -equalish(e_1,e_5) # label(e_1_is_not_e_5) # label(axiom). [assumption].
% 0.69/0.98 6 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.69/0.98 7 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.69/0.98 8 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.69/0.98 9 -equalish(e_2,e_5) # label(e_2_is_not_e_5) # label(axiom). [assumption].
% 0.69/0.98 10 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.69/0.98 11 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.69/0.98 12 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.69/0.98 13 -equalish(e_3,e_5) # label(e_3_is_not_e_5) # label(axiom). [assumption].
% 0.69/0.98 14 -equalish(e_4,e_1) # label(e_4_is_not_e_1) # label(axiom). [assumption].
% 0.69/0.98 15 -equalish(e_4,e_2) # label(e_4_is_not_e_2) # label(axiom). [assumption].
% 0.69/0.98 16 -equalish(e_4,e_3) # label(e_4_is_not_e_3) # label(axiom). [assumption].
% 0.69/0.98 17 -equalish(e_4,e_5) # label(e_4_is_not_e_5) # label(axiom). [assumption].
% 0.69/0.98 18 -equalish(e_5,e_1) # label(e_5_is_not_e_1) # label(axiom). [assumption].
% 0.69/0.98 19 -equalish(e_5,e_2) # label(e_5_is_not_e_2) # label(axiom). [assumption].
% 0.69/0.98 20 -equalish(e_5,e_3) # label(e_5_is_not_e_3) # label(axiom). [assumption].
% 0.69/0.98 21 -equalish(e_5,e_4) # label(e_5_is_not_e_4) # label(axiom). [assumption].
% 0.69/0.98 Derived: -cycle(A,e_1) | -cycle(A,e_2). [resolve(1,c,2,a)].
% 0.69/0.98 Derived: -cycle(A,e_1) | -cycle(A,e_3). [resolve(1,c,3,a)].
% 0.69/0.98 Derived: -cycle(A,e_1) | -cycle(A,e_4). [resolve(1,c,4,a)].
% 0.69/0.98 Derived: -cycle(A,e_1) | -cycle(A,e_5). [resolve(1,c,5,a)].
% 0.69/0.98 Derived: -cycle(A,e_2) | -cycle(A,e_3). [resolve(1,c,7,a)].
% 0.69/0.98 Derived: -cycle(A,e_2) | -cycle(A,e_4). [resolve(1,c,8,a)].
% 0.69/0.98 Derived: -cycle(A,e_2) | -cycle(A,e_5). [resolve(1,c,9,a)].
% 0.69/0.98 Derived: -cycle(A,e_3) | -cycle(A,e_4). [resolve(1,c,12,a)].
% 0.69/0.98 Derived: -cycle(A,e_3) | -cycle(A,e_5). [resolve(1,c,13,a)].
% 0.69/0.98 Derived: -cycle(A,e_4) | -cycle(A,e_5). [resolve(1,c,17,a)].
% 0.69/0.98 22 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.69/0.98 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(22,c,2,a)].
% 0.69/0.98 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(22,c,3,a)].
% 0.69/0.98 Derived: -product(A,B,e_1) | -product(A,B,e_4). [resolve(22,c,4,a)].
% 0.69/0.98 Derived: -product(A,B,e_1) | -product(A,B,e_5). [resolve(22,c,5,a)].
% 0.69/0.98 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(22,c,7,a)].
% 0.69/0.98 Derived: -product(A,B,e_2) | -product(A,B,e_4). [resolve(22,c,8,a)].
% 0.69/0.98 Derived: -product(A,B,e_2) | -product(A,B,e_5). [resolve(22,c,9,a)].
% 0.69/0.98 Derived: -product(A,B,e_3) | -product(A,B,e_4). [resolve(22,c,12,a)].
% 0.69/0.98 Derived: -product(A,B,e_3) | -product(A,B,e_5). [resolve(22,c,13,a)].
% 0.69/0.98 Derived: -product(A,B,e_4) | -product(A,B,e_5). [resolve(22,c,17,a)].
% 0.69/0.98 23 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.69/0.98 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(23,c,2,a)].
% 0.69/0.98 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(23,c,3,a)].
% 0.69/0.98 Derived: -product(A,e_1,B) | -product(A,e_4,B). [resolve(23,c,4,a)].
% 0.69/0.98 Derived: -product(A,e_1,B) | -product(A,e_5,B). [resolve(23,c,5,a)].
% 0.69/0.98 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(23,c,7,a)].
% 0.69/0.98 Derived: -product(A,e_2,B) | -product(A,e_4,B). [resolve(23,c,8,a)].
% 0.69/0.98 Derived: -product(A,e_2,B) | -product(A,e_5,B). [resolve(23,c,9,a)].
% 0.69/0.98 Derived: -product(A,e_3,B) | -product(A,e_4,B). [resolve(23,c,12,a)].
% 0.69/0.98 Derived: -product(A,e_3,B) | -product(A,e_5,B). [resolve(23,c,13,a)].
% 0.69/0.98 Derived: -product(A,e_4,B) | -product(A,e_5,B). [resolve(23,c,17,a)].
% 0.69/0.98 24 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.69/0.98 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(24,c,2,a)].
% 0.69/0.98 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(24,c,3,a)].
% 0.69/0.98 Derived: -product(e_1,A,B) | -product(e_4,A,B). [resolve(24,c,4,a)].
% 0.69/0.98 Derived: -product(e_1,A,B) | -product(e_5,A,B). [resolve(24,c,5,a)].
% 0.69/0.98 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(24,c,7,a)].
% 0.69/0.98 Derived: -product(e_2,A,B) | -product(e_4,A,B). [resolve(24,c,8,a)].
% 0.69/0.98 Derived: -product(e_2,A,B) | -product(e_5,A,B). [resolve(24,c,9,a)].
% 0.69/0.98 Derived: -product(e_3,A,B) | -product(e_4,A,B). [resolve(24,c,12,a)].
% 0.69/0.98 Derived: -product(e_3,A,B) | -product(e_5,A,B). [resolve(24,c,13,a)].
% 0.69/0.98 Derived: -product(e_4,A,B) | -product(e_5,A,B). [resolve(24,c,17,a)].
% 0.69/0.98 25 -cycle(A,B) | -product(A,e_1,C) | -greater(B,e_0) | -next(A,D) | equalish(C,D) # label(cycle7) # label(axiom). [assumption].
% 0.69/0.98 Derived: -cycle(A,B) | -product(A,e_1,e_1) | -greater(B,e_0) | -next(A,e_2). [resolve(25,e,2,a)].
% 0.69/0.98 Derived: -cycle(A,B) | -product(A,e_1,e_1) | -greater(B,e_0) | -next(A,e_3). [resolve(25,e,3,a)].
% 0.69/0.98 Derived: -cycle(A,B) | -product(A,e_1,e_1) | -greater(B,e_0) | -next(A,e_4). [resolve(25,e,4,a)].
% 0.69/0.98 Derived: -cycle(A,B) | -product(A,e_1,e_1) | -greater(B,e_0) | -next(A,e_5). [resolve(25,e,5,a)].
% 0.69/0.98 Derived: -cycle(A,B) | -product(A,e_1,e_2) | -greater(B,e_0) | -next(A,e_1). [resolve(25,e,6,a)].
% 0.69/0.98 Derived: -cycle(A,B) | -product(A,e_1,e_2) | -greater(B,e_0) | -next(A,e_3). [resolve(25,e,7,a)].
% 0.69/0.98 Derived: -cycle(A,B) | -product(A,e_1,e_2) | -greater(B,e_0) | -next(A,e_4). [resolve(25,e,8,a)].
% 0.69/0.98 Derived: -cycle(A,B) | -product(A,e_1,e_2) | -greater(B,e_0) | -next(A,e_5). [resolve(25,e,9,a)].
% 0.69/0.98 Derived: -cycle(A,B) | -product(A,e_1,e_3) | -greater(B,e_0) | -next(A,e_1). [resolve(25,e,10,a)].
% 0.69/0.98 Derived: -cycle(A,B) | -product(A,e_1,e_3) | -greater(B,e_0) | -next(A,e_2). [resolve(25,e,11,a)].
% 0.69/0.98 Derived: -cycle(A,B) | -product(A,e_1,e_3) | -greater(B,e_0) | -next(A,e_4). [resolve(25,e,12,a)].
% 5.86/6.20 Derived: -cycle(A,B) | -product(A,e_1,e_3) | -greater(B,e_0) | -next(A,e_5). [resolve(25,e,13,a)].
% 5.86/6.20 Derived: -cycle(A,B) | -product(A,e_1,e_4) | -greater(B,e_0) | -next(A,e_1). [resolve(25,e,14,a)].
% 5.86/6.20 Derived: -cycle(A,B) | -product(A,e_1,e_4) | -greater(B,e_0) | -next(A,e_2). [resolve(25,e,15,a)].
% 5.86/6.20 Derived: -cycle(A,B) | -product(A,e_1,e_4) | -greater(B,e_0) | -next(A,e_3). [resolve(25,e,16,a)].
% 5.86/6.20 Derived: -cycle(A,B) | -product(A,e_1,e_4) | -greater(B,e_0) | -next(A,e_5). [resolve(25,e,17,a)].
% 5.86/6.20 Derived: -cycle(A,B) | -product(A,e_1,e_5) | -greater(B,e_0) | -next(A,e_1). [resolve(25,e,18,a)].
% 5.86/6.20 Derived: -cycle(A,B) | -product(A,e_1,e_5) | -greater(B,e_0) | -next(A,e_2). [resolve(25,e,19,a)].
% 5.86/6.20 Derived: -cycle(A,B) | -product(A,e_1,e_5) | -greater(B,e_0) | -next(A,e_3). [resolve(25,e,20,a)].
% 5.86/6.20 Derived: -cycle(A,B) | -product(A,e_1,e_5) | -greater(B,e_0) | -next(A,e_4). [resolve(25,e,21,a)].
% 5.86/6.20 26 -cycle(A,B) | -cycle(C,D) | -next(A,C) | -greater(B,e_0) | -next(D,E) | equalish(B,E) # label(cycle4) # label(axiom). [assumption].
% 5.86/6.20 Derived: -cycle(A,e_1) | -cycle(B,C) | -next(A,B) | -greater(e_1,e_0) | -next(C,e_2). [resolve(26,f,2,a)].
% 5.86/6.20 Derived: -cycle(A,e_1) | -cycle(B,C) | -next(A,B) | -greater(e_1,e_0) | -next(C,e_3). [resolve(26,f,3,a)].
% 5.86/6.20 Derived: -cycle(A,e_1) | -cycle(B,C) | -next(A,B) | -greater(e_1,e_0) | -next(C,e_4). [resolve(26,f,4,a)].
% 5.86/6.20 Derived: -cycle(A,e_1) | -cycle(B,C) | -next(A,B) | -greater(e_1,e_0) | -next(C,e_5). [resolve(26,f,5,a)].
% 5.86/6.20 Derived: -cycle(A,e_2) | -cycle(B,C) | -next(A,B) | -greater(e_2,e_0) | -next(C,e_1). [resolve(26,f,6,a)].
% 5.86/6.20 Derived: -cycle(A,e_2) | -cycle(B,C) | -next(A,B) | -greater(e_2,e_0) | -next(C,e_3). [resolve(26,f,7,a)].
% 5.86/6.20 Derived: -cycle(A,e_2) | -cycle(B,C) | -next(A,B) | -greater(e_2,e_0) | -next(C,e_4). [resolve(26,f,8,a)].
% 5.86/6.20 Derived: -cycle(A,e_2) | -cycle(B,C) | -next(A,B) | -greater(e_2,e_0) | -next(C,e_5). [resolve(26,f,9,a)].
% 5.86/6.20 Derived: -cycle(A,e_3) | -cycle(B,C) | -next(A,B) | -greater(e_3,e_0) | -next(C,e_1). [resolve(26,f,10,a)].
% 5.86/6.20 Derived: -cycle(A,e_3) | -cycle(B,C) | -next(A,B) | -greater(e_3,e_0) | -next(C,e_2). [resolve(26,f,11,a)].
% 5.86/6.20 Derived: -cycle(A,e_3) | -cycle(B,C) | -next(A,B) | -greater(e_3,e_0) | -next(C,e_4). [resolve(26,f,12,a)].
% 5.86/6.20 Derived: -cycle(A,e_3) | -cycle(B,C) | -next(A,B) | -greater(e_3,e_0) | -next(C,e_5). [resolve(26,f,13,a)].
% 5.86/6.20 Derived: -cycle(A,e_4) | -cycle(B,C) | -next(A,B) | -greater(e_4,e_0) | -next(C,e_1). [resolve(26,f,14,a)].
% 5.86/6.20 Derived: -cycle(A,e_4) | -cycle(B,C) | -next(A,B) | -greater(e_4,e_0) | -next(C,e_2). [resolve(26,f,15,a)].
% 5.86/6.20 Derived: -cycle(A,e_4) | -cycle(B,C) | -next(A,B) | -greater(e_4,e_0) | -next(C,e_3). [resolve(26,f,16,a)].
% 5.86/6.20 Derived: -cycle(A,e_4) | -cycle(B,C) | -next(A,B) | -greater(e_4,e_0) | -next(C,e_5). [resolve(26,f,17,a)].
% 5.86/6.20 Derived: -cycle(A,e_5) | -cycle(B,C) | -next(A,B) | -greater(e_5,e_0) | -next(C,e_1). [resolve(26,f,18,a)].
% 5.86/6.20 Derived: -cycle(A,e_5) | -cycle(B,C) | -next(A,B) | -greater(e_5,e_0) | -next(C,e_2). [resolve(26,f,19,a)].
% 5.86/6.20 Derived: -cycle(A,e_5) | -cycle(B,C) | -next(A,B) | -greater(e_5,e_0) | -next(C,e_3). [resolve(26,f,20,a)].
% 5.86/6.20 Derived: -cycle(A,e_5) | -cycle(B,C) | -next(A,B) | -greater(e_5,e_0) | -next(C,e_4). [resolve(26,f,21,a)].
% 5.86/6.20
% 5.86/6.20 ============================== end predicate elimination =============
% 5.86/6.20
% 5.86/6.20 Auto_denials: (non-Horn, no changes).
% 5.86/6.20
% 5.86/6.20 Term ordering decisions:
% 5.86/6.20 Function symbol KB weights: e_1=1. e_2=1. e_3=1. e_4=1. e_5=1. e_0=1.
% 5.86/6.20
% 5.86/6.20 ============================== end of process initial clauses ========
% 5.86/6.20
% 5.86/6.20 ============================== CLAUSES FOR SEARCH ====================
% 5.86/6.20
% 5.86/6.20 ============================== end of clauses for search =============
% 5.86/6.20
% 5.86/6.20 ============================== SEARCH ================================
% 5.86/6.20
% 5.86/6.20 % Starting search at 0.02 seconds.
% 5.86/6.20
% 5.86/6.20 Low Water (keep): wt=84.000, iters=3335
% 5.86/6.20
% 5.86/6.20 Low Water (keep): wt=80.000, iters=3339
% 5.86/6.20
% 5.86/6.20 Low Water (keep): wt=76.000, iters=3340
% 5.86/6.20
% 5.86/6.20 Low Water (keep): wt=72.000, iters=3343
% 5.86/6.20
% 5.86/6.20 Low Water (keep): wt=71.000, iters=3336
% 5.86/6.20
% 5.86/6.20 Low Water (keep): wt=68.000, iters=3336
% 5.86/6.20
% 5.86/6.20 Low Water (keep): wt=64.000,Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------