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