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

View Problem - Process Solution

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

% Computer : n016.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 : Wed Jul 20 21:13:14 EDT 2022

% Result   : Timeout 300.04s 300.37s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV486+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n016.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 : Wed Jun 15 06:41:17 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.73/1.00  ============================== Prover9 ===============================
% 0.73/1.00  Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.00  Process 13190 was started by sandbox on n016.cluster.edu,
% 0.73/1.00  Wed Jun 15 06:41:17 2022
% 0.73/1.00  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12966_n016.cluster.edu".
% 0.73/1.00  ============================== end of head ===========================
% 0.73/1.00  
% 0.73/1.00  ============================== INPUT =================================
% 0.73/1.00  
% 0.73/1.00  % Reading from file /tmp/Prover9_12966_n016.cluster.edu
% 0.73/1.00  
% 0.73/1.00  set(prolog_style_variables).
% 0.73/1.00  set(auto2).
% 0.73/1.00      % set(auto2) -> set(auto).
% 0.73/1.00      % set(auto) -> set(auto_inference).
% 0.73/1.00      % set(auto) -> set(auto_setup).
% 0.73/1.00      % set(auto_setup) -> set(predicate_elim).
% 0.73/1.00      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.00      % set(auto) -> set(auto_limits).
% 0.73/1.00      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.00      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.00      % set(auto) -> set(auto_denials).
% 0.73/1.00      % set(auto) -> set(auto_process).
% 0.73/1.00      % set(auto2) -> assign(new_constants, 1).
% 0.73/1.00      % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.00      % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.00      % set(auto2) -> assign(max_hours, 1).
% 0.73/1.00      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.00      % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.00      % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.00      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.00      % set(auto2) -> set(sort_initial_sos).
% 0.73/1.00      % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.00      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.00      % set(auto2) -> assign(max_megs, 400).
% 0.73/1.00      % set(auto2) -> assign(stats, some).
% 0.73/1.00      % set(auto2) -> clear(echo_input).
% 0.73/1.00      % set(auto2) -> set(quiet).
% 0.73/1.00      % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.00      % set(auto2) -> clear(print_given).
% 0.73/1.00  assign(lrs_ticks,-1).
% 0.73/1.00  assign(sos_limit,10000).
% 0.73/1.00  assign(order,kbo).
% 0.73/1.00  set(lex_order_vars).
% 0.73/1.00  clear(print_given).
% 0.73/1.00  
% 0.73/1.00  % formulas(sos).  % not echoed (13 formulas)
% 0.73/1.00  
% 0.73/1.00  ============================== end of input ==========================
% 0.73/1.00  
% 0.73/1.00  % From the command line: assign(max_seconds, 300).
% 0.73/1.00  
% 0.73/1.00  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.00  
% 0.73/1.00  % Formulas that are not ordinary clauses:
% 0.73/1.00  1 (all I all J (int_leq(I,J) <-> int_less(I,J) | I = J)) # label(int_leq) # label(axiom) # label(non_clause).  [assumption].
% 0.73/1.00  2 (all I all J all K (int_less(I,J) & int_less(J,K) -> int_less(I,K))) # label(int_less_transitive) # label(axiom) # label(non_clause).  [assumption].
% 0.73/1.00  3 (all I all J (int_less(I,J) -> I != J)) # label(int_less_irreflexive) # label(axiom) # label(non_clause).  [assumption].
% 0.73/1.00  4 (all I all J (int_less(I,J) | int_leq(J,I))) # label(int_less_total) # label(axiom) # label(non_clause).  [assumption].
% 0.73/1.00  5 (all I all J plus(I,J) = plus(J,I)) # label(plus_commutative) # label(axiom) # label(non_clause).  [assumption].
% 0.73/1.00  6 (all I plus(I,int_zero) = I) # label(plus_zero) # label(axiom) # label(non_clause).  [assumption].
% 0.73/1.00  7 (all I1 all J1 all I2 all J2 (int_less(I1,J1) & int_leq(I2,J2) -> int_leq(plus(I1,I2),plus(J1,J2)))) # label(plus_and_order1) # label(axiom) # label(non_clause).  [assumption].
% 0.73/1.00  8 (all I all J (int_less(I,J) <-> (exists K (plus(I,K) = J & int_less(int_zero,K))))) # label(plus_and_inverse) # label(axiom) # label(non_clause).  [assumption].
% 0.73/1.00  9 (all I (int_less(int_zero,I) <-> int_leq(int_one,I))) # label(one_successor_of_zero) # label(axiom) # label(non_clause).  [assumption].
% 0.73/1.00  10 (all I all J (int_leq(int_one,I) & int_leq(I,n) & int_leq(int_one,J) & int_leq(J,n) -> (all C (int_less(int_zero,C) & I = plus(J,C) -> (all K (int_leq(int_one,K) & int_leq(K,J) -> a(plus(K,C),K) = real_zero)))) & (all K (int_leq(int_one,K) & int_leq(K,J) -> a(K,K) = real_one)) & (all C (int_less(int_zero,C) & J = plus(I,C) -> (all K (int_leq(int_one,K) & int_leq(K,I) -> a(K,plus(K,C)) = real_zero)))))) # label(qii) # label(hypothesis) # label(non_clause).  [assumption].
% 0.73/1.00  11 -(all I all J (int_leq(int_one,I) & int_less(I,J) & int_leq(J,n) -> a(I,J) = real_zero)) # label(lt) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.73/1.00  
% 0.73/1.00  ============================== end of process non-clausal formulas ===
% 0.73/1.00  
% 0.73/1.00  ==========================Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------