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