TSTP Solution File: GRP021-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP021-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:44 EDT 2022
% Result : Unsatisfiable 0.49s 0.80s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : GRP021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.08 % Command : tptp2X_and_run_prover9 %d %s
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Mon Jun 13 13:28:56 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.49/0.80 ============================== Prover9 ===============================
% 0.49/0.80 Prover9 (32) version 2009-11A, November 2009.
% 0.49/0.80 Process 21727 was started by sandbox2 on n032.cluster.edu,
% 0.49/0.80 Mon Jun 13 13:28:57 2022
% 0.49/0.80 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21477_n032.cluster.edu".
% 0.49/0.80 ============================== end of head ===========================
% 0.49/0.80
% 0.49/0.80 ============================== INPUT =================================
% 0.49/0.80
% 0.49/0.80 % Reading from file /tmp/Prover9_21477_n032.cluster.edu
% 0.49/0.80
% 0.49/0.80 set(prolog_style_variables).
% 0.49/0.80 set(auto2).
% 0.49/0.80 % set(auto2) -> set(auto).
% 0.49/0.80 % set(auto) -> set(auto_inference).
% 0.49/0.80 % set(auto) -> set(auto_setup).
% 0.49/0.80 % set(auto_setup) -> set(predicate_elim).
% 0.49/0.80 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/0.80 % set(auto) -> set(auto_limits).
% 0.49/0.80 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/0.80 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/0.80 % set(auto) -> set(auto_denials).
% 0.49/0.80 % set(auto) -> set(auto_process).
% 0.49/0.80 % set(auto2) -> assign(new_constants, 1).
% 0.49/0.80 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/0.80 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/0.80 % set(auto2) -> assign(max_hours, 1).
% 0.49/0.80 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/0.80 % set(auto2) -> assign(max_seconds, 0).
% 0.49/0.80 % set(auto2) -> assign(max_minutes, 5).
% 0.49/0.80 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/0.80 % set(auto2) -> set(sort_initial_sos).
% 0.49/0.80 % set(auto2) -> assign(sos_limit, -1).
% 0.49/0.80 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/0.80 % set(auto2) -> assign(max_megs, 400).
% 0.49/0.80 % set(auto2) -> assign(stats, some).
% 0.49/0.80 % set(auto2) -> clear(echo_input).
% 0.49/0.80 % set(auto2) -> set(quiet).
% 0.49/0.80 % set(auto2) -> clear(print_initial_clauses).
% 0.49/0.80 % set(auto2) -> clear(print_given).
% 0.49/0.80 assign(lrs_ticks,-1).
% 0.49/0.80 assign(sos_limit,10000).
% 0.49/0.80 assign(order,kbo).
% 0.49/0.80 set(lex_order_vars).
% 0.49/0.80 clear(print_given).
% 0.49/0.80
% 0.49/0.80 % formulas(sos). % not echoed (9 formulas)
% 0.49/0.80
% 0.49/0.80 ============================== end of input ==========================
% 0.49/0.80
% 0.49/0.80 % From the command line: assign(max_seconds, 300).
% 0.49/0.80
% 0.49/0.80 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/0.80
% 0.49/0.80 % Formulas that are not ordinary clauses:
% 0.49/0.80
% 0.49/0.80 ============================== end of process non-clausal formulas ===
% 0.49/0.80
% 0.49/0.80 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/0.80
% 0.49/0.80 ============================== PREDICATE ELIMINATION =================
% 0.49/0.80
% 0.49/0.80 ============================== end predicate elimination =============
% 0.49/0.80
% 0.49/0.80 Auto_denials:
% 0.49/0.80 % copying label prove_X_times_inverse_X_is_id to answer in negative clause
% 0.49/0.80
% 0.49/0.80 Term ordering decisions:
% 0.49/0.80
% 0.49/0.80 % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.49/0.80 Function symbol KB weights: identity=1. a=1. multiply=1. inverse=0.
% 0.49/0.80
% 0.49/0.80 ============================== end of process initial clauses ========
% 0.49/0.80
% 0.49/0.80 ============================== CLAUSES FOR SEARCH ====================
% 0.49/0.80
% 0.49/0.80 ============================== end of clauses for search =============
% 0.49/0.80
% 0.49/0.80 ============================== SEARCH ================================
% 0.49/0.80
% 0.49/0.80 % Starting search at 0.01 seconds.
% 0.49/0.80
% 0.49/0.80 ============================== PROOF =================================
% 0.49/0.80 % SZS status Unsatisfiable
% 0.49/0.80 % SZS output start Refutation
% 0.49/0.80
% 0.49/0.80 % Proof 1 at 0.01 (+ 0.00) seconds: prove_X_times_inverse_X_is_id.
% 0.49/0.80 % Length of proof is 6.
% 0.49/0.80 % Level of proof is 2.
% 0.49/0.80 % Maximum clause weight is 11.000.
% 0.49/0.80 % Given clauses 7.
% 0.49/0.80
% 0.49/0.80 4 product(A,inverse(A),identity) # label(right_inverse) # label(axiom). [assumption].
% 0.49/0.80 5 product(A,B,multiply(A,B)) # label(total_function1) # label(axiom). [assumption].
% 0.49/0.80 6 multiply(a,inverse(a)) != identity # label(prove_X_times_inverse_X_is_id) # label(negated_conjecture) # answer(prove_X_times_inverse_X_is_id). [assumption].
% 0.49/0.80 7 -product(A,B,C) | -product(A,B,D) | C = D # label(total_function2) # label(axiom). [assumption].
% 0.49/0.80 10 multiply(A,inverse(A)) = identity. [hyper(7,a,5,a,b,4,a)].
% 0.49/0.80 11 $F # answer(prove_X_times_inverse_X_is_id). [resolve(10,a,6,a)].
% 0.49/0.80
% 0.49/0.80 % SZS output end Refutation
% 0.49/0.80 ============================== end of proof ==========================
% 0.49/0.80
% 0.49/0.80 ============================== STATISTICS ============================
% 0.49/0.80
% 0.49/0.80 Given=7. Generated=11. Kept=10. proofs=1.
% 0.49/0.80 Usable=7. Sos=2. Demods=0. Limbo=0, Disabled=9. Hints=0.
% 0.49/0.80 Megabytes=0.03.
% 0.49/0.80 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.49/0.80
% 0.49/0.80 ============================== end of statistics =====================
% 0.49/0.80
% 0.49/0.80 ============================== end of search =========================
% 0.49/0.80
% 0.49/0.80 THEOREM PROVED
% 0.49/0.80 % SZS status Unsatisfiable
% 0.49/0.80
% 0.49/0.80 Exiting with 1 proof.
% 0.49/0.80
% 0.49/0.80 Process 21727 exit (max_proofs) Mon Jun 13 13:28:57 2022
% 0.49/0.80 Prover9 interrupted
%------------------------------------------------------------------------------