TSTP Solution File: GRP037-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP037-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:52 EDT 2022
% Result : Unsatisfiable 0.66s 0.96s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP037-3 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jun 14 14:17:54 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.66/0.96 ============================== Prover9 ===============================
% 0.66/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.96 Process 10242 was started by sandbox on n028.cluster.edu,
% 0.66/0.96 Tue Jun 14 14:17:54 2022
% 0.66/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10089_n028.cluster.edu".
% 0.66/0.96 ============================== end of head ===========================
% 0.66/0.96
% 0.66/0.96 ============================== INPUT =================================
% 0.66/0.96
% 0.66/0.96 % Reading from file /tmp/Prover9_10089_n028.cluster.edu
% 0.66/0.96
% 0.66/0.96 set(prolog_style_variables).
% 0.66/0.96 set(auto2).
% 0.66/0.96 % set(auto2) -> set(auto).
% 0.66/0.96 % set(auto) -> set(auto_inference).
% 0.66/0.96 % set(auto) -> set(auto_setup).
% 0.66/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.96 % set(auto) -> set(auto_limits).
% 0.66/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.96 % set(auto) -> set(auto_denials).
% 0.66/0.96 % set(auto) -> set(auto_process).
% 0.66/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.96 % set(auto2) -> assign(stats, some).
% 0.66/0.96 % set(auto2) -> clear(echo_input).
% 0.66/0.96 % set(auto2) -> set(quiet).
% 0.66/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.96 % set(auto2) -> clear(print_given).
% 0.66/0.96 assign(lrs_ticks,-1).
% 0.66/0.96 assign(sos_limit,10000).
% 0.66/0.96 assign(order,kbo).
% 0.66/0.96 set(lex_order_vars).
% 0.66/0.96 clear(print_given).
% 0.66/0.96
% 0.66/0.96 % formulas(sos). % not echoed (19 formulas)
% 0.66/0.96
% 0.66/0.96 ============================== end of input ==========================
% 0.66/0.96
% 0.66/0.96 % From the command line: assign(max_seconds, 300).
% 0.66/0.96
% 0.66/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.96
% 0.66/0.96 % Formulas that are not ordinary clauses:
% 0.66/0.96
% 0.66/0.96 ============================== end of process non-clausal formulas ===
% 0.66/0.96
% 0.66/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/0.96
% 0.66/0.96 ============================== PREDICATE ELIMINATION =================
% 0.66/0.96
% 0.66/0.96 ============================== end predicate elimination =============
% 0.66/0.96
% 0.66/0.96 Auto_denials:
% 0.66/0.96 % copying label prove_two_inverses_are_equal to answer in negative clause
% 0.66/0.96
% 0.66/0.96 Term ordering decisions:
% 0.66/0.96 Function symbol KB weights: another_identity=1. identity=1. a=1. multiply=1. another_inverse=1. inverse=1.
% 0.66/0.96
% 0.66/0.96 ============================== end of process initial clauses ========
% 0.66/0.96
% 0.66/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.66/0.96
% 0.66/0.96 ============================== end of clauses for search =============
% 0.66/0.96
% 0.66/0.96 ============================== SEARCH ================================
% 0.66/0.96
% 0.66/0.96 % Starting search at 0.01 seconds.
% 0.66/0.96
% 0.66/0.96 ============================== PROOF =================================
% 0.66/0.96 % SZS status Unsatisfiable
% 0.66/0.96 % SZS output start Refutation
% 0.66/0.96
% 0.66/0.96 % Proof 1 at 0.02 (+ 0.01) seconds: prove_two_inverses_are_equal.
% 0.66/0.96 % Length of proof is 18.
% 0.66/0.96 % Level of proof is 5.
% 0.66/0.96 % Maximum clause weight is 11.000.
% 0.66/0.96 % Given clauses 47.
% 0.66/0.96
% 0.66/0.96 1 subgroup_member(a) # label(a_is_in_subgroup) # label(hypothesis). [assumption].
% 0.66/0.96 2 subgroup_member(another_identity) # label(another_identity_in_subgroup) # label(hypothesis). [assumption].
% 0.66/0.96 3 product(identity,A,A) # label(left_identity) # label(axiom). [assumption].
% 0.66/0.96 6 product(A,inverse(A),identity) # label(right_inverse) # label(axiom). [assumption].
% 0.66/0.96 8 inverse(a) != another_inverse(a) # label(prove_two_inverses_are_equal) # label(negated_conjecture) # answer(prove_two_inverses_are_equal). [assumption].
% 0.66/0.96 10 -subgroup_member(A) | product(another_identity,A,A) # label(another_left_identity) # label(hypothesis). [assumption].
% 0.66/0.96 12 -subgroup_member(A) | product(A,another_inverse(A),another_identity) # label(another_right_inverse) # label(hypothesis). [assumption].
% 0.66/0.96 16 -product(A,B,C) | -product(A,D,C) | D = B # label(product_right_cancellation) # label(hypothesis). [assumption].
% 0.66/0.96 17 -product(A,B,C) | -product(D,B,C) | D = A # label(product_left_cancellation) # label(hypothesis). [assumption].
% 0.66/0.96 20 inverse(a) = c_0. [new_symbol(8)].
% 0.66/0.96 21 another_inverse(a) != c_0 # answer(prove_two_inverses_are_equal). [back_rewrite(8),rewrite([20(2)]),flip(a)].
% 0.66/0.96 24 product(another_identity,another_identity,another_identity). [hyper(10,a,2,a)].
% 0.66/0.96 28 product(a,another_inverse(a),another_identity). [hyper(12,a,1,a)].
% 0.66/0.96 54 product(a,c_0,identity). [para(20(a,1),6(a,2))].
% 0.66/0.96 146 identity = another_identity. [hyper(17,a,3,a,b,24,a),flip(a)].
% 0.66/0.96 156 product(a,c_0,another_identity). [back_rewrite(54),rewrite([146(3)])].
% 0.66/0.96 272 -product(a,another_inverse(a),another_identity) # answer(prove_two_inverses_are_equal). [ur(16,b,156,a,c,21,a(flip))].
% 0.66/0.96 273 $F # answer(prove_two_inverses_are_equal). [resolve(272,a,28,a)].
% 0.66/0.96
% 0.66/0.96 % SZS output end Refutation
% 0.66/0.96 ============================== end of proof ==========================
% 0.66/0.96
% 0.66/0.96 ============================== STATISTICS ============================
% 0.66/0.96
% 0.66/0.96 Given=47. Generated=766. Kept=272. proofs=1.
% 0.66/0.96 Usable=32. Sos=127. Demods=10. Limbo=9, Disabled=122. Hints=0.
% 0.66/0.96 Megabytes=0.16.
% 0.66/0.96 User_CPU=0.02, System_CPU=0.01, Wall_clock=0.
% 0.66/0.96
% 0.66/0.96 ============================== end of statistics =====================
% 0.66/0.96
% 0.66/0.96 ============================== end of search =========================
% 0.66/0.96
% 0.66/0.96 THEOREM PROVED
% 0.66/0.96 % SZS status Unsatisfiable
% 0.66/0.96
% 0.66/0.96 Exiting with 1 proof.
% 0.66/0.96
% 0.66/0.96 Process 10242 exit (max_proofs) Tue Jun 14 14:17:54 2022
% 0.66/0.96 Prover9 interrupted
%------------------------------------------------------------------------------