TSTP Solution File: GRP123-4.004 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP123-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:16 EDT 2022
% Result : Unknown 2.51s 2.80s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP123-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 12:30:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.01 ============================== Prover9 ===============================
% 0.43/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01 Process 3349 was started by sandbox2 on n022.cluster.edu,
% 0.43/1.01 Mon Jun 13 12:30:49 2022
% 0.43/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3196_n022.cluster.edu".
% 0.43/1.01 ============================== end of head ===========================
% 0.43/1.01
% 0.43/1.01 ============================== INPUT =================================
% 0.43/1.01
% 0.43/1.01 % Reading from file /tmp/Prover9_3196_n022.cluster.edu
% 0.43/1.01
% 0.43/1.01 set(prolog_style_variables).
% 0.43/1.01 set(auto2).
% 0.43/1.01 % set(auto2) -> set(auto).
% 0.43/1.01 % set(auto) -> set(auto_inference).
% 0.43/1.01 % set(auto) -> set(auto_setup).
% 0.43/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01 % set(auto) -> set(auto_limits).
% 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01 % set(auto) -> set(auto_denials).
% 0.43/1.01 % set(auto) -> set(auto_process).
% 0.43/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01 % set(auto2) -> assign(stats, some).
% 0.43/1.01 % set(auto2) -> clear(echo_input).
% 0.43/1.01 % set(auto2) -> set(quiet).
% 0.43/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01 % set(auto2) -> clear(print_given).
% 0.43/1.01 assign(lrs_ticks,-1).
% 0.43/1.01 assign(sos_limit,10000).
% 0.43/1.01 assign(order,kbo).
% 0.43/1.01 set(lex_order_vars).
% 0.43/1.01 clear(print_given).
% 0.43/1.01
% 0.43/1.01 % formulas(sos). % not echoed (25 formulas)
% 0.43/1.01
% 0.43/1.01 ============================== end of input ==========================
% 0.43/1.01
% 0.43/1.01 % From the command line: assign(max_seconds, 300).
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01
% 0.43/1.01 % Formulas that are not ordinary clauses:
% 0.43/1.01
% 0.43/1.01 ============================== end of process non-clausal formulas ===
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.01
% 0.43/1.01 ============================== PREDICATE ELIMINATION =================
% 0.43/1.01 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.43/1.01 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.43/1.01 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.43/1.01 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.43/1.01 5 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.43/1.01 6 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.43/1.01 7 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.43/1.01 8 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.43/1.01 9 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.43/1.01 10 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.43/1.01 11 -equalish(e_4,e_1) # label(e_4_is_not_e_1) # label(axiom). [assumption].
% 0.43/1.01 12 -equalish(e_4,e_2) # label(e_4_is_not_e_2) # label(axiom). [assumption].
% 0.43/1.01 13 -equalish(e_4,e_3) # label(e_4_is_not_e_3) # label(axiom). [assumption].
% 0.43/1.01 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(1,c,2,a)].
% 0.43/1.01 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(1,c,3,a)].
% 0.43/1.01 Derived: -product(A,B,e_1) | -product(A,B,e_4). [resolve(1,c,4,a)].
% 0.43/1.01 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(1,c,6,a)].
% 0.43/1.01 Derived: -product(A,B,e_2) | -product(A,B,e_4). [resolve(1,c,7,a)].
% 0.43/1.01 Derived: -product(A,B,e_3) | -product(A,B,e_4). [resolve(1,c,10,a)].
% 0.43/1.01 14 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.43/1.01 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(14,c,2,a)].
% 0.43/1.01 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(14,c,3,a)].
% 0.43/1.01 Derived: -product(A,e_1,B) | -product(A,e_4,B). [resolve(14,c,4,a)].
% 2.51/2.80 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(14,c,6,a)].
% 2.51/2.80 Derived: -product(A,e_2,B) | -product(A,e_4,B). [resolve(14,c,7,a)].
% 2.51/2.80 Derived: -product(A,e_3,B) | -product(A,e_4,B). [resolve(14,c,10,a)].
% 2.51/2.80 15 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 2.51/2.80 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(15,c,2,a)].
% 2.51/2.80 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(15,c,3,a)].
% 2.51/2.80 Derived: -product(e_1,A,B) | -product(e_4,A,B). [resolve(15,c,4,a)].
% 2.51/2.80 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(15,c,6,a)].
% 2.51/2.80 Derived: -product(e_2,A,B) | -product(e_4,A,B). [resolve(15,c,7,a)].
% 2.51/2.80 Derived: -product(e_3,A,B) | -product(e_4,A,B). [resolve(15,c,10,a)].
% 2.51/2.80 16 -product(A,B,C) | -product(D,E,C) | -product(F,B,A) | -product(F,E,D) | equalish(A,D) # label(qg1_1) # label(negated_conjecture). [assumption].
% 2.51/2.80 Derived: -product(e_1,A,B) | -product(e_2,C,B) | -product(D,A,e_1) | -product(D,C,e_2). [resolve(16,e,2,a)].
% 2.51/2.80 Derived: -product(e_1,A,B) | -product(e_3,C,B) | -product(D,A,e_1) | -product(D,C,e_3). [resolve(16,e,3,a)].
% 2.51/2.80 Derived: -product(e_1,A,B) | -product(e_4,C,B) | -product(D,A,e_1) | -product(D,C,e_4). [resolve(16,e,4,a)].
% 2.51/2.80 Derived: -product(e_2,A,B) | -product(e_3,C,B) | -product(D,A,e_2) | -product(D,C,e_3). [resolve(16,e,6,a)].
% 2.51/2.80 Derived: -product(e_2,A,B) | -product(e_4,C,B) | -product(D,A,e_2) | -product(D,C,e_4). [resolve(16,e,7,a)].
% 2.51/2.80 Derived: -product(e_3,A,B) | -product(e_4,C,B) | -product(D,A,e_3) | -product(D,C,e_4). [resolve(16,e,10,a)].
% 2.51/2.80 17 -product(A,B,C) | -product(D,E,C) | -product(F,B,A) | -product(F,E,D) | equalish(B,E) # label(qg1_2) # label(negated_conjecture). [assumption].
% 2.51/2.80 Derived: -product(A,e_1,B) | -product(C,e_2,B) | -product(D,e_1,A) | -product(D,e_2,C). [resolve(17,e,2,a)].
% 2.51/2.80 Derived: -product(A,e_1,B) | -product(C,e_3,B) | -product(D,e_1,A) | -product(D,e_3,C). [resolve(17,e,3,a)].
% 2.51/2.80 Derived: -product(A,e_1,B) | -product(C,e_4,B) | -product(D,e_1,A) | -product(D,e_4,C). [resolve(17,e,4,a)].
% 2.51/2.80 Derived: -product(A,e_2,B) | -product(C,e_3,B) | -product(D,e_2,A) | -product(D,e_3,C). [resolve(17,e,6,a)].
% 2.51/2.80 Derived: -product(A,e_2,B) | -product(C,e_4,B) | -product(D,e_2,A) | -product(D,e_4,C). [resolve(17,e,7,a)].
% 2.51/2.80 Derived: -product(A,e_3,B) | -product(C,e_4,B) | -product(D,e_3,A) | -product(D,e_4,C). [resolve(17,e,10,a)].
% 2.51/2.80
% 2.51/2.80 ============================== end predicate elimination =============
% 2.51/2.80
% 2.51/2.80 Auto_denials: (non-Horn, no changes).
% 2.51/2.80
% 2.51/2.80 Term ordering decisions:
% 2.51/2.80 Function symbol KB weights: e_1=1. e_2=1. e_3=1. e_4=1.
% 2.51/2.80
% 2.51/2.80 ============================== end of process initial clauses ========
% 2.51/2.80
% 2.51/2.80 ============================== CLAUSES FOR SEARCH ====================
% 2.51/2.80
% 2.51/2.80 ============================== end of clauses for search =============
% 2.51/2.80
% 2.51/2.80 ============================== SEARCH ================================
% 2.51/2.80
% 2.51/2.80 % Starting search at 0.02 seconds.
% 2.51/2.80
% 2.51/2.80 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 24 (0.00 of 0.19 sec).
% 2.51/2.80
% 2.51/2.80 ============================== STATISTICS ============================
% 2.51/2.80
% 2.51/2.80 Given=2808. Generated=59241. Kept=2876. proofs=0.
% 2.51/2.80 Usable=2802. Sos=0. Demods=0. Limbo=0, Disabled=129. Hints=0.
% 2.51/2.80 Megabytes=1.97.
% 2.51/2.80 User_CPU=1.75, System_CPU=0.05, Wall_clock=2.
% 2.51/2.80
% 2.51/2.80 ============================== end of statistics =====================
% 2.51/2.80
% 2.51/2.80 ============================== end of search =========================
% 2.51/2.80
% 2.51/2.80 SEARCH FAILED
% 2.51/2.80
% 2.51/2.80 Exiting with failure.
% 2.51/2.80
% 2.51/2.80 Process 3349 exit (sos_empty) Mon Jun 13 12:30:51 2022
% 2.51/2.80 Prover9 interrupted
%------------------------------------------------------------------------------