TSTP Solution File: GRP418-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP418-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:00 EDT 2022
% Result : Unsatisfiable 1.26s 1.60s
% Output : Refutation 1.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP418-1 : TPTP v8.1.0. Released v2.6.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n016.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 : Tue Jun 14 08:51:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.26/1.60 ============================== Prover9 ===============================
% 1.26/1.60 Prover9 (32) version 2009-11A, November 2009.
% 1.26/1.60 Process 24358 was started by sandbox on n016.cluster.edu,
% 1.26/1.60 Tue Jun 14 08:51:46 2022
% 1.26/1.60 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24204_n016.cluster.edu".
% 1.26/1.60 ============================== end of head ===========================
% 1.26/1.60
% 1.26/1.60 ============================== INPUT =================================
% 1.26/1.60
% 1.26/1.60 % Reading from file /tmp/Prover9_24204_n016.cluster.edu
% 1.26/1.60
% 1.26/1.60 set(prolog_style_variables).
% 1.26/1.60 set(auto2).
% 1.26/1.60 % set(auto2) -> set(auto).
% 1.26/1.60 % set(auto) -> set(auto_inference).
% 1.26/1.60 % set(auto) -> set(auto_setup).
% 1.26/1.60 % set(auto_setup) -> set(predicate_elim).
% 1.26/1.60 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.26/1.60 % set(auto) -> set(auto_limits).
% 1.26/1.60 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.26/1.60 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.26/1.60 % set(auto) -> set(auto_denials).
% 1.26/1.60 % set(auto) -> set(auto_process).
% 1.26/1.60 % set(auto2) -> assign(new_constants, 1).
% 1.26/1.60 % set(auto2) -> assign(fold_denial_max, 3).
% 1.26/1.60 % set(auto2) -> assign(max_weight, "200.000").
% 1.26/1.60 % set(auto2) -> assign(max_hours, 1).
% 1.26/1.60 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.26/1.60 % set(auto2) -> assign(max_seconds, 0).
% 1.26/1.60 % set(auto2) -> assign(max_minutes, 5).
% 1.26/1.60 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.26/1.60 % set(auto2) -> set(sort_initial_sos).
% 1.26/1.60 % set(auto2) -> assign(sos_limit, -1).
% 1.26/1.60 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.26/1.60 % set(auto2) -> assign(max_megs, 400).
% 1.26/1.60 % set(auto2) -> assign(stats, some).
% 1.26/1.60 % set(auto2) -> clear(echo_input).
% 1.26/1.60 % set(auto2) -> set(quiet).
% 1.26/1.60 % set(auto2) -> clear(print_initial_clauses).
% 1.26/1.60 % set(auto2) -> clear(print_given).
% 1.26/1.60 assign(lrs_ticks,-1).
% 1.26/1.60 assign(sos_limit,10000).
% 1.26/1.60 assign(order,kbo).
% 1.26/1.60 set(lex_order_vars).
% 1.26/1.60 clear(print_given).
% 1.26/1.60
% 1.26/1.60 % formulas(sos). % not echoed (2 formulas)
% 1.26/1.60
% 1.26/1.60 ============================== end of input ==========================
% 1.26/1.60
% 1.26/1.60 % From the command line: assign(max_seconds, 300).
% 1.26/1.60
% 1.26/1.60 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.26/1.60
% 1.26/1.60 % Formulas that are not ordinary clauses:
% 1.26/1.60
% 1.26/1.60 ============================== end of process non-clausal formulas ===
% 1.26/1.60
% 1.26/1.60 ============================== PROCESS INITIAL CLAUSES ===============
% 1.26/1.60
% 1.26/1.60 ============================== PREDICATE ELIMINATION =================
% 1.26/1.60
% 1.26/1.60 ============================== end predicate elimination =============
% 1.26/1.60
% 1.26/1.60 Auto_denials:
% 1.26/1.60 % copying label prove_these_axioms_1 to answer in negative clause
% 1.26/1.60
% 1.26/1.60 Term ordering decisions:
% 1.26/1.60
% 1.26/1.60 % Assigning unary symbol inverse kb_weight 0 and highest precedence (5).
% 1.26/1.60 Function symbol KB weights: a1=1. b1=1. multiply=1. inverse=0.
% 1.26/1.60
% 1.26/1.60 ============================== end of process initial clauses ========
% 1.26/1.60
% 1.26/1.60 ============================== CLAUSES FOR SEARCH ====================
% 1.26/1.60
% 1.26/1.60 ============================== end of clauses for search =============
% 1.26/1.60
% 1.26/1.60 ============================== SEARCH ================================
% 1.26/1.60
% 1.26/1.60 % Starting search at 0.01 seconds.
% 1.26/1.60
% 1.26/1.60 ============================== PROOF =================================
% 1.26/1.60 % SZS status Unsatisfiable
% 1.26/1.60 % SZS output start Refutation
% 1.26/1.60
% 1.26/1.60 % Proof 1 at 0.61 (+ 0.01) seconds: prove_these_axioms_1.
% 1.26/1.60 % Length of proof is 13.
% 1.26/1.60 % Level of proof is 10.
% 1.26/1.60 % Maximum clause weight is 52.000.
% 1.26/1.60 % Given clauses 34.
% 1.26/1.60
% 1.26/1.60 1 inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),multiply(A,C))) = B # label(single_axiom) # label(axiom). [assumption].
% 1.26/1.60 2 multiply(inverse(a1),a1) != multiply(inverse(b1),b1) # label(prove_these_axioms_1) # label(negated_conjecture) # answer(prove_these_axioms_1). [assumption].
% 1.26/1.60 3 multiply(inverse(b1),b1) != multiply(inverse(a1),a1) # answer(prove_these_axioms_1). [copy(2),flip(a)].
% 1.26/1.60 4 multiply(inverse(multiply(A,inverse(multiply(inverse(B),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),multiply(A,C)) = inverse(multiply(inverse(multiply(D,inverse(multiply(B,inverse(multiply(E,inverse(multiply(inverse(E),E)))))))),multiply(D,E))). [para(1(a,1),1(a,1,1,1,1,2,1,1)),flip(a)].
% 1.26/1.60 10 multiply(inverse(multiply(A,inverse(multiply(inverse(inverse(B)),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),multiply(A,C)) = B. [para(4(a,2),1(a,1))].
% 1.26/1.60 28 inverse(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(inverse(B)),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),inverse(multiply(inverse(D),inverse(multiply(multiply(A,C),inverse(multiply(inverse(multiply(A,C)),multiply(A,C))))))))),B)) = D. [para(10(a,1),1(a,1,1,2))].
% 1.26/1.60 88 multiply(inverse(multiply(A,inverse(multiply(inverse(inverse(inverse(multiply(B,inverse(multiply(inverse(B),B)))))),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),inverse(multiply(inverse(D),inverse(multiply(multiply(A,C),inverse(multiply(inverse(multiply(A,C)),multiply(A,C)))))))) = inverse(multiply(inverse(multiply(E,D)),multiply(E,B))). [para(28(a,1),1(a,1,1,1,1,2)),flip(a)].
% 1.26/1.60 272 inverse(multiply(inverse(multiply(A,B)),multiply(A,C))) = inverse(multiply(inverse(multiply(D,B)),multiply(D,C))). [para(88(a,1),88(a,1))].
% 1.26/1.60 345 multiply(inverse(multiply(A,B)),multiply(A,C)) = multiply(inverse(multiply(D,B)),multiply(D,C)). [para(272(a,1),1(a,1,1,1,1,2,1,1)),rewrite([1(17)])].
% 1.26/1.60 405 multiply(inverse(multiply(A,multiply(B,C))),multiply(A,D)) = multiply(E,multiply(inverse(multiply(B,inverse(multiply(inverse(E),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),D)). [para(1(a,1),345(a,1,1)),flip(a)].
% 1.26/1.60 1723 multiply(inverse(multiply(A,multiply(B,C))),multiply(A,multiply(B,C))) = multiply(inverse(D),D). [para(10(a,1),405(a,2,2))].
% 1.26/1.60 2189 multiply(inverse(multiply(A,multiply(B,C))),multiply(A,multiply(B,C))) != multiply(inverse(a1),a1) # answer(prove_these_axioms_1). [para(1723(a,2),3(a,1))].
% 1.26/1.60 2190 $F # answer(prove_these_axioms_1). [resolve(2189,a,1723,a)].
% 1.26/1.60
% 1.26/1.60 % SZS output end Refutation
% 1.26/1.60 ============================== end of proof ==========================
% 1.26/1.60
% 1.26/1.60 ============================== STATISTICS ============================
% 1.26/1.60
% 1.26/1.60 Given=34. Generated=4684. Kept=2188. proofs=1.
% 1.26/1.60 Usable=25. Sos=2015. Demods=579. Limbo=5, Disabled=144. Hints=0.
% 1.26/1.60 Megabytes=8.90.
% 1.26/1.60 User_CPU=0.61, System_CPU=0.01, Wall_clock=1.
% 1.26/1.60
% 1.26/1.60 ============================== end of statistics =====================
% 1.26/1.60
% 1.26/1.60 ============================== end of search =========================
% 1.26/1.60
% 1.26/1.60 THEOREM PROVED
% 1.26/1.60 % SZS status Unsatisfiable
% 1.26/1.60
% 1.26/1.60 Exiting with 1 proof.
% 1.26/1.60
% 1.26/1.60 Process 24358 exit (max_proofs) Tue Jun 14 08:51:47 2022
% 1.26/1.60 Prover9 interrupted
%------------------------------------------------------------------------------