TSTP Solution File: GRP729-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP729-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:49 EDT 2022
% Result : Unsatisfiable 1.86s 2.13s
% Output : Refutation 1.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP729-1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n028.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 : Mon Jun 13 07:31:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.86/2.13 ============================== Prover9 ===============================
% 1.86/2.13 Prover9 (32) version 2009-11A, November 2009.
% 1.86/2.13 Process 7986 was started by sandbox2 on n028.cluster.edu,
% 1.86/2.13 Mon Jun 13 07:31:38 2022
% 1.86/2.13 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7833_n028.cluster.edu".
% 1.86/2.13 ============================== end of head ===========================
% 1.86/2.13
% 1.86/2.13 ============================== INPUT =================================
% 1.86/2.13
% 1.86/2.13 % Reading from file /tmp/Prover9_7833_n028.cluster.edu
% 1.86/2.13
% 1.86/2.13 set(prolog_style_variables).
% 1.86/2.13 set(auto2).
% 1.86/2.13 % set(auto2) -> set(auto).
% 1.86/2.13 % set(auto) -> set(auto_inference).
% 1.86/2.13 % set(auto) -> set(auto_setup).
% 1.86/2.13 % set(auto_setup) -> set(predicate_elim).
% 1.86/2.13 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.86/2.13 % set(auto) -> set(auto_limits).
% 1.86/2.13 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.86/2.13 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.86/2.13 % set(auto) -> set(auto_denials).
% 1.86/2.13 % set(auto) -> set(auto_process).
% 1.86/2.13 % set(auto2) -> assign(new_constants, 1).
% 1.86/2.13 % set(auto2) -> assign(fold_denial_max, 3).
% 1.86/2.13 % set(auto2) -> assign(max_weight, "200.000").
% 1.86/2.13 % set(auto2) -> assign(max_hours, 1).
% 1.86/2.13 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.86/2.13 % set(auto2) -> assign(max_seconds, 0).
% 1.86/2.13 % set(auto2) -> assign(max_minutes, 5).
% 1.86/2.13 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.86/2.13 % set(auto2) -> set(sort_initial_sos).
% 1.86/2.13 % set(auto2) -> assign(sos_limit, -1).
% 1.86/2.13 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.86/2.13 % set(auto2) -> assign(max_megs, 400).
% 1.86/2.13 % set(auto2) -> assign(stats, some).
% 1.86/2.13 % set(auto2) -> clear(echo_input).
% 1.86/2.13 % set(auto2) -> set(quiet).
% 1.86/2.13 % set(auto2) -> clear(print_initial_clauses).
% 1.86/2.13 % set(auto2) -> clear(print_given).
% 1.86/2.13 assign(lrs_ticks,-1).
% 1.86/2.13 assign(sos_limit,10000).
% 1.86/2.13 assign(order,kbo).
% 1.86/2.13 set(lex_order_vars).
% 1.86/2.13 clear(print_given).
% 1.86/2.13
% 1.86/2.13 % formulas(sos). % not echoed (23 formulas)
% 1.86/2.13
% 1.86/2.13 ============================== end of input ==========================
% 1.86/2.13
% 1.86/2.13 % From the command line: assign(max_seconds, 300).
% 1.86/2.13
% 1.86/2.13 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.86/2.13
% 1.86/2.13 % Formulas that are not ordinary clauses:
% 1.86/2.13
% 1.86/2.13 ============================== end of process non-clausal formulas ===
% 1.86/2.13
% 1.86/2.13 ============================== PROCESS INITIAL CLAUSES ===============
% 1.86/2.13
% 1.86/2.13 ============================== PREDICATE ELIMINATION =================
% 1.86/2.13
% 1.86/2.13 ============================== end predicate elimination =============
% 1.86/2.13
% 1.86/2.13 Auto_denials:
% 1.86/2.13 % copying label goals to answer in negative clause
% 1.86/2.13
% 1.86/2.13 Term ordering decisions:
% 1.86/2.13
% 1.86/2.13 % Assigning unary symbol i kb_weight 0 and highest precedence (14).
% 1.86/2.13 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.
% 1.86/2.13
% 1.86/2.13 ============================== end of process initial clauses ========
% 1.86/2.13
% 1.86/2.13 ============================== CLAUSES FOR SEARCH ====================
% 1.86/2.13
% 1.86/2.13 ============================== end of clauses for search =============
% 1.86/2.13
% 1.86/2.13 ============================== SEARCH ================================
% 1.86/2.13
% 1.86/2.13 % Starting search at 0.01 seconds.
% 1.86/2.13
% 1.86/2.13 ============================== PROOF =================================
% 1.86/2.13 % SZS status Unsatisfiable
% 1.86/2.13 % SZS output start Refutation
% 1.86/2.13
% 1.86/2.13 % Proof 1 at 1.13 (+ 0.02) seconds: goals.
% 1.86/2.13 % Length of proof is 21.
% 1.86/2.13 % Level of proof is 6.
% 1.86/2.13 % Maximum clause weight is 19.000.
% 1.86/2.13 % Given clauses 191.
% 1.86/2.13
% 1.86/2.13 1 mult(unit,A) = A # label(c01) # label(axiom). [assumption].
% 1.86/2.13 3 mult(A,i(A)) = unit # label(c03) # label(axiom). [assumption].
% 1.86/2.13 4 mult(i(A),A) = unit # label(c04) # label(axiom). [assumption].
% 1.86/2.13 5 rd(mult(A,B),B) = A # label(c07) # label(axiom). [assumption].
% 1.86/2.13 7 mult(i(A),mult(A,B)) = B # label(c06) # label(axiom). [assumption].
% 1.86/2.13 9 asoc(A,B,asoc(C,D,E)) = unit # label(c22) # label(axiom). [assumption].
% 1.86/2.13 10 i(mult(A,B)) = mult(i(A),i(B)) # label(c05) # label(axiom). [assumption].
% 1.86/2.13 12 mult(A,B) = mult(mult(B,A),op_k(A,B)) # label(c11) # label(axiom). [assumption].
% 1.86/2.13 13 mult(mult(A,B),op_k(B,A)) = mult(B,A). [copy(12),flip(a)].
% 1.86/2.13 30 mult(mult(A,B),C) = mult(mult(A,mult(B,C)),asoc(A,B,C)) # label(c10) # label(axiom). [assumption].
% 1.86/2.13 31 mult(mult(A,mult(B,C)),asoc(A,B,C)) = mult(mult(A,B),C). [copy(30),flip(a)].
% 1.86/2.13 32 asoc(a,b,op_k(c,d)) != unit # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 1.86/2.13 38 rd(unit,i(A)) = A. [para(3(a,1),5(a,1,1))].
% 1.86/2.13 39 rd(unit,A) = i(A). [para(4(a,1),5(a,1,1))].
% 1.86/2.13 40 i(i(A)) = A. [back_rewrite(38),rewrite([39(3)])].
% 1.86/2.13 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)])].
% 1.86/2.13 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)])].
% 1.86/2.13 392 mult(A,mult(i(A),B)) = B. [para(40(a,1),7(a,1,1))].
% 1.86/2.13 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)].
% 1.86/2.13 6974 asoc(A,B,op_k(C,D)) = unit. [para(6853(a,1),9(a,1,3))].
% 1.86/2.13 6975 $F # answer(goals). [resolve(6974,a,32,a)].
% 1.86/2.13
% 1.86/2.13 % SZS output end Refutation
% 1.86/2.13 ============================== end of proof ==========================
% 1.86/2.13
% 1.86/2.13 ============================== STATISTICS ============================
% 1.86/2.13
% 1.86/2.13 Given=191. Generated=19436. Kept=6965. proofs=1.
% 1.86/2.13 Usable=153. Sos=4938. Demods=4171. Limbo=2, Disabled=1894. Hints=0.
% 1.86/2.13 Megabytes=16.88.
% 1.86/2.13 User_CPU=1.13, System_CPU=0.02, Wall_clock=1.
% 1.86/2.13
% 1.86/2.13 ============================== end of statistics =====================
% 1.86/2.13
% 1.86/2.13 ============================== end of search =========================
% 1.86/2.13
% 1.86/2.13 THEOREM PROVED
% 1.86/2.13 % SZS status Unsatisfiable
% 1.86/2.13
% 1.86/2.13 Exiting with 1 proof.
% 1.86/2.13
% 1.86/2.13 Process 7986 exit (max_proofs) Mon Jun 13 07:31:39 2022
% 1.86/2.13 Prover9 interrupted
%------------------------------------------------------------------------------