TSTP Solution File: BOO010-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : BOO010-4 : TPTP v8.1.0. Released v1.1.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:47:59 EDT 2022
% Result : Unsatisfiable 0.71s 1.05s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : BOO010-4 : TPTP v8.1.0. Released v1.1.0.
% 0.03/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 : Thu Jun 2 00:21:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.05 ============================== Prover9 ===============================
% 0.71/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.05 Process 26914 was started by sandbox on n022.cluster.edu,
% 0.71/1.05 Thu Jun 2 00:21:37 2022
% 0.71/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26761_n022.cluster.edu".
% 0.71/1.05 ============================== end of head ===========================
% 0.71/1.05
% 0.71/1.05 ============================== INPUT =================================
% 0.71/1.05
% 0.71/1.05 % Reading from file /tmp/Prover9_26761_n022.cluster.edu
% 0.71/1.05
% 0.71/1.05 set(prolog_style_variables).
% 0.71/1.05 set(auto2).
% 0.71/1.05 % set(auto2) -> set(auto).
% 0.71/1.05 % set(auto) -> set(auto_inference).
% 0.71/1.05 % set(auto) -> set(auto_setup).
% 0.71/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.05 % set(auto) -> set(auto_limits).
% 0.71/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.05 % set(auto) -> set(auto_denials).
% 0.71/1.05 % set(auto) -> set(auto_process).
% 0.71/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.05 % set(auto2) -> assign(stats, some).
% 0.71/1.05 % set(auto2) -> clear(echo_input).
% 0.71/1.05 % set(auto2) -> set(quiet).
% 0.71/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.05 % set(auto2) -> clear(print_given).
% 0.71/1.05 assign(lrs_ticks,-1).
% 0.71/1.05 assign(sos_limit,10000).
% 0.71/1.05 assign(order,kbo).
% 0.71/1.05 set(lex_order_vars).
% 0.71/1.05 clear(print_given).
% 0.71/1.05
% 0.71/1.05 % formulas(sos). % not echoed (9 formulas)
% 0.71/1.05
% 0.71/1.05 ============================== end of input ==========================
% 0.71/1.05
% 0.71/1.05 % From the command line: assign(max_seconds, 300).
% 0.71/1.05
% 0.71/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.05
% 0.71/1.05 % Formulas that are not ordinary clauses:
% 0.71/1.05
% 0.71/1.05 ============================== end of process non-clausal formulas ===
% 0.71/1.05
% 0.71/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.05
% 0.71/1.05 ============================== PREDICATE ELIMINATION =================
% 0.71/1.05
% 0.71/1.05 ============================== end predicate elimination =============
% 0.71/1.05
% 0.71/1.05 Auto_denials:
% 0.71/1.05 % copying label prove_a_plus_ab_is_a to answer in negative clause
% 0.71/1.05
% 0.71/1.05 Term ordering decisions:
% 0.71/1.05
% 0.71/1.05 % Assigning unary symbol inverse kb_weight 0 and highest precedence (8).
% 0.71/1.05 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. b=1. add=1. multiply=1. inverse=0.
% 0.71/1.05
% 0.71/1.05 ============================== end of process initial clauses ========
% 0.71/1.05
% 0.71/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.05
% 0.71/1.05 ============================== end of clauses for search =============
% 0.71/1.05
% 0.71/1.05 ============================== SEARCH ================================
% 0.71/1.05
% 0.71/1.05 % Starting search at 0.01 seconds.
% 0.71/1.05
% 0.71/1.05 ============================== PROOF =================================
% 0.71/1.05 % SZS status Unsatisfiable
% 0.71/1.05 % SZS output start Refutation
% 0.71/1.05
% 0.71/1.05 % Proof 1 at 0.09 (+ 0.01) seconds: prove_a_plus_ab_is_a.
% 0.71/1.05 % Length of proof is 67.
% 0.71/1.05 % Level of proof is 16.
% 0.71/1.05 % Maximum clause weight is 27.000.
% 0.71/1.05 % Given clauses 54.
% 0.71/1.05
% 0.71/1.05 1 add(A,additive_identity) = A # label(additive_id1) # label(axiom). [assumption].
% 0.71/1.05 2 multiply(A,multiplicative_identity) = A # label(multiplicative_id1) # label(axiom). [assumption].
% 0.71/1.05 3 add(A,inverse(A)) = multiplicative_identity # label(additive_inverse1) # label(axiom). [assumption].
% 0.71/1.05 4 multiply(A,inverse(A)) = additive_identity # label(multiplicative_inverse1) # label(axiom). [assumption].
% 0.71/1.05 5 add(A,B) = add(B,A) # label(commutativity_of_add) # label(axiom). [assumption].
% 0.71/1.05 6 multiply(A,B) = multiply(B,A) # label(commutativity_of_multiply) # label(axiom). [assumption].
% 0.71/1.05 7 add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)) # label(distributivity1) # label(axiom). [assumption].
% 0.71/1.05 8 multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)). [copy(7),flip(a)].
% 0.71/1.05 9 multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)) # label(distributivity2) # label(axiom). [assumption].
% 0.71/1.05 10 add(multiply(A,B),multiply(A,C)) = multiply(A,add(B,C)). [copy(9),flip(a)].
% 0.71/1.05 11 add(a,multiply(a,b)) != a # label(prove_a_plus_ab_is_a) # label(negated_conjecture) # answer(prove_a_plus_ab_is_a). [assumption].
% 0.71/1.05 12 multiply(A,add(A,B)) = add(A,multiply(B,additive_identity)). [para(1(a,1),8(a,1,1)),rewrite([6(4)])].
% 0.71/1.05 13 multiply(multiplicative_identity,add(A,B)) = add(A,multiply(B,inverse(A))). [para(3(a,1),8(a,1,1)),rewrite([6(5)])].
% 0.71/1.05 14 multiply(add(A,B),add(B,C)) = add(B,multiply(A,C)). [para(5(a,1),8(a,1,1))].
% 0.71/1.05 15 multiply(A,add(B,multiplicative_identity)) = add(A,multiply(A,B)). [para(2(a,1),10(a,1,1)),rewrite([5(4)]),flip(a)].
% 0.71/1.05 16 multiply(A,add(B,inverse(A))) = add(additive_identity,multiply(A,B)). [para(4(a,1),10(a,1,1)),rewrite([5(5)]),flip(a)].
% 0.71/1.05 17 add(multiply(A,B),multiply(B,C)) = multiply(B,add(A,C)). [para(6(a,1),10(a,1,1))].
% 0.71/1.05 18 multiply(multiply(A,add(B,C)),add(D,multiply(A,B))) = add(multiply(A,B),multiply(D,multiply(A,C))). [para(10(a,1),8(a,1,1)),rewrite([5(4),6(8)])].
% 0.71/1.05 21 add(add(A,multiply(B,C)),multiply(D,add(A,B))) = multiply(add(A,B),add(D,add(A,C))). [para(8(a,1),10(a,1,1)),rewrite([6(4),5(8)])].
% 0.71/1.05 22 add(multiply(A,add(B,C)),add(B,multiply(C,D))) = multiply(add(B,C),add(A,add(B,D))). [para(8(a,1),10(a,1,2)),rewrite([6(2)])].
% 0.71/1.05 24 multiply(A,A) = add(A,multiply(additive_identity,additive_identity)). [para(1(a,1),12(a,1,2))].
% 0.71/1.05 25 add(A,multiply(inverse(A),additive_identity)) = A. [para(3(a,1),12(a,1,2)),rewrite([2(2)]),flip(a)].
% 0.71/1.05 36 add(A,multiply(B,multiply(inverse(A),additive_identity))) = multiply(A,add(A,B)). [para(25(a,1),8(a,1,1)),rewrite([6(6)]),flip(a)].
% 0.71/1.05 39 add(multiplicative_identity,multiply(additive_identity,additive_identity)) = multiplicative_identity. [para(24(a,1),2(a,1))].
% 0.71/1.05 40 add(add(A,B),multiply(additive_identity,additive_identity)) = add(A,multiply(B,B)). [para(24(a,1),8(a,1))].
% 0.71/1.05 46 multiply(A,A) = add(A,add(additive_identity,multiply(additive_identity,additive_identity))). [para(24(a,1),12(a,2,2)),rewrite([1(2)])].
% 0.71/1.05 49 add(additive_identity,multiplicative_identity) = multiplicative_identity. [para(39(a,1),8(a,2)),rewrite([5(3),5(6),8(7),2(4)])].
% 0.71/1.05 53 multiply(multiplicative_identity,add(A,A)) = A. [para(4(a,1),13(a,2,2)),rewrite([1(5)])].
% 0.71/1.05 54 multiply(multiplicative_identity,add(A,B)) = add(B,multiply(A,inverse(B))). [para(13(a,2),5(a,2)),rewrite([5(3),5(5)]),flip(a)].
% 0.71/1.05 59 add(A,multiply(B,inverse(A))) = add(A,B). [para(13(a,1),10(a,2)),rewrite([6(2),2(2),6(2),2(2)]),flip(a)].
% 0.71/1.05 63 add(multiplicative_identity,multiply(A,additive_identity)) = add(A,multiplicative_identity). [para(13(a,1),12(a,1)),rewrite([59(5),5(2)]),flip(a)].
% 0.71/1.05 70 multiply(multiplicative_identity,add(A,B)) = add(A,B). [back_rewrite(54),rewrite([59(6),5(4)])].
% 0.71/1.05 74 add(A,A) = A. [back_rewrite(53),rewrite([70(3)])].
% 0.71/1.05 75 add(A,multiply(A,additive_identity)) = A. [para(49(a,1),10(a,2,2)),rewrite([2(4),5(3),2(5)])].
% 0.71/1.05 76 multiply(A,A) = A. [back_rewrite(46),rewrite([75(6),1(3)])].
% 0.71/1.05 77 add(additive_identity,add(A,B)) = add(A,B). [back_rewrite(40),rewrite([76(4),5(3),76(4)])].
% 0.71/1.05 78 multiply(A,add(A,B)) = add(A,multiply(A,B)). [para(74(a,1),8(a,1,1))].
% 0.71/1.05 80 add(A,multiply(B,multiply(inverse(A),additive_identity))) = add(A,multiply(A,B)). [back_rewrite(36),rewrite([78(7)])].
% 0.71/1.05 86 add(A,multiply(B,additive_identity)) = add(A,multiply(A,B)). [back_rewrite(12),rewrite([78(2)]),flip(a)].
% 0.71/1.05 88 add(additive_identity,multiply(A,B)) = multiply(A,B). [para(1(a,1),14(a,1,1)),rewrite([5(2),1(2)]),flip(a)].
% 0.71/1.05 89 add(inverse(A),multiply(A,B)) = add(B,inverse(A)). [para(3(a,1),14(a,1,1)),rewrite([5(3),70(4)]),flip(a)].
% 0.71/1.05 94 multiply(A,add(B,A)) = add(A,multiply(B,A)). [para(25(a,1),14(a,1,2)),rewrite([6(2),80(7),6(3)])].
% 0.71/1.05 96 multiply(A,add(B,inverse(A))) = multiply(A,B). [back_rewrite(16),rewrite([88(6)])].
% 0.71/1.05 97 multiply(add(A,multiplicative_identity),add(B,multiplicative_identity)) = add(multiplicative_identity,multiply(B,multiply(A,additive_identity))). [para(63(a,1),8(a,1,1)),rewrite([5(4),6(9)])].
% 0.71/1.05 101 add(add(A,B),multiply(C,add(A,B))) = add(add(A,B),multiply(C,additive_identity)). [para(77(a,1),14(a,1,1)),rewrite([5(3),94(4),6(7)])].
% 0.71/1.05 103 multiply(A,add(B,multiplicative_identity)) = add(A,multiply(B,A)). [para(15(a,1),6(a,2)),rewrite([6(3),6(4)])].
% 0.71/1.05 110 add(multiply(A,B),add(A,multiply(A,C))) = multiply(A,add(B,add(C,multiplicative_identity))). [para(15(a,1),10(a,1,2))].
% 0.71/1.05 118 multiply(add(A,B),add(C,multiplicative_identity)) = add(add(A,B),multiply(C,additive_identity)). [back_rewrite(101),rewrite([103(4,R)])].
% 0.71/1.05 119 add(add(A,multiplicative_identity),multiply(B,additive_identity)) = add(multiplicative_identity,multiply(B,multiply(A,additive_identity))). [back_rewrite(97),rewrite([118(5)])].
% 0.71/1.05 128 add(add(A,multiply(B,C)),multiply(D,add(A,C))) = multiply(add(A,C),add(D,add(A,B))). [para(8(a,1),17(a,1,1)),rewrite([6(4),5(8)])].
% 0.71/1.05 168 multiply(multiply(A,add(B,add(C,multiplicative_identity))),add(D,add(A,multiply(A,C)))) = add(multiply(A,add(C,multiplicative_identity)),multiply(D,multiply(A,B))). [para(15(a,1),18(a,1,2,2)),rewrite([5(3)])].
% 0.71/1.05 289 multiply(A,add(B,multiplicative_identity)) = add(A,multiply(B,additive_identity)). [para(86(a,2),15(a,2))].
% 0.71/1.05 301 multiply(add(A,multiply(B,additive_identity)),add(C,add(A,D))) = multiply(add(A,multiply(A,B)),add(C,add(A,D))). [para(86(a,1),21(a,2,1)),rewrite([6(3),128(9)])].
% 0.71/1.05 315 multiply(multiply(A,add(B,add(C,multiplicative_identity))),add(D,add(A,multiply(A,C)))) = add(add(A,multiply(C,additive_identity)),multiply(D,multiply(A,B))). [back_rewrite(168),rewrite([289(11)])].
% 0.71/1.05 330 add(multiplicative_identity,inverse(A)) = multiplicative_identity. [para(2(a,1),89(a,1,2)),rewrite([5(2),3(2)]),flip(a)].
% 0.71/1.05 348 add(additive_identity,inverse(A)) = inverse(A). [para(89(a,1),86(a,1)),rewrite([6(6),4(6),1(6)])].
% 0.71/1.05 350 add(multiplicative_identity,multiply(A,inverse(B))) = add(A,multiplicative_identity). [para(330(a,1),8(a,1,1)),rewrite([5(3),94(4),2(3),5(2),6(5)]),flip(a)].
% 0.71/1.05 353 add(add(A,multiplicative_identity),add(B,multiply(A,additive_identity))) = add(multiplicative_identity,multiply(B,multiply(A,additive_identity))). [para(330(a,1),21(a,2,2,2)),rewrite([350(4),5(4),289(5),5(8),289(11),119(11)])].
% 0.71/1.05 355 add(multiply(A,B),add(B,multiply(C,additive_identity))) = multiply(B,add(A,add(B,C))). [para(1(a,1),22(a,1,1,2)),rewrite([6(3),1(7)])].
% 0.71/1.05 378 add(multiply(A,add(B,multiply(C,additive_identity))),add(B,multiply(D,multiply(B,C)))) = multiply(add(B,multiply(B,C)),add(A,add(B,D))). [para(86(a,2),22(a,1,1,2)),rewrite([6(6)])].
% 0.71/1.05 387 multiply(A,additive_identity) = additive_identity. [para(348(a,1),96(a,1,2)),rewrite([4(2)]),flip(a)].
% 0.71/1.05 392 multiply(add(A,multiply(A,B)),add(C,add(A,D))) = add(multiply(C,A),add(A,multiply(D,multiply(A,B)))). [back_rewrite(378),rewrite([387(2),1(2)]),flip(a)].
% 0.71/1.05 396 multiply(A,add(B,add(A,C))) = add(A,multiply(B,A)). [back_rewrite(355),rewrite([387(3),1(3),5(2)]),flip(a)].
% 0.71/1.05 397 add(A,add(B,multiplicative_identity)) = multiplicative_identity. [back_rewrite(353),rewrite([387(4),1(4),5(3),387(6),387(6),5(6),49(6)])].
% 0.71/1.05 401 add(A,multiply(B,multiply(A,C))) = add(A,multiply(A,B)). [back_rewrite(315),rewrite([397(3),2(2),396(4),6(1),387(4),1(4)]),flip(a)].
% 0.71/1.05 409 add(A,multiply(A,B)) = A. [back_rewrite(301),rewrite([387(2),1(2),396(3),6(1),392(7),6(3),401(6),110(6),397(5),2(4)])].
% 0.71/1.05 410 $F # answer(prove_a_plus_ab_is_a). [resolve(409,a,11,a)].
% 0.71/1.05
% 0.71/1.05 % SZS output end Refutation
% 0.71/1.05 ============================== end of proof ==========================
% 0.71/1.05
% 0.71/1.05 ============================== STATISTICS ============================
% 0.71/1.05
% 0.71/1.05 Given=54. Generated=1777. Kept=407. proofs=1.
% 0.71/1.05 Usable=39. Sos=172. Demods=197. Limbo=22, Disabled=182. Hints=0.
% 0.71/1.05 Megabytes=0.43.
% 0.71/1.05 User_CPU=0.09, System_CPU=0.01, Wall_clock=0.
% 0.71/1.05
% 0.71/1.05 ============================== end of statistics =====================
% 0.71/1.05
% 0.71/1.05 ============================== end of search =========================
% 0.71/1.05
% 0.71/1.05 THEOREM PROVED
% 0.71/1.05 % SZS status Unsatisfiable
% 0.71/1.05
% 0.71/1.05 Exiting with 1 proof.
% 0.71/1.05
% 0.71/1.05 Process 26914 exit (max_proofs) Thu Jun 2 00:21:37 2022
% 0.71/1.05 Prover9 interrupted
%------------------------------------------------------------------------------