TSTP Solution File: GRP406-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP406-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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:18:57 EDT 2022
% Result : Unsatisfiable 1.36s 1.67s
% Output : Refutation 1.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP406-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 01:40:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.36/1.67 ============================== Prover9 ===============================
% 1.36/1.67 Prover9 (32) version 2009-11A, November 2009.
% 1.36/1.67 Process 9489 was started by sandbox on n010.cluster.edu,
% 1.36/1.67 Tue Jun 14 01:40:40 2022
% 1.36/1.67 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9335_n010.cluster.edu".
% 1.36/1.67 ============================== end of head ===========================
% 1.36/1.67
% 1.36/1.67 ============================== INPUT =================================
% 1.36/1.67
% 1.36/1.67 % Reading from file /tmp/Prover9_9335_n010.cluster.edu
% 1.36/1.67
% 1.36/1.67 set(prolog_style_variables).
% 1.36/1.67 set(auto2).
% 1.36/1.67 % set(auto2) -> set(auto).
% 1.36/1.67 % set(auto) -> set(auto_inference).
% 1.36/1.67 % set(auto) -> set(auto_setup).
% 1.36/1.67 % set(auto_setup) -> set(predicate_elim).
% 1.36/1.67 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.36/1.67 % set(auto) -> set(auto_limits).
% 1.36/1.67 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.36/1.67 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.36/1.67 % set(auto) -> set(auto_denials).
% 1.36/1.67 % set(auto) -> set(auto_process).
% 1.36/1.67 % set(auto2) -> assign(new_constants, 1).
% 1.36/1.67 % set(auto2) -> assign(fold_denial_max, 3).
% 1.36/1.67 % set(auto2) -> assign(max_weight, "200.000").
% 1.36/1.67 % set(auto2) -> assign(max_hours, 1).
% 1.36/1.67 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.36/1.67 % set(auto2) -> assign(max_seconds, 0).
% 1.36/1.67 % set(auto2) -> assign(max_minutes, 5).
% 1.36/1.67 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.36/1.67 % set(auto2) -> set(sort_initial_sos).
% 1.36/1.67 % set(auto2) -> assign(sos_limit, -1).
% 1.36/1.67 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.36/1.67 % set(auto2) -> assign(max_megs, 400).
% 1.36/1.67 % set(auto2) -> assign(stats, some).
% 1.36/1.67 % set(auto2) -> clear(echo_input).
% 1.36/1.67 % set(auto2) -> set(quiet).
% 1.36/1.67 % set(auto2) -> clear(print_initial_clauses).
% 1.36/1.67 % set(auto2) -> clear(print_given).
% 1.36/1.67 assign(lrs_ticks,-1).
% 1.36/1.67 assign(sos_limit,10000).
% 1.36/1.67 assign(order,kbo).
% 1.36/1.67 set(lex_order_vars).
% 1.36/1.67 clear(print_given).
% 1.36/1.67
% 1.36/1.67 % formulas(sos). % not echoed (2 formulas)
% 1.36/1.67
% 1.36/1.67 ============================== end of input ==========================
% 1.36/1.67
% 1.36/1.67 % From the command line: assign(max_seconds, 300).
% 1.36/1.67
% 1.36/1.67 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.36/1.67
% 1.36/1.67 % Formulas that are not ordinary clauses:
% 1.36/1.67
% 1.36/1.67 ============================== end of process non-clausal formulas ===
% 1.36/1.67
% 1.36/1.67 ============================== PROCESS INITIAL CLAUSES ===============
% 1.36/1.67
% 1.36/1.67 ============================== PREDICATE ELIMINATION =================
% 1.36/1.67
% 1.36/1.67 ============================== end predicate elimination =============
% 1.36/1.67
% 1.36/1.67 Auto_denials:
% 1.36/1.67 % copying label prove_these_axioms_1 to answer in negative clause
% 1.36/1.67
% 1.36/1.67 Term ordering decisions:
% 1.36/1.67
% 1.36/1.67 % Assigning unary symbol inverse kb_weight 0 and highest precedence (5).
% 1.36/1.67 Function symbol KB weights: a1=1. b1=1. multiply=1. inverse=0.
% 1.36/1.67
% 1.36/1.67 ============================== end of process initial clauses ========
% 1.36/1.67
% 1.36/1.67 ============================== CLAUSES FOR SEARCH ====================
% 1.36/1.67
% 1.36/1.67 ============================== end of clauses for search =============
% 1.36/1.67
% 1.36/1.67 ============================== SEARCH ================================
% 1.36/1.67
% 1.36/1.67 % Starting search at 0.01 seconds.
% 1.36/1.67
% 1.36/1.67 ============================== PROOF =================================
% 1.36/1.67 % SZS status Unsatisfiable
% 1.36/1.67 % SZS output start Refutation
% 1.36/1.67
% 1.36/1.67 % Proof 1 at 0.72 (+ 0.01) seconds: prove_these_axioms_1.
% 1.36/1.67 % Length of proof is 16.
% 1.36/1.67 % Level of proof is 9.
% 1.36/1.67 % Maximum clause weight is 63.000.
% 1.36/1.67 % Given clauses 27.
% 1.36/1.67
% 1.36/1.67 1 multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),multiply(inverse(B),multiply(inverse(B),B))))) = C # label(single_axiom) # label(axiom). [assumption].
% 1.36/1.67 2 multiply(inverse(a1),a1) != multiply(inverse(b1),b1) # label(prove_these_axioms_1) # label(negated_conjecture) # answer(prove_these_axioms_1). [assumption].
% 1.36/1.67 3 multiply(inverse(b1),b1) != multiply(inverse(a1),a1) # answer(prove_these_axioms_1). [copy(2),flip(a)].
% 1.36/1.67 4 multiply(A,inverse(multiply(inverse(multiply(inverse(B),C)),multiply(inverse(inverse(multiply(inverse(multiply(inverse(multiply(A,D)),B)),multiply(inverse(D),multiply(inverse(D),D))))),multiply(inverse(inverse(multiply(inverse(multiply(inverse(multiply(A,D)),B)),multiply(inverse(D),multiply(inverse(D),D))))),inverse(multiply(inverse(multiply(inverse(multiply(A,D)),B)),multiply(inverse(D),multiply(inverse(D),D))))))))) = C. [para(1(a,1),1(a,1,2,1,1,1,1,1))].
% 1.36/1.67 5 inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),D)),multiply(inverse(C),multiply(inverse(C),C)))) = multiply(A,inverse(multiply(inverse(D),multiply(inverse(B),multiply(inverse(B),B))))). [para(1(a,1),1(a,1,2,1,1,1)),flip(a)].
% 1.36/1.67 18 multiply(inverse(multiply(A,B)),multiply(A,inverse(multiply(inverse(C),multiply(inverse(B),multiply(inverse(B),B)))))) = C. [para(5(a,1),1(a,1,2))].
% 1.36/1.67 44 inverse(multiply(inverse(multiply(inverse(multiply(inverse(A),B)),multiply(inverse(A),C))),multiply(inverse(B),multiply(inverse(B),B)))) = C. [para(5(a,2),4(a,1)),rewrite([1(11)])].
% 1.36/1.67 101 multiply(inverse(multiply(inverse(A),B)),multiply(inverse(A),C)) = multiply(inverse(multiply(D,B)),multiply(D,C)). [para(44(a,1),18(a,1,2,2)),flip(a)].
% 1.36/1.67 102 inverse(multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,C))),multiply(inverse(B),multiply(inverse(B),B)))) = C. [para(44(a,1),44(a,1,1,1,1,1,1,1)),rewrite([44(15)])].
% 1.36/1.67 147 multiply(inverse(multiply(A,B)),multiply(A,inverse(multiply(inverse(multiply(C,D)),multiply(C,multiply(inverse(B),B)))))) = multiply(inverse(B),D). [para(101(a,1),18(a,1,2,2,1))].
% 1.36/1.67 153 multiply(inverse(multiply(A,B)),multiply(A,C)) = multiply(inverse(multiply(D,B)),multiply(D,C)). [para(101(a,1),101(a,1))].
% 1.36/1.67 236 multiply(inverse(multiply(A,multiply(inverse(B),multiply(inverse(B),B)))),multiply(A,C)) = multiply(D,multiply(inverse(multiply(inverse(multiply(E,B)),multiply(E,D))),C)). [para(102(a,1),153(a,1,1)),flip(a)].
% 1.36/1.67 1520 multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,inverse(C)))),multiply(inverse(B),multiply(inverse(B),B))) = C. [para(236(a,2),18(a,1,2,2,1)),rewrite([147(30)])].
% 1.36/1.67 1800 multiply(inverse(multiply(A,multiply(inverse(B),multiply(inverse(B),B)))),multiply(A,multiply(inverse(B),multiply(inverse(B),B)))) = multiply(inverse(C),C). [para(1520(a,1),236(a,2,2))].
% 1.36/1.67 1808 multiply(inverse(multiply(A,multiply(inverse(B),multiply(inverse(B),B)))),multiply(A,multiply(inverse(B),multiply(inverse(B),B)))) != multiply(inverse(a1),a1) # answer(prove_these_axioms_1). [para(1800(a,2),3(a,1))].
% 1.36/1.67 1809 $F # answer(prove_these_axioms_1). [resolve(1808,a,1800,a)].
% 1.36/1.67
% 1.36/1.67 % SZS output end Refutation
% 1.36/1.67 ============================== end of proof ==========================
% 1.36/1.67
% 1.36/1.67 ============================== STATISTICS ============================
% 1.36/1.67
% 1.36/1.67 Given=27. Generated=5402. Kept=1807. proofs=1.
% 1.36/1.67 Usable=23. Sos=1448. Demods=665. Limbo=4, Disabled=333. Hints=0.
% 1.36/1.67 Megabytes=7.26.
% 1.36/1.67 User_CPU=0.72, System_CPU=0.01, Wall_clock=1.
% 1.36/1.67
% 1.36/1.67 ============================== end of statistics =====================
% 1.36/1.67
% 1.36/1.67 ============================== end of search =========================
% 1.36/1.67
% 1.36/1.67 THEOREM PROVED
% 1.36/1.67 % SZS status Unsatisfiable
% 1.36/1.67
% 1.36/1.67 Exiting with 1 proof.
% 1.36/1.67
% 1.36/1.67 Process 9489 exit (max_proofs) Tue Jun 14 01:40:41 2022
% 1.36/1.67 Prover9 interrupted
%------------------------------------------------------------------------------