TSTP Solution File: GRP684-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP684-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:20:35 EDT 2022
% Result : Unsatisfiable 0.81s 1.09s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP684-1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n007.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 : Mon Jun 13 11:53:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.81/1.09 ============================== Prover9 ===============================
% 0.81/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.09 Process 16715 was started by sandbox2 on n007.cluster.edu,
% 0.81/1.09 Mon Jun 13 11:53:39 2022
% 0.81/1.09 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16562_n007.cluster.edu".
% 0.81/1.09 ============================== end of head ===========================
% 0.81/1.09
% 0.81/1.09 ============================== INPUT =================================
% 0.81/1.09
% 0.81/1.09 % Reading from file /tmp/Prover9_16562_n007.cluster.edu
% 0.81/1.09
% 0.81/1.09 set(prolog_style_variables).
% 0.81/1.09 set(auto2).
% 0.81/1.09 % set(auto2) -> set(auto).
% 0.81/1.09 % set(auto) -> set(auto_inference).
% 0.81/1.09 % set(auto) -> set(auto_setup).
% 0.81/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.81/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.09 % set(auto) -> set(auto_limits).
% 0.81/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.09 % set(auto) -> set(auto_denials).
% 0.81/1.09 % set(auto) -> set(auto_process).
% 0.81/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.81/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.81/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.81/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.81/1.09 % set(auto2) -> assign(stats, some).
% 0.81/1.09 % set(auto2) -> clear(echo_input).
% 0.81/1.09 % set(auto2) -> set(quiet).
% 0.81/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.09 % set(auto2) -> clear(print_given).
% 0.81/1.09 assign(lrs_ticks,-1).
% 0.81/1.09 assign(sos_limit,10000).
% 0.81/1.09 assign(order,kbo).
% 0.81/1.09 set(lex_order_vars).
% 0.81/1.09 clear(print_given).
% 0.81/1.09
% 0.81/1.09 % formulas(sos). % not echoed (8 formulas)
% 0.81/1.09
% 0.81/1.09 ============================== end of input ==========================
% 0.81/1.09
% 0.81/1.09 % From the command line: assign(max_seconds, 300).
% 0.81/1.09
% 0.81/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.09
% 0.81/1.09 % Formulas that are not ordinary clauses:
% 0.81/1.09
% 0.81/1.09 ============================== end of process non-clausal formulas ===
% 0.81/1.09
% 0.81/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.09
% 0.81/1.09 ============================== PREDICATE ELIMINATION =================
% 0.81/1.09
% 0.81/1.09 ============================== end predicate elimination =============
% 0.81/1.09
% 0.81/1.09 Auto_denials:
% 0.81/1.09 % copying label goals to answer in negative clause
% 0.81/1.09
% 0.81/1.09 Term ordering decisions:
% 0.81/1.09 Function symbol KB weights: a=1. b=1. c=1. mult=1. ld=1. rd=1.
% 0.81/1.09
% 0.81/1.09 ============================== end of process initial clauses ========
% 0.81/1.09
% 0.81/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.09
% 0.81/1.09 ============================== end of clauses for search =============
% 0.81/1.09
% 0.81/1.09 ============================== SEARCH ================================
% 0.81/1.09
% 0.81/1.09 % Starting search at 0.01 seconds.
% 0.81/1.09
% 0.81/1.09 ============================== PROOF =================================
% 0.81/1.09 % SZS status Unsatisfiable
% 0.81/1.09 % SZS output start Refutation
% 0.81/1.09
% 0.81/1.09 % Proof 1 at 0.10 (+ 0.01) seconds: goals.
% 0.81/1.09 % Length of proof is 90.
% 0.81/1.09 % Level of proof is 19.
% 0.81/1.09 % Maximum clause weight is 35.000.
% 0.81/1.09 % Given clauses 69.
% 0.81/1.09
% 0.81/1.09 1 ld(A,mult(A,A)) = A # label(c01) # label(axiom). [assumption].
% 0.81/1.09 2 rd(mult(A,A),A) = A # label(c02) # label(axiom). [assumption].
% 0.81/1.09 3 mult(A,ld(A,B)) = ld(A,mult(A,B)) # label(c03) # label(axiom). [assumption].
% 0.81/1.09 4 ld(A,mult(A,B)) = mult(A,ld(A,B)). [copy(3),flip(a)].
% 0.81/1.09 5 mult(rd(A,B),B) = rd(mult(A,B),B) # label(c04) # label(axiom). [assumption].
% 0.81/1.09 6 rd(mult(A,B),B) = mult(rd(A,B),B). [copy(5),flip(a)].
% 0.81/1.09 7 ld(A,mult(A,ld(B,B))) = rd(mult(rd(A,A),B),B) # label(c07) # label(axiom). [assumption].
% 0.81/1.09 8 mult(rd(rd(A,A),B),B) = mult(A,ld(A,ld(B,B))). [copy(7),rewrite([4(3),6(6)]),flip(a)].
% 0.81/1.09 9 ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D) # label(c05) # label(axiom). [assumption].
% 0.81/1.09 10 mult(ld(A,B),ld(ld(A,B),mult(C,D))) = mult(mult(A,ld(A,C)),D). [copy(9),rewrite([4(5),4(7)])].
% 0.81/1.09 11 rd(mult(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,rd(mult(B,D),D)) # label(c06) # label(axiom). [assumption].
% 0.81/1.09 12 mult(rd(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,mult(rd(B,D),D)). [copy(11),rewrite([6(5),6(7)])].
% 0.81/1.09 13 rd(mult(a,mult(b,c)),mult(b,c)) != rd(mult(a,c),c) # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 0.81/1.09 14 mult(rd(a,mult(b,c)),mult(b,c)) != mult(rd(a,c),c) # answer(goals). [copy(13),rewrite([6(9),6(14)])].
% 0.81/1.09 15 mult(A,ld(A,A)) = A. [back_rewrite(1),rewrite([4(2)])].
% 0.81/1.09 16 mult(rd(A,A),A) = A. [back_rewrite(2),rewrite([6(2)])].
% 0.81/1.09 19 mult(ld(A,B),ld(ld(A,B),ld(ld(A,B),mult(C,D)))) = ld(ld(A,B),mult(mult(A,ld(A,C)),D)). [para(10(a,1),4(a,1,2)),flip(a)].
% 0.81/1.09 20 mult(mult(A,ld(A,B)),ld(mult(A,ld(A,B)),mult(C,D))) = mult(mult(A,ld(A,C)),D). [para(4(a,1),10(a,1,1)),rewrite([4(4)])].
% 0.81/1.09 21 mult(ld(A,B),mult(ld(A,B),ld(ld(A,B),C))) = mult(mult(A,ld(A,ld(A,B))),C). [para(4(a,1),10(a,1,2))].
% 0.81/1.09 27 mult(rd(mult(A,B),mult(rd(C,D),D)),mult(rd(C,D),D)) = mult(A,mult(rd(B,D),D)). [para(6(a,1),12(a,1,1,2)),rewrite([6(6)])].
% 0.81/1.09 29 mult(rd(rd(A,A),B),mult(rd(B,C),C)) = mult(A,mult(rd(ld(A,ld(B,B)),C),C)). [para(8(a,1),12(a,1,1,1)),rewrite([12(7)]),flip(a)].
% 0.81/1.09 33 mult(A,ld(A,ld(A,A))) = ld(A,A). [para(15(a,1),4(a,1,2)),flip(a)].
% 0.81/1.09 34 mult(rd(A,ld(A,A)),ld(A,A)) = rd(A,ld(A,A)). [para(15(a,1),6(a,1,1)),flip(a)].
% 0.81/1.09 36 mult(rd(A,rd(B,C)),rd(B,C)) = mult(A,mult(rd(ld(A,A),C),C)). [para(15(a,1),12(a,1,1,1))].
% 0.81/1.09 38 rd(A,A) = ld(A,A). [para(16(a,1),6(a,1,1)),rewrite([8(4),33(4)])].
% 0.81/1.09 39 mult(ld(A,A),A) = A. [para(16(a,1),6(a,2)),rewrite([6(2),38(1)])].
% 0.81/1.09 40 mult(A,ld(A,ld(ld(A,A),ld(A,A)))) = ld(A,A). [para(16(a,1),8(a,1)),rewrite([38(1),38(2),38(3)]),flip(a)].
% 0.81/1.09 41 mult(ld(A,B),ld(ld(A,B),C)) = mult(mult(A,ld(A,ld(C,C))),C). [para(16(a,1),10(a,1,2,2)),rewrite([38(5)])].
% 0.81/1.09 44 mult(rd(ld(A,A),B),mult(rd(B,C),C)) = mult(A,mult(rd(ld(A,ld(B,B)),C),C)). [back_rewrite(29),rewrite([38(1)])].
% 0.81/1.09 48 mult(rd(ld(A,A),B),B) = mult(A,ld(A,ld(B,B))). [back_rewrite(8),rewrite([38(1)])].
% 0.81/1.09 49 mult(rd(A,rd(B,C)),rd(B,C)) = mult(A,mult(A,ld(A,ld(C,C)))). [back_rewrite(36),rewrite([48(7)])].
% 0.81/1.09 51 mult(mult(A,ld(A,B)),ld(mult(A,ld(A,B)),ld(mult(A,ld(A,B)),mult(C,D)))) = ld(mult(A,ld(A,B)),mult(mult(A,ld(A,C)),D)). [para(4(a,1),19(a,1,1)),rewrite([4(4),4(6),4(12)])].
% 0.81/1.09 59 ld(ld(A,B),mult(mult(A,ld(A,ld(C,C))),C)) = mult(ld(A,B),ld(ld(A,B),ld(ld(A,B),C))). [para(39(a,1),19(a,1,2,2,2)),flip(a)].
% 0.81/1.09 76 mult(mult(A,ld(A,B)),C) = mult(A,ld(A,mult(B,C))). [para(15(a,1),20(a,1,1)),rewrite([15(2)]),flip(a)].
% 0.81/1.09 77 mult(A,ld(A,mult(B,ld(mult(A,ld(A,B)),C)))) = mult(A,ld(A,C)). [para(15(a,1),20(a,1,2,2)),rewrite([76(6),76(10),15(8)])].
% 0.81/1.09 78 mult(A,mult(A,ld(A,B))) = mult(A,B). [para(15(a,1),20(a,2,1)),rewrite([76(7),77(7),4(2)])].
% 0.81/1.09 80 mult(A,ld(A,mult(ld(A,A),B))) = mult(ld(A,A),B). [para(33(a,1),20(a,2,1)),rewrite([76(8),77(8)])].
% 0.81/1.09 90 mult(ld(A,B),ld(ld(A,B),ld(ld(A,B),C))) = ld(ld(A,B),mult(A,ld(A,C))). [back_rewrite(59),rewrite([76(5),39(3)]),flip(a)].
% 0.81/1.09 95 ld(mult(A,ld(A,B)),mult(A,ld(A,mult(C,D)))) = mult(A,ld(A,ld(mult(A,ld(A,B)),mult(C,D)))). [back_rewrite(51),rewrite([76(10),77(10),76(11)]),flip(a)].
% 0.81/1.09 97 mult(ld(A,B),ld(ld(A,B),C)) = mult(A,ld(A,C)). [back_rewrite(41),rewrite([76(8),39(6)])].
% 0.81/1.09 100 mult(ld(A,B),mult(A,ld(A,C))) = mult(A,ld(A,mult(ld(A,B),C))). [back_rewrite(21),rewrite([97(5),76(8)])].
% 0.81/1.09 102 mult(rd(A,rd(B,C)),rd(B,C)) = mult(A,ld(C,C)). [back_rewrite(49),rewrite([78(8)])].
% 0.81/1.09 103 ld(ld(A,B),mult(A,ld(A,C))) = mult(A,ld(A,ld(ld(A,B),C))). [back_rewrite(90),rewrite([97(6)]),flip(a)].
% 0.81/1.09 111 mult(mult(A,B),ld(C,C)) = mult(A,mult(rd(B,C),C)). [back_rewrite(12),rewrite([102(5)])].
% 0.81/1.09 132 mult(A,ld(A,ld(mult(A,ld(A,B)),mult(B,C)))) = mult(A,ld(A,C)). [para(76(a,1),4(a,1,2)),rewrite([95(6),76(12),77(12)])].
% 0.81/1.09 133 mult(A,ld(A,mult(mult(A,B),C))) = mult(mult(A,B),C). [para(4(a,1),76(a,1,1,2)),rewrite([78(3)]),flip(a)].
% 0.81/1.09 145 ld(ld(A,A),ld(A,A)) = ld(A,A). [para(33(a,1),80(a,1,2,2)),rewrite([40(5),33(8)]),flip(a)].
% 0.81/1.09 155 mult(A,mult(rd(B,ld(C,C)),ld(C,C))) = mult(A,mult(rd(B,C),C)). [para(34(a,1),27(a,1,1,2)),rewrite([34(8),102(7),145(4),111(3)]),flip(a)].
% 0.81/1.09 180 mult(A,ld(A,ld(A,B))) = ld(A,B). [para(97(a,1),15(a,1))].
% 0.81/1.09 182 mult(A,ld(A,mult(ld(A,B),C))) = mult(ld(A,B),C). [para(97(a,1),78(a,1,2)),rewrite([100(4)])].
% 0.81/1.09 186 mult(ld(A,B),mult(A,ld(A,C))) = mult(ld(A,B),C). [back_rewrite(100),rewrite([182(8)])].
% 0.81/1.09 188 mult(A,ld(A,ld(mult(A,ld(A,B)),C))) = ld(mult(A,ld(A,B)),C). [para(180(a,1),76(a,1)),rewrite([77(12)]),flip(a)].
% 0.81/1.09 189 mult(A,ld(A,ld(ld(A,B),C))) = ld(ld(A,B),C). [para(180(a,1),97(a,1)),flip(a)].
% 0.81/1.09 190 ld(mult(A,ld(A,B)),mult(B,C)) = mult(A,ld(A,C)). [back_rewrite(132),rewrite([188(6)])].
% 0.81/1.09 192 ld(ld(A,B),mult(A,ld(A,C))) = ld(ld(A,B),C). [back_rewrite(103),rewrite([189(8)])].
% 0.81/1.09 195 mult(rd(ld(A,A),mult(B,C)),mult(mult(rd(B,C),C),C)) = mult(A,mult(rd(ld(A,ld(mult(B,C),mult(B,C))),C),C)). [para(6(a,1),44(a,1,2,1))].
% 0.81/1.09 198 mult(rd(ld(A,A),ld(B,B)),mult(B,ld(B,ld(C,C)))) = mult(A,mult(rd(ld(A,ld(B,B)),C),C)). [para(48(a,1),44(a,1,2)),rewrite([145(10)])].
% 0.81/1.09 201 mult(rd(A,ld(B,B)),ld(B,B)) = mult(A,ld(B,B)). [para(38(a,1),102(a,1,1,2)),rewrite([38(3)])].
% 0.81/1.09 202 mult(rd(A,B),ld(B,B)) = rd(A,B). [para(38(a,1),102(a,1,1)),rewrite([39(5)]),flip(a)].
% 0.81/1.09 204 mult(ld(A,A),ld(B,B)) = mult(A,ld(A,ld(B,B))). [para(48(a,1),102(a,2)),rewrite([102(7),201(5),145(6)])].
% 0.81/1.09 208 mult(A,mult(rd(B,C),C)) = mult(A,mult(B,ld(C,C))). [back_rewrite(155),rewrite([201(4)]),flip(a)].
% 0.81/1.09 210 rd(A,ld(A,A)) = A. [back_rewrite(34),rewrite([201(4),15(2)]),flip(a)].
% 0.81/1.09 219 mult(rd(ld(A,A),ld(B,B)),mult(B,ld(B,ld(C,C)))) = mult(A,mult(ld(A,ld(B,B)),ld(C,C))). [back_rewrite(198),rewrite([208(12)])].
% 0.81/1.09 220 mult(rd(ld(A,A),mult(B,C)),mult(mult(rd(B,C),C),C)) = mult(A,mult(ld(A,ld(mult(B,C),mult(B,C))),ld(C,C))). [back_rewrite(195),rewrite([208(14)])].
% 0.81/1.09 249 mult(mult(A,B),ld(C,C)) = mult(A,mult(B,ld(C,C))). [back_rewrite(111),rewrite([208(6)])].
% 0.81/1.09 253 mult(rd(A,B),B) = mult(A,ld(B,B)). [para(210(a,1),102(a,1,1,2)),rewrite([210(3),145(5)])].
% 0.81/1.09 263 mult(rd(ld(A,A),mult(B,C)),mult(mult(B,ld(C,C)),C)) = mult(A,mult(ld(A,ld(mult(B,C),mult(B,C))),ld(C,C))). [back_rewrite(220),rewrite([253(5)])].
% 0.81/1.09 272 mult(a,ld(mult(b,c),mult(b,c))) != mult(a,ld(c,c)) # answer(goals). [back_rewrite(14),rewrite([253(9),253(14)])].
% 0.81/1.09 273 rd(mult(A,B),B) = mult(A,ld(B,B)). [back_rewrite(6),rewrite([253(4)])].
% 0.81/1.09 276 rd(A,ld(B,B)) = mult(A,ld(B,B)). [para(145(a,1),202(a,1,2)),rewrite([253(4),145(3)]),flip(a)].
% 0.81/1.09 278 mult(A,ld(A,mult(B,ld(B,ld(C,C))))) = mult(A,mult(ld(A,ld(B,B)),ld(C,C))). [back_rewrite(219),rewrite([276(3),204(3),76(7),186(5),204(3)])].
% 0.81/1.09 288 mult(mult(A,ld(B,B)),B) = mult(A,B). [para(273(a,1),253(a,1,1)),rewrite([249(6),15(5)])].
% 0.81/1.09 289 mult(A,mult(ld(A,ld(mult(B,C),mult(B,C))),ld(C,C))) = mult(A,ld(A,ld(mult(B,C),mult(B,C)))). [back_rewrite(263),rewrite([288(6),253(5),204(5)]),flip(a)].
% 0.81/1.09 292 mult(mult(A,ld(B,B)),ld(mult(A,ld(B,B)),B)) = ld(mult(A,ld(B,B)),mult(A,B)). [para(288(a,1),4(a,1,2)),flip(a)].
% 0.81/1.09 297 ld(A,mult(B,ld(mult(A,ld(A,B)),C))) = ld(A,C). [para(77(a,1),4(a,1,2)),rewrite([4(3),180(3),180(8)]),flip(a)].
% 0.81/1.09 298 mult(mult(A,B),ld(mult(A,B),C)) = mult(A,ld(A,C)). [para(4(a,1),77(a,1,2,2,2,1,2)),rewrite([78(4),133(6)])].
% 0.81/1.09 303 ld(mult(A,ld(B,B)),mult(A,B)) = mult(A,ld(A,B)). [back_rewrite(292),rewrite([298(6)]),flip(a)].
% 0.81/1.09 338 ld(mult(A,ld(A,B)),B) = mult(A,ld(A,ld(B,B))). [para(15(a,1),190(a,1,2))].
% 0.81/1.09 340 mult(A,ld(A,mult(B,ld(B,C)))) = mult(A,ld(A,C)). [para(78(a,1),190(a,1,2)),rewrite([190(4)]),flip(a)].
% 0.81/1.09 351 mult(A,mult(ld(A,ld(B,B)),ld(C,C))) = mult(A,ld(A,ld(C,C))). [back_rewrite(278),rewrite([340(5)]),flip(a)].
% 0.81/1.09 357 mult(A,ld(A,ld(mult(B,C),mult(B,C)))) = mult(A,ld(A,ld(C,C))). [back_rewrite(289),rewrite([351(7)]),flip(a)].
% 0.81/1.09 361 ld(mult(A,ld(A,B)),mult(A,ld(A,C))) = ld(mult(A,ld(A,B)),C). [para(4(a,1),192(a,1,1)),rewrite([4(7)])].
% 0.81/1.09 369 mult(ld(A,A),B) = mult(A,ld(A,B)). [para(204(a,1),288(a,1,1)),rewrite([76(4),39(2)]),flip(a)].
% 0.81/1.09 370 ld(ld(A,A),B) = mult(A,ld(A,B)). [para(204(a,1),133(a,1,2,2,1)),rewrite([76(6),369(4),340(6),192(5),369(4),189(4),369(5),76(6),369(4),340(6)])].
% 0.81/1.09 384 rd(mult(A,ld(A,B)),B) = mult(A,ld(A,ld(B,B))). [para(369(a,1),273(a,1,1)),rewrite([369(6)])].
% 0.81/1.09 385 ld(mult(A,ld(A,ld(B,B))),C) = mult(A,ld(A,C)). [para(76(a,1),370(a,2)),rewrite([361(5),338(3),297(9)])].
% 0.81/1.09 444 ld(A,mult(B,ld(B,C))) = ld(A,C). [para(369(a,1),297(a,1,2)),rewrite([385(4),340(4)])].
% 0.81/1.09 450 mult(A,mult(B,ld(B,C))) = mult(A,C). [para(444(a,1),78(a,1,2,2)),rewrite([78(3)]),flip(a)].
% 0.81/1.09 515 ld(mult(A,B),mult(A,B)) = mult(A,ld(A,ld(B,B))). [para(303(a,1),384(a,1,1,2)),rewrite([450(5),288(3),38(3),357(12),298(10)])].
% 0.81/1.09 516 $F # answer(goals). [back_rewrite(272),rewrite([515(8),450(9)]),xx(a)].
% 0.81/1.09
% 0.81/1.09 % SZS output end Refutation
% 0.81/1.09 ============================== end of proof ==========================
% 0.81/1.09
% 0.81/1.09 ============================== STATISTICS ============================
% 0.81/1.09
% 0.81/1.09 Given=69. Generated=2482. Kept=509. proofs=1.
% 0.81/1.09 Usable=28. Sos=107. Demods=135. Limbo=1, Disabled=381. Hints=0.
% 0.81/1.09 Megabytes=0.59.
% 0.81/1.09 User_CPU=0.10, System_CPU=0.01, Wall_clock=0.
% 0.81/1.09
% 0.81/1.09 ============================== end of statistics =====================
% 0.81/1.09
% 0.81/1.09 ============================== end of search =========================
% 0.81/1.09
% 0.81/1.09 THEOREM PROVED
% 0.81/1.09 % SZS status Unsatisfiable
% 0.81/1.09
% 0.81/1.09 Exiting with 1 proof.
% 0.81/1.09
% 0.81/1.09 Process 16715 exit (max_proofs) Mon Jun 13 11:53:39 2022
% 0.81/1.09 Prover9 interrupted
%------------------------------------------------------------------------------