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