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