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