TSTP Solution File: GRP123-6.005 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP123-6.005 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:17 EDT 2022
% Result : Timeout 300.02s 300.31s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : GRP123-6.005 : TPTP v8.1.0. Released v1.2.0.
% 0.09/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 07:03:41 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.76/1.02 ============================== Prover9 ===============================
% 0.76/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.02 Process 4982 was started by sandbox on n021.cluster.edu,
% 0.76/1.02 Mon Jun 13 07:03:42 2022
% 0.76/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4828_n021.cluster.edu".
% 0.76/1.02 ============================== end of head ===========================
% 0.76/1.02
% 0.76/1.02 ============================== INPUT =================================
% 0.76/1.02
% 0.76/1.02 % Reading from file /tmp/Prover9_4828_n021.cluster.edu
% 0.76/1.02
% 0.76/1.02 set(prolog_style_variables).
% 0.76/1.02 set(auto2).
% 0.76/1.02 % set(auto2) -> set(auto).
% 0.76/1.02 % set(auto) -> set(auto_inference).
% 0.76/1.02 % set(auto) -> set(auto_setup).
% 0.76/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.02 % set(auto) -> set(auto_limits).
% 0.76/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.02 % set(auto) -> set(auto_denials).
% 0.76/1.02 % set(auto) -> set(auto_process).
% 0.76/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.02 % set(auto2) -> assign(stats, some).
% 0.76/1.02 % set(auto2) -> clear(echo_input).
% 0.76/1.02 % set(auto2) -> set(quiet).
% 0.76/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.02 % set(auto2) -> clear(print_given).
% 0.76/1.02 assign(lrs_ticks,-1).
% 0.76/1.02 assign(sos_limit,10000).
% 0.76/1.02 assign(order,kbo).
% 0.76/1.02 set(lex_order_vars).
% 0.76/1.02 clear(print_given).
% 0.76/1.02
% 0.76/1.02 % formulas(sos). % not echoed (36 formulas)
% 0.76/1.02
% 0.76/1.02 ============================== end of input ==========================
% 0.76/1.02
% 0.76/1.02 % From the command line: assign(max_seconds, 300).
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.02
% 0.76/1.02 % Formulas that are not ordinary clauses:
% 0.76/1.02
% 0.76/1.02 ============================== end of process non-clausal formulas ===
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.02
% 0.76/1.02 ============================== PREDICATE ELIMINATION =================
% 0.76/1.02 1 -product1(A,B,C) | -product1(A,B,D) | equalish(C,D) # label(product1_total_function2) # label(axiom). [assumption].
% 0.76/1.02 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.76/1.02 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.76/1.02 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.76/1.02 5 -equalish(e_1,e_5) # label(e_1_is_not_e_5) # label(axiom). [assumption].
% 0.76/1.02 6 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.76/1.02 7 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.76/1.02 8 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.76/1.02 9 -equalish(e_2,e_5) # label(e_2_is_not_e_5) # label(axiom). [assumption].
% 0.76/1.02 10 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.76/1.02 11 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.76/1.02 12 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.76/1.02 13 -equalish(e_3,e_5) # label(e_3_is_not_e_5) # label(axiom). [assumption].
% 0.76/1.02 14 -equalish(e_4,e_1) # label(e_4_is_not_e_1) # label(axiom). [assumption].
% 0.76/1.02 15 -equalish(e_4,e_2) # label(e_4_is_not_e_2) # label(axiom). [assumption].
% 0.76/1.02 16 -equalish(e_4,e_3) # label(e_4_is_not_e_3) # label(axiom). [assumption].
% 0.76/1.02 17 -equalish(e_4,e_5) # label(e_4_is_not_e_5) # label(axiom). [assumption].
% 0.76/1.02 18 -equalish(e_5,e_1) # label(e_5_is_not_e_1) # label(axiom). [assumption].
% 0.76/1.02 19 -equalish(e_5,e_2) # label(e_5_is_not_e_2) # label(axiom). [assumption].
% 0.76/1.02 20 -equalish(e_5,e_3) # label(e_5_is_not_e_3) # label(axiom). [assumption].
% 0.76/1.02 21 -equalish(e_5,e_4) # label(e_5_is_not_e_4) # label(axiom). [assumption].
% 0.76/1.02 Derived: -product1(A,B,e_1) | -product1(A,B,e_2). [resolve(1,c,2,a)].
% 0.76/1.02 Derived: -product1(A,B,e_1) | -product1(A,B,e_3). [resolve(1,c,3,a)].
% 0.76/1.02 Derived: -product1(A,B,e_1) | -product1(A,B,e_4). [resolve(1,c,4,a)].
% 0.76/1.02 Derived: -product1(A,B,e_1) | -product1(A,B,e_5). [resolve(1,c,5,a)].
% 0.76/1.02 Derived: -product1(A,B,e_2) | -product1(A,B,e_3). [resolve(1,c,7,a)].
% 0.76/1.02 Derived: -product1(A,B,e_2) | -product1(A,B,e_4). [resolve(1,c,8,a)].
% 0.76/1.02 Derived: -product1(A,B,e_2) | -product1(A,B,e_5). [resolve(1,c,9,a)].
% 0.76/1.02 Derived: -product1(A,B,e_3) | -product1(A,B,e_4). [resolve(1,c,12,a)].
% 0.76/1.02 Derived: -product1(A,B,e_3) | -product1(A,B,e_5). [resolve(1,c,13,a)].
% 0.76/1.02 Derived: -product1(A,B,e_4) | -product1(A,B,e_5). [resolve(1,c,17,a)].
% 0.76/1.02 22 -product1(A,B,C) | -product1(A,D,C) | equalish(B,D) # label(product1_right_cancellation) # label(axiom). [assumption].
% 0.76/1.02 Derived: -product1(A,e_1,B) | -product1(A,e_2,B). [resolve(22,c,2,a)].
% 0.76/1.02 Derived: -product1(A,e_1,B) | -product1(A,e_3,B). [resolve(22,c,3,a)].
% 0.76/1.02 Derived: -product1(A,e_1,B) | -product1(A,e_4,B). [resolve(22,c,4,a)].
% 0.76/1.02 Derived: -product1(A,e_1,B) | -product1(A,e_5,B). [resolve(22,c,5,a)].
% 0.76/1.02 Derived: -product1(A,e_2,B) | -product1(A,e_3,B). [resolve(22,c,7,a)].
% 0.76/1.02 Derived: -product1(A,e_2,B) | -product1(A,e_4,B). [resolve(22,c,8,a)].
% 0.76/1.02 Derived: -product1(A,e_2,B) | -product1(A,e_5,B). [resolve(22,c,9,a)].
% 0.76/1.02 Derived: -product1(A,e_3,B) | -product1(A,e_4,B). [resolve(22,c,12,a)].
% 0.76/1.02 Derived: -product1(A,e_3,B) | -product1(A,e_5,B). [resolve(22,c,13,a)].
% 0.76/1.02 Derived: -product1(A,e_4,B) | -product1(A,e_5,B). [resolve(22,c,17,a)].
% 0.76/1.02 23 -product1(A,B,C) | -product1(D,B,C) | equalish(A,D) # label(product1_left_cancellation) # label(axiom). [assumption].
% 0.76/1.02 Derived: -product1(e_1,A,B) | -product1(e_2,A,B). [resolve(23,c,2,a)].
% 0.76/1.02 Derived: -product1(e_1,A,B) | -product1(e_3,A,B). [resolve(23,c,3,a)].
% 0.76/1.02 Derived: -product1(e_1,A,B) | -product1(e_4,A,B). [resolve(23,c,4,a)].
% 0.76/1.02 Derived: -product1(e_1,A,B) | -product1(e_5,A,B). [resolve(23,c,5,a)].
% 0.76/1.02 Derived: -product1(e_2,A,B) | -product1(e_3,A,B). [resolve(23,c,7,a)].
% 0.76/1.02 Derived: -product1(e_2,A,B) | -product1(e_4,A,B). [resolve(23,c,8,a)].
% 0.76/1.02 Derived: -product1(e_2,A,B) | -product1(e_5,A,B). [resolve(23,c,9,a)].
% 0.76/1.02 Derived: -product1(e_3,A,B) | -product1(e_4,A,B). [resolve(23,c,12,a)].
% 0.76/1.02 Derived: -product1(e_3,A,B) | -product1(e_5,A,B). [resolve(23,c,13,a)].
% 0.76/1.02 Derived: -product1(e_4,A,B) | -product1(e_5,A,B). [resolve(23,c,17,a)].
% 0.76/1.02 24 -product2(A,B,C) | -product2(A,B,D) | equalish(C,D) # label(product2_total_function2) # label(axiom). [assumption].
% 0.76/1.02 Derived: -product2(A,B,e_1) | -product2(A,B,e_2). [resolve(24,c,2,a)].
% 0.76/1.02 Derived: -product2(A,B,e_1) | -product2(A,B,e_3). [resolve(24,c,3,a)].
% 0.76/1.02 Derived: -product2(A,B,e_1) | -product2(A,B,e_4). [resolve(24,c,4,a)].
% 0.76/1.02 Derived: -product2(A,B,e_1) | -product2(A,B,e_5). [resolve(24,c,5,a)].
% 0.76/1.02 Derived: -product2(A,B,e_2) | -product2(A,B,e_3). [resolve(24,c,7,a)].
% 0.76/1.02 Derived: -product2(A,B,e_2) | -product2(A,B,e_4). [resolve(24,c,8,a)].
% 0.76/1.02 Derived: -product2(A,B,e_2) | -product2(A,B,e_5). [resolve(24,c,9,a)].
% 0.76/1.02 Derived: -product2(A,B,e_3) | -product2(A,B,e_4). [resolve(24,c,12,a)].
% 0.76/1.02 Derived: -product2(A,B,e_3) | -product2(A,B,e_5). [resolve(24,c,13,a)].
% 0.76/1.02 Derived: -product2(A,B,e_4) | -product2(A,B,e_5). [resolve(24,c,17,a)].
% 0.76/1.02 25 -product2(A,B,C) | -product2(A,D,C) | equalish(B,D) # label(product2_right_cancellation) # label(axiom). [assumption].
% 0.76/1.02 Derived: -product2(A,e_1,B) | -product2(A,e_2,B). [resolve(25,c,2,a)].
% 0.76/1.02 Derived: -product2(A,e_1,B) | -product2(A,e_3,B). [resolve(25,c,3,a)].
% 0.76/1.02 Derived: -product2(A,e_1,B) | -product2(A,e_4,B). [resolve(25,c,4,a)].
% 0.76/1.02 Derived: -product2(A,e_1,B) | -product2(A,e_5,B). [resolve(25,c,5,a)].
% 0.76/1.02 Derived: -product2(A,e_2,B) | -product2(A,e_3,B). [resolve(25,c,7,a)].
% 0.76/1.02 Derived: -product2(A,e_2,B) | -product2(A,e_4,B). [resolve(25,c,8,a)].
% 0.76/1.02 Derived: -product2(A,e_2,B) | -product2(A,e_5,B). [resolve(25,c,9,a)].
% 0.76/1.02 Derived: -product2(A,e_3,B) | -product2(A,e_4,B). [resolve(25,c,12,a)].
% 0.76/1.02 Derived: -product2(A,e_3,B) | -product2(A,e_5,B). [resolve(25,c,13,a)].
% 0.76/1.02 Derived: -product2(A,e_4,B) | -product2(A,e_5,B). [resolve(25,c,17,a)].
% 0.76/1.02 26 -product2(A,B,C) | -product2(D,B,C) | equalish(A,D) # label(product2_left_cancellation) # label(axCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------