TSTP Solution File: GRP683-11 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP683-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:34 EDT 2022
% Result : Unsatisfiable 0.49s 0.82s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP683-11 : TPTP v8.1.0. Released v8.1.0.
% 0.00/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Tue Jun 14 00:26:42 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.49/0.82 ============================== Prover9 ===============================
% 0.49/0.82 Prover9 (32) version 2009-11A, November 2009.
% 0.49/0.82 Process 5749 was started by sandbox on n032.cluster.edu,
% 0.49/0.82 Tue Jun 14 00:26:42 2022
% 0.49/0.82 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5595_n032.cluster.edu".
% 0.49/0.82 ============================== end of head ===========================
% 0.49/0.82
% 0.49/0.82 ============================== INPUT =================================
% 0.49/0.82
% 0.49/0.82 % Reading from file /tmp/Prover9_5595_n032.cluster.edu
% 0.49/0.82
% 0.49/0.82 set(prolog_style_variables).
% 0.49/0.82 set(auto2).
% 0.49/0.82 % set(auto2) -> set(auto).
% 0.49/0.82 % set(auto) -> set(auto_inference).
% 0.49/0.82 % set(auto) -> set(auto_setup).
% 0.49/0.82 % set(auto_setup) -> set(predicate_elim).
% 0.49/0.82 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/0.82 % set(auto) -> set(auto_limits).
% 0.49/0.82 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/0.82 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/0.82 % set(auto) -> set(auto_denials).
% 0.49/0.82 % set(auto) -> set(auto_process).
% 0.49/0.82 % set(auto2) -> assign(new_constants, 1).
% 0.49/0.82 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/0.82 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/0.82 % set(auto2) -> assign(max_hours, 1).
% 0.49/0.82 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/0.82 % set(auto2) -> assign(max_seconds, 0).
% 0.49/0.82 % set(auto2) -> assign(max_minutes, 5).
% 0.49/0.82 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/0.82 % set(auto2) -> set(sort_initial_sos).
% 0.49/0.82 % set(auto2) -> assign(sos_limit, -1).
% 0.49/0.82 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/0.82 % set(auto2) -> assign(max_megs, 400).
% 0.49/0.82 % set(auto2) -> assign(stats, some).
% 0.49/0.82 % set(auto2) -> clear(echo_input).
% 0.49/0.82 % set(auto2) -> set(quiet).
% 0.49/0.82 % set(auto2) -> clear(print_initial_clauses).
% 0.49/0.82 % set(auto2) -> clear(print_given).
% 0.49/0.82 assign(lrs_ticks,-1).
% 0.49/0.82 assign(sos_limit,10000).
% 0.49/0.82 assign(order,kbo).
% 0.49/0.82 set(lex_order_vars).
% 0.49/0.82 clear(print_given).
% 0.49/0.82
% 0.49/0.82 % formulas(sos). % not echoed (8 formulas)
% 0.49/0.82
% 0.49/0.82 ============================== end of input ==========================
% 0.49/0.82
% 0.49/0.82 % From the command line: assign(max_seconds, 300).
% 0.49/0.82
% 0.49/0.82 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/0.82
% 0.49/0.82 % Formulas that are not ordinary clauses:
% 0.49/0.82
% 0.49/0.82 ============================== end of process non-clausal formulas ===
% 0.49/0.82
% 0.49/0.82 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/0.82
% 0.49/0.82 ============================== PREDICATE ELIMINATION =================
% 0.49/0.82
% 0.49/0.82 ============================== end predicate elimination =============
% 0.49/0.82
% 0.49/0.82 Auto_denials:
% 0.49/0.82 % copying label goal to answer in negative clause
% 0.49/0.82
% 0.49/0.82 Term ordering decisions:
% 0.49/0.82 Function symbol KB weights: x3=1. x4=1. x5=1. mult=1. ld=1. rd=1.
% 0.49/0.82
% 0.49/0.82 ============================== end of process initial clauses ========
% 0.49/0.82
% 0.49/0.82 ============================== CLAUSES FOR SEARCH ====================
% 0.49/0.82
% 0.49/0.82 ============================== end of clauses for search =============
% 0.49/0.82
% 0.49/0.82 ============================== SEARCH ================================
% 0.49/0.82
% 0.49/0.82 % Starting search at 0.01 seconds.
% 0.49/0.82
% 0.49/0.82 ============================== PROOF =================================
% 0.49/0.82 % SZS status Unsatisfiable
% 0.49/0.82 % SZS output start Refutation
% 0.49/0.82
% 0.49/0.82 % Proof 1 at 0.06 (+ 0.01) seconds: goal.
% 0.49/0.82 % Length of proof is 59.
% 0.49/0.82 % Level of proof is 16.
% 0.49/0.82 % Maximum clause weight is 35.000.
% 0.49/0.82 % Given clauses 74.
% 0.49/0.82
% 0.49/0.82 1 ld(A,mult(A,A)) = A # label(f01) # label(axiom). [assumption].
% 0.49/0.82 2 rd(mult(A,A),A) = A # label(f02) # label(axiom). [assumption].
% 0.49/0.82 3 mult(A,ld(A,B)) = ld(A,mult(A,B)) # label(f03) # label(axiom). [assumption].
% 0.49/0.82 4 ld(A,mult(A,B)) = mult(A,ld(A,B)). [copy(3),flip(a)].
% 0.49/0.82 5 mult(rd(A,B),B) = rd(mult(A,B),B) # label(f04) # label(axiom). [assumption].
% 0.49/0.82 6 rd(mult(A,B),B) = mult(rd(A,B),B). [copy(5),flip(a)].
% 0.49/0.82 7 ld(A,mult(A,ld(B,B))) = rd(mult(rd(A,A),B),B) # label(f07) # label(axiom). [assumption].
% 0.49/0.82 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.49/0.82 9 ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D) # label(f05) # label(axiom). [assumption].
% 0.49/0.82 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.49/0.82 11 rd(mult(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,rd(mult(B,D),D)) # label(f06) # label(axiom). [assumption].
% 0.49/0.82 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.49/0.82 13 mult(rd(mult(x3,x4),x4),x5) != mult(x3,x5) # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 0.49/0.82 14 mult(mult(rd(x3,x4),x4),x5) != mult(x3,x5) # answer(goal). [copy(13),rewrite([6(5)])].
% 0.49/0.82 15 mult(A,ld(A,A)) = A. [back_rewrite(1),rewrite([4(2)])].
% 0.49/0.82 16 mult(rd(A,A),A) = A. [back_rewrite(2),rewrite([6(2)])].
% 0.49/0.82 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.49/0.82 25 mult(rd(mult(A,B),rd(C,D)),ld(rd(mult(A,B),rd(C,D)),rd(C,D))) = ld(rd(mult(A,B),rd(C,D)),mult(A,mult(rd(B,D),D))). [para(12(a,1),4(a,1,2)),flip(a)].
% 0.49/0.82 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.49/0.82 33 mult(A,ld(A,ld(A,A))) = ld(A,A). [para(15(a,1),4(a,1,2)),flip(a)].
% 0.49/0.82 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.49/0.82 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.49/0.82 38 rd(A,A) = ld(A,A). [para(16(a,1),6(a,1,1)),rewrite([8(4),33(4)])].
% 0.49/0.82 39 mult(ld(A,A),A) = A. [para(16(a,1),6(a,2)),rewrite([6(2),38(1)])].
% 0.49/0.82 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.49/0.82 48 mult(rd(ld(A,A),B),B) = mult(A,ld(A,ld(B,B))). [back_rewrite(8),rewrite([38(1)])].
% 0.49/0.82 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.49/0.82 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.49/0.82 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.49/0.82 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.49/0.82 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.49/0.82 102 mult(rd(A,rd(B,C)),rd(B,C)) = mult(A,ld(C,C)). [back_rewrite(49),rewrite([78(8)])].
% 0.49/0.82 111 mult(mult(A,B),ld(C,C)) = mult(A,mult(rd(B,C),C)). [back_rewrite(12),rewrite([102(5)])].
% 0.49/0.82 121 mult(rd(A,rd(B,C)),ld(rd(A,rd(B,C)),rd(B,C))) = ld(rd(A,rd(B,C)),mult(A,ld(C,C))). [para(15(a,1),25(a,1,1,1)),rewrite([15(4),15(9),48(12),78(13)])].
% 0.49/0.82 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.49/0.82 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.49/0.82 152 mult(rd(A,mult(rd(B,C),C)),mult(rd(B,C),C)) = mult(A,ld(C,C)). [para(15(a,1),27(a,1,1,1)),rewrite([48(9),78(10)])].
% 0.49/0.82 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.49/0.82 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.49/0.82 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.49/0.82 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.49/0.82 208 mult(A,mult(rd(B,C),C)) = mult(A,mult(B,ld(C,C))). [back_rewrite(155),rewrite([201(4)]),flip(a)].
% 0.49/0.82 210 rd(A,ld(A,A)) = A. [back_rewrite(34),rewrite([201(4),15(2)]),flip(a)].
% 0.49/0.82 242 mult(rd(A,mult(rd(B,C),C)),mult(B,ld(C,C))) = mult(A,ld(C,C)). [back_rewrite(152),rewrite([208(6)])].
% 0.49/0.82 249 mult(mult(A,B),ld(C,C)) = mult(A,mult(B,ld(C,C))). [back_rewrite(111),rewrite([208(6)])].
% 0.49/0.82 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.49/0.82 256 mult(A,ld(mult(B,ld(C,C)),mult(B,ld(C,C)))) = mult(A,ld(C,C)). [back_rewrite(242),rewrite([253(2),253(6)])].
% 0.49/0.82 272 mult(mult(x3,ld(x4,x4)),x5) != mult(x3,x5) # answer(goal). [back_rewrite(14),rewrite([253(5)])].
% 0.49/0.82 273 rd(mult(A,B),B) = mult(A,ld(B,B)). [back_rewrite(6),rewrite([253(4)])].
% 0.49/0.82 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.49/0.82 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.49/0.82 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.49/0.82 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.49/0.82 372 ld(mult(A,ld(B,B)),mult(A,ld(B,B))) = mult(A,ld(A,ld(B,B))). [para(38(a,1),121(a,1,1,2)),rewrite([276(2),38(3),276(4),38(5),298(7),38(4),276(5)]),flip(a)].
% 0.49/0.82 383 mult(A,mult(B,ld(B,ld(C,C)))) = mult(A,ld(C,C)). [back_rewrite(256),rewrite([372(5)])].
% 0.49/0.82 395 mult(rd(A,B),mult(B,ld(C,C))) = mult(A,ld(C,C)). [para(253(a,1),249(a,1,1)),rewrite([249(4),369(3),383(4)]),flip(a)].
% 0.49/0.82 397 mult(mult(A,mult(B,ld(C,C))),C) = mult(mult(A,B),C). [para(249(a,1),288(a,1,1))].
% 0.49/0.82 555 mult(mult(A,ld(B,B)),C) = mult(A,C). [para(253(a,1),397(a,2,1)),rewrite([395(4),288(3)]),flip(a)].
% 0.49/0.82 556 $F # answer(goal). [resolve(555,a,272,a)].
% 0.49/0.82
% 0.49/0.82 % SZS output end Refutation
% 0.49/0.82 ============================== end of proof ==========================
% 0.49/0.82
% 0.49/0.82 ============================== STATISTICS ============================
% 0.49/0.82
% 0.49/0.82 Given=74. Generated=2738. Kept=549. proofs=1.
% 0.49/0.82 Usable=31. Sos=103. Demods=133. Limbo=1, Disabled=421. Hints=0.
% 0.49/0.82 Megabytes=0.62.
% 0.49/0.82 User_CPU=0.06, System_CPU=0.01, Wall_clock=0.
% 0.49/0.82
% 0.49/0.82 ============================== end of statistics =====================
% 0.49/0.82
% 0.49/0.82 ============================== end of search =========================
% 0.49/0.82
% 0.49/0.82 THEOREM PROVED
% 0.49/0.82 % SZS status Unsatisfiable
% 0.49/0.82
% 0.49/0.82 Exiting with 1 proof.
% 0.49/0.82
% 0.49/0.82 Process 5749 exit (max_proofs) Tue Jun 14 00:26:42 2022
% 0.49/0.82 Prover9 interrupted
%------------------------------------------------------------------------------