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