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