TSTP Solution File: GRP043-2 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GRP043-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n021.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:16:55 EDT 2022

% Result   : Unsatisfiable 0.73s 0.99s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP043-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.32  % Computer : n021.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit : 300
% 0.13/0.32  % WCLimit  : 600
% 0.13/0.32  % DateTime : Mon Jun 13 17:29:57 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.73/0.99  ============================== Prover9 ===============================
% 0.73/0.99  Prover9 (32) version 2009-11A, November 2009.
% 0.73/0.99  Process 28236 was started by sandbox on n021.cluster.edu,
% 0.73/0.99  Mon Jun 13 17:29:57 2022
% 0.73/0.99  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27939_n021.cluster.edu".
% 0.73/0.99  ============================== end of head ===========================
% 0.73/0.99  
% 0.73/0.99  ============================== INPUT =================================
% 0.73/0.99  
% 0.73/0.99  % Reading from file /tmp/Prover9_27939_n021.cluster.edu
% 0.73/0.99  
% 0.73/0.99  set(prolog_style_variables).
% 0.73/0.99  set(auto2).
% 0.73/0.99      % set(auto2) -> set(auto).
% 0.73/0.99      % set(auto) -> set(auto_inference).
% 0.73/0.99      % set(auto) -> set(auto_setup).
% 0.73/0.99      % set(auto_setup) -> set(predicate_elim).
% 0.73/0.99      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/0.99      % set(auto) -> set(auto_limits).
% 0.73/0.99      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/0.99      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/0.99      % set(auto) -> set(auto_denials).
% 0.73/0.99      % set(auto) -> set(auto_process).
% 0.73/0.99      % set(auto2) -> assign(new_constants, 1).
% 0.73/0.99      % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/0.99      % set(auto2) -> assign(max_weight, "200.000").
% 0.73/0.99      % set(auto2) -> assign(max_hours, 1).
% 0.73/0.99      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/0.99      % set(auto2) -> assign(max_seconds, 0).
% 0.73/0.99      % set(auto2) -> assign(max_minutes, 5).
% 0.73/0.99      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/0.99      % set(auto2) -> set(sort_initial_sos).
% 0.73/0.99      % set(auto2) -> assign(sos_limit, -1).
% 0.73/0.99      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/0.99      % set(auto2) -> assign(max_megs, 400).
% 0.73/0.99      % set(auto2) -> assign(stats, some).
% 0.73/0.99      % set(auto2) -> clear(echo_input).
% 0.73/0.99      % set(auto2) -> set(quiet).
% 0.73/0.99      % set(auto2) -> clear(print_initial_clauses).
% 0.73/0.99      % set(auto2) -> clear(print_given).
% 0.73/0.99  assign(lrs_ticks,-1).
% 0.73/0.99  assign(sos_limit,10000).
% 0.73/0.99  assign(order,kbo).
% 0.73/0.99  set(lex_order_vars).
% 0.73/0.99  clear(print_given).
% 0.73/0.99  
% 0.73/0.99  % formulas(sos).  % not echoed (10 formulas)
% 0.73/0.99  
% 0.73/0.99  ============================== end of input ==========================
% 0.73/0.99  
% 0.73/0.99  % From the command line: assign(max_seconds, 300).
% 0.73/0.99  
% 0.73/0.99  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/0.99  
% 0.73/0.99  % Formulas that are not ordinary clauses:
% 0.73/0.99  
% 0.73/0.99  ============================== end of process non-clausal formulas ===
% 0.73/0.99  
% 0.73/0.99  ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/0.99  
% 0.73/0.99  ============================== PREDICATE ELIMINATION =================
% 0.73/0.99  1 -equalish(a,c) # label(prove_transitivity) # label(negated_conjecture).  [assumption].
% 0.73/0.99  2 equalish(a,b) # label(a_equals_b) # label(hypothesis).  [assumption].
% 0.73/0.99  3 equalish(b,c) # label(b_equals_c) # label(hypothesis).  [assumption].
% 0.73/0.99  4 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(total_function2) # label(axiom).  [assumption].
% 0.73/0.99  Derived: -product(A,B,a) | -product(A,B,c).  [resolve(4,c,1,a)].
% 0.73/0.99  5 -equalish(A,B) | -product(C,D,A) | product(C,D,B) # label(product_substitution3) # label(axiom).  [assumption].
% 0.73/0.99  Derived: -product(A,B,a) | product(A,B,b).  [resolve(5,a,2,a)].
% 0.73/0.99  Derived: -product(A,B,b) | product(A,B,c).  [resolve(5,a,3,a)].
% 0.73/0.99  Derived: -product(A,B,C) | product(A,B,D) | -product(E,F,C) | -product(E,F,D).  [resolve(5,a,4,c)].
% 0.73/0.99  
% 0.73/0.99  ============================== end predicate elimination =============
% 0.73/0.99  
% 0.73/0.99  Auto_denials:  (no changes).
% 0.73/0.99  
% 0.73/0.99  Term ordering decisions:
% 0.73/0.99  
% 0.73/0.99  % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.73/0.99  Function symbol KB weights:  b=1. identity=1. a=1. c=1. multiply=1. inverse=0.
% 0.73/0.99  
% 0.73/0.99  ============================== end of process initial clauses ========
% 0.73/0.99  
% 0.73/0.99  ============================== CLAUSES FOR SEARCH ====================
% 0.73/0.99  
% 0.73/0.99  ============================== end of clauses for search =============
% 0.73/0.99  
% 0.73/0.99  ============================== SEARCH ================================
% 0.73/0.99  
% 0.73/0.99  % Starting search at 0.01 seconds.
% 0.73/0.99  
% 0.73/0.99  ============================== PROOF =================================
% 0.73/0.99  % SZS status Unsatisfiable
% 0.73/0.99  % SZS output start Refutation
% 0.73/0.99  
% 0.73/0.99  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.73/0.99  % Length of proof is 12.
% 0.73/0.99  % Level of proof is 3.
% 0.73/0.99  % Maximum clause weight is 8.000.
% 0.73/0.99  % Given clauses 11.
% 0.73/0.99  
% 0.73/0.99  1 -equalish(a,c) # label(prove_transitivity) # label(negated_conjecture).  [assumption].
% 0.73/0.99  2 equalish(a,b) # label(a_equals_b) # label(hypothesis).  [assumption].
% 0.73/0.99  3 equalish(b,c) # label(b_equals_c) # label(hypothesis).  [assumption].
% 0.73/0.99  4 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(total_function2) # label(axiom).  [assumption].
% 0.73/0.99  5 -equalish(A,B) | -product(C,D,A) | product(C,D,B) # label(product_substitution3) # label(axiom).  [assumption].
% 0.73/0.99  6 product(identity,A,A) # label(left_identity) # label(axiom).  [assumption].
% 0.73/0.99  11 -product(A,B,a) | -product(A,B,c).  [resolve(4,c,1,a)].
% 0.73/0.99  12 -product(A,B,a) | product(A,B,b).  [resolve(5,a,2,a)].
% 0.73/0.99  13 -product(A,B,b) | product(A,B,c).  [resolve(5,a,3,a)].
% 0.73/0.99  43 -product(identity,a,c).  [resolve(11,a,6,a)].
% 0.73/0.99  45 product(identity,a,b).  [ur(12,a,6,a)].
% 0.73/0.99  91 $F.  [resolve(43,a,13,b),unit_del(a,45)].
% 0.73/0.99  
% 0.73/0.99  % SZS output end Refutation
% 0.73/0.99  ============================== end of proof ==========================
% 0.73/0.99  
% 0.73/0.99  ============================== STATISTICS ============================
% 0.73/0.99  
% 0.73/0.99  Given=11. Generated=168. Kept=85. proofs=1.
% 0.73/0.99  Usable=11. Sos=73. Demods=0. Limbo=1, Disabled=14. Hints=0.
% 0.73/0.99  Megabytes=0.09.
% 0.73/0.99  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.73/0.99  
% 0.73/0.99  ============================== end of statistics =====================
% 0.73/0.99  
% 0.73/0.99  ============================== end of search =========================
% 0.73/0.99  
% 0.73/0.99  THEOREM PROVED
% 0.73/0.99  % SZS status Unsatisfiable
% 0.73/0.99  
% 0.73/0.99  Exiting with 1 proof.
% 0.73/0.99  
% 0.73/0.99  Process 28236 exit (max_proofs) Mon Jun 13 17:29:57 2022
% 0.73/0.99  Prover9 interrupted
%------------------------------------------------------------------------------