TSTP Solution File: GRP158-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GRP158-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n020.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:47 EDT 2022

% Result   : Unsatisfiable 0.77s 1.04s
% Output   : Refutation 0.77s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : GRP158-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.33  % Computer : n020.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jun 13 08:23:50 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.77/1.04  ============================== Prover9 ===============================
% 0.77/1.04  Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.04  Process 30679 was started by sandbox on n020.cluster.edu,
% 0.77/1.04  Mon Jun 13 08:23:50 2022
% 0.77/1.04  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30526_n020.cluster.edu".
% 0.77/1.04  ============================== end of head ===========================
% 0.77/1.04  
% 0.77/1.04  ============================== INPUT =================================
% 0.77/1.04  
% 0.77/1.04  % Reading from file /tmp/Prover9_30526_n020.cluster.edu
% 0.77/1.04  
% 0.77/1.04  set(prolog_style_variables).
% 0.77/1.04  set(auto2).
% 0.77/1.04      % set(auto2) -> set(auto).
% 0.77/1.04      % set(auto) -> set(auto_inference).
% 0.77/1.04      % set(auto) -> set(auto_setup).
% 0.77/1.04      % set(auto_setup) -> set(predicate_elim).
% 0.77/1.04      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.04      % set(auto) -> set(auto_limits).
% 0.77/1.04      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.04      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.04      % set(auto) -> set(auto_denials).
% 0.77/1.04      % set(auto) -> set(auto_process).
% 0.77/1.04      % set(auto2) -> assign(new_constants, 1).
% 0.77/1.04      % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.04      % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.04      % set(auto2) -> assign(max_hours, 1).
% 0.77/1.04      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.04      % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.04      % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.04      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.04      % set(auto2) -> set(sort_initial_sos).
% 0.77/1.04      % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.04      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.04      % set(auto2) -> assign(max_megs, 400).
% 0.77/1.04      % set(auto2) -> assign(stats, some).
% 0.77/1.04      % set(auto2) -> clear(echo_input).
% 0.77/1.04      % set(auto2) -> set(quiet).
% 0.77/1.04      % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.04      % set(auto2) -> clear(print_given).
% 0.77/1.04  assign(lrs_ticks,-1).
% 0.77/1.04  assign(sos_limit,10000).
% 0.77/1.04  assign(order,kbo).
% 0.77/1.04  set(lex_order_vars).
% 0.77/1.04  clear(print_given).
% 0.77/1.04  
% 0.77/1.04  % formulas(sos).  % not echoed (17 formulas)
% 0.77/1.04  
% 0.77/1.04  ============================== end of input ==========================
% 0.77/1.04  
% 0.77/1.04  % From the command line: assign(max_seconds, 300).
% 0.77/1.04  
% 0.77/1.04  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.04  
% 0.77/1.04  % Formulas that are not ordinary clauses:
% 0.77/1.04  
% 0.77/1.04  ============================== end of process non-clausal formulas ===
% 0.77/1.04  
% 0.77/1.04  ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.04  
% 0.77/1.04  ============================== PREDICATE ELIMINATION =================
% 0.77/1.04  
% 0.77/1.04  ============================== end predicate elimination =============
% 0.77/1.04  
% 0.77/1.04  Auto_denials:
% 0.77/1.04    % copying label prove_ax_mono2b to answer in negative clause
% 0.77/1.04  
% 0.77/1.04  Term ordering decisions:
% 0.77/1.04  
% 0.77/1.04  % Assigning unary symbol inverse kb_weight 0 and highest precedence (9).
% 0.77/1.04  Function symbol KB weights:  a=1. identity=1. b=1. c=1. multiply=1. greatest_lower_bound=1. least_upper_bound=1. inverse=0.
% 0.77/1.04  
% 0.77/1.04  ============================== PROOF =================================
% 0.77/1.04  % SZS status Unsatisfiable
% 0.77/1.04  % SZS output start Refutation
% 0.77/1.04  
% 0.77/1.04  % Proof 1 at 0.01 (+ 0.00) seconds: prove_ax_mono2b.
% 0.77/1.04  % Length of proof is 5.
% 0.77/1.04  % Level of proof is 2.
% 0.77/1.04  % Maximum clause weight is 13.000.
% 0.77/1.04  % Given clauses 0.
% 0.77/1.04  
% 0.77/1.04  4 greatest_lower_bound(a,b) = a # label(ax_mono2b_1) # label(hypothesis).  [assumption].
% 0.77/1.04  17 multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)) # label(monotony_glb1) # label(axiom).  [assumption].
% 0.77/1.04  18 greatest_lower_bound(multiply(A,B),multiply(A,C)) = multiply(A,greatest_lower_bound(B,C)).  [copy(17),flip(a)].
% 0.77/1.04  23 greatest_lower_bound(multiply(c,a),multiply(c,b)) != multiply(c,a) # label(prove_ax_mono2b) # label(negated_conjecture) # answer(prove_ax_mono2b).  [assumption].
% 0.77/1.04  24 $F # answer(prove_ax_mono2b).  [copy(23),rewrite([18(7),4(4)]),xx(a)].
% 0.77/1.04  
% 0.77/1.04  % SZS output end Refutation
% 0.77/1.04  ============================== end of proof ==========================
% 0.77/1.04  
% 0.77/1.04  ============================== STATISTICS ============================
% 0.77/1.04  
% 0.77/1.04  Given=0. Generated=17. Kept=16. proofs=1.
% 0.77/1.04  Usable=0. Sos=0. Demods=16. Limbo=16, Disabled=17. Hints=0.
% 0.77/1.04  Megabytes=0.03.
% 0.77/1.04  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.77/1.04  
% 0.77/1.04  ============================== end of statistics =====================
% 0.77/1.04  
% 0.77/1.04  ============================== end of search =========================
% 0.77/1.04  
% 0.77/1.04  THEOREM PROVED
% 0.77/1.04  % SZS status Unsatisfiable
% 0.77/1.04  
% 0.77/1.04  Exiting with 1 proof.
% 0.77/1.04  
% 0.77/1.04  Process 30679 exit (max_proofs) Mon Jun 13 08:23:50 2022
% 0.77/1.04  Prover9 interrupted
%------------------------------------------------------------------------------