TSTP Solution File: GRP756-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP756-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:56 EDT 2022
% Result : Unsatisfiable 0.91s 1.18s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP756-1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 09:19:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.91/1.18 ============================== Prover9 ===============================
% 0.91/1.18 Prover9 (32) version 2009-11A, November 2009.
% 0.91/1.18 Process 17484 was started by sandbox on n023.cluster.edu,
% 0.91/1.18 Tue Jun 14 09:19:36 2022
% 0.91/1.18 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17330_n023.cluster.edu".
% 0.91/1.18 ============================== end of head ===========================
% 0.91/1.18
% 0.91/1.18 ============================== INPUT =================================
% 0.91/1.18
% 0.91/1.18 % Reading from file /tmp/Prover9_17330_n023.cluster.edu
% 0.91/1.18
% 0.91/1.18 set(prolog_style_variables).
% 0.91/1.18 set(auto2).
% 0.91/1.18 % set(auto2) -> set(auto).
% 0.91/1.18 % set(auto) -> set(auto_inference).
% 0.91/1.18 % set(auto) -> set(auto_setup).
% 0.91/1.18 % set(auto_setup) -> set(predicate_elim).
% 0.91/1.18 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.91/1.18 % set(auto) -> set(auto_limits).
% 0.91/1.18 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.91/1.18 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.91/1.18 % set(auto) -> set(auto_denials).
% 0.91/1.18 % set(auto) -> set(auto_process).
% 0.91/1.18 % set(auto2) -> assign(new_constants, 1).
% 0.91/1.18 % set(auto2) -> assign(fold_denial_max, 3).
% 0.91/1.18 % set(auto2) -> assign(max_weight, "200.000").
% 0.91/1.18 % set(auto2) -> assign(max_hours, 1).
% 0.91/1.18 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.91/1.18 % set(auto2) -> assign(max_seconds, 0).
% 0.91/1.18 % set(auto2) -> assign(max_minutes, 5).
% 0.91/1.18 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.91/1.18 % set(auto2) -> set(sort_initial_sos).
% 0.91/1.18 % set(auto2) -> assign(sos_limit, -1).
% 0.91/1.18 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.91/1.18 % set(auto2) -> assign(max_megs, 400).
% 0.91/1.18 % set(auto2) -> assign(stats, some).
% 0.91/1.18 % set(auto2) -> clear(echo_input).
% 0.91/1.18 % set(auto2) -> set(quiet).
% 0.91/1.18 % set(auto2) -> clear(print_initial_clauses).
% 0.91/1.18 % set(auto2) -> clear(print_given).
% 0.91/1.18 assign(lrs_ticks,-1).
% 0.91/1.18 assign(sos_limit,10000).
% 0.91/1.18 assign(order,kbo).
% 0.91/1.18 set(lex_order_vars).
% 0.91/1.18 clear(print_given).
% 0.91/1.18
% 0.91/1.18 % formulas(sos). % not echoed (6 formulas)
% 0.91/1.18
% 0.91/1.18 ============================== end of input ==========================
% 0.91/1.18
% 0.91/1.18 % From the command line: assign(max_seconds, 300).
% 0.91/1.18
% 0.91/1.18 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.91/1.18
% 0.91/1.18 % Formulas that are not ordinary clauses:
% 0.91/1.18
% 0.91/1.18 ============================== end of process non-clausal formulas ===
% 0.91/1.18
% 0.91/1.18 ============================== PROCESS INITIAL CLAUSES ===============
% 0.91/1.18
% 0.91/1.18 ============================== PREDICATE ELIMINATION =================
% 0.91/1.18
% 0.91/1.18 ============================== end predicate elimination =============
% 0.91/1.18
% 0.91/1.18 Auto_denials:
% 0.91/1.18 % copying label goals to answer in negative clause
% 0.91/1.18
% 0.91/1.18 Term ordering decisions:
% 0.91/1.18 Function symbol KB weights: a=1. b=1. c=1. mult=1. ld=1. rd=1.
% 0.91/1.18
% 0.91/1.18 ============================== end of process initial clauses ========
% 0.91/1.18
% 0.91/1.18 ============================== CLAUSES FOR SEARCH ====================
% 0.91/1.18
% 0.91/1.18 ============================== end of clauses for search =============
% 0.91/1.18
% 0.91/1.18 ============================== SEARCH ================================
% 0.91/1.18
% 0.91/1.18 % Starting search at 0.01 seconds.
% 0.91/1.18
% 0.91/1.18 ============================== PROOF =================================
% 0.91/1.18 % SZS status Unsatisfiable
% 0.91/1.18 % SZS output start Refutation
% 0.91/1.18
% 0.91/1.18 % Proof 1 at 0.18 (+ 0.00) seconds: goals.
% 0.91/1.18 % Length of proof is 52.
% 0.91/1.18 % Level of proof is 16.
% 0.91/1.18 % Maximum clause weight is 31.000.
% 0.91/1.18 % Given clauses 40.
% 0.91/1.18
% 0.91/1.18 1 mult(A,ld(A,B)) = B # label(f01) # label(axiom). [assumption].
% 0.91/1.18 2 ld(A,mult(A,B)) = B # label(f02) # label(axiom). [assumption].
% 0.91/1.18 3 mult(rd(A,B),B) = A # label(f03) # label(axiom). [assumption].
% 0.91/1.18 4 rd(mult(A,B),B) = A # label(f04) # label(axiom). [assumption].
% 0.91/1.18 5 mult(A,mult(mult(B,B),C)) = mult(mult(A,B),mult(B,C)) # label(f05) # label(axiom). [assumption].
% 0.91/1.18 6 mult(mult(A,B),mult(B,C)) = mult(A,mult(mult(B,B),C)). [copy(5),flip(a)].
% 0.91/1.18 7 mult(mult(a,b),c) != mult(a,mult(b,c)) # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 0.91/1.18 10 mult(A,mult(mult(ld(A,B),ld(A,B)),C)) = mult(B,mult(ld(A,B),C)). [para(1(a,1),6(a,1,1)),flip(a)].
% 0.91/1.18 11 mult(A,mult(mult(B,B),ld(B,C))) = mult(mult(A,B),C). [para(1(a,1),6(a,1,2)),flip(a)].
% 0.91/1.18 12 ld(mult(A,B),mult(A,mult(mult(B,B),C))) = mult(B,C). [para(6(a,1),2(a,1,2))].
% 0.91/1.18 15 rd(mult(A,mult(mult(B,B),C)),mult(B,C)) = mult(A,B). [para(6(a,1),4(a,1,1))].
% 0.91/1.18 18 mult(mult(A,A),ld(A,B)) = ld(C,mult(mult(C,A),B)). [para(11(a,1),2(a,1,2)),flip(a)].
% 0.91/1.18 21 mult(mult(mult(A,B),C),mult(mult(mult(B,B),ld(B,C)),D)) = mult(A,mult(mult(mult(mult(mult(B,B),ld(B,C)),B),C),D)). [para(11(a,1),6(a,1,1)),rewrite([11(14)])].
% 0.91/1.18 26 mult(A,ld(mult(A,A),B)) = ld(mult(C,A),mult(C,B)). [para(1(a,1),12(a,1,2,2)),flip(a)].
% 0.91/1.18 50 rd(mult(A,B),mult(C,ld(mult(C,C),B))) = mult(A,C). [para(1(a,1),15(a,1,1,2))].
% 0.91/1.18 56 rd(mult(A,mult(mult(mult(mult(mult(B,B),ld(B,C)),B),C),D)),mult(mult(mult(B,B),ld(B,C)),D)) = mult(mult(A,B),C). [para(11(a,1),15(a,1,1,2,1)),rewrite([11(16)])].
% 0.91/1.18 60 mult(mult(A,A),ld(A,ld(mult(B,A),C))) = ld(B,C). [para(1(a,1),18(a,2,2))].
% 0.91/1.18 63 rd(ld(A,mult(mult(A,B),C)),ld(B,C)) = mult(B,B). [para(18(a,1),4(a,1,1))].
% 0.91/1.18 66 mult(A,ld(B,mult(mult(B,C),D))) = mult(mult(A,C),D). [para(18(a,1),6(a,2,2)),rewrite([1(3)]),flip(a)].
% 0.91/1.18 78 mult(A,mult(mult(mult(mult(mult(B,B),ld(B,C)),B),C),D)) = mult(A,mult(mult(mult(ld(A,mult(mult(A,B),C)),B),C),D)). [para(18(a,2),10(a,2,2,1)),rewrite([66(7),21(14)]),flip(a)].
% 0.91/1.18 84 mult(mult(A,A),ld(A,ld(A,B))) = ld(A,ld(C,mult(mult(C,A),B))). [para(18(a,1),18(a,2,2))].
% 0.91/1.18 95 ld(A,ld(mult(B,A),mult(B,C))) = ld(mult(A,A),C). [para(26(a,1),2(a,1,2))].
% 0.91/1.18 96 mult(A,ld(mult(A,A),B)) = ld(C,mult(rd(C,A),B)). [para(3(a,1),26(a,2,1))].
% 0.91/1.18 199 rd(A,mult(B,ld(mult(B,B),C))) = mult(rd(A,C),B). [para(3(a,1),50(a,1,1))].
% 0.91/1.18 289 mult(mult(A,A),ld(A,ld(B,C))) = ld(rd(B,A),C). [para(3(a,1),60(a,1,2,2,1))].
% 0.91/1.18 318 ld(A,ld(B,mult(mult(B,A),C))) = ld(rd(A,A),C). [back_rewrite(84),rewrite([289(4)]),flip(a)].
% 0.91/1.18 383 mult(rd(ld(A,mult(mult(A,mult(B,C)),mult(B,D))),D),C) = mult(mult(B,C),mult(B,C)). [para(26(a,2),63(a,1,2)),rewrite([199(9)])].
% 0.91/1.18 461 mult(mult(A,ld(B,C)),D) = mult(A,ld(B,mult(C,D))). [para(1(a,1),66(a,1,2,2,1)),flip(a)].
% 0.91/1.18 475 mult(mult(A,B),ld(B,C)) = mult(A,ld(rd(B,B),C)). [para(18(a,1),66(a,1,2,2)),rewrite([318(4)]),flip(a)].
% 0.91/1.18 477 mult(A,ld(rd(A,A),B)) = ld(C,mult(mult(C,A),B)). [para(18(a,1),66(a,2)),rewrite([475(3),2(4)])].
% 0.91/1.18 478 mult(A,mult(B,ld(rd(B,B),C))) = mult(mult(A,B),C). [para(18(a,2),66(a,1,2)),rewrite([475(3)])].
% 0.91/1.18 543 mult(A,mult(mult(mult(ld(A,mult(mult(A,B),C)),B),C),D)) = mult(mult(A,B),mult(mult(mult(C,B),C),D)). [back_rewrite(78),rewrite([475(3),461(4),461(5),461(6),478(7)]),flip(a)].
% 0.91/1.18 547 rd(mult(mult(A,B),mult(mult(mult(C,B),C),D)),mult(B,ld(rd(B,B),mult(C,D)))) = mult(mult(A,B),C). [back_rewrite(56),rewrite([475(3),461(4),461(5),461(6),478(7),475(8),461(9)])].
% 0.91/1.18 639 ld(mult(ld(A,B),ld(A,B)),C) = ld(ld(A,B),ld(B,mult(A,C))). [para(1(a,1),95(a,1,2,1)),flip(a)].
% 0.91/1.18 657 mult(A,ld(mult(A,A),A)) = ld(B,B). [para(3(a,1),96(a,2,2))].
% 0.91/1.18 696 mult(A,ld(mult(A,A),A)) = c_0. [new_symbol(657)].
% 0.91/1.18 697 ld(A,A) = c_0. [back_rewrite(657),rewrite([696(3)]),flip(a)].
% 0.91/1.18 824 mult(A,c_0) = A. [para(697(a,1),1(a,1,2))].
% 0.91/1.18 827 ld(mult(A,A),A) = ld(A,c_0). [para(697(a,1),95(a,1,2)),flip(a)].
% 0.91/1.18 834 rd(A,ld(A,c_0)) = mult(A,A). [para(824(a,1),63(a,1,1,2)),rewrite([2(2)])].
% 0.91/1.18 900 mult(A,ld(rd(A,A),c_0)) = A. [para(827(a,1),1(a,1,2)),rewrite([475(4)])].
% 0.91/1.18 933 ld(A,mult(mult(A,A),B)) = ld(c_0,mult(A,B)). [para(834(a,1),96(a,2,2,1)),rewrite([639(8),1(9)]),flip(a)].
% 0.91/1.18 934 ld(rd(A,A),c_0) = c_0. [para(900(a,1),2(a,1,2)),rewrite([697(1)]),flip(a)].
% 0.91/1.18 935 rd(A,A) = c_0. [para(934(a,1),1(a,1,2)),rewrite([824(3)])].
% 0.91/1.18 972 rd(mult(mult(A,B),mult(mult(mult(C,B),C),D)),mult(B,ld(c_0,mult(C,D)))) = mult(mult(A,B),C). [back_rewrite(547),rewrite([935(6)])].
% 0.91/1.18 987 mult(A,mult(B,ld(c_0,C))) = mult(mult(A,B),C). [back_rewrite(478),rewrite([935(1)])].
% 0.91/1.18 988 ld(A,mult(mult(A,B),C)) = mult(B,ld(c_0,C)). [back_rewrite(477),rewrite([935(1)]),flip(a)].
% 0.91/1.18 1068 ld(c_0,mult(A,B)) = mult(A,ld(c_0,B)). [back_rewrite(933),rewrite([988(3)]),flip(a)].
% 0.91/1.18 1081 mult(mult(A,B),mult(mult(mult(C,B),C),D)) = mult(A,mult(mult(mult(mult(B,C),B),C),D)). [back_rewrite(543),rewrite([988(3),461(4),1068(3),987(4)]),flip(a)].
% 0.91/1.18 1093 mult(mult(mult(A,B),A),B) = mult(mult(A,B),mult(A,B)). [back_rewrite(383),rewrite([988(5),1068(4),987(5),4(4)])].
% 0.91/1.18 1223 mult(mult(A,B),C) = mult(A,mult(B,C)). [back_rewrite(972),rewrite([1081(5),1093(3),1068(8),987(9),15(8)]),flip(a)].
% 0.91/1.18 1224 $F # answer(goals). [resolve(1223,a,7,a)].
% 0.91/1.18
% 0.91/1.18 % SZS output end Refutation
% 0.91/1.18 ============================== end of proof ==========================
% 0.91/1.18
% 0.91/1.18 ============================== STATISTICS ============================
% 0.91/1.18
% 0.91/1.18 Given=40. Generated=2551. Kept=1222. proofs=1.
% 0.91/1.18 Usable=17. Sos=266. Demods=422. Limbo=155, Disabled=789. Hints=0.
% 0.91/1.18 Megabytes=1.70.
% 0.91/1.18 User_CPU=0.18, System_CPU=0.00, Wall_clock=0.
% 0.91/1.18
% 0.91/1.18 ============================== end of statistics =====================
% 0.91/1.18
% 0.91/1.18 ============================== end of search =========================
% 0.91/1.18
% 0.91/1.18 THEOREM PROVED
% 0.91/1.18 % SZS status Unsatisfiable
% 0.91/1.18
% 0.91/1.18 Exiting with 1 proof.
% 0.91/1.18
% 0.91/1.18 Process 17484 exit (max_proofs) Tue Jun 14 09:19:36 2022
% 0.91/1.18 Prover9 interrupted
%------------------------------------------------------------------------------