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