TSTP Solution File: GRP520-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP520-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:19:26 EDT 2022
% Result : Unsatisfiable 0.46s 1.02s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP520-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n008.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 13:17:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.02 ============================== Prover9 ===============================
% 0.46/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.02 Process 17472 was started by sandbox2 on n008.cluster.edu,
% 0.46/1.02 Tue Jun 14 13:17:38 2022
% 0.46/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17319_n008.cluster.edu".
% 0.46/1.02 ============================== end of head ===========================
% 0.46/1.02
% 0.46/1.02 ============================== INPUT =================================
% 0.46/1.02
% 0.46/1.02 % Reading from file /tmp/Prover9_17319_n008.cluster.edu
% 0.46/1.02
% 0.46/1.02 set(prolog_style_variables).
% 0.46/1.02 set(auto2).
% 0.46/1.02 % set(auto2) -> set(auto).
% 0.46/1.02 % set(auto) -> set(auto_inference).
% 0.46/1.02 % set(auto) -> set(auto_setup).
% 0.46/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.02 % set(auto) -> set(auto_limits).
% 0.46/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.02 % set(auto) -> set(auto_denials).
% 0.46/1.02 % set(auto) -> set(auto_process).
% 0.46/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.02 % set(auto2) -> assign(stats, some).
% 0.46/1.02 % set(auto2) -> clear(echo_input).
% 0.46/1.02 % set(auto2) -> set(quiet).
% 0.46/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.02 % set(auto2) -> clear(print_given).
% 0.46/1.02 assign(lrs_ticks,-1).
% 0.46/1.02 assign(sos_limit,10000).
% 0.46/1.02 assign(order,kbo).
% 0.46/1.02 set(lex_order_vars).
% 0.46/1.02 clear(print_given).
% 0.46/1.02
% 0.46/1.02 % formulas(sos). % not echoed (2 formulas)
% 0.46/1.02
% 0.46/1.02 ============================== end of input ==========================
% 0.46/1.02
% 0.46/1.02 % From the command line: assign(max_seconds, 300).
% 0.46/1.02
% 0.46/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.02
% 0.46/1.02 % Formulas that are not ordinary clauses:
% 0.46/1.02
% 0.46/1.02 ============================== end of process non-clausal formulas ===
% 0.46/1.02
% 0.46/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.02
% 0.46/1.02 ============================== PREDICATE ELIMINATION =================
% 0.46/1.02
% 0.46/1.02 ============================== end predicate elimination =============
% 0.46/1.02
% 0.46/1.02 Auto_denials:
% 0.46/1.02 % copying label prove_these_axioms_4 to answer in negative clause
% 0.46/1.02
% 0.46/1.02 Term ordering decisions:
% 0.46/1.02
% 0.46/1.02 % Assigning unary symbol inverse kb_weight 0 and highest precedence (5).
% 0.46/1.02 Function symbol KB weights: a=1. b=1. multiply=1. inverse=0.
% 0.46/1.02
% 0.46/1.02 ============================== end of process initial clauses ========
% 0.46/1.02
% 0.46/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.02
% 0.46/1.02 ============================== end of clauses for search =============
% 0.46/1.02
% 0.46/1.02 ============================== SEARCH ================================
% 0.46/1.02
% 0.46/1.02 % Starting search at 0.01 seconds.
% 0.46/1.02
% 0.46/1.02 ============================== PROOF =================================
% 0.46/1.02 % SZS status Unsatisfiable
% 0.46/1.02 % SZS output start Refutation
% 0.46/1.02
% 0.46/1.02 % Proof 1 at 0.02 (+ 0.00) seconds: prove_these_axioms_4.
% 0.46/1.02 % Length of proof is 15.
% 0.46/1.02 % Level of proof is 8.
% 0.46/1.02 % Maximum clause weight is 17.000.
% 0.46/1.02 % Given clauses 8.
% 0.46/1.02
% 0.46/1.02 1 multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C # label(single_axiom) # label(axiom). [assumption].
% 0.46/1.02 2 multiply(a,b) != multiply(b,a) # label(prove_these_axioms_4) # label(negated_conjecture) # answer(prove_these_axioms_4). [assumption].
% 0.46/1.02 3 multiply(b,a) != multiply(a,b) # answer(prove_these_axioms_4). [copy(2),flip(a)].
% 0.46/1.02 4 multiply(b,a) = c_0. [new_symbol(3)].
% 0.46/1.02 5 multiply(a,b) != c_0 # answer(prove_these_axioms_4). [back_rewrite(3),rewrite([4(3)]),flip(a)].
% 0.46/1.02 6 multiply(A,multiply(multiply(inverse(B),C),multiply(multiply(inverse(multiply(A,D)),B),D))) = C. [para(1(a,1),1(a,1,2,1,1,1))].
% 0.46/1.02 7 multiply(multiply(inverse(multiply(inverse(multiply(A,B)),C)),D),C) = multiply(A,multiply(D,B)). [para(1(a,1),1(a,1,2,1)),flip(a)].
% 0.46/1.02 12 multiply(multiply(inverse(A),B),A) = B. [para(1(a,1),6(a,1,2))].
% 0.46/1.02 17 multiply(multiply(inverse(multiply(inverse(A),B)),C),B) = multiply(C,A). [para(1(a,1),12(a,1,1)),flip(a)].
% 0.46/1.02 19 multiply(multiply(inverse(A),B),multiply(A,C)) = multiply(B,C). [para(6(a,1),12(a,1,1)),rewrite([17(8)]),flip(a)].
% 0.46/1.02 21 multiply(A,multiply(B,C)) = multiply(B,multiply(A,C)). [back_rewrite(7),rewrite([17(6)])].
% 0.46/1.02 22 multiply(A,multiply(multiply(inverse(A),B),C)) = multiply(B,C). [back_rewrite(19),rewrite([21(4)])].
% 0.46/1.02 34 multiply(A,B) = multiply(B,A). [para(12(a,1),22(a,1,2))].
% 0.46/1.02 58 multiply(a,b) = c_0. [back_rewrite(4),rewrite([34(3)])].
% 0.46/1.02 59 $F # answer(prove_these_axioms_4). [resolve(58,a,5,a)].
% 0.46/1.02
% 0.46/1.02 % SZS output end Refutation
% 0.46/1.02 ============================== end of proof ==========================
% 0.46/1.02
% 0.46/1.02 ============================== STATISTICS ============================
% 0.46/1.02
% 0.46/1.02 Given=8. Generated=112. Kept=57. proofs=1.
% 0.46/1.02 Usable=2. Sos=1. Demods=23. Limbo=24, Disabled=31. Hints=0.
% 0.46/1.02 Megabytes=0.07.
% 0.46/1.02 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.46/1.02
% 0.46/1.02 ============================== end of statistics =====================
% 0.46/1.02
% 0.46/1.02 ============================== end of search =========================
% 0.46/1.02
% 0.46/1.02 THEOREM PROVED
% 0.46/1.02 % SZS status Unsatisfiable
% 0.46/1.02
% 0.46/1.02 Exiting with 1 proof.
% 0.46/1.02
% 0.46/1.02 Process 17472 exit (max_proofs) Tue Jun 14 13:17:38 2022
% 0.46/1.02 Prover9 interrupted
%------------------------------------------------------------------------------