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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : LCL788-1 : TPTP v8.1.0. Released v4.1.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 : Sun Jul 17 13:50:11 EDT 2022

% Result   : Unsatisfiable 0.86s 1.27s
% Output   : Refutation 0.86s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : LCL788-1 : TPTP v8.1.0. Released v4.1.0.
% 0.08/0.15  % Command  : tptp2X_and_run_prover9 %d %s
% 0.15/0.36  % Computer : n008.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Sun Jul  3 18:20:53 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 0.86/1.15  ============================== Prover9 ===============================
% 0.86/1.15  Prover9 (32) version 2009-11A, November 2009.
% 0.86/1.15  Process 9834 was started by sandbox2 on n008.cluster.edu,
% 0.86/1.15  Sun Jul  3 18:20:54 2022
% 0.86/1.15  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9681_n008.cluster.edu".
% 0.86/1.15  ============================== end of head ===========================
% 0.86/1.15  
% 0.86/1.15  ============================== INPUT =================================
% 0.86/1.15  
% 0.86/1.15  % Reading from file /tmp/Prover9_9681_n008.cluster.edu
% 0.86/1.15  
% 0.86/1.15  set(prolog_style_variables).
% 0.86/1.15  set(auto2).
% 0.86/1.15      % set(auto2) -> set(auto).
% 0.86/1.15      % set(auto) -> set(auto_inference).
% 0.86/1.15      % set(auto) -> set(auto_setup).
% 0.86/1.15      % set(auto_setup) -> set(predicate_elim).
% 0.86/1.15      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.86/1.15      % set(auto) -> set(auto_limits).
% 0.86/1.15      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.86/1.15      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.86/1.15      % set(auto) -> set(auto_denials).
% 0.86/1.15      % set(auto) -> set(auto_process).
% 0.86/1.15      % set(auto2) -> assign(new_constants, 1).
% 0.86/1.15      % set(auto2) -> assign(fold_denial_max, 3).
% 0.86/1.15      % set(auto2) -> assign(max_weight, "200.000").
% 0.86/1.15      % set(auto2) -> assign(max_hours, 1).
% 0.86/1.15      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.86/1.15      % set(auto2) -> assign(max_seconds, 0).
% 0.86/1.15      % set(auto2) -> assign(max_minutes, 5).
% 0.86/1.15      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.86/1.15      % set(auto2) -> set(sort_initial_sos).
% 0.86/1.15      % set(auto2) -> assign(sos_limit, -1).
% 0.86/1.15      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.86/1.15      % set(auto2) -> assign(max_megs, 400).
% 0.86/1.15      % set(auto2) -> assign(stats, some).
% 0.86/1.15      % set(auto2) -> clear(echo_input).
% 0.86/1.15      % set(auto2) -> set(quiet).
% 0.86/1.15      % set(auto2) -> clear(print_initial_clauses).
% 0.86/1.15      % set(auto2) -> clear(print_given).
% 0.86/1.15  assign(lrs_ticks,-1).
% 0.86/1.15  assign(sos_limit,10000).
% 0.86/1.15  assign(order,kbo).
% 0.86/1.15  set(lex_order_vars).
% 0.86/1.15  clear(print_given).
% 0.86/1.15  
% 0.86/1.15  % formulas(sos).  % not echoed (242 formulas)
% 0.86/1.15  
% 0.86/1.15  ============================== end of input ==========================
% 0.86/1.15  
% 0.86/1.15  % From the command line: assign(max_seconds, 300).
% 0.86/1.15  
% 0.86/1.15  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.86/1.15  
% 0.86/1.15  % Formulas that are not ordinary clauses:
% 0.86/1.15  
% 0.86/1.15  ============================== end of process non-clausal formulas ===
% 0.86/1.15  
% 0.86/1.15  ============================== PROCESS INITIAL CLAUSES ===============
% 0.86/1.15  
% 0.86/1.15  ============================== PREDICATE ELIMINATION =================
% 0.86/1.15  1 A = B | -c_fequal(A,B,C) # label(cls_ATP__Linkup_Ofequal__imp__equal_0) # label(axiom).  [assumption].
% 0.86/1.15  2 c_fequal(A,A,B) # label(cls_ATP__Linkup_Oequal__imp__fequal_0) # label(axiom).  [assumption].
% 0.86/1.15  Derived: A = A.  [resolve(1,b,2,a)].
% 0.86/1.15  
% 0.86/1.15  ============================== end predicate elimination =============
% 0.86/1.15  
% 0.86/1.15  Auto_denials:  (non-Horn, no changes).
% 0.86/1.15  
% 0.86/1.15  Term ordering decisions:
% 0.86/1.15  Function symbol KB weights:  tc_Lambda_OdB=1. c_Lambda_OdB_OApp=1. tc_Type_Otype=1. c_Type_Otype_OFun=1. c_InductTermi_OIT=1. tc_nat=1. v_T____=1. v_i____=1. v_e____=1. v_n____=1. t_a=1. v_T_H____=1. v_Ts____=1. v_T_H_H____=1. v_a____=1. v_rs____=1. v_as____=1. v_ea______=1. v_u____=1. v_ua______=1. v_T_Ha______=1. v_ia______=1. hAPP=1. c_List_Orev=1. c_List_Olast=1. c_List_Ohd=1. c_List_Obutlast=1. c_Lambda_Olift=1. c_List_Otl=1. c_List_Orotate1=1. c_List_Olist_ONil=1. c_Lambda_OdB_OVar=1. c_Lambda_OdB_OAbs=1. c_HOL_Ozero__class_Ozero=1. c_Type_Otype_OAtom=1. c_Type_Osko__Type__Xtype__induct__1__1=1. c_List_Olist_OCons=1. c_List_Oappend=1. c_List_Oreplicate=1. c_Lambda_Osubst=1. c_List_OdropWhile=1. c_List_OtakeWhile=1. c_List_Osplice=1. c_List_Osko__List__Xsplit__list__first__prop__iff__1__5=1. c_List_Osko__List__Xsplit__list__last__prop__iff__1__5=1. c_Type_Oshift=1. c_Type_Otype_Otype__case=1. c_Type_Otype_Otype__rec=1. c_COMBC=1. c_List_Oconcat__map=1. c_Type_Osko__Type__Xlist__app__typeD__1__1=1. c_Type_Osko__Type__Xlist__app__typeE__1__1=1. c_Type_Osko__Type__Xtyping__elims__2__1=1. c_Type_Osko__Type__Xvar__app__typesE__1__1=1. c_Type_Osko__Type__Xvar__app__types__1__1=1. c_Type_Osko__Type__Xtypes__snocE__1__2=1. c_List_Ofoldl=1. c_List_Ofoldr=1. c_List_Osko__List__XCons__eq__append__conv__1__1=1. c_List_Osko__List__Xappend__eq__Cons__conv__1__1=1.
% 0.86/1.27  
% 0.86/1.27  ============================== end of process initial clauses ========
% 0.86/1.27  
% 0.86/1.27  ============================== CLAUSES FOR SEARCH ====================
% 0.86/1.27  
% 0.86/1.27  ============================== end of clauses for search =============
% 0.86/1.27  
% 0.86/1.27  ============================== SEARCH ================================
% 0.86/1.27  
% 0.86/1.27  % Starting search at 0.06 seconds.
% 0.86/1.27  
% 0.86/1.27  ============================== PROOF =================================
% 0.86/1.27  % SZS status Unsatisfiable
% 0.86/1.27  % SZS output start Refutation
% 0.86/1.27  
% 0.86/1.27  % Proof 1 at 0.17 (+ 0.01) seconds.
% 0.86/1.27  % Length of proof is 8.
% 0.86/1.27  % Level of proof is 2.
% 0.86/1.27  % Maximum clause weight is 18.000.
% 0.86/1.27  % Given clauses 169.
% 0.86/1.27  
% 0.86/1.27  259 hAPP(A,B) = C | -c_Type_Otyping(A,c_Lambda_OdB_OVar(B),C) # label(cls_typing__elims_I1_J_0) # label(axiom).  [assumption].
% 0.86/1.27  260 v_n____ = v_i____ # label(cls_True_0) # label(axiom).  [assumption].
% 0.86/1.27  261 hAPP(c_Type_Oshift(A,B,C,D),B) = C # label(cls_shift__eq_0) # label(axiom).  [assumption].
% 0.86/1.27  302 c_Type_Otyping(c_Type_Oshift(v_e____,v_i____,v_T____,tc_Type_Otype),c_Lambda_OdB_OVar(v_n____),hAPP(hAPP(c_Type_Otype_OFun,v_T_H_H____),c_List_Ofoldr(c_Type_Otype_OFun,v_Ts____,v_T_H____,tc_Type_Otype,tc_Type_Otype))) # label(cls_varT_0) # label(axiom).  [assumption].
% 0.86/1.27  303 c_Type_Otyping(c_Type_Oshift(v_e____,v_i____,v_T____,tc_Type_Otype),c_Lambda_OdB_OVar(v_i____),hAPP(hAPP(c_Type_Otype_OFun,v_T_H_H____),c_List_Ofoldr(c_Type_Otype_OFun,v_Ts____,v_T_H____,tc_Type_Otype,tc_Type_Otype))).  [copy(302),rewrite([260(6)])].
% 0.86/1.27  314 v_T____ != hAPP(hAPP(c_Type_Otype_OFun,v_T_H_H____),c_List_Ofoldr(c_Type_Otype_OFun,v_Ts____,v_T_H____,tc_Type_Otype,tc_Type_Otype)) # label(cls_conjecture_0) # label(negated_conjecture).  [assumption].
% 0.86/1.27  315 hAPP(hAPP(c_Type_Otype_OFun,v_T_H_H____),c_List_Ofoldr(c_Type_Otype_OFun,v_Ts____,v_T_H____,tc_Type_Otype,tc_Type_Otype)) != v_T____.  [copy(314),flip(a)].
% 0.86/1.27  1119 $F.  [resolve(303,a,259,b),rewrite([261(7)]),flip(a),unit_del(a,315)].
% 0.86/1.27  
% 0.86/1.27  % SZS output end Refutation
% 0.86/1.27  ============================== end of proof ==========================
% 0.86/1.27  
% 0.86/1.27  ============================== STATISTICS ============================
% 0.86/1.27  
% 0.86/1.27  Given=169. Generated=1510. Kept=1000. proofs=1.
% 0.86/1.27  Usable=166. Sos=777. Demods=98. Limbo=2, Disabled=298. Hints=0.
% 0.86/1.27  Megabytes=2.98.
% 0.86/1.27  User_CPU=0.17, System_CPU=0.01, Wall_clock=0.
% 0.86/1.27  
% 0.86/1.27  ============================== end of statistics =====================
% 0.86/1.27  
% 0.86/1.27  ============================== end of search =========================
% 0.86/1.27  
% 0.86/1.27  THEOREM PROVED
% 0.86/1.27  % SZS status Unsatisfiable
% 0.86/1.27  
% 0.86/1.27  Exiting with 1 proof.
% 0.86/1.27  
% 0.86/1.27  Process 9834 exit (max_proofs) Sun Jul  3 18:20:54 2022
% 0.86/1.27  Prover9 interrupted
%------------------------------------------------------------------------------