TSTP Solution File: GRP680-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP680-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:33 EDT 2022
% Result : Unsatisfiable 0.71s 1.00s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP680-1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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 07:37:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.00 ============================== Prover9 ===============================
% 0.71/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.00 Process 2552 was started by sandbox2 on n023.cluster.edu,
% 0.71/1.00 Tue Jun 14 07:37:21 2022
% 0.71/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2398_n023.cluster.edu".
% 0.71/1.00 ============================== end of head ===========================
% 0.71/1.00
% 0.71/1.00 ============================== INPUT =================================
% 0.71/1.00
% 0.71/1.00 % Reading from file /tmp/Prover9_2398_n023.cluster.edu
% 0.71/1.00
% 0.71/1.00 set(prolog_style_variables).
% 0.71/1.00 set(auto2).
% 0.71/1.00 % set(auto2) -> set(auto).
% 0.71/1.00 % set(auto) -> set(auto_inference).
% 0.71/1.00 % set(auto) -> set(auto_setup).
% 0.71/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.00 % set(auto) -> set(auto_limits).
% 0.71/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.00 % set(auto) -> set(auto_denials).
% 0.71/1.00 % set(auto) -> set(auto_process).
% 0.71/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.00 % set(auto2) -> assign(stats, some).
% 0.71/1.00 % set(auto2) -> clear(echo_input).
% 0.71/1.00 % set(auto2) -> set(quiet).
% 0.71/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.00 % set(auto2) -> clear(print_given).
% 0.71/1.00 assign(lrs_ticks,-1).
% 0.71/1.00 assign(sos_limit,10000).
% 0.71/1.00 assign(order,kbo).
% 0.71/1.00 set(lex_order_vars).
% 0.71/1.00 clear(print_given).
% 0.71/1.00
% 0.71/1.00 % formulas(sos). % not echoed (10 formulas)
% 0.71/1.00
% 0.71/1.00 ============================== end of input ==========================
% 0.71/1.00
% 0.71/1.00 % From the command line: assign(max_seconds, 300).
% 0.71/1.00
% 0.71/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.00
% 0.71/1.00 % Formulas that are not ordinary clauses:
% 0.71/1.00
% 0.71/1.00 ============================== end of process non-clausal formulas ===
% 0.71/1.00
% 0.71/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.00
% 0.71/1.00 ============================== PREDICATE ELIMINATION =================
% 0.71/1.00
% 0.71/1.00 ============================== end predicate elimination =============
% 0.71/1.00
% 0.71/1.00 Auto_denials:
% 0.71/1.00 % copying label goals to answer in negative clause
% 0.71/1.00
% 0.71/1.00 Term ordering decisions:
% 0.71/1.00
% 0.71/1.00 % Assigning unary symbol i kb_weight 0 and highest precedence (8).
% 0.71/1.00 Function symbol KB weights: op_c=1. unit=1. a=1. mult=1. ld=1. rd=1. i=0.
% 0.71/1.00
% 0.71/1.00 ============================== end of process initial clauses ========
% 0.71/1.00
% 0.71/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.00
% 0.71/1.00 ============================== end of clauses for search =============
% 0.71/1.00
% 0.71/1.00 ============================== SEARCH ================================
% 0.71/1.00
% 0.71/1.00 % Starting search at 0.01 seconds.
% 0.71/1.00
% 0.71/1.00 ============================== PROOF =================================
% 0.71/1.00 % SZS status Unsatisfiable
% 0.71/1.00 % SZS output start Refutation
% 0.71/1.00
% 0.71/1.00 % Proof 1 at 0.03 (+ 0.00) seconds: goals.
% 0.71/1.00 % Length of proof is 13.
% 0.71/1.00 % Level of proof is 4.
% 0.71/1.00 % Maximum clause weight is 15.000.
% 0.71/1.00 % Given clauses 41.
% 0.71/1.00
% 0.71/1.00 1 mult(A,unit) = A # label(c05) # label(axiom). [assumption].
% 0.71/1.00 3 mult(A,ld(A,B)) = B # label(c01) # label(axiom). [assumption].
% 0.71/1.00 7 mult(op_c,A) = mult(A,op_c) # label(c09) # label(axiom). [assumption].
% 0.71/1.00 8 mult(i(A),mult(A,B)) = B # label(c08) # label(axiom). [assumption].
% 0.71/1.00 9 mult(A,mult(B,mult(A,C))) = mult(mult(A,mult(B,A)),C) # label(c07) # label(axiom). [assumption].
% 0.71/1.00 10 mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))). [copy(9),flip(a)].
% 0.71/1.00 11 mult(i(op_c),a) != mult(a,i(op_c)) # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 0.71/1.00 21 mult(i(A),A) = unit. [para(1(a,1),8(a,1,2))].
% 0.71/1.00 23 ld(A,B) = mult(i(A),B). [para(3(a,1),8(a,1,2)),flip(a)].
% 0.71/1.00 29 mult(A,mult(i(A),B)) = B. [back_rewrite(3),rewrite([23(1)])].
% 0.71/1.00 33 mult(op_c,mult(A,mult(B,A))) = mult(A,mult(B,mult(A,op_c))). [para(10(a,1),7(a,2))].
% 0.71/1.00 157 mult(i(op_c),A) = mult(A,i(op_c)). [para(21(a,1),33(a,2,2,2)),rewrite([29(8),1(7)]),flip(a)].
% 0.71/1.00 158 $F # answer(goals). [resolve(157,a,11,a)].
% 0.71/1.00
% 0.71/1.00 % SZS output end Refutation
% 0.71/1.00 ============================== end of proof ==========================
% 0.71/1.00
% 0.71/1.00 ============================== STATISTICS ============================
% 0.71/1.00
% 0.71/1.00 Given=41. Generated=752. Kept=156. proofs=1.
% 0.71/1.00 Usable=34. Sos=72. Demods=104. Limbo=14, Disabled=45. Hints=0.
% 0.71/1.00 Megabytes=0.18.
% 0.71/1.00 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.71/1.00
% 0.71/1.00 ============================== end of statistics =====================
% 0.71/1.00
% 0.71/1.00 ============================== end of search =========================
% 0.71/1.00
% 0.71/1.00 THEOREM PROVED
% 0.71/1.00 % SZS status Unsatisfiable
% 0.71/1.00
% 0.71/1.00 Exiting with 1 proof.
% 0.71/1.00
% 0.71/1.00 Process 2552 exit (max_proofs) Tue Jun 14 07:37:21 2022
% 0.71/1.00 Prover9 interrupted
%------------------------------------------------------------------------------