TSTP Solution File: GRP685-11 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP685-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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.43s 1.02s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP685-11 : TPTP v8.1.0. Released v8.1.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n011.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 : Tue Jun 14 11:53:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.02 ============================== Prover9 ===============================
% 0.43/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.02 Process 9043 was started by sandbox on n011.cluster.edu,
% 0.43/1.02 Tue Jun 14 11:53:20 2022
% 0.43/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8889_n011.cluster.edu".
% 0.43/1.02 ============================== end of head ===========================
% 0.43/1.02
% 0.43/1.02 ============================== INPUT =================================
% 0.43/1.02
% 0.43/1.02 % Reading from file /tmp/Prover9_8889_n011.cluster.edu
% 0.43/1.02
% 0.43/1.02 set(prolog_style_variables).
% 0.43/1.02 set(auto2).
% 0.43/1.02 % set(auto2) -> set(auto).
% 0.43/1.02 % set(auto) -> set(auto_inference).
% 0.43/1.02 % set(auto) -> set(auto_setup).
% 0.43/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.02 % set(auto) -> set(auto_limits).
% 0.43/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.02 % set(auto) -> set(auto_denials).
% 0.43/1.02 % set(auto) -> set(auto_process).
% 0.43/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.02 % set(auto2) -> assign(stats, some).
% 0.43/1.02 % set(auto2) -> clear(echo_input).
% 0.43/1.02 % set(auto2) -> set(quiet).
% 0.43/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.02 % set(auto2) -> clear(print_given).
% 0.43/1.02 assign(lrs_ticks,-1).
% 0.43/1.02 assign(sos_limit,10000).
% 0.43/1.02 assign(order,kbo).
% 0.43/1.02 set(lex_order_vars).
% 0.43/1.02 clear(print_given).
% 0.43/1.02
% 0.43/1.02 % formulas(sos). % not echoed (8 formulas)
% 0.43/1.02
% 0.43/1.02 ============================== end of input ==========================
% 0.43/1.02
% 0.43/1.02 % From the command line: assign(max_seconds, 300).
% 0.43/1.02
% 0.43/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.02
% 0.43/1.02 % Formulas that are not ordinary clauses:
% 0.43/1.02
% 0.43/1.02 ============================== end of process non-clausal formulas ===
% 0.43/1.02
% 0.43/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.02
% 0.43/1.02 ============================== PREDICATE ELIMINATION =================
% 0.43/1.02
% 0.43/1.02 ============================== end predicate elimination =============
% 0.43/1.02
% 0.43/1.02 Auto_denials:
% 0.43/1.02 % copying label goal to answer in negative clause
% 0.43/1.02
% 0.43/1.02 Term ordering decisions:
% 0.43/1.02 Function symbol KB weights: x6=1. x7=1. x8=1. mult=1. ld=1. rd=1.
% 0.43/1.02
% 0.43/1.02 ============================== end of process initial clauses ========
% 0.43/1.02
% 0.43/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.02
% 0.43/1.02 ============================== end of clauses for search =============
% 0.43/1.02
% 0.43/1.02 ============================== SEARCH ================================
% 0.43/1.02
% 0.43/1.02 % Starting search at 0.01 seconds.
% 0.43/1.02
% 0.43/1.02 ============================== PROOF =================================
% 0.43/1.02 % SZS status Unsatisfiable
% 0.43/1.02 % SZS output start Refutation
% 0.43/1.02
% 0.43/1.02 % Proof 1 at 0.04 (+ 0.00) seconds: goal.
% 0.43/1.02 % Length of proof is 35.
% 0.43/1.02 % Level of proof is 11.
% 0.43/1.02 % Maximum clause weight is 23.000.
% 0.43/1.02 % Given clauses 32.
% 0.43/1.02
% 0.43/1.02 1 ld(A,mult(A,A)) = A # label(f01) # label(axiom). [assumption].
% 0.43/1.02 2 rd(mult(A,A),A) = A # label(f02) # label(axiom). [assumption].
% 0.43/1.02 3 mult(A,ld(A,B)) = ld(A,mult(A,B)) # label(f03) # label(axiom). [assumption].
% 0.43/1.02 4 ld(A,mult(A,B)) = mult(A,ld(A,B)). [copy(3),flip(a)].
% 0.43/1.02 5 mult(rd(A,B),B) = rd(mult(A,B),B) # label(f04) # label(axiom). [assumption].
% 0.43/1.02 6 rd(mult(A,B),B) = mult(rd(A,B),B). [copy(5),flip(a)].
% 0.43/1.02 7 ld(A,mult(A,ld(B,B))) = rd(mult(rd(A,A),B),B) # label(f07) # label(axiom). [assumption].
% 0.43/1.02 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.43/1.02 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.43/1.02 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.43/1.02 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.43/1.02 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.43/1.02 13 rd(mult(x6,rd(x7,x8)),rd(x7,x8)) != rd(mult(x6,x8),x8) # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 0.43/1.02 14 mult(rd(x6,rd(x7,x8)),rd(x7,x8)) != mult(rd(x6,x8),x8) # answer(goal). [copy(13),rewrite([6(9),6(14)])].
% 0.43/1.02 15 mult(A,ld(A,A)) = A. [back_rewrite(1),rewrite([4(2)])].
% 0.43/1.02 16 mult(rd(A,A),A) = A. [back_rewrite(2),rewrite([6(2)])].
% 0.43/1.02 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.43/1.02 33 mult(A,ld(A,ld(A,A))) = ld(A,A). [para(15(a,1),4(a,1,2)),flip(a)].
% 0.43/1.02 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.43/1.02 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.43/1.02 38 rd(A,A) = ld(A,A). [para(16(a,1),6(a,1,1)),rewrite([8(4),33(4)])].
% 0.43/1.02 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.43/1.02 48 mult(rd(ld(A,A),B),B) = mult(A,ld(A,ld(B,B))). [back_rewrite(8),rewrite([38(1)])].
% 0.43/1.02 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.43/1.02 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.43/1.02 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.43/1.02 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.43/1.02 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.43/1.02 102 mult(rd(A,rd(B,C)),rd(B,C)) = mult(A,ld(C,C)). [back_rewrite(49),rewrite([78(8)])].
% 0.43/1.02 111 mult(rd(x6,x8),x8) != mult(x6,ld(x8,x8)) # answer(goal). [back_rewrite(14),rewrite([102(9)]),flip(a)].
% 0.43/1.02 146 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.43/1.02 202 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.43/1.02 211 rd(A,ld(A,A)) = A. [back_rewrite(34),rewrite([202(4),15(2)]),flip(a)].
% 0.43/1.02 254 mult(rd(A,B),B) = mult(A,ld(B,B)). [para(211(a,1),102(a,1,1,2)),rewrite([211(3),146(5)])].
% 0.43/1.02 255 $F # answer(goal). [resolve(254,a,111,a)].
% 0.43/1.02
% 0.43/1.02 % SZS output end Refutation
% 0.43/1.02 ============================== end of proof ==========================
% 0.43/1.02
% 0.43/1.02 ============================== STATISTICS ============================
% 0.43/1.02
% 0.43/1.02 Given=32. Generated=639. Kept=248. proofs=1.
% 0.43/1.02 Usable=15. Sos=70. Demods=84. Limbo=0, Disabled=170. Hints=0.
% 0.43/1.02 Megabytes=0.37.
% 0.43/1.02 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.43/1.02
% 0.43/1.02 ============================== end of statistics =====================
% 0.43/1.02
% 0.43/1.02 ============================== end of search =========================
% 0.43/1.02
% 0.43/1.02 THEOREM PROVED
% 0.43/1.02 % SZS status Unsatisfiable
% 0.43/1.02
% 0.43/1.02 Exiting with 1 proof.
% 0.43/1.02
% 0.43/1.02 Process 9043 exit (max_proofs) Tue Jun 14 11:53:20 2022
% 0.43/1.02 Prover9 interrupted
%------------------------------------------------------------------------------