TSTP Solution File: GRP125-1.003 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP125-1.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:23 EDT 2022
% Result : Unsatisfiable 0.44s 0.97s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP125-1.003 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 23:29:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/0.97 ============================== Prover9 ===============================
% 0.44/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.97 Process 16406 was started by sandbox2 on n027.cluster.edu,
% 0.44/0.97 Mon Jun 13 23:29:03 2022
% 0.44/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15997_n027.cluster.edu".
% 0.44/0.97 ============================== end of head ===========================
% 0.44/0.97
% 0.44/0.97 ============================== INPUT =================================
% 0.44/0.97
% 0.44/0.97 % Reading from file /tmp/Prover9_15997_n027.cluster.edu
% 0.44/0.97
% 0.44/0.97 set(prolog_style_variables).
% 0.44/0.97 set(auto2).
% 0.44/0.97 % set(auto2) -> set(auto).
% 0.44/0.97 % set(auto) -> set(auto_inference).
% 0.44/0.97 % set(auto) -> set(auto_setup).
% 0.44/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.97 % set(auto) -> set(auto_limits).
% 0.44/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.97 % set(auto) -> set(auto_denials).
% 0.44/0.97 % set(auto) -> set(auto_process).
% 0.44/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.97 % set(auto2) -> assign(stats, some).
% 0.44/0.97 % set(auto2) -> clear(echo_input).
% 0.44/0.97 % set(auto2) -> set(quiet).
% 0.44/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.97 % set(auto2) -> clear(print_given).
% 0.44/0.97 assign(lrs_ticks,-1).
% 0.44/0.97 assign(sos_limit,10000).
% 0.44/0.97 assign(order,kbo).
% 0.44/0.97 set(lex_order_vars).
% 0.44/0.97 clear(print_given).
% 0.44/0.97
% 0.44/0.97 % formulas(sos). % not echoed (15 formulas)
% 0.44/0.97
% 0.44/0.97 ============================== end of input ==========================
% 0.44/0.97
% 0.44/0.97 % From the command line: assign(max_seconds, 300).
% 0.44/0.97
% 0.44/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.97
% 0.44/0.97 % Formulas that are not ordinary clauses:
% 0.44/0.97
% 0.44/0.97 ============================== end of process non-clausal formulas ===
% 0.44/0.97
% 0.44/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.97
% 0.44/0.97 ============================== PREDICATE ELIMINATION =================
% 0.44/0.97 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.44/0.97 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.44/0.97 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.44/0.97 4 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.44/0.97 5 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.44/0.97 6 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.44/0.97 7 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.44/0.97 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(1,c,2,a)].
% 0.44/0.97 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(1,c,3,a)].
% 0.44/0.97 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(1,c,5,a)].
% 0.44/0.97 8 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.44/0.97 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(8,c,2,a)].
% 0.44/0.97 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(8,c,3,a)].
% 0.44/0.97 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(8,c,5,a)].
% 0.44/0.97 9 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.44/0.97 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(9,c,2,a)].
% 0.44/0.97 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(9,c,3,a)].
% 0.44/0.97 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(9,c,5,a)].
% 0.44/0.97
% 0.44/0.97 ============================== end predicate elimination =============
% 0.44/0.97
% 0.44/0.97 Auto_denials: (non-Horn, no changes).
% 0.44/0.97
% 0.44/0.97 Term ordering decisions:
% 0.44/0.97 Function symbol KB weights: e_1=1. e_2=1. e_3=1.
% 0.44/0.97
% 0.44/0.97 ============================== end of process initial clauses ========
% 0.44/0.97
% 0.44/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.97
% 0.44/0.97 ============================== end of clauses for search =============
% 0.44/0.97
% 0.44/0.97 ============================== SEARCH ================================
% 0.44/0.97
% 0.44/0.97 % Starting search at 0.01 seconds.
% 0.44/0.97
% 0.44/0.97 ============================== PROOF =================================
% 0.44/0.97 % SZS status Unsatisfiable
% 0.44/0.97 % SZS output start Refutation
% 0.44/0.97
% 0.44/0.97 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/0.97 % Length of proof is 23.
% 0.44/0.97 % Level of proof is 5.
% 0.44/0.97 % Maximum clause weight is 16.000.
% 0.44/0.97 % Given clauses 27.
% 0.44/0.97
% 0.44/0.97 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.44/0.97 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.44/0.97 5 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.44/0.97 8 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.44/0.97 9 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.44/0.97 11 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.44/0.97 12 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.44/0.97 13 product(A,A,A) # label(product_idempotence) # label(axiom). [assumption].
% 0.44/0.97 14 -product(A,B,C) | -product(B,A,D) | product(C,D,A) # label(qg3) # label(negated_conjecture). [assumption].
% 0.44/0.97 15 -group_element(A) | -group_element(B) | product(A,B,e_1) | product(A,B,e_2) | product(A,B,e_3) # label(product_total_function1) # label(axiom). [assumption].
% 0.44/0.97 16 -product(A,B,e_1) | -product(A,B,e_2). [resolve(1,c,2,a)].
% 0.44/0.97 21 -product(A,e_2,B) | -product(A,e_3,B). [resolve(8,c,5,a)].
% 0.44/0.97 24 -product(e_2,A,B) | -product(e_3,A,B). [resolve(9,c,5,a)].
% 0.44/0.97 29 -group_element(A) | product(e_3,A,e_1) | product(e_3,A,e_2) | product(e_3,A,e_3). [resolve(15,a,12,a)].
% 0.44/0.97 30 -group_element(A) | product(e_2,A,e_1) | product(e_2,A,e_2) | product(e_2,A,e_3). [resolve(15,a,11,a)].
% 0.44/0.97 36 -product(e_1,e_1,e_2). [ur(16,a,13,a)].
% 0.44/0.97 45 -product(e_3,e_2,e_3). [resolve(21,b,13,a)].
% 0.44/0.97 46 -product(e_2,e_3,e_2). [ur(21,a,13,a)].
% 0.44/0.97 51 -product(e_2,e_3,e_3). [resolve(24,b,13,a)].
% 0.44/0.97 52 -product(e_3,e_2,e_2). [ur(24,a,13,a)].
% 0.44/0.97 53 product(e_3,e_2,e_1). [resolve(29,a,11,a),unit_del(b,52),unit_del(c,45)].
% 0.44/0.97 57 -product(e_2,e_3,e_1). [ur(14,b,53,a,c,36,a)].
% 0.44/0.97 61 $F. [resolve(30,a,12,a),unit_del(a,57),unit_del(b,46),unit_del(c,51)].
% 0.44/0.97
% 0.44/0.97 % SZS output end Refutation
% 0.44/0.97 ============================== end of proof ==========================
% 0.44/0.97
% 0.44/0.97 ============================== STATISTICS ============================
% 0.44/0.97
% 0.44/0.97 Given=27. Generated=91. Kept=51. proofs=1.
% 0.44/0.97 Usable=27. Sos=24. Demods=0. Limbo=0, Disabled=24. Hints=0.
% 0.44/0.97 Megabytes=0.05.
% 0.44/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.97
% 0.44/0.97 ============================== end of statistics =====================
% 0.44/0.97
% 0.44/0.97 ============================== end of search =========================
% 0.44/0.97
% 0.44/0.97 THEOREM PROVED
% 0.44/0.97 % SZS status Unsatisfiable
% 0.44/0.97
% 0.44/0.97 Exiting with 1 proof.
% 0.44/0.97
% 0.44/0.97 Process 16406 exit (max_proofs) Mon Jun 13 23:29:03 2022
% 0.44/0.97 Prover9 interrupted
%------------------------------------------------------------------------------