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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SWV983-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n010.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:15:27 EDT 2022

% Result   : Timeout 300.07s 300.42s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : SWV983-1 : TPTP v8.1.0. Released v4.1.0.
% 0.08/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.35  % Computer : n010.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Thu Jun 16 03:27:24 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.45/1.17  ============================== Prover9 ===============================
% 0.45/1.17  Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.17  Process 20362 was started by sandbox2 on n010.cluster.edu,
% 0.45/1.17  Thu Jun 16 03:27:24 2022
% 0.45/1.17  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20208_n010.cluster.edu".
% 0.45/1.17  ============================== end of head ===========================
% 0.45/1.17  
% 0.45/1.17  ============================== INPUT =================================
% 0.45/1.17  
% 0.45/1.17  % Reading from file /tmp/Prover9_20208_n010.cluster.edu
% 0.45/1.17  
% 0.45/1.17  set(prolog_style_variables).
% 0.45/1.17  set(auto2).
% 0.45/1.17      % set(auto2) -> set(auto).
% 0.45/1.17      % set(auto) -> set(auto_inference).
% 0.45/1.17      % set(auto) -> set(auto_setup).
% 0.45/1.17      % set(auto_setup) -> set(predicate_elim).
% 0.45/1.17      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.17      % set(auto) -> set(auto_limits).
% 0.45/1.17      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.17      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.17      % set(auto) -> set(auto_denials).
% 0.45/1.17      % set(auto) -> set(auto_process).
% 0.45/1.17      % set(auto2) -> assign(new_constants, 1).
% 0.45/1.17      % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.17      % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.17      % set(auto2) -> assign(max_hours, 1).
% 0.45/1.17      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.17      % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.17      % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.17      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.17      % set(auto2) -> set(sort_initial_sos).
% 0.45/1.17      % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.17      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.17      % set(auto2) -> assign(max_megs, 400).
% 0.45/1.17      % set(auto2) -> assign(stats, some).
% 0.45/1.17      % set(auto2) -> clear(echo_input).
% 0.45/1.17      % set(auto2) -> set(quiet).
% 0.45/1.17      % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.17      % set(auto2) -> clear(print_given).
% 0.45/1.17  assign(lrs_ticks,-1).
% 0.45/1.17  assign(sos_limit,10000).
% 0.45/1.17  assign(order,kbo).
% 0.45/1.17  set(lex_order_vars).
% 0.45/1.17  clear(print_given).
% 0.45/1.17  
% 0.45/1.17  % formulas(sos).  % not echoed (475 formulas)
% 0.45/1.17  
% 0.45/1.17  ============================== end of input ==========================
% 0.45/1.17  
% 0.45/1.17  % From the command line: assign(max_seconds, 300).
% 0.45/1.17  
% 0.45/1.17  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.17  
% 0.45/1.17  % Formulas that are not ordinary clauses:
% 0.45/1.17  
% 0.45/1.17  ============================== end of process non-clausal formulas ===
% 0.45/1.17  
% 0.45/1.17  ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.17  
% 0.45/1.17  ============================== PREDICATE ELIMINATION =================
% 0.45/1.17  1 class_Orderings_Olinorder(tc_nat) # label(clsarity_nat__Orderings_Olinorder) # label(axiom).  [assumption].
% 0.45/1.17  2 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Odrop(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__drop_0) # label(axiom).  [assumption].
% 0.45/1.17  3 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_ONil(A),A) # label(cls_sorted_Osimps_I1_J_0) # label(axiom).  [assumption].
% 0.45/1.17  4 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Otake(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__take_0) # label(axiom).  [assumption].
% 0.45/1.17  5 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_OtakeWhile(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__takeWhile_0) # label(axiom).  [assumption].
% 0.45/1.17  6 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,c_List_Olist_ONil(A),A),A) # label(cls_sorted_Osimps_I2_J_0) # label(axiom).  [assumption].
% 0.45/1.17  7 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,C,A),A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(D,c_List_Olist_OCons(B,C,A),A),A) # label(cls_sorted_Osimps_I3_J_1) # label(axiom).  [assumption].
% 0.45/1.17  8 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(B,A) | -c_List_Olinorder__class_Osorted(c_List_Oappend(C,B,A),A) # label(cls_sorted__append_1) # label(axiom).  [assumption].
% 0.45/1.17  9 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(B,A) | -c_List_Olinorder__class_Osorted(c_List_Oappend(B,C,A),A) # label(cls_sorted__append_0) # label(axiom).  [assumption].
% 0.45/1.17  10 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Oremove1(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__remove1_0) # label(axiom).  [assumption].
% 3.04/3.31  11 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(B,A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(C,B,A),A) # label(cls_sorted__Cons_0) # label(axiom).  [assumption].
% 3.04/3.31  Derived: c_List_Olinorder__class_Osorted(c_List_Odrop(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat).  [resolve(1,a,2,a)].
% 3.04/3.31  Derived: c_List_Olinorder__class_Osorted(c_List_Olist_ONil(tc_nat),tc_nat).  [resolve(1,a,3,a)].
% 3.04/3.31  Derived: c_List_Olinorder__class_Osorted(c_List_Otake(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat).  [resolve(1,a,4,a)].
% 3.04/3.31  Derived: c_List_Olinorder__class_Osorted(c_List_OtakeWhile(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat).  [resolve(1,a,5,a)].
% 3.04/3.31  Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,c_List_Olist_ONil(tc_nat),tc_nat),tc_nat).  [resolve(1,a,6,a)].
% 3.04/3.31  Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(C,c_List_Olist_OCons(A,B,tc_nat),tc_nat),tc_nat).  [resolve(1,a,7,a)].
% 3.04/3.31  Derived: c_List_Olinorder__class_Osorted(A,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Oappend(B,A,tc_nat),tc_nat).  [resolve(1,a,8,a)].
% 3.04/3.31  Derived: c_List_Olinorder__class_Osorted(A,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Oappend(A,B,tc_nat),tc_nat).  [resolve(1,a,9,a)].
% 3.04/3.31  Derived: c_List_Olinorder__class_Osorted(c_List_Oremove1(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat).  [resolve(1,a,10,a)].
% 3.04/3.31  Derived: c_List_Olinorder__class_Osorted(A,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,A,tc_nat),tc_nat).  [resolve(1,a,11,a)].
% 3.04/3.31  12 c_WellTypeRT_OWTrts(A,B,C,D,E) | -c_Progress_OWTrts_H(A,B,C,D,E) # label(cls_wts_H__wts_0) # label(axiom).  [assumption].
% 3.04/3.31  13 c_Progress_OWTrts_H(A,B,C,D,E) | -c_WellTypeRT_OWTrts(A,B,C,D,E) # label(cls_wts__wts_H_0) # label(axiom).  [assumption].
% 3.04/3.31  
% 3.04/3.31  ============================== end predicate elimination =============
% 3.04/3.31  
% 3.04/3.31  Auto_denials:  (non-Horn, no changes).
% 3.04/3.31  
% 3.04/3.31  Term ordering decisions:
% 3.04/3.31  Function symbol KB weights:  tc_String_Ochar=1. tc_nat=1. tc_Type_Oty=1. v_P=1. tc_Value_Oval=1. v_a______=1. v_aa______=1. v_es_Ha______=1. v_b______=1. v_esa______=1. t_b=1. t_a=1. v_E____=1. v_Ts____=1. v_v______=1. hAPP=1. c_List_Orev=1. tc_fun=1. c_Nat_Osize__class_Osize=1. tc_prod=1. c_TypeRel_Owiden=1. c_Expr_Oexp_OVal=1. c_Expr_Oexp_Othrow=1. c_Expr_Oexp_Onew=1. c_Expr_Oexp_OVar=1. c_COMBI=1. c_List_Osko__List__Xlist__all2__refl__1__1=1. tc_List_Olist=1. c_List_Olist_ONil=1. tc_Option_Ooption=1. tc_Expr_Oexp=1. c_fequal=1. c_List_Olist_OCons=1. c_List_Oappend=1. c_List_Odrop=1. c_List_Otake=1. c_List_OtakeWhile=1. c_Conform_Oconf=1. c_Expr_Oexp_OCast=1. c_Expr_Oexp_OLAss=1. c_Expr_Oexp_OSeq=1. c_Expr_Oexp_OWhile=1. c_Aux_Ofun__of=1. c_List_Oremove1=1. c_Pair=1. c_Expr_Oexp_OFAcc=1. c_Expr_Oexp_OBinOp=1. c_Expr_Oexp_OCond=1. c_Expr_Oexp_OBlock=1. c_Expr_Oexp_OCall=1. c_Expr_Oexp_OFAss=1. c_Expr_Oexp_OTryCatch=1. c_List_Olist_Olist__case=1. c_TypeRel_Osko__TypeRel__Xwidens__Cons__1__1=1. c_TypeRel_Osko__TypeRel__Xwidens__Cons__1__2=1. v_sko__CHAINED__1=1. v_sko__local__XListRed2__2__1=1. v_sko__local__XListRed2__Xhyps__2__1=1. c_List_Osko__List__Xlist__all2__Cons1__1__1=1. c_List_Osko__List__Xlist__all2__Cons1__1__2=1. c_List_Osko__List__Xlist__all2__Cons2__1__1=1. c_List_Osko__List__Xlist__all2__Cons2__1__2=1. c_Aux_Osko__Aux__Xrel__list__all2__Cons1__1__2=1. c_Aux_Osko__Aux__Xrel__list__all2__Cons2__1__2=1. c_Expr_Oexp_Oexp__case=1. c_Expr_Oexp_Oexp__rec__1=1.
% 3.04/3.31  
% 3.04/3.31  ============================== end of process initial clauses ========
% 3.04/3.31  
% 3.04/3.31  ============================== CLAUSES FOR SEARCH ====================
% 3.04/3.31  
% 3.04/3.31  ============================== end of clauses for search =============
% 3.04/3.31  
% 3.04/3.31  ============================== SEARCH ================================
% 3.04/3.31  
% 3.04/3.31  % Starting search at 0.13 seconds.
% 3.04/3.31  
% 3.04/3.31  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 101 (0.00 of 1.30 sec).
% 3.04/3.31  
% 3.04/3.31  Low Water (keep): wt=194.000, iters=3353
% 3.04/3.31  
% 3.04/3.31  Low Water (keep): wt=193Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------