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