TSTP Solution File: GRP175-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP175-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:17:55 EDT 2022
% Result : Unsatisfiable 0.43s 1.02s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP175-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n025.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 05:58:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.02 ============================== Prover9 ===============================
% 0.43/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.02 Process 24797 was started by sandbox2 on n025.cluster.edu,
% 0.43/1.02 Tue Jun 14 05:58:55 2022
% 0.43/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24643_n025.cluster.edu".
% 0.43/1.02 ============================== end of head ===========================
% 0.43/1.02
% 0.43/1.02 ============================== INPUT =================================
% 0.43/1.02
% 0.43/1.02 % Reading from file /tmp/Prover9_24643_n025.cluster.edu
% 0.43/1.02
% 0.43/1.02 set(prolog_style_variables).
% 0.43/1.02 set(auto2).
% 0.43/1.02 % set(auto2) -> set(auto).
% 0.43/1.02 % set(auto) -> set(auto_inference).
% 0.43/1.02 % set(auto) -> set(auto_setup).
% 0.43/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.02 % set(auto) -> set(auto_limits).
% 0.43/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.02 % set(auto) -> set(auto_denials).
% 0.43/1.02 % set(auto) -> set(auto_process).
% 0.43/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.02 % set(auto2) -> assign(stats, some).
% 0.43/1.02 % set(auto2) -> clear(echo_input).
% 0.43/1.02 % set(auto2) -> set(quiet).
% 0.43/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.02 % set(auto2) -> clear(print_given).
% 0.43/1.02 assign(lrs_ticks,-1).
% 0.43/1.02 assign(sos_limit,10000).
% 0.43/1.02 assign(order,kbo).
% 0.43/1.02 set(lex_order_vars).
% 0.43/1.02 clear(print_given).
% 0.43/1.02
% 0.43/1.02 % formulas(sos). % not echoed (17 formulas)
% 0.43/1.02
% 0.43/1.02 ============================== end of input ==========================
% 0.43/1.02
% 0.43/1.02 % From the command line: assign(max_seconds, 300).
% 0.43/1.02
% 0.43/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.02
% 0.43/1.02 % Formulas that are not ordinary clauses:
% 0.43/1.02
% 0.43/1.02 ============================== end of process non-clausal formulas ===
% 0.43/1.02
% 0.43/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.02
% 0.43/1.02 ============================== PREDICATE ELIMINATION =================
% 0.43/1.02
% 0.43/1.02 ============================== end predicate elimination =============
% 0.43/1.02
% 0.43/1.02 Auto_denials:
% 0.43/1.02 % copying label prove_p06c to answer in negative clause
% 0.43/1.02
% 0.43/1.02 Term ordering decisions:
% 0.43/1.02
% 0.43/1.02 % Assigning unary symbol inverse kb_weight 0 and highest precedence (8).
% 0.43/1.02 Function symbol KB weights: identity=1. b=1. a=1. multiply=1. least_upper_bound=1. greatest_lower_bound=1. inverse=0.
% 0.43/1.02
% 0.43/1.02 ============================== end of process initial clauses ========
% 0.43/1.02
% 0.43/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.02
% 0.43/1.02 ============================== end of clauses for search =============
% 0.43/1.02
% 0.43/1.02 ============================== SEARCH ================================
% 0.43/1.02
% 0.43/1.02 % Starting search at 0.01 seconds.
% 0.43/1.02
% 0.43/1.02 ============================== PROOF =================================
% 0.43/1.02 % SZS status Unsatisfiable
% 0.43/1.02 % SZS output start Refutation
% 0.43/1.02
% 0.43/1.02 % Proof 1 at 0.03 (+ 0.00) seconds: prove_p06c.
% 0.43/1.02 % Length of proof is 14.
% 0.43/1.02 % Level of proof is 3.
% 0.43/1.02 % Maximum clause weight is 13.000.
% 0.43/1.02 % Given clauses 43.
% 0.43/1.02
% 0.43/1.02 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 0.43/1.02 4 least_upper_bound(identity,b) = b # label(p06c_1) # label(hypothesis). [assumption].
% 0.43/1.02 5 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 0.43/1.02 6 greatest_lower_bound(A,B) = greatest_lower_bound(B,A) # label(symmetry_of_glb) # label(axiom). [assumption].
% 0.43/1.02 9 greatest_lower_bound(A,least_upper_bound(A,B)) = A # label(glb_absorbtion) # label(axiom). [assumption].
% 0.43/1.02 17 multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)) # label(monotony_glb1) # label(axiom). [assumption].
% 0.43/1.02 18 greatest_lower_bound(multiply(A,B),multiply(A,C)) = multiply(A,greatest_lower_bound(B,C)). [copy(17),flip(a)].
% 0.43/1.02 21 multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)) # label(monotony_glb2) # label(axiom). [assumption].
% 0.43/1.02 22 greatest_lower_bound(multiply(A,B),multiply(C,B)) = multiply(greatest_lower_bound(A,C),B). [copy(21),flip(a)].
% 0.43/1.02 23 greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity # label(prove_p06c) # label(negated_conjecture) # answer(prove_p06c). [assumption].
% 0.43/1.02 24 greatest_lower_bound(identity,b) = identity. [para(4(a,1),9(a,1,2))].
% 0.43/1.02 31 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.43/1.02 37 greatest_lower_bound(A,multiply(B,A)) = multiply(greatest_lower_bound(B,identity),A). [para(1(a,1),22(a,1,1)),rewrite([6(4)])].
% 0.43/1.02 143 $F # answer(prove_p06c). [para(31(a,1),23(a,1)),rewrite([37(7),6(5),24(5),1(5),5(4)]),xx(a)].
% 0.43/1.02
% 0.43/1.02 % SZS output end Refutation
% 0.43/1.02 ============================== end of proof ==========================
% 0.43/1.02
% 0.43/1.02 ============================== STATISTICS ============================
% 0.43/1.02
% 0.43/1.02 Given=43. Generated=758. Kept=136. proofs=1.
% 0.43/1.02 Usable=41. Sos=73. Demods=100. Limbo=14, Disabled=25. Hints=0.
% 0.43/1.02 Megabytes=0.17.
% 0.43/1.02 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.43/1.02
% 0.43/1.02 ============================== end of statistics =====================
% 0.43/1.02
% 0.43/1.02 ============================== end of search =========================
% 0.43/1.02
% 0.43/1.02 THEOREM PROVED
% 0.43/1.02 % SZS status Unsatisfiable
% 0.43/1.02
% 0.43/1.02 Exiting with 1 proof.
% 0.43/1.02
% 0.43/1.02 Process 24797 exit (max_proofs) Tue Jun 14 05:58:55 2022
% 0.43/1.02 Prover9 interrupted
%------------------------------------------------------------------------------