TSTP Solution File: GRP135-1.002 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP135-1.002 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:17:40 EDT 2022
% Result : Unsatisfiable 0.44s 1.01s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP135-1.002 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n017.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 20:12:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.01 ============================== Prover9 ===============================
% 0.44/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01 Process 4455 was started by sandbox2 on n017.cluster.edu,
% 0.44/1.01 Mon Jun 13 20:12:54 2022
% 0.44/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4074_n017.cluster.edu".
% 0.44/1.01 ============================== end of head ===========================
% 0.44/1.01
% 0.44/1.01 ============================== INPUT =================================
% 0.44/1.01
% 0.44/1.01 % Reading from file /tmp/Prover9_4074_n017.cluster.edu
% 0.44/1.01
% 0.44/1.01 set(prolog_style_variables).
% 0.44/1.01 set(auto2).
% 0.44/1.01 % set(auto2) -> set(auto).
% 0.44/1.01 % set(auto) -> set(auto_inference).
% 0.44/1.01 % set(auto) -> set(auto_setup).
% 0.44/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01 % set(auto) -> set(auto_limits).
% 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01 % set(auto) -> set(auto_denials).
% 0.44/1.01 % set(auto) -> set(auto_process).
% 0.44/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01 % set(auto2) -> assign(stats, some).
% 0.44/1.01 % set(auto2) -> clear(echo_input).
% 0.44/1.01 % set(auto2) -> set(quiet).
% 0.44/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01 % set(auto2) -> clear(print_given).
% 0.44/1.01 assign(lrs_ticks,-1).
% 0.44/1.01 assign(sos_limit,10000).
% 0.44/1.01 assign(order,kbo).
% 0.44/1.01 set(lex_order_vars).
% 0.44/1.01 clear(print_given).
% 0.44/1.01
% 0.44/1.01 % formulas(sos). % not echoed (9 formulas)
% 0.44/1.01
% 0.44/1.01 ============================== end of input ==========================
% 0.44/1.01
% 0.44/1.01 % From the command line: assign(max_seconds, 300).
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01
% 0.44/1.01 % Formulas that are not ordinary clauses:
% 0.44/1.01
% 0.44/1.01 ============================== end of process non-clausal formulas ===
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.01
% 0.44/1.01 ============================== PREDICATE ELIMINATION =================
% 0.44/1.01 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.44/1.01 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.44/1.01 3 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.44/1.01 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(1,c,2,a)].
% 0.44/1.01 4 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.44/1.01 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(4,c,2,a)].
% 0.44/1.01 5 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.44/1.01 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(5,c,2,a)].
% 0.44/1.01
% 0.44/1.01 ============================== end predicate elimination =============
% 0.44/1.01
% 0.44/1.01 Auto_denials: (non-Horn, no changes).
% 0.44/1.01
% 0.44/1.01 Term ordering decisions:
% 0.44/1.01 Function symbol KB weights: e_1=1. e_2=1.
% 0.44/1.01
% 0.44/1.01 ============================== end of process initial clauses ========
% 0.44/1.01
% 0.44/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.01
% 0.44/1.01 ============================== end of clauses for search =============
% 0.44/1.01
% 0.44/1.01 ============================== SEARCH ================================
% 0.44/1.01
% 0.44/1.01 % Starting search at 0.01 seconds.
% 0.44/1.01
% 0.44/1.01 ============================== PROOF =================================
% 0.44/1.01 % SZS status Unsatisfiable
% 0.44/1.01 % SZS output start Refutation
% 0.44/1.01
% 0.44/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/1.01 % Length of proof is 26.
% 0.44/1.01 % Level of proof is 8.
% 0.44/1.01 % Maximum clause weight is 12.000.
% 0.44/1.01 % Given clauses 26.
% 0.44/1.01
% 0.44/1.01 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.44/1.01 4 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.44/1.01 5 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.44/1.01 6 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.44/1.01 7 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.44/1.01 8 -group_element(A) | -group_element(B) | product(A,B,e_1) | product(A,B,e_2) # label(product_total_function1) # label(axiom). [assumption].
% 0.44/1.01 9 -product(A,B,C) | -product(C,A,D) | product(D,A,B) # label(qg3) # label(negated_conjecture). [assumption].
% 0.44/1.01 11 -product(A,e_1,B) | -product(A,e_2,B). [resolve(4,c,2,a)].
% 0.44/1.01 12 -product(e_1,A,B) | -product(e_2,A,B). [resolve(5,c,2,a)].
% 0.44/1.01 13 -group_element(A) | product(A,A,e_1) | product(A,A,e_2). [factor(8,a,b)].
% 0.44/1.01 14 -group_element(A) | product(e_2,A,e_1) | product(e_2,A,e_2). [resolve(8,a,7,a)].
% 0.44/1.01 18 product(e_2,e_2,e_1) | product(e_2,e_2,e_2). [resolve(13,a,7,a)].
% 0.44/1.01 19 product(e_1,e_1,e_1) | product(e_1,e_1,e_2). [resolve(13,a,6,a)].
% 0.44/1.01 20 product(e_2,e_1,e_1) | product(e_2,e_1,e_2). [resolve(14,a,6,a)].
% 0.44/1.01 22 product(e_2,e_2,e_1) | -product(e_2,e_1,e_2). [resolve(18,b,11,b)].
% 0.44/1.01 26 product(e_1,e_1,e_1) | -product(e_2,e_1,A) | product(A,e_1,e_1). [resolve(19,b,9,a)].
% 0.44/1.01 27 product(e_1,e_1,e_1) | -product(e_2,e_1,e_1). [factor(26,a,c)].
% 0.44/1.01 28 product(e_2,e_1,e_1) | -product(e_1,e_1,e_2). [resolve(20,b,12,b)].
% 0.44/1.01 32 product(e_2,e_2,e_1) | product(e_2,e_1,e_1). [resolve(22,b,20,b)].
% 0.44/1.01 33 product(e_2,e_1,e_1) | product(e_1,e_1,e_1). [resolve(28,b,19,b)].
% 0.44/1.01 41 product(e_1,e_1,e_1). [resolve(33,a,27,b),merge(b)].
% 0.44/1.01 44 -product(e_2,e_1,e_1). [ur(12,a,41,a)].
% 0.44/1.01 45 -product(e_1,e_2,e_1). [ur(11,a,41,a)].
% 0.44/1.01 49 product(e_2,e_2,e_1). [back_unit_del(32),unit_del(b,44)].
% 0.44/1.01 52 product(e_2,e_1,e_2). [back_unit_del(20),unit_del(a,44)].
% 0.44/1.01 57 $F. [ur(9,b,49,a,c,45,a),unit_del(a,52)].
% 0.44/1.01
% 0.44/1.01 % SZS output end Refutation
% 0.44/1.01 ============================== end of proof ==========================
% 0.44/1.01
% 0.44/1.01 ============================== STATISTICS ============================
% 0.44/1.01
% 0.44/1.01 Given=26. Generated=79. Kept=51. proofs=1.
% 0.44/1.01 Usable=16. Sos=12. Demods=0. Limbo=0, Disabled=35. Hints=0.
% 0.44/1.01 Megabytes=0.05.
% 0.44/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/1.01
% 0.44/1.01 ============================== end of statistics =====================
% 0.44/1.01
% 0.44/1.01 ============================== end of search =========================
% 0.44/1.01
% 0.44/1.01 THEOREM PROVED
% 0.44/1.01 % SZS status Unsatisfiable
% 0.44/1.01
% 0.44/1.01 Exiting with 1 proof.
% 0.44/1.01
% 0.44/1.01 Process 4455 exit (max_proofs) Mon Jun 13 20:12:54 2022
% 0.44/1.01 Prover9 interrupted
%------------------------------------------------------------------------------