TSTP Solution File: GRP039-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP039-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:16:53 EDT 2022
% Result : Unsatisfiable 1.26s 1.57s
% Output : Refutation 1.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP039-4 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n006.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 19:18:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.26/1.57 ============================== Prover9 ===============================
% 1.26/1.57 Prover9 (32) version 2009-11A, November 2009.
% 1.26/1.57 Process 16020 was started by sandbox on n006.cluster.edu,
% 1.26/1.57 Mon Jun 13 19:18:42 2022
% 1.26/1.57 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15867_n006.cluster.edu".
% 1.26/1.57 ============================== end of head ===========================
% 1.26/1.57
% 1.26/1.57 ============================== INPUT =================================
% 1.26/1.57
% 1.26/1.57 % Reading from file /tmp/Prover9_15867_n006.cluster.edu
% 1.26/1.57
% 1.26/1.57 set(prolog_style_variables).
% 1.26/1.57 set(auto2).
% 1.26/1.57 % set(auto2) -> set(auto).
% 1.26/1.57 % set(auto) -> set(auto_inference).
% 1.26/1.57 % set(auto) -> set(auto_setup).
% 1.26/1.57 % set(auto_setup) -> set(predicate_elim).
% 1.26/1.57 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.26/1.57 % set(auto) -> set(auto_limits).
% 1.26/1.57 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.26/1.57 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.26/1.57 % set(auto) -> set(auto_denials).
% 1.26/1.57 % set(auto) -> set(auto_process).
% 1.26/1.57 % set(auto2) -> assign(new_constants, 1).
% 1.26/1.57 % set(auto2) -> assign(fold_denial_max, 3).
% 1.26/1.57 % set(auto2) -> assign(max_weight, "200.000").
% 1.26/1.57 % set(auto2) -> assign(max_hours, 1).
% 1.26/1.57 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.26/1.57 % set(auto2) -> assign(max_seconds, 0).
% 1.26/1.57 % set(auto2) -> assign(max_minutes, 5).
% 1.26/1.57 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.26/1.57 % set(auto2) -> set(sort_initial_sos).
% 1.26/1.57 % set(auto2) -> assign(sos_limit, -1).
% 1.26/1.57 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.26/1.57 % set(auto2) -> assign(max_megs, 400).
% 1.26/1.57 % set(auto2) -> assign(stats, some).
% 1.26/1.57 % set(auto2) -> clear(echo_input).
% 1.26/1.57 % set(auto2) -> set(quiet).
% 1.26/1.57 % set(auto2) -> clear(print_initial_clauses).
% 1.26/1.57 % set(auto2) -> clear(print_given).
% 1.26/1.57 assign(lrs_ticks,-1).
% 1.26/1.57 assign(sos_limit,10000).
% 1.26/1.57 assign(order,kbo).
% 1.26/1.57 set(lex_order_vars).
% 1.26/1.57 clear(print_given).
% 1.26/1.57
% 1.26/1.57 % formulas(sos). % not echoed (17 formulas)
% 1.26/1.57
% 1.26/1.57 ============================== end of input ==========================
% 1.26/1.57
% 1.26/1.57 % From the command line: assign(max_seconds, 300).
% 1.26/1.57
% 1.26/1.57 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.26/1.57
% 1.26/1.57 % Formulas that are not ordinary clauses:
% 1.26/1.57
% 1.26/1.57 ============================== end of process non-clausal formulas ===
% 1.26/1.57
% 1.26/1.57 ============================== PROCESS INITIAL CLAUSES ===============
% 1.26/1.57
% 1.26/1.57 ============================== PREDICATE ELIMINATION =================
% 1.26/1.57
% 1.26/1.57 ============================== end predicate elimination =============
% 1.26/1.57
% 1.26/1.57 Auto_denials: (non-Horn, no changes).
% 1.26/1.57
% 1.26/1.57 Term ordering decisions:
% 1.26/1.57
% 1.26/1.57 % Assigning unary symbol inverse kb_weight 0 and highest precedence (11).
% 1.26/1.57 Function symbol KB weights: identity=1. a=1. b=1. c=1. d=1. element_in_O2=1. multiply=1. inverse=0.
% 1.26/1.57
% 1.26/1.57 ============================== end of process initial clauses ========
% 1.26/1.57
% 1.26/1.57 ============================== CLAUSES FOR SEARCH ====================
% 1.26/1.57
% 1.26/1.57 ============================== end of clauses for search =============
% 1.26/1.57
% 1.26/1.57 ============================== SEARCH ================================
% 1.26/1.57
% 1.26/1.57 % Starting search at 0.01 seconds.
% 1.26/1.57
% 1.26/1.57 Low Water (keep): wt=16.000, iters=3433
% 1.26/1.57
% 1.26/1.57 Low Water (keep): wt=15.000, iters=3903
% 1.26/1.57
% 1.26/1.57 ============================== PROOF =================================
% 1.26/1.57 % SZS status Unsatisfiable
% 1.26/1.57 % SZS output start Refutation
% 1.26/1.57
% 1.26/1.57 % Proof 1 at 0.54 (+ 0.02) seconds.
% 1.26/1.57 % Length of proof is 41.
% 1.26/1.57 % Level of proof is 12.
% 1.26/1.57 % Maximum clause weight is 16.000.
% 1.26/1.57 % Given clauses 438.
% 1.26/1.57
% 1.26/1.57 1 subgroup_member(identity) # label(identity_is_in_subgroup) # label(axiom). [assumption].
% 1.26/1.57 2 subgroup_member(b) # label(b_is_in_subgroup) # label(negated_conjecture). [assumption].
% 1.26/1.57 3 product(identity,A,A) # label(left_identity) # label(axiom). [assumption].
% 1.26/1.57 4 product(A,identity,A) # label(right_identity) # label(axiom). [assumption].
% 1.26/1.57 5 product(a,c,d) # label(a_times_c_is_d) # label(negated_conjecture). [assumption].
% 1.26/1.57 6 product(inverse(A),A,identity) # label(left_inverse) # label(axiom). [assumption].
% 1.26/1.57 8 product(b,inverse(a),c) # label(b_times_a_inverse_is_c) # label(negated_conjecture). [assumption].
% 1.26/1.57 9 product(A,B,multiply(A,B)) # label(total_function1) # label(axiom). [assumption].
% 1.26/1.57 10 subgroup_member(element_in_O2(A,B)) | subgroup_member(B) | subgroup_member(A) # label(an_element_in_O2) # label(axiom). [assumption].
% 1.26/1.57 11 product(A,element_in_O2(A,B),B) | subgroup_member(B) | subgroup_member(A) # label(property_of_O2) # label(axiom). [assumption].
% 1.26/1.57 12 -subgroup_member(d) # label(prove_d_is_in_subgroup) # label(negated_conjecture). [assumption].
% 1.26/1.57 13 -subgroup_member(A) | subgroup_member(inverse(A)) # label(closure_of_inverse) # label(axiom). [assumption].
% 1.26/1.57 14 -subgroup_member(A) | -subgroup_member(B) | -product(A,B,C) | subgroup_member(C) # label(closure_of_product) # label(axiom). [assumption].
% 1.26/1.57 15 -product(A,B,C) | -product(A,B,D) | C = D # label(total_function2) # label(axiom). [assumption].
% 1.26/1.57 16 -product(A,B,C) | -product(B,D,E) | -product(C,D,F) | product(A,E,F) # label(associativity1) # label(axiom). [assumption].
% 1.26/1.57 17 -product(A,B,C) | -product(B,D,E) | -product(A,E,F) | product(C,D,F) # label(associativity2) # label(axiom). [assumption].
% 1.26/1.57 32 -subgroup_member(inverse(a)) | subgroup_member(c). [resolve(14,c,8,a),unit_del(a,2)].
% 1.26/1.57 33 -subgroup_member(a) | -subgroup_member(c). [resolve(14,c,5,a),unit_del(c,12)].
% 1.26/1.57 48 -product(A,identity,B) | B = A. [resolve(15,b,4,a)].
% 1.26/1.57 54 -product(inverse(a),A,B) | -product(c,A,C) | product(b,B,C). [resolve(16,a,8,a)].
% 1.26/1.57 65 -product(A,a,B) | -product(B,c,C) | product(A,d,C). [resolve(16,b,5,a)].
% 1.26/1.57 75 -product(A,B,identity) | -product(B,C,D) | product(A,D,C). [resolve(16,c,3,a)].
% 1.26/1.57 90 -product(A,B,C) | -product(inverse(A),C,D) | product(identity,B,D). [resolve(17,a,6,a)].
% 1.26/1.57 1804 -product(c,a,A) | product(b,identity,A). [resolve(54,a,6,a)].
% 1.26/1.57 5049 -product(A,a,identity) | product(A,d,c). [resolve(65,b,3,a)].
% 1.26/1.57 5082 product(b,identity,multiply(c,a)). [resolve(1804,a,9,a)].
% 1.26/1.57 5092 multiply(c,a) = b. [resolve(5082,a,48,a)].
% 1.26/1.57 5093 product(c,a,b). [para(5092(a,1),9(a,3))].
% 1.26/1.57 5479 product(inverse(a),d,c). [resolve(5049,a,6,a)].
% 1.26/1.57 5884 -product(A,c,identity) | product(A,b,a). [resolve(75,b,5093,a)].
% 1.26/1.57 6016 product(inverse(c),b,a). [resolve(5884,a,6,a)].
% 1.26/1.57 6051 -subgroup_member(inverse(c)) | subgroup_member(a). [resolve(6016,a,14,c),unit_del(b,2)].
% 1.26/1.57 6774 -product(a,A,d) | product(identity,A,c). [resolve(90,b,5479,a)].
% 1.26/1.57 6801 product(identity,element_in_O2(a,d),c) | subgroup_member(a). [resolve(6774,a,11,a),unit_del(b,12)].
% 1.26/1.57 6836 subgroup_member(a) | -subgroup_member(element_in_O2(a,d)) | subgroup_member(c). [resolve(6801,a,14,c),unit_del(b,1)].
% 1.26/1.57 6949 subgroup_member(a) | subgroup_member(c). [resolve(6836,b,10,a),merge(d),unit_del(c,12)].
% 1.26/1.57 6965 subgroup_member(a) | subgroup_member(inverse(c)). [resolve(6949,b,13,a)].
% 1.26/1.57 7029 subgroup_member(a). [resolve(6965,b,6051,a),merge(b)].
% 1.26/1.57 7030 -subgroup_member(c). [back_unit_del(33),unit_del(a,7029)].
% 1.26/1.57 7041 -subgroup_member(inverse(a)). [back_unit_del(32),unit_del(b,7030)].
% 1.26/1.57 7062 $F. [resolve(7029,a,13,a),unit_del(a,7041)].
% 1.26/1.57
% 1.26/1.57 % SZS output end Refutation
% 1.26/1.57 ============================== end of proof ==========================
% 1.26/1.57
% 1.26/1.57 ============================== STATISTICS ============================
% 1.26/1.57
% 1.26/1.57 Given=438. Generated=24225. Kept=7061. proofs=1.
% 1.26/1.57 Usable=398. Sos=5821. Demods=17. Limbo=15, Disabled=844. Hints=0.
% 1.26/1.57 Megabytes=4.46.
% 1.26/1.57 User_CPU=0.54, System_CPU=0.02, Wall_clock=1.
% 1.26/1.57
% 1.26/1.57 ============================== end of statistics =====================
% 1.26/1.57
% 1.26/1.57 ============================== end of search =========================
% 1.26/1.57
% 1.26/1.57 THEOREM PROVED
% 1.26/1.57 % SZS status Unsatisfiable
% 1.26/1.57
% 1.26/1.57 Exiting with 1 proof.
% 1.26/1.57
% 1.26/1.57 Process 16020 exit (max_proofs) Mon Jun 13 19:18:43 2022
% 1.26/1.57 Prover9 interrupted
%------------------------------------------------------------------------------