TSTP Solution File: GRP700-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP700-10 : 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:40 EDT 2022
% Result : Unsatisfiable 0.51s 0.91s
% Output : Refutation 0.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP700-10 : TPTP v8.1.0. Released v8.1.0.
% 0.05/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 02:16:42 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.51/0.91 ============================== Prover9 ===============================
% 0.51/0.91 Prover9 (32) version 2009-11A, November 2009.
% 0.51/0.91 Process 12837 was started by sandbox2 on n032.cluster.edu,
% 0.51/0.91 Tue Jun 14 02:16:43 2022
% 0.51/0.91 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12683_n032.cluster.edu".
% 0.51/0.91 ============================== end of head ===========================
% 0.51/0.91
% 0.51/0.91 ============================== INPUT =================================
% 0.51/0.91
% 0.51/0.91 % Reading from file /tmp/Prover9_12683_n032.cluster.edu
% 0.51/0.91
% 0.51/0.91 set(prolog_style_variables).
% 0.51/0.91 set(auto2).
% 0.51/0.91 % set(auto2) -> set(auto).
% 0.51/0.91 % set(auto) -> set(auto_inference).
% 0.51/0.91 % set(auto) -> set(auto_setup).
% 0.51/0.91 % set(auto_setup) -> set(predicate_elim).
% 0.51/0.91 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.51/0.91 % set(auto) -> set(auto_limits).
% 0.51/0.91 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.51/0.91 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.51/0.91 % set(auto) -> set(auto_denials).
% 0.51/0.91 % set(auto) -> set(auto_process).
% 0.51/0.91 % set(auto2) -> assign(new_constants, 1).
% 0.51/0.91 % set(auto2) -> assign(fold_denial_max, 3).
% 0.51/0.91 % set(auto2) -> assign(max_weight, "200.000").
% 0.51/0.91 % set(auto2) -> assign(max_hours, 1).
% 0.51/0.91 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.51/0.91 % set(auto2) -> assign(max_seconds, 0).
% 0.51/0.91 % set(auto2) -> assign(max_minutes, 5).
% 0.51/0.91 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.51/0.91 % set(auto2) -> set(sort_initial_sos).
% 0.51/0.91 % set(auto2) -> assign(sos_limit, -1).
% 0.51/0.91 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.51/0.91 % set(auto2) -> assign(max_megs, 400).
% 0.51/0.91 % set(auto2) -> assign(stats, some).
% 0.51/0.91 % set(auto2) -> clear(echo_input).
% 0.51/0.91 % set(auto2) -> set(quiet).
% 0.51/0.91 % set(auto2) -> clear(print_initial_clauses).
% 0.51/0.91 % set(auto2) -> clear(print_given).
% 0.51/0.91 assign(lrs_ticks,-1).
% 0.51/0.91 assign(sos_limit,10000).
% 0.51/0.91 assign(order,kbo).
% 0.51/0.91 set(lex_order_vars).
% 0.51/0.91 clear(print_given).
% 0.51/0.91
% 0.51/0.91 % formulas(sos). % not echoed (9 formulas)
% 0.51/0.91
% 0.51/0.91 ============================== end of input ==========================
% 0.51/0.91
% 0.51/0.91 % From the command line: assign(max_seconds, 300).
% 0.51/0.91
% 0.51/0.91 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.51/0.91
% 0.51/0.91 % Formulas that are not ordinary clauses:
% 0.51/0.91
% 0.51/0.91 ============================== end of process non-clausal formulas ===
% 0.51/0.91
% 0.51/0.91 ============================== PROCESS INITIAL CLAUSES ===============
% 0.51/0.91
% 0.51/0.91 ============================== PREDICATE ELIMINATION =================
% 0.51/0.91
% 0.51/0.91 ============================== end predicate elimination =============
% 0.51/0.91
% 0.51/0.91 Auto_denials:
% 0.51/0.91 % copying label goal to answer in negative clause
% 0.51/0.91
% 0.51/0.91 Term ordering decisions:
% 0.51/0.91 Function symbol KB weights: unit=1. x0=1. mult=1. ld=1. rd=1. tuple=1.
% 0.51/0.91
% 0.51/0.91 ============================== end of process initial clauses ========
% 0.51/0.91
% 0.51/0.91 ============================== CLAUSES FOR SEARCH ====================
% 0.51/0.91
% 0.51/0.91 ============================== end of clauses for search =============
% 0.51/0.91
% 0.51/0.91 ============================== SEARCH ================================
% 0.51/0.91
% 0.51/0.91 % Starting search at 0.01 seconds.
% 0.51/0.91
% 0.51/0.91 ============================== PROOF =================================
% 0.51/0.91 % SZS status Unsatisfiable
% 0.51/0.91 % SZS output start Refutation
% 0.51/0.91
% 0.51/0.91 % Proof 1 at 0.14 (+ 0.00) seconds: goal.
% 0.51/0.91 % Length of proof is 22.
% 0.51/0.91 % Level of proof is 9.
% 0.51/0.91 % Maximum clause weight is 19.000.
% 0.51/0.91 % Given clauses 108.
% 0.51/0.91
% 0.51/0.91 1 mult(A,unit) = A # label(f05) # label(axiom). [assumption].
% 0.51/0.91 2 mult(unit,A) = A # label(f06) # label(axiom). [assumption].
% 0.51/0.91 3 mult(A,ld(A,B)) = B # label(f01) # label(axiom). [assumption].
% 0.51/0.91 4 ld(A,mult(A,B)) = B # label(f02) # label(axiom). [assumption].
% 0.51/0.91 6 rd(mult(A,B),B) = A # label(f04) # label(axiom). [assumption].
% 0.51/0.91 7 mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C)) # label(f07) # label(axiom). [assumption].
% 0.51/0.91 8 mult(mult(A,B),mult(B,mult(C,B))) = mult(mult(A,mult(B,mult(B,C))),B) # label(f08) # label(axiom). [assumption].
% 0.51/0.91 9 mult(mult(A,mult(B,mult(B,C))),B) = mult(mult(A,B),mult(B,mult(C,B))). [copy(8),flip(a)].
% 0.51/0.91 10 tuple(mult(A,x0),mult(x0,A)) != tuple(unit,unit) # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 0.51/0.91 15 rd(A,A) = unit. [para(2(a,1),6(a,1,1))].
% 0.51/0.91 16 rd(A,ld(B,A)) = B. [para(3(a,1),6(a,1,1))].
% 0.51/0.91 17 mult(mult(A,A),mult(A,B)) = mult(A,mult(mult(A,A),B)). [para(1(a,1),7(a,1,1,1)),rewrite([2(5)])].
% 0.51/0.91 24 rd(mult(A,mult(mult(mult(B,A),A),C)),mult(A,C)) = mult(mult(A,B),A). [para(7(a,1),6(a,1,1))].
% 0.51/0.91 28 mult(mult(A,mult(B,B)),B) = mult(mult(A,B),mult(B,B)). [para(1(a,1),9(a,1,1,2,2)),rewrite([2(6)])].
% 0.51/0.91 71 mult(A,mult(mult(A,A),ld(A,B))) = mult(mult(A,A),B). [para(3(a,1),17(a,1,2)),flip(a)].
% 0.51/0.91 176 ld(A,mult(mult(A,A),B)) = mult(mult(A,A),ld(A,B)). [para(71(a,1),4(a,1,2))].
% 0.51/0.91 476 mult(mult(A,A),ld(A,unit)) = A. [para(1(a,1),176(a,1,2)),rewrite([4(2)]),flip(a)].
% 0.51/0.91 645 mult(mult(ld(A,unit),mult(A,A)),ld(A,unit)) = unit. [para(476(a,1),24(a,1,1,2,1,1)),rewrite([3(5),2(4),15(7)]),flip(a)].
% 0.51/0.91 659 mult(ld(A,unit),mult(A,A)) = A. [para(645(a,1),6(a,1,1)),rewrite([16(4)]),flip(a)].
% 0.51/0.91 751 mult(mult(ld(A,unit),A),mult(A,A)) = mult(A,A). [para(659(a,1),28(a,1,1)),flip(a)].
% 0.51/0.91 901 mult(ld(A,unit),A) = unit. [para(751(a,1),6(a,1,1)),rewrite([15(3)]),flip(a)].
% 0.51/0.91 910 $F # answer(goal). [para(901(a,1),10(a,1,1)),rewrite([3(6)]),xx(a)].
% 0.51/0.91
% 0.51/0.91 % SZS output end Refutation
% 0.51/0.91 ============================== end of proof ==========================
% 0.51/0.91
% 0.51/0.91 ============================== STATISTICS ============================
% 0.51/0.91
% 0.51/0.91 Given=108. Generated=3183. Kept=908. proofs=1.
% 0.51/0.91 Usable=81. Sos=637. Demods=577. Limbo=4, Disabled=195. Hints=0.
% 0.51/0.91 Megabytes=2.08.
% 0.51/0.91 User_CPU=0.14, System_CPU=0.00, Wall_clock=0.
% 0.51/0.91
% 0.51/0.91 ============================== end of statistics =====================
% 0.51/0.91
% 0.51/0.91 ============================== end of search =========================
% 0.51/0.91
% 0.51/0.91 THEOREM PROVED
% 0.51/0.91 % SZS status Unsatisfiable
% 0.51/0.91
% 0.51/0.91 Exiting with 1 proof.
% 0.51/0.91
% 0.51/0.91 Process 12837 exit (max_proofs) Tue Jun 14 02:16:43 2022
% 0.51/0.91 Prover9 interrupted
%------------------------------------------------------------------------------