TSTP Solution File: GRP123-9.003 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP123-9.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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:18 EDT 2022
% Result : Unsatisfiable 0.46s 1.01s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP123-9.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.14 % 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 06:08:46 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.00 ============================== Prover9 ===============================
% 0.46/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.00 Process 29307 was started by sandbox on n027.cluster.edu,
% 0.46/1.00 Mon Jun 13 06:08:47 2022
% 0.46/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29151_n027.cluster.edu".
% 0.46/1.00 ============================== end of head ===========================
% 0.46/1.00
% 0.46/1.00 ============================== INPUT =================================
% 0.46/1.00
% 0.46/1.00 % Reading from file /tmp/Prover9_29151_n027.cluster.edu
% 0.46/1.00
% 0.46/1.00 set(prolog_style_variables).
% 0.46/1.00 set(auto2).
% 0.46/1.00 % set(auto2) -> set(auto).
% 0.46/1.00 % set(auto) -> set(auto_inference).
% 0.46/1.00 % set(auto) -> set(auto_setup).
% 0.46/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.00 % set(auto) -> set(auto_limits).
% 0.46/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.00 % set(auto) -> set(auto_denials).
% 0.46/1.00 % set(auto) -> set(auto_process).
% 0.46/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.00 % set(auto2) -> assign(stats, some).
% 0.46/1.00 % set(auto2) -> clear(echo_input).
% 0.46/1.00 % set(auto2) -> set(quiet).
% 0.46/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.00 % set(auto2) -> clear(print_given).
% 0.46/1.00 assign(lrs_ticks,-1).
% 0.46/1.00 assign(sos_limit,10000).
% 0.46/1.00 assign(order,kbo).
% 0.46/1.00 set(lex_order_vars).
% 0.46/1.00 clear(print_given).
% 0.46/1.00
% 0.46/1.00 % formulas(sos). % not echoed (22 formulas)
% 0.46/1.00
% 0.46/1.00 ============================== end of input ==========================
% 0.46/1.00
% 0.46/1.00 % From the command line: assign(max_seconds, 300).
% 0.46/1.00
% 0.46/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.00
% 0.46/1.00 % Formulas that are not ordinary clauses:
% 0.46/1.00
% 0.46/1.00 ============================== end of process non-clausal formulas ===
% 0.46/1.00
% 0.46/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.00
% 0.46/1.00 ============================== PREDICATE ELIMINATION =================
% 0.46/1.00 1 -product1(A,B,C) | -product1(A,B,D) | equalish(C,D) # label(product1_total_function2) # label(axiom). [assumption].
% 0.46/1.00 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.46/1.00 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.46/1.00 4 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.46/1.00 5 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.46/1.00 6 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.46/1.00 7 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.46/1.00 Derived: -product1(A,B,e_1) | -product1(A,B,e_2). [resolve(1,c,2,a)].
% 0.46/1.00 Derived: -product1(A,B,e_1) | -product1(A,B,e_3). [resolve(1,c,3,a)].
% 0.46/1.00 Derived: -product1(A,B,e_2) | -product1(A,B,e_3). [resolve(1,c,5,a)].
% 0.46/1.00 8 -product1(A,B,C) | -product1(A,D,C) | equalish(B,D) # label(product1_right_cancellation) # label(axiom). [assumption].
% 0.46/1.00 Derived: -product1(A,e_1,B) | -product1(A,e_2,B). [resolve(8,c,2,a)].
% 0.46/1.00 Derived: -product1(A,e_1,B) | -product1(A,e_3,B). [resolve(8,c,3,a)].
% 0.46/1.00 Derived: -product1(A,e_2,B) | -product1(A,e_3,B). [resolve(8,c,5,a)].
% 0.46/1.00 9 -product1(A,B,C) | -product1(D,B,C) | equalish(A,D) # label(product1_left_cancellation) # label(axiom). [assumption].
% 0.46/1.00 Derived: -product1(e_1,A,B) | -product1(e_2,A,B). [resolve(9,c,2,a)].
% 0.46/1.00 Derived: -product1(e_1,A,B) | -product1(e_3,A,B). [resolve(9,c,3,a)].
% 0.46/1.00 Derived: -product1(e_2,A,B) | -product1(e_3,A,B). [resolve(9,c,5,a)].
% 0.46/1.00 10 -product2(A,B,C) | -product2(A,B,D) | equalish(C,D) # label(product2_total_function2) # label(axiom). [assumption].
% 0.46/1.00 Derived: -product2(A,B,e_1) | -product2(A,B,e_2). [resolve(10,c,2,a)].
% 0.46/1.00 Derived: -product2(A,B,e_1) | -product2(A,B,e_3). [resolve(10,c,3,a)].
% 0.46/1.00 Derived: -product2(A,B,e_2) | -product2(A,B,e_3). [resolve(10,c,5,a)].
% 0.46/1.01 11 -product2(A,B,C) | -product2(A,D,C) | equalish(B,D) # label(product2_right_cancellation) # label(axiom). [assumption].
% 0.46/1.01 Derived: -product2(A,e_1,B) | -product2(A,e_2,B). [resolve(11,c,2,a)].
% 0.46/1.01 Derived: -product2(A,e_1,B) | -product2(A,e_3,B). [resolve(11,c,3,a)].
% 0.46/1.01 Derived: -product2(A,e_2,B) | -product2(A,e_3,B). [resolve(11,c,5,a)].
% 0.46/1.01 12 -product2(A,B,C) | -product2(D,B,C) | equalish(A,D) # label(product2_left_cancellation) # label(axiom). [assumption].
% 0.46/1.01 Derived: -product2(e_1,A,B) | -product2(e_2,A,B). [resolve(12,c,2,a)].
% 0.46/1.01 Derived: -product2(e_1,A,B) | -product2(e_3,A,B). [resolve(12,c,3,a)].
% 0.46/1.01 Derived: -product2(e_2,A,B) | -product2(e_3,A,B). [resolve(12,c,5,a)].
% 0.46/1.01
% 0.46/1.01 ============================== end predicate elimination =============
% 0.46/1.01
% 0.46/1.01 Auto_denials: (non-Horn, no changes).
% 0.46/1.01
% 0.46/1.01 Term ordering decisions:
% 0.46/1.01 Function symbol KB weights: e_1=1. e_2=1. e_3=1.
% 0.46/1.01
% 0.46/1.01 ============================== end of process initial clauses ========
% 0.46/1.01
% 0.46/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.01
% 0.46/1.01 ============================== end of clauses for search =============
% 0.46/1.01
% 0.46/1.01 ============================== SEARCH ================================
% 0.46/1.01
% 0.46/1.01 % Starting search at 0.01 seconds.
% 0.46/1.01
% 0.46/1.01 ============================== PROOF =================================
% 0.46/1.01 % SZS status Unsatisfiable
% 0.46/1.01 % SZS output start Refutation
% 0.46/1.01
% 0.46/1.01 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.46/1.01 % Length of proof is 27.
% 0.46/1.01 % Level of proof is 5.
% 0.46/1.01 % Maximum clause weight is 16.000.
% 0.46/1.01 % Given clauses 97.
% 0.46/1.01
% 0.46/1.01 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.46/1.01 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.46/1.01 8 -product1(A,B,C) | -product1(A,D,C) | equalish(B,D) # label(product1_right_cancellation) # label(axiom). [assumption].
% 0.46/1.01 9 -product1(A,B,C) | -product1(D,B,C) | equalish(A,D) # label(product1_left_cancellation) # label(axiom). [assumption].
% 0.46/1.01 10 -product2(A,B,C) | -product2(A,B,D) | equalish(C,D) # label(product2_total_function2) # label(axiom). [assumption].
% 0.46/1.01 13 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.46/1.01 14 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.46/1.01 15 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.46/1.01 16 product1(A,A,A) # label(product1_idempotence) # label(axiom). [assumption].
% 0.46/1.01 17 product2(A,A,A) # label(product2_idempotence) # label(axiom). [assumption].
% 0.46/1.01 18 -product1(A,B,C) | -product1(C,B,D) | product2(D,A,B) # label(qg1a) # label(negated_conjecture). [assumption].
% 0.46/1.01 21 -group_element(A) | -group_element(B) | product1(A,B,e_1) | product1(A,B,e_2) | product1(A,B,e_3) # label(product1_total_function1) # label(axiom). [assumption].
% 0.46/1.01 26 -product1(A,e_1,B) | -product1(A,e_2,B). [resolve(8,c,2,a)].
% 0.46/1.01 27 -product1(A,e_1,B) | -product1(A,e_3,B). [resolve(8,c,3,a)].
% 0.46/1.01 29 -product1(e_1,A,B) | -product1(e_2,A,B). [resolve(9,c,2,a)].
% 0.46/1.01 30 -product1(e_1,A,B) | -product1(e_3,A,B). [resolve(9,c,3,a)].
% 0.46/1.01 32 -product2(A,B,e_1) | -product2(A,B,e_2). [resolve(10,c,2,a)].
% 0.46/1.01 60 -group_element(A) | product1(e_3,A,e_1) | product1(e_3,A,e_2) | product1(e_3,A,e_3). [resolve(21,a,15,a)].
% 0.46/1.01 61 -group_element(A) | product1(e_2,A,e_1) | product1(e_2,A,e_2) | product1(e_2,A,e_3). [resolve(21,a,14,a)].
% 0.46/1.01 78 -product1(e_2,e_1,e_2). [resolve(26,b,16,a)].
% 0.46/1.01 80 -product1(e_3,e_1,e_3). [resolve(27,b,16,a)].
% 0.46/1.01 85 -product1(e_2,e_1,e_1). [ur(29,a,16,a)].
% 0.46/1.01 87 -product1(e_3,e_1,e_1). [ur(30,a,16,a)].
% 0.46/1.01 90 -product2(e_2,e_2,e_1). [resolve(32,b,17,a)].
% 0.46/1.01 127 product1(e_3,e_1,e_2). [resolve(60,a,13,a),unit_del(a,87),unit_del(c,80)].
% 0.46/1.01 133 -product1(e_2,e_1,e_3). [ur(18,b,127,a,c,90,a)].
% 0.46/1.01 135 $F. [resolve(61,a,13,a),unit_del(a,85),unit_del(b,78),unit_del(c,133)].
% 0.46/1.01
% 0.46/1.01 % SZS output end Refutation
% 0.46/1.01 ============================== end of proof ==========================
% 0.46/1.01
% 0.46/1.01 ============================== STATISTICS ============================
% 0.46/1.01
% 0.46/1.01 Given=97. Generated=211. Kept=122. proofs=1.
% 0.46/1.01 Usable=97. Sos=24. Demods=0. Limbo=1, Disabled=40. Hints=0.
% 0.46/1.01 Megabytes=0.10.
% 0.46/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.46/1.01
% 0.46/1.01 ============================== end of statistics =====================
% 0.46/1.01
% 0.46/1.01 ============================== end of search =========================
% 0.46/1.01
% 0.46/1.01 THEOREM PROVED
% 0.46/1.01 % SZS status Unsatisfiable
% 0.46/1.01
% 0.46/1.01 Exiting with 1 proof.
% 0.46/1.01
% 0.46/1.01 Process 29307 exit (max_proofs) Mon Jun 13 06:08:47 2022
% 0.46/1.01 Prover9 interrupted
%------------------------------------------------------------------------------