TSTP Solution File: GRP731-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP731-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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:50 EDT 2022
% Result : Unsatisfiable 2.25s 2.56s
% Output : Refutation 2.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP731-1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 13 11:45:25 EDT 2022
% 0.14/0.34 % CPUTime :
% 2.25/2.56 ============================== Prover9 ===============================
% 2.25/2.56 Prover9 (32) version 2009-11A, November 2009.
% 2.25/2.56 Process 24036 was started by sandbox on n012.cluster.edu,
% 2.25/2.56 Mon Jun 13 11:45:26 2022
% 2.25/2.56 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23869_n012.cluster.edu".
% 2.25/2.56 ============================== end of head ===========================
% 2.25/2.56
% 2.25/2.56 ============================== INPUT =================================
% 2.25/2.56
% 2.25/2.56 % Reading from file /tmp/Prover9_23869_n012.cluster.edu
% 2.25/2.56
% 2.25/2.56 set(prolog_style_variables).
% 2.25/2.56 set(auto2).
% 2.25/2.56 % set(auto2) -> set(auto).
% 2.25/2.56 % set(auto) -> set(auto_inference).
% 2.25/2.56 % set(auto) -> set(auto_setup).
% 2.25/2.56 % set(auto_setup) -> set(predicate_elim).
% 2.25/2.56 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.25/2.56 % set(auto) -> set(auto_limits).
% 2.25/2.56 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.25/2.56 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.25/2.56 % set(auto) -> set(auto_denials).
% 2.25/2.56 % set(auto) -> set(auto_process).
% 2.25/2.56 % set(auto2) -> assign(new_constants, 1).
% 2.25/2.56 % set(auto2) -> assign(fold_denial_max, 3).
% 2.25/2.56 % set(auto2) -> assign(max_weight, "200.000").
% 2.25/2.56 % set(auto2) -> assign(max_hours, 1).
% 2.25/2.56 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.25/2.56 % set(auto2) -> assign(max_seconds, 0).
% 2.25/2.56 % set(auto2) -> assign(max_minutes, 5).
% 2.25/2.56 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.25/2.56 % set(auto2) -> set(sort_initial_sos).
% 2.25/2.56 % set(auto2) -> assign(sos_limit, -1).
% 2.25/2.56 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.25/2.56 % set(auto2) -> assign(max_megs, 400).
% 2.25/2.56 % set(auto2) -> assign(stats, some).
% 2.25/2.56 % set(auto2) -> clear(echo_input).
% 2.25/2.56 % set(auto2) -> set(quiet).
% 2.25/2.56 % set(auto2) -> clear(print_initial_clauses).
% 2.25/2.56 % set(auto2) -> clear(print_given).
% 2.25/2.56 assign(lrs_ticks,-1).
% 2.25/2.56 assign(sos_limit,10000).
% 2.25/2.56 assign(order,kbo).
% 2.25/2.56 set(lex_order_vars).
% 2.25/2.56 clear(print_given).
% 2.25/2.56
% 2.25/2.56 % formulas(sos). % not echoed (23 formulas)
% 2.25/2.56
% 2.25/2.56 ============================== end of input ==========================
% 2.25/2.56
% 2.25/2.56 % From the command line: assign(max_seconds, 300).
% 2.25/2.56
% 2.25/2.56 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.25/2.56
% 2.25/2.56 % Formulas that are not ordinary clauses:
% 2.25/2.56
% 2.25/2.56 ============================== end of process non-clausal formulas ===
% 2.25/2.56
% 2.25/2.56 ============================== PROCESS INITIAL CLAUSES ===============
% 2.25/2.56
% 2.25/2.56 ============================== PREDICATE ELIMINATION =================
% 2.25/2.56
% 2.25/2.56 ============================== end predicate elimination =============
% 2.25/2.56
% 2.25/2.56 Auto_denials:
% 2.25/2.56 % copying label goals to answer in negative clause
% 2.25/2.56
% 2.25/2.56 Term ordering decisions:
% 2.25/2.56
% 2.25/2.56 % Assigning unary symbol i kb_weight 0 and highest precedence (14).
% 2.25/2.56 Function symbol KB weights: unit=1. a=1. b=1. c=1. d=1. mult=1. op_t=1. rd=1. op_k=1. op_l=1. op_r=1. asoc=1. i=0.
% 2.25/2.56
% 2.25/2.56 ============================== end of process initial clauses ========
% 2.25/2.56
% 2.25/2.56 ============================== CLAUSES FOR SEARCH ====================
% 2.25/2.56
% 2.25/2.56 ============================== end of clauses for search =============
% 2.25/2.56
% 2.25/2.56 ============================== SEARCH ================================
% 2.25/2.56
% 2.25/2.56 % Starting search at 0.01 seconds.
% 2.25/2.56
% 2.25/2.56 ============================== PROOF =================================
% 2.25/2.56 % SZS status Unsatisfiable
% 2.25/2.56 % SZS output start Refutation
% 2.25/2.56
% 2.25/2.56 % Proof 1 at 1.54 (+ 0.02) seconds: goals.
% 2.25/2.56 % Length of proof is 40.
% 2.25/2.56 % Level of proof is 9.
% 2.25/2.56 % Maximum clause weight is 19.000.
% 2.25/2.56 % Given clauses 201.
% 2.25/2.56
% 2.25/2.56 1 mult(unit,A) = A # label(c01) # label(axiom). [assumption].
% 2.25/2.56 2 mult(A,unit) = A # label(c02) # label(axiom). [assumption].
% 2.25/2.56 3 mult(A,i(A)) = unit # label(c03) # label(axiom). [assumption].
% 2.25/2.56 4 mult(i(A),A) = unit # label(c04) # label(axiom). [assumption].
% 2.25/2.56 5 rd(mult(A,B),B) = A # label(c07) # label(axiom). [assumption].
% 2.25/2.56 6 mult(rd(A,B),B) = A # label(c08) # label(axiom). [assumption].
% 2.25/2.56 7 mult(i(A),mult(A,B)) = B # label(c06) # label(axiom). [assumption].
% 2.25/2.56 8 asoc(asoc(A,B,C),D,E) = unit # label(c21) # label(axiom). [assumption].
% 2.25/2.56 9 asoc(A,B,asoc(C,D,E)) = unit # label(c22) # label(axiom). [assumption].
% 2.25/2.56 10 i(mult(A,B)) = mult(i(A),i(B)) # label(c05) # label(axiom). [assumption].
% 2.25/2.56 12 mult(A,B) = mult(mult(B,A),op_k(A,B)) # label(c11) # label(axiom). [assumption].
% 2.25/2.56 13 mult(mult(A,B),op_k(B,A)) = mult(B,A). [copy(12),flip(a)].
% 2.25/2.56 30 mult(mult(A,B),C) = mult(mult(A,mult(B,C)),asoc(A,B,C)) # label(c10) # label(axiom). [assumption].
% 2.25/2.56 31 mult(mult(A,mult(B,C)),asoc(A,B,C)) = mult(mult(A,B),C). [copy(30),flip(a)].
% 2.25/2.56 32 op_k(asoc(a,b,c),d) != unit # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 2.25/2.56 38 rd(unit,i(A)) = A. [para(3(a,1),5(a,1,1))].
% 2.25/2.56 39 rd(unit,A) = i(A). [para(4(a,1),5(a,1,1))].
% 2.25/2.56 40 i(i(A)) = A. [back_rewrite(38),rewrite([39(3)])].
% 2.25/2.56 41 rd(A,mult(B,A)) = i(B). [para(7(a,1),5(a,1,1))].
% 2.25/2.56 47 mult(i(rd(A,B)),i(B)) = i(A). [para(6(a,1),10(a,1,1)),flip(a)].
% 2.25/2.56 54 rd(mult(A,B),op_k(A,B)) = mult(B,A). [para(13(a,1),5(a,1,1))].
% 2.25/2.56 56 mult(mult(i(A),i(B)),mult(B,A)) = op_k(B,A). [para(13(a,1),7(a,1,2)),rewrite([10(2)])].
% 2.25/2.56 211 mult(mult(i(A),mult(i(B),i(C))),mult(mult(A,B),C)) = asoc(A,B,C). [para(31(a,1),7(a,1,2)),rewrite([10(3),10(3)])].
% 2.25/2.56 213 mult(mult(asoc(A,B,C),D),E) = mult(asoc(A,B,C),mult(D,E)). [para(8(a,1),31(a,1,2)),rewrite([2(5)]),flip(a)].
% 2.25/2.56 392 mult(A,mult(i(A),B)) = B. [para(40(a,1),7(a,1,1))].
% 2.25/2.56 402 i(rd(A,B)) = rd(B,A). [para(6(a,1),41(a,1,2)),flip(a)].
% 2.25/2.56 424 mult(rd(A,B),i(A)) = i(B). [back_rewrite(47),rewrite([402(2)])].
% 2.25/2.56 472 mult(mult(A,B),mult(mult(i(A),i(B)),C)) = C. [para(10(a,1),392(a,1,2,1))].
% 2.25/2.56 596 mult(mult(A,B),mult(i(B),i(A))) = i(op_k(B,A)). [para(54(a,1),424(a,1,1)),rewrite([10(3)])].
% 2.25/2.56 897 mult(mult(A,i(B)),mult(B,i(A))) = op_k(B,i(A)). [para(40(a,1),56(a,1,1,1))].
% 2.25/2.56 909 op_k(mult(i(A),i(B)),mult(B,A)) = mult(op_k(A,B),op_k(B,A)). [para(56(a,1),56(a,1,2)),rewrite([10(2),10(7),40(5),40(5),56(5)]),flip(a)].
% 2.25/2.56 1506 i(op_k(A,B)) = op_k(i(A),i(B)). [para(13(a,1),472(a,1,2)),rewrite([596(5)])].
% 2.25/2.56 1611 mult(op_k(A,B),op_k(i(A),i(B))) = unit. [para(1506(a,1),3(a,1,2))].
% 2.25/2.56 6853 asoc(i(A),i(B),mult(B,A)) = op_k(B,A). [para(56(a,1),211(a,1,2)),rewrite([40(2),40(2),10(2),392(4),3(2),1(3)]),flip(a)].
% 2.25/2.56 6974 asoc(A,B,op_k(C,D)) = unit. [para(6853(a,1),9(a,1,3))].
% 2.25/2.56 6987 mult(op_k(A,B),op_k(B,A)) = unit. [para(56(a,1),6853(a,1,3)),rewrite([10(2),10(7),40(5),40(5),6974(6),909(6)]),flip(a)].
% 2.25/2.56 8424 op_k(A,i(asoc(B,C,D))) = unit. [para(213(a,1),897(a,1)),rewrite([7(6),3(4)]),flip(a)].
% 2.25/2.56 8832 op_k(A,asoc(B,C,D)) = unit. [para(8424(a,1),1611(a,1,2)),rewrite([2(4)])].
% 2.25/2.56 8866 op_k(asoc(A,B,C),D) = unit. [para(8832(a,1),6987(a,1,1)),rewrite([1(4)])].
% 2.25/2.56 8867 $F # answer(goals). [resolve(8866,a,32,a)].
% 2.25/2.56
% 2.25/2.56 % SZS output end Refutation
% 2.25/2.56 ============================== end of proof ==========================
% 2.25/2.56
% 2.25/2.56 ============================== STATISTICS ============================
% 2.25/2.56
% 2.25/2.56 Given=201. Generated=22767. Kept=8857. proofs=1.
% 2.25/2.56 Usable=132. Sos=4313. Demods=3561. Limbo=0, Disabled=4434. Hints=0.
% 2.25/2.56 Megabytes=18.40.
% 2.25/2.56 User_CPU=1.54, System_CPU=0.02, Wall_clock=2.
% 2.25/2.56
% 2.25/2.56 ============================== end of statistics =====================
% 2.25/2.56
% 2.25/2.56 ============================== end of search =========================
% 2.25/2.56
% 2.25/2.56 THEOREM PROVED
% 2.25/2.56 % SZS status Unsatisfiable
% 2.25/2.56
% 2.25/2.56 Exiting with 1 proof.
% 2.25/2.56
% 2.25/2.56 Process 24036 exit (max_proofs) Mon Jun 13 11:45:28 2022
% 2.25/2.56 Prover9 interrupted
%------------------------------------------------------------------------------