TSTP Solution File: GRP128-2.004 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP128-2.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:30 EDT 2022
% Result : Unknown 0.72s 1.07s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP128-2.004 : TPTP v8.1.0. Released v1.2.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n024.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 15:36:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/0.98 ============================== Prover9 ===============================
% 0.67/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.98 Process 10112 was started by sandbox2 on n024.cluster.edu,
% 0.67/0.98 Mon Jun 13 15:36:49 2022
% 0.67/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9943_n024.cluster.edu".
% 0.67/0.98 ============================== end of head ===========================
% 0.67/0.98
% 0.67/0.98 ============================== INPUT =================================
% 0.67/0.98
% 0.67/0.98 % Reading from file /tmp/Prover9_9943_n024.cluster.edu
% 0.67/0.98
% 0.67/0.98 set(prolog_style_variables).
% 0.67/0.98 set(auto2).
% 0.67/0.98 % set(auto2) -> set(auto).
% 0.67/0.98 % set(auto) -> set(auto_inference).
% 0.67/0.98 % set(auto) -> set(auto_setup).
% 0.67/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.98 % set(auto) -> set(auto_limits).
% 0.67/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.98 % set(auto) -> set(auto_denials).
% 0.67/0.98 % set(auto) -> set(auto_process).
% 0.67/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.98 % set(auto2) -> assign(stats, some).
% 0.67/0.98 % set(auto2) -> clear(echo_input).
% 0.67/0.98 % set(auto2) -> set(quiet).
% 0.67/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.98 % set(auto2) -> clear(print_given).
% 0.67/0.98 assign(lrs_ticks,-1).
% 0.67/0.98 assign(sos_limit,10000).
% 0.67/0.98 assign(order,kbo).
% 0.67/0.98 set(lex_order_vars).
% 0.67/0.98 clear(print_given).
% 0.67/0.98
% 0.67/0.98 % formulas(sos). % not echoed (31 formulas)
% 0.67/0.98
% 0.67/0.98 ============================== end of input ==========================
% 0.67/0.98
% 0.67/0.98 % From the command line: assign(max_seconds, 300).
% 0.67/0.98
% 0.67/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.98
% 0.67/0.98 % Formulas that are not ordinary clauses:
% 0.67/0.98
% 0.67/0.98 ============================== end of process non-clausal formulas ===
% 0.67/0.98
% 0.67/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.98
% 0.67/0.98 ============================== PREDICATE ELIMINATION =================
% 0.67/0.98 1 -product(A,e_1,B) | -next(A,C) | -greater(B,C) # label(no_redundancy) # label(axiom). [assumption].
% 0.67/0.98 2 next(e_1,e_2) # label(e_1_then_e_2) # label(axiom). [assumption].
% 0.67/0.98 3 next(e_2,e_3) # label(e_2_then_e_3) # label(axiom). [assumption].
% 0.67/0.98 4 next(e_3,e_4) # label(e_3_then_e_4) # label(axiom). [assumption].
% 0.67/0.98 Derived: -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.67/0.98 Derived: -product(e_2,e_1,A) | -greater(A,e_3). [resolve(1,b,3,a)].
% 0.67/0.98 Derived: -product(e_3,e_1,A) | -greater(A,e_4). [resolve(1,b,4,a)].
% 0.67/0.98 5 -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.67/0.98 6 greater(e_2,e_1) # label(e_2_greater_e_1) # label(axiom). [assumption].
% 0.67/0.98 7 greater(e_3,e_1) # label(e_3_greater_e_1) # label(axiom). [assumption].
% 0.67/0.98 8 greater(e_4,e_1) # label(e_4_greater_e_1) # label(axiom). [assumption].
% 0.67/0.98 9 greater(e_3,e_2) # label(e_3_greater_e_2) # label(axiom). [assumption].
% 0.67/0.98 10 greater(e_4,e_2) # label(e_4_greater_e_2) # label(axiom). [assumption].
% 0.67/0.98 11 greater(e_4,e_3) # label(e_4_greater_e_3) # label(axiom). [assumption].
% 0.67/0.98 Derived: -product(e_1,e_1,e_3). [resolve(5,b,9,a)].
% 0.67/0.98 Derived: -product(e_1,e_1,e_4). [resolve(5,b,10,a)].
% 0.67/0.98 12 -product(e_2,e_1,A) | -greater(A,e_3). [resolve(1,b,3,a)].
% 0.67/0.98 Derived: -product(e_2,e_1,e_4). [resolve(12,b,11,a)].
% 0.67/0.98 13 -product(e_3,e_1,A) | -greater(A,e_4). [resolve(1,b,4,a)].
% 0.67/0.98 14 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.67/0.98 15 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.67/0.98 16 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.67/0.98 17 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.67/0.98 18 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.67/0.98 19 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.72/1.07 20 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.72/1.07 21 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.72/1.07 22 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.72/1.07 23 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.72/1.07 24 -equalish(e_4,e_1) # label(e_4_is_not_e_1) # label(axiom). [assumption].
% 0.72/1.07 25 -equalish(e_4,e_2) # label(e_4_is_not_e_2) # label(axiom). [assumption].
% 0.72/1.07 26 -equalish(e_4,e_3) # label(e_4_is_not_e_3) # label(axiom). [assumption].
% 0.72/1.07 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(14,c,15,a)].
% 0.72/1.07 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(14,c,16,a)].
% 0.72/1.07 Derived: -product(A,B,e_1) | -product(A,B,e_4). [resolve(14,c,17,a)].
% 0.72/1.07 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(14,c,19,a)].
% 0.72/1.07 Derived: -product(A,B,e_2) | -product(A,B,e_4). [resolve(14,c,20,a)].
% 0.72/1.07 Derived: -product(A,B,e_3) | -product(A,B,e_4). [resolve(14,c,23,a)].
% 0.72/1.07 27 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.72/1.07 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(27,c,15,a)].
% 0.72/1.07 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(27,c,16,a)].
% 0.72/1.07 Derived: -product(A,e_1,B) | -product(A,e_4,B). [resolve(27,c,17,a)].
% 0.72/1.07 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(27,c,19,a)].
% 0.72/1.07 Derived: -product(A,e_2,B) | -product(A,e_4,B). [resolve(27,c,20,a)].
% 0.72/1.07 Derived: -product(A,e_3,B) | -product(A,e_4,B). [resolve(27,c,23,a)].
% 0.72/1.07 28 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.72/1.07 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(28,c,15,a)].
% 0.72/1.07 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(28,c,16,a)].
% 0.72/1.07 Derived: -product(e_1,A,B) | -product(e_4,A,B). [resolve(28,c,17,a)].
% 0.72/1.07 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(28,c,19,a)].
% 0.72/1.07 Derived: -product(e_2,A,B) | -product(e_4,A,B). [resolve(28,c,20,a)].
% 0.72/1.07 Derived: -product(e_3,A,B) | -product(e_4,A,B). [resolve(28,c,23,a)].
% 0.72/1.07
% 0.72/1.07 ============================== end predicate elimination =============
% 0.72/1.07
% 0.72/1.07 Auto_denials: (non-Horn, no changes).
% 0.72/1.07
% 0.72/1.07 Term ordering decisions:
% 0.72/1.07 Function symbol KB weights: e_1=1. e_2=1. e_3=1. e_4=1.
% 0.72/1.07
% 0.72/1.07 ============================== end of process initial clauses ========
% 0.72/1.07
% 0.72/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.07
% 0.72/1.07 ============================== end of clauses for search =============
% 0.72/1.07
% 0.72/1.07 ============================== SEARCH ================================
% 0.72/1.07
% 0.72/1.07 % Starting search at 0.01 seconds.
% 0.72/1.07
% 0.72/1.07 ============================== STATISTICS ============================
% 0.72/1.07
% 0.72/1.07 Given=415. Generated=1953. Kept=935. proofs=0.
% 0.72/1.07 Usable=122. Sos=0. Demods=0. Limbo=0, Disabled=868. Hints=0.
% 0.72/1.07 Megabytes=0.65.
% 0.72/1.07 User_CPU=0.10, System_CPU=0.01, Wall_clock=0.
% 0.72/1.07
% 0.72/1.07 ============================== end of statistics =====================
% 0.72/1.07
% 0.72/1.07 ============================== end of search =========================
% 0.72/1.07
% 0.72/1.07 SEARCH FAILED
% 0.72/1.07
% 0.72/1.07 Exiting with failure.
% 0.72/1.07
% 0.72/1.07 Process 10112 exit (sos_empty) Mon Jun 13 15:36:49 2022
% 0.72/1.07 Prover9 interrupted
%------------------------------------------------------------------------------