TSTP Solution File: KLE182+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : KLE182+1 : TPTP v8.1.0. Released v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n009.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 : Sun Jul 17 02:22:40 EDT 2022

% Result   : Timeout 300.01s 300.72s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : KLE182+1 : TPTP v8.1.0. Released v6.4.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n009.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 : Thu Jun 16 11:53:22 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.42/0.97  ============================== Prover9 ===============================
% 0.42/0.97  Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.97  Process 32136 was started by sandbox on n009.cluster.edu,
% 0.42/0.97  Thu Jun 16 11:53:23 2022
% 0.42/0.97  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31983_n009.cluster.edu".
% 0.42/0.97  ============================== end of head ===========================
% 0.42/0.97  
% 0.42/0.97  ============================== INPUT =================================
% 0.42/0.97  
% 0.42/0.97  % Reading from file /tmp/Prover9_31983_n009.cluster.edu
% 0.42/0.97  
% 0.42/0.97  set(prolog_style_variables).
% 0.42/0.97  set(auto2).
% 0.42/0.97      % set(auto2) -> set(auto).
% 0.42/0.97      % set(auto) -> set(auto_inference).
% 0.42/0.97      % set(auto) -> set(auto_setup).
% 0.42/0.97      % set(auto_setup) -> set(predicate_elim).
% 0.42/0.97      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.97      % set(auto) -> set(auto_limits).
% 0.42/0.97      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.97      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.97      % set(auto) -> set(auto_denials).
% 0.42/0.97      % set(auto) -> set(auto_process).
% 0.42/0.97      % set(auto2) -> assign(new_constants, 1).
% 0.42/0.97      % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.97      % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.97      % set(auto2) -> assign(max_hours, 1).
% 0.42/0.97      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.97      % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.97      % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.97      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.97      % set(auto2) -> set(sort_initial_sos).
% 0.42/0.97      % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.97      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.97      % set(auto2) -> assign(max_megs, 400).
% 0.42/0.97      % set(auto2) -> assign(stats, some).
% 0.42/0.97      % set(auto2) -> clear(echo_input).
% 0.42/0.97      % set(auto2) -> set(quiet).
% 0.42/0.97      % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.97      % set(auto2) -> clear(print_given).
% 0.42/0.97  assign(lrs_ticks,-1).
% 0.42/0.97  assign(sos_limit,10000).
% 0.42/0.97  assign(order,kbo).
% 0.42/0.97  set(lex_order_vars).
% 0.42/0.97  clear(print_given).
% 0.42/0.97  
% 0.42/0.97  % formulas(sos).  % not echoed (18 formulas)
% 0.42/0.97  
% 0.42/0.97  ============================== end of input ==========================
% 0.42/0.97  
% 0.42/0.97  % From the command line: assign(max_seconds, 300).
% 0.42/0.97  
% 0.42/0.97  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.97  
% 0.42/0.97  % Formulas that are not ordinary clauses:
% 0.42/0.97  1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  2 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  4 (all A addition(A,A) = A) # label(idempotence) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  5 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  8 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(distributivity1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(distributivity2) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  10 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  11 (all A addition(one,multiplication(A,star(A))) = star(A)) # label(star_unfold1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  12 (all A addition(one,multiplication(star(A),A)) = star(A)) # label(star_unfold2) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  13 (all A all B all C (leq(addition(multiplication(A,C),B),C) -> leq(multiplication(star(A),B),C))) # label(star_induction1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/0.97  14 (all A all B all C (leq(addition(multiplication(C,A),B),C) -> leq(multiplication(B,star(A)),C))Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------