TSTP Solution File: GRP129-2.005 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP129-2.005 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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.04s 300.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP129-2.005 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n018.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 07:31:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.97 ============================== Prover9 ===============================
% 0.41/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.97 Process 3768 was started by sandbox on n018.cluster.edu,
% 0.41/0.97 Mon Jun 13 07:31:28 2022
% 0.41/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3615_n018.cluster.edu".
% 0.41/0.97 ============================== end of head ===========================
% 0.41/0.97
% 0.41/0.97 ============================== INPUT =================================
% 0.41/0.97
% 0.41/0.97 % Reading from file /tmp/Prover9_3615_n018.cluster.edu
% 0.41/0.97
% 0.41/0.97 set(prolog_style_variables).
% 0.41/0.97 set(auto2).
% 0.41/0.97 % set(auto2) -> set(auto).
% 0.41/0.97 % set(auto) -> set(auto_inference).
% 0.41/0.97 % set(auto) -> set(auto_setup).
% 0.41/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.97 % set(auto) -> set(auto_limits).
% 0.41/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.97 % set(auto) -> set(auto_denials).
% 0.41/0.97 % set(auto) -> set(auto_process).
% 0.41/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.97 % set(auto2) -> assign(stats, some).
% 0.41/0.97 % set(auto2) -> clear(echo_input).
% 0.41/0.97 % set(auto2) -> set(quiet).
% 0.41/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.97 % set(auto2) -> clear(print_given).
% 0.41/0.97 assign(lrs_ticks,-1).
% 0.41/0.97 assign(sos_limit,10000).
% 0.41/0.97 assign(order,kbo).
% 0.41/0.97 set(lex_order_vars).
% 0.41/0.97 clear(print_given).
% 0.41/0.97
% 0.41/0.97 % formulas(sos). % not echoed (45 formulas)
% 0.41/0.97
% 0.41/0.97 ============================== end of input ==========================
% 0.41/0.97
% 0.41/0.97 % From the command line: assign(max_seconds, 300).
% 0.41/0.97
% 0.41/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.97
% 0.41/0.97 % Formulas that are not ordinary clauses:
% 0.41/0.97
% 0.41/0.97 ============================== end of process non-clausal formulas ===
% 0.41/0.97
% 0.41/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.97
% 0.41/0.97 ============================== PREDICATE ELIMINATION =================
% 0.41/0.97 1 -product(A,e_1,B) | -next(A,C) | -greater(B,C) # label(no_redundancy) # label(axiom). [assumption].
% 0.41/0.97 2 next(e_1,e_2) # label(e_1_then_e_2) # label(axiom). [assumption].
% 0.41/0.97 3 next(e_2,e_3) # label(e_2_then_e_3) # label(axiom). [assumption].
% 0.41/0.97 4 next(e_3,e_4) # label(e_3_then_e_4) # label(axiom). [assumption].
% 0.41/0.97 5 next(e_4,e_5) # label(e_4_then_e_5) # label(axiom). [assumption].
% 0.41/0.97 Derived: -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.41/0.97 Derived: -product(e_2,e_1,A) | -greater(A,e_3). [resolve(1,b,3,a)].
% 0.41/0.97 Derived: -product(e_3,e_1,A) | -greater(A,e_4). [resolve(1,b,4,a)].
% 0.41/0.97 Derived: -product(e_4,e_1,A) | -greater(A,e_5). [resolve(1,b,5,a)].
% 0.41/0.97 6 -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.41/0.97 7 greater(e_2,e_1) # label(e_2_greater_e_1) # label(axiom). [assumption].
% 0.41/0.97 8 greater(e_3,e_1) # label(e_3_greater_e_1) # label(axiom). [assumption].
% 0.41/0.97 9 greater(e_4,e_1) # label(e_4_greater_e_1) # label(axiom). [assumption].
% 0.41/0.97 10 greater(e_5,e_1) # label(e_5_greater_e_1) # label(axiom). [assumption].
% 0.41/0.97 11 greater(e_3,e_2) # label(e_3_greater_e_2) # label(axiom). [assumption].
% 0.41/0.97 12 greater(e_4,e_2) # label(e_4_greater_e_2) # label(axiom). [assumption].
% 0.41/0.97 13 greater(e_5,e_2) # label(e_5_greater_e_2) # label(axiom). [assumption].
% 0.41/0.97 14 greater(e_4,e_3) # label(e_4_greater_e_3) # label(axiom). [assumption].
% 0.41/0.97 15 greater(e_5,e_3) # label(e_5_greater_e_3) # label(axiom). [assumption].
% 0.41/0.97 16 greater(e_5,e_4) # label(e_5_greater_e_4) # label(axiom). [assumption].
% 0.41/0.97 Derived: -product(e_1,e_1,e_3). [resolve(6,b,11,a)].
% 0.41/0.97 Derived: -product(e_1,e_1,e_4). [resolve(6,b,12,a)].
% 0.41/0.97 Derived: -product(e_1,e_1,e_5). [resolve(6,b,13,a)].
% 0.41/0.97 17 -product(e_2,e_1,A) | -greater(A,e_3). [resolve(1,b,3,a)].
% 0.41/0.97 Derived: -product(e_2,e_1,e_4). [resolve(17,b,14,a)].
% 0.41/0.98 Derived: -product(e_2,e_1,e_5). [resolve(17,b,15,a)].
% 0.41/0.98 18 -product(e_3,e_1,A) | -greater(A,e_4). [resolve(1,b,4,a)].
% 0.41/0.98 Derived: -product(e_3,e_1,e_5). [resolve(18,b,16,a)].
% 0.41/0.98 19 -product(e_4,e_1,A) | -greater(A,e_5). [resolve(1,b,5,a)].
% 0.41/0.98 20 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.41/0.98 21 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.41/0.98 22 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.41/0.98 23 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.41/0.98 24 -equalish(e_1,e_5) # label(e_1_is_not_e_5) # label(axiom). [assumption].
% 0.41/0.98 25 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.41/0.98 26 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.41/0.98 27 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.41/0.98 28 -equalish(e_2,e_5) # label(e_2_is_not_e_5) # label(axiom). [assumption].
% 0.41/0.98 29 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.41/0.98 30 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.41/0.98 31 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.41/0.98 32 -equalish(e_3,e_5) # label(e_3_is_not_e_5) # label(axiom). [assumption].
% 0.41/0.98 33 -equalish(e_4,e_1) # label(e_4_is_not_e_1) # label(axiom). [assumption].
% 0.41/0.98 34 -equalish(e_4,e_2) # label(e_4_is_not_e_2) # label(axiom). [assumption].
% 0.41/0.98 35 -equalish(e_4,e_3) # label(e_4_is_not_e_3) # label(axiom). [assumption].
% 0.41/0.98 36 -equalish(e_4,e_5) # label(e_4_is_not_e_5) # label(axiom). [assumption].
% 0.41/0.98 37 -equalish(e_5,e_1) # label(e_5_is_not_e_1) # label(axiom). [assumption].
% 0.41/0.98 38 -equalish(e_5,e_2) # label(e_5_is_not_e_2) # label(axiom). [assumption].
% 0.41/0.98 39 -equalish(e_5,e_3) # label(e_5_is_not_e_3) # label(axiom). [assumption].
% 0.41/0.98 40 -equalish(e_5,e_4) # label(e_5_is_not_e_4) # label(axiom). [assumption].
% 0.41/0.98 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(20,c,21,a)].
% 0.41/0.98 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(20,c,22,a)].
% 0.41/0.98 Derived: -product(A,B,e_1) | -product(A,B,e_4). [resolve(20,c,23,a)].
% 0.41/0.98 Derived: -product(A,B,e_1) | -product(A,B,e_5). [resolve(20,c,24,a)].
% 0.41/0.98 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(20,c,26,a)].
% 0.41/0.98 Derived: -product(A,B,e_2) | -product(A,B,e_4). [resolve(20,c,27,a)].
% 0.41/0.98 Derived: -product(A,B,e_2) | -product(A,B,e_5). [resolve(20,c,28,a)].
% 0.41/0.98 Derived: -product(A,B,e_3) | -product(A,B,e_4). [resolve(20,c,31,a)].
% 0.41/0.98 Derived: -product(A,B,e_3) | -product(A,B,e_5). [resolve(20,c,32,a)].
% 0.41/0.98 Derived: -product(A,B,e_4) | -product(A,B,e_5). [resolve(20,c,36,a)].
% 0.41/0.98 41 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.41/0.98 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(41,c,21,a)].
% 0.41/0.98 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(41,c,22,a)].
% 0.41/0.98 Derived: -product(A,e_1,B) | -product(A,e_4,B). [resolve(41,c,23,a)].
% 0.41/0.98 Derived: -product(A,e_1,B) | -product(A,e_5,B). [resolve(41,c,24,a)].
% 0.41/0.98 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(41,c,26,a)].
% 0.41/0.98 Derived: -product(A,e_2,B) | -product(A,e_4,B). [resolve(41,c,27,a)].
% 0.41/0.98 Derived: -product(A,e_2,B) | -product(A,e_5,B). [resolve(41,c,28,a)].
% 0.41/0.98 Derived: -product(A,e_3,B) | -product(A,e_4,B). [resolve(41,c,31,a)].
% 0.41/0.98 Derived: -product(A,e_3,B) | -product(A,e_5,B). [resolve(41,c,32,a)].
% 0.41/0.98 Derived: -product(A,e_4,B) | -product(A,e_5,B). [resolve(41,c,36,a)].
% 0.41/0.98 42 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.41/0.98 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(42,c,21,a)].
% 0.41/0.98 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(42,c,22,a)].
% 0.41/0.98 Derived: -product(e_1,A,B) | -product(e_4,A,B). [resolve(42,c,23,a)].
% 0.41/0.98 Derived: -product(e_1,A,B) | -product(e_5,A,B). [resolve(42,c,24,a)].
% 0.41/0.98 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(42,c,26,a)].
% 0.41/0.98 Derived: -product(e_2,A,B) | -product(e_4,A,B). [resolve(42,c,27,a)].
% 0.41/0.98 Derived: -product(e_2,A,B) | -product(e_5,A,B). [resolve(42,c,28,a)].
% 0.41/0.98 Derived: -product(e_3,A,B) | -product(e_4,Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------