TSTP Solution File: NUM374+3 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : NUM374+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n008.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 : Mon Jul 18 13:27:00 EDT 2022

% Result   : Timeout 300.05s 300.43s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NUM374+3 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n008.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 : Wed Jul  6 12:37:23 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.41/0.96  ============================== Prover9 ===============================
% 0.41/0.96  Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.96  Process 20141 was started by sandbox2 on n008.cluster.edu,
% 0.41/0.96  Wed Jul  6 12:37:24 2022
% 0.41/0.96  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19988_n008.cluster.edu".
% 0.41/0.96  ============================== end of head ===========================
% 0.41/0.96  
% 0.41/0.96  ============================== INPUT =================================
% 0.41/0.96  
% 0.41/0.96  % Reading from file /tmp/Prover9_19988_n008.cluster.edu
% 0.41/0.96  
% 0.41/0.96  set(prolog_style_variables).
% 0.41/0.96  set(auto2).
% 0.41/0.96      % set(auto2) -> set(auto).
% 0.41/0.96      % set(auto) -> set(auto_inference).
% 0.41/0.96      % set(auto) -> set(auto_setup).
% 0.41/0.96      % set(auto_setup) -> set(predicate_elim).
% 0.41/0.96      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.96      % set(auto) -> set(auto_limits).
% 0.41/0.96      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.96      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.96      % set(auto) -> set(auto_denials).
% 0.41/0.96      % set(auto) -> set(auto_process).
% 0.41/0.96      % set(auto2) -> assign(new_constants, 1).
% 0.41/0.96      % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.96      % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.96      % set(auto2) -> assign(max_hours, 1).
% 0.41/0.96      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.96      % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.96      % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.96      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.96      % set(auto2) -> set(sort_initial_sos).
% 0.41/0.96      % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.96      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.96      % set(auto2) -> assign(max_megs, 400).
% 0.41/0.96      % set(auto2) -> assign(stats, some).
% 0.41/0.96      % set(auto2) -> clear(echo_input).
% 0.41/0.96      % set(auto2) -> set(quiet).
% 0.41/0.96      % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.96      % set(auto2) -> clear(print_given).
% 0.41/0.96  assign(lrs_ticks,-1).
% 0.41/0.96  assign(sos_limit,10000).
% 0.41/0.96  assign(order,kbo).
% 0.41/0.96  set(lex_order_vars).
% 0.41/0.96  clear(print_given).
% 0.41/0.96  
% 0.41/0.96  % formulas(sos).  % not echoed (13 formulas)
% 0.41/0.96  
% 0.41/0.96  ============================== end of input ==========================
% 0.41/0.96  
% 0.41/0.96  % From the command line: assign(max_seconds, 300).
% 0.41/0.96  
% 0.41/0.96  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.96  
% 0.41/0.96  % Formulas that are not ordinary clauses:
% 0.41/0.96  1 (all X all Y sum(X,Y) = sum(Y,X)) # label(sum_symmetry) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.96  2 (all X all Y all Z sum(X,sum(Y,Z)) = sum(sum(X,Y),Z)) # label(sum_associativity) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.96  3 (all X product(X,n1) = X) # label(product_identity) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.96  4 (all X all Y product(X,Y) = product(Y,X)) # label(product_symmetry) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.96  5 (all X all Y all Z product(X,product(Y,Z)) = product(product(X,Y),Z)) # label(product_associativity) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.96  6 (all X all Y all Z product(X,sum(Y,Z)) = sum(product(X,Y),product(X,Z))) # label(sum_product_distribution) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.96  7 (all X exponent(n1,X) = n1) # label(exponent_n1) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.96  8 (all X exponent(X,n1) = X) # label(exponent_identity) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.96  9 (all X all Y all Z exponent(X,sum(Y,Z)) = product(exponent(X,Y),exponent(X,Z))) # label(exponent_sum_product) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.96  10 (all X all Y all Z exponent(product(X,Y),Z) = product(exponent(X,Z),exponent(Y,Z))) # label(exponent_product_distribution) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.96  11 (all X all Y all Z exponent(exponent(X,Y),Z) = exponent(X,product(Y,Z))) # label(exponent_exponent) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.96  12 -(all C all P all Q all R all S all B (C = product(n0,n0) & P = sum(n1,n0) & Q = sum(P,C) & R = sum(n1,product(n0,C)) & S = sum(sum(n1,C),product(C,C)) -> product(exponent(sum(exponent(P,n0),exponent(Q,n0)),B),exponent(sum(exponent(R,B),exponent(S,B)),n0)) = product(exponent(sum(exponent(P,B),exponent(Q,B)),n0),exponent(sum(exponent(R,n0),exponent(S,n0)),B)))) # label(wilkie) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.41/0.96  
% 0.41/0.96  ===========================
% 0.41/0.96  WARNING: denials share constants (see output).
% 0.41/0.96  
% 300.05/300.43  Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------