TSTP Solution File: BOO034-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : BOO034-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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 : Thu Jul 14 23:48:04 EDT 2022
% Result : Unsatisfiable 0.67s 0.99s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : BOO034-1 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 1 18:49:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/0.99 ============================== Prover9 ===============================
% 0.67/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.99 Process 14762 was started by sandbox on n022.cluster.edu,
% 0.67/0.99 Wed Jun 1 18:49:07 2022
% 0.67/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14609_n022.cluster.edu".
% 0.67/0.99 ============================== end of head ===========================
% 0.67/0.99
% 0.67/0.99 ============================== INPUT =================================
% 0.67/0.99
% 0.67/0.99 % Reading from file /tmp/Prover9_14609_n022.cluster.edu
% 0.67/0.99
% 0.67/0.99 set(prolog_style_variables).
% 0.67/0.99 set(auto2).
% 0.67/0.99 % set(auto2) -> set(auto).
% 0.67/0.99 % set(auto) -> set(auto_inference).
% 0.67/0.99 % set(auto) -> set(auto_setup).
% 0.67/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.99 % set(auto) -> set(auto_limits).
% 0.67/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.99 % set(auto) -> set(auto_denials).
% 0.67/0.99 % set(auto) -> set(auto_process).
% 0.67/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.99 % set(auto2) -> assign(stats, some).
% 0.67/0.99 % set(auto2) -> clear(echo_input).
% 0.67/0.99 % set(auto2) -> set(quiet).
% 0.67/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.99 % set(auto2) -> clear(print_given).
% 0.67/0.99 assign(lrs_ticks,-1).
% 0.67/0.99 assign(sos_limit,10000).
% 0.67/0.99 assign(order,kbo).
% 0.67/0.99 set(lex_order_vars).
% 0.67/0.99 clear(print_given).
% 0.67/0.99
% 0.67/0.99 % formulas(sos). % not echoed (6 formulas)
% 0.67/0.99
% 0.67/0.99 ============================== end of input ==========================
% 0.67/0.99
% 0.67/0.99 % From the command line: assign(max_seconds, 300).
% 0.67/0.99
% 0.67/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.99
% 0.67/0.99 % Formulas that are not ordinary clauses:
% 0.67/0.99
% 0.67/0.99 ============================== end of process non-clausal formulas ===
% 0.67/0.99
% 0.67/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.99
% 0.67/0.99 ============================== PREDICATE ELIMINATION =================
% 0.67/0.99
% 0.67/0.99 ============================== end predicate elimination =============
% 0.67/0.99
% 0.67/0.99 Auto_denials:
% 0.67/0.99 % copying label prove_single_axiom to answer in negative clause
% 0.67/0.99
% 0.67/0.99 Term ordering decisions:
% 0.67/0.99
% 0.67/0.99 % Assigning unary symbol inverse kb_weight 0 and highest precedence (10).
% 0.67/0.99 Function symbol KB weights: a=1. b=1. c=1. d=1. e=1. f=1. g=1. multiply=1. inverse=0.
% 0.67/0.99
% 0.67/0.99 ============================== end of process initial clauses ========
% 0.67/0.99
% 0.67/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.67/0.99
% 0.67/0.99 ============================== end of clauses for search =============
% 0.67/0.99
% 0.67/0.99 ============================== SEARCH ================================
% 0.67/0.99
% 0.67/0.99 % Starting search at 0.01 seconds.
% 0.67/0.99
% 0.67/0.99 ============================== PROOF =================================
% 0.67/0.99 % SZS status Unsatisfiable
% 0.67/0.99 % SZS output start Refutation
% 0.67/0.99
% 0.67/0.99 % Proof 1 at 0.03 (+ 0.00) seconds: prove_single_axiom.
% 0.67/0.99 % Length of proof is 25.
% 0.67/0.99 % Level of proof is 9.
% 0.67/0.99 % Maximum clause weight is 23.000.
% 0.67/0.99 % Given clauses 21.
% 0.67/0.99
% 0.67/0.99 1 multiply(A,B,B) = B # label(ternary_multiply_1) # label(axiom). [assumption].
% 0.67/0.99 2 multiply(A,A,B) = A # label(ternary_multiply_2) # label(axiom). [assumption].
% 0.67/0.99 4 multiply(A,B,inverse(B)) = A # label(right_inverse) # label(axiom). [assumption].
% 0.67/0.99 5 multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)) # label(associativity) # label(axiom). [assumption].
% 0.67/0.99 6 multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)) != b # label(prove_single_axiom) # label(negated_conjecture) # answer(prove_single_axiom). [assumption].
% 0.67/0.99 7 multiply(multiply(a,inverse(a),b),inverse(multiply(c,d,multiply(e,f,g))),multiply(d,multiply(g,f,e),c)) != b # answer(prove_single_axiom). [copy(6),rewrite([5(15)])].
% 0.67/0.99 8 multiply(A,B,multiply(C,multiply(A,B,D),D)) = multiply(A,B,D). [para(5(a,1),1(a,1))].
% 0.67/0.99 9 multiply(A,B,multiply(C,A,D)) = multiply(C,A,multiply(A,B,D)). [para(1(a,1),5(a,1,1))].
% 0.67/0.99 10 multiply(multiply(A,B,C),D,B) = multiply(A,B,multiply(C,D,B)). [para(1(a,1),5(a,1,3))].
% 0.67/0.99 11 multiply(A,B,multiply(C,multiply(A,B,C),D)) = multiply(A,B,C). [para(5(a,1),2(a,1))].
% 0.67/0.99 12 multiply(A,B,A) = A. [para(2(a,1),5(a,1,1)),rewrite([2(1),2(3)])].
% 0.67/0.99 18 multiply(A,B,multiply(C,A,inverse(B))) = A. [para(4(a,1),8(a,1,3,2)),rewrite([4(5)])].
% 0.67/0.99 24 multiply(multiply(A,B,C),D,A) = multiply(A,B,multiply(C,D,A)). [para(12(a,1),5(a,1,3))].
% 0.67/0.99 27 multiply(A,B,multiply(C,D,multiply(E,A,inverse(B)))) = multiply(A,B,multiply(C,D,A)). [para(18(a,1),5(a,1,3)),rewrite([24(2)]),flip(a)].
% 0.67/0.99 30 multiply(A,B,multiply(C,A,B)) = multiply(C,A,B). [para(1(a,1),9(a,2,3))].
% 0.67/0.99 46 multiply(A,B,multiply(inverse(B),C,B)) = multiply(A,C,B). [para(4(a,1),10(a,1,1)),flip(a)].
% 0.67/0.99 52 multiply(A,B,multiply(C,inverse(B),A)) = A. [para(10(a,1),18(a,1,3)),rewrite([27(5)])].
% 0.67/0.99 62 multiply(A,inverse(A),B) = B. [para(52(a,1),9(a,2)),rewrite([12(2)])].
% 0.67/0.99 64 multiply(b,inverse(multiply(c,d,multiply(e,f,g))),multiply(d,multiply(g,f,e),c)) != b # answer(prove_single_axiom). [back_rewrite(7),rewrite([62(5)])].
% 0.67/0.99 65 inverse(inverse(A)) = A. [para(62(a,1),4(a,1))].
% 0.67/0.99 75 multiply(A,B,multiply(inverse(B),A,C)) = A. [para(4(a,1),11(a,1,3,2)),rewrite([4(5)])].
% 0.67/0.99 100 multiply(A,B,C) = multiply(C,A,B). [para(75(a,1),52(a,1,3)),rewrite([65(2),10(2),30(2),65(3)]),flip(a)].
% 0.67/0.99 123 multiply(b,inverse(multiply(c,d,multiply(e,f,g))),multiply(c,d,multiply(e,g,f))) != b # answer(prove_single_axiom). [back_rewrite(64),rewrite([100(14),100(16)])].
% 0.67/0.99 133 multiply(A,B,C) = multiply(A,C,B). [back_rewrite(46),rewrite([100(2),62(2)])].
% 0.67/0.99 161 $F # answer(prove_single_axiom). [back_rewrite(123),rewrite([133(15),133(17),4(17)]),xx(a)].
% 0.67/0.99
% 0.67/0.99 % SZS output end Refutation
% 0.67/0.99 ============================== end of proof ==========================
% 0.67/0.99
% 0.67/0.99 ============================== STATISTICS ============================
% 0.67/0.99
% 0.67/0.99 Given=21. Generated=609. Kept=159. proofs=1.
% 0.67/0.99 Usable=9. Sos=38. Demods=62. Limbo=28, Disabled=90. Hints=0.
% 0.67/0.99 Megabytes=0.15.
% 0.67/0.99 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.67/0.99
% 0.67/0.99 ============================== end of statistics =====================
% 0.67/0.99
% 0.67/0.99 ============================== end of search =========================
% 0.67/0.99
% 0.67/0.99 THEOREM PROVED
% 0.67/0.99 % SZS status Unsatisfiable
% 0.67/0.99
% 0.67/0.99 Exiting with 1 proof.
% 0.67/0.99
% 0.67/0.99 Process 14762 exit (max_proofs) Wed Jun 1 18:49:07 2022
% 0.67/0.99 Prover9 interrupted
%------------------------------------------------------------------------------