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