TSTP Solution File: LCL798-1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL798-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n005.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 14:33:01 EDT 2022

% Result   : Unsatisfiable 0.20s 0.54s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL798-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.14/0.34  % Computer : n005.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jul  4 05:11:52 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.36  ----- Otter 3.2, August 2001 -----
% 0.20/0.36  The process was started by sandbox on n005.cluster.edu,
% 0.20/0.36  Mon Jul  4 05:11:52 2022
% 0.20/0.36  The command was "./sos".  The process ID is 792.
% 0.20/0.36  
% 0.20/0.36  set(prolog_style_variables).
% 0.20/0.36  set(auto).
% 0.20/0.36     dependent: set(auto1).
% 0.20/0.36     dependent: set(process_input).
% 0.20/0.36     dependent: clear(print_kept).
% 0.20/0.36     dependent: clear(print_new_demod).
% 0.20/0.36     dependent: clear(print_back_demod).
% 0.20/0.36     dependent: clear(print_back_sub).
% 0.20/0.36     dependent: set(control_memory).
% 0.20/0.36     dependent: assign(max_mem, 12000).
% 0.20/0.36     dependent: assign(pick_given_ratio, 4).
% 0.20/0.36     dependent: assign(stats_level, 1).
% 0.20/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36     dependent: assign(sos_limit, 5000).
% 0.20/0.36     dependent: assign(max_weight, 60).
% 0.20/0.36  clear(print_given).
% 0.20/0.36  
% 0.20/0.36  list(usable).
% 0.20/0.36  
% 0.20/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.20/0.36  
% 0.20/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.20/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.36  clauses in usable.
% 0.20/0.36  
% 0.20/0.36     dependent: set(knuth_bendix).
% 0.20/0.36     dependent: set(para_from).
% 0.20/0.36     dependent: set(para_into).
% 0.20/0.36     dependent: clear(para_from_right).
% 0.20/0.36     dependent: clear(para_into_right).
% 0.20/0.36     dependent: set(para_from_vars).
% 0.20/0.36     dependent: set(eq_units_both_ways).
% 0.20/0.36     dependent: set(dynamic_demod_all).
% 0.20/0.36     dependent: set(dynamic_demod).
% 0.20/0.36     dependent: set(order_eq).
% 0.20/0.36     dependent: set(back_demod).
% 0.20/0.36     dependent: set(lrpo).
% 0.20/0.36     dependent: set(hyper_res).
% 0.20/0.36     dependent: set(unit_deletion).
% 0.20/0.36     dependent: set(factor).
% 0.20/0.36  
% 0.20/0.36  ------------> process usable:
% 0.20/0.36    Following clause subsumed by 6 during input processing: 0 [] {-} -class_Orderings_Opreorder(A)| -c_HOL_Oord__class_Oless(B,C,A)| -c_HOL_Oord__class_Oless(C,B,A).
% 0.20/0.36    Following clause subsumed by 12 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_HOL_Oord__class_Oless(B,C,A)|C=B|c_HOL_Oord__class_Oless(C,B,A).
% 0.20/0.36    Following clause subsumed by 12 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_HOL_Oord__class_Oless(B,C,A)|c_HOL_Oord__class_Oless(C,B,A)|C=B.
% 0.20/0.36    Following clause subsumed by 12 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|B=C|c_HOL_Oord__class_Oless(C,B,A)|c_HOL_Oord__class_Oless(B,C,A).
% 0.20/0.36    Following clause subsumed by 17 during input processing: 0 [] {-} -c_HOL_Oord__class_Oless(A,A,tc_nat).
% 0.20/0.36    Following clause subsumed by 20 during input processing: 0 [] {-} -c_HOL_Oord__class_Oless(A,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat).
% 0.20/0.36    Following clause subsumed by 27 during input processing: 0 [] {-} c_List_Olist_OCons(A,B,C)!=B.
% 0.20/0.36  17 back subsumes 9.
% 0.20/0.36    Following clause subsumed by 34 during input processing: 0 [copy,21,flip.1] {-} c_Lambda_OdB_OVar(A)!=c_Lambda_OdB_OApp(B,C).
% 0.20/0.36    Following clause subsumed by 45 during input processing: 0 [copy,32,flip.1] {-} c_Lambda_OdB_OAbs(A)!=c_Lambda_OdB_OVar(B).
% 0.20/0.36    Following clause subsumed by 21 during input processing: 0 [copy,34,flip.1] {-} c_Lambda_OdB_OApp(A,B)!=c_Lambda_OdB_OVar(C).
% 0.20/0.36    Following clause subsumed by 44 during input processing: 0 [copy,42,flip.1] {-} c_Lambda_OdB_OApp(A,B)!=c_Lambda_OdB_OAbs(C).
% 0.20/0.36    Following clause subsumed by 42 during input processing: 0 [copy,44,flip.1] {-} c_Lambda_OdB_OAbs(A)!=c_Lambda_OdB_OApp(B,C).
% 0.20/0.36    Following clause subsumed by 32 during input processing: 0 [copy,45,flip.1] {-} c_Lambda_OdB_OVar(A)!=c_Lambda_OdB_OAbs(B).
% 0.20/0.36  
% 0.20/0.36  ------------> process sos:
% 0.20/0.36    Following clause subsumed by 55 during input processing: 0 [] {-} c_HOL_Oord__class_Oless(A,B,tc_nat)|c_HOL_Oord__class_Oless(B,A,tc_nat)|B=A.
% 0.20/0.36    Following clause subsumed by 72 during input processing: 0 [] {-} c_InductTermi_OIT(v_u____).
% 0.20/0.36    Following clause subsumed by 67 during input processing: 0 [] {-} A=A.
% 0.20/0.36    Following clause subsumed by 67 during input processing: 0 [copy,67,flip.1] {-} A=A.
% 0.20/0.36  67 back subsumes 53.
% 0.20/0.36  67 back subsumes 52.
% 0.20/0.36  
% 0.20/0.36  ======= end of input processing =======
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Failed to model usable list: disabling FINDER
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  -------------- Softie stats --------------
% 0.20/0.44  
% 0.20/0.44  UPDATE_STOP: 300
% 0.20/0.44  SFINDER_TIME_LIMIT: 2
% 0.20/0.44  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.44  number of clauses in intial UL: 48
% 0.20/0.44  number of clauses initially in problem: 76
% 0.20/0.44  percentage of clauses intially in UL: 63
% 0.20/0.44  percentage of distinct symbols occuring in initial UL: 80
% 0.20/0.44  percent of all initial clauses that are short: 100
% 0.20/0.44  absolute distinct symbol count: 35
% 0.20/0.44     distinct predicate count: 12
% 0.20/0.44     distinct function count: 10
% 0.20/0.44     distinct constant count: 13
% 0.20/0.44  
% 0.20/0.44  ---------- no more Softie stats ----------
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  =========== start of search ===========
% 0.20/0.54  
% 0.20/0.54  -------- PROOF -------- 
% 0.20/0.54  % SZS status Unsatisfiable
% 0.20/0.54  % SZS output start Refutation
% 0.20/0.54  
% 0.20/0.54  ----> UNIT CONFLICT at   0.15 sec ----> 1520 [binary,1519.1,51.1] {-} $F.
% 0.20/0.54  
% 0.20/0.54  Length of proof is 1.  Level of proof is 1.
% 0.20/0.54  
% 0.20/0.54  ---------------- PROOF ----------------
% 0.20/0.54  % SZS status Unsatisfiable
% 0.20/0.54  % SZS output start Refutation
% 0.20/0.54  
% 0.20/0.54  50 [] {+} c_InductTermi_OIT(c_Lambda_Osubst(v_a____,A,B))| -c_Type_Otyping(C,A,v_T____)| -c_InductTermi_OIT(A)| -c_Type_Otyping(c_Type_Oshift(C,B,v_T____,tc_Type_Otype),v_a____,D).
% 0.20/0.54  51 [] {+} -c_InductTermi_OIT(c_Lambda_Osubst(v_a____,v_u____,v_i____)).
% 0.20/0.54  72 [] {-} c_InductTermi_OIT(v_u____).
% 0.20/0.54  78 [] {-} c_Type_Otyping(v_e____,v_u____,v_T____).
% 0.20/0.54  79 [] {-} c_Type_Otyping(c_Type_Oshift(v_e____,v_i____,v_T____,tc_Type_Otype),v_a____,v_T_H_H____).
% 0.20/0.54  1519 [hyper,79,50,78,72] {-} c_InductTermi_OIT(c_Lambda_Osubst(v_a____,v_u____,v_i____)).
% 0.20/0.54  1520 [binary,1519.1,51.1] {-} $F.
% 0.20/0.54  
% 0.20/0.54  % SZS output end Refutation
% 0.20/0.54  ------------ end of proof -------------
% 0.20/0.54  
% 0.20/0.54  
% 0.20/0.54  Search stopped by max_proofs option.
% 0.20/0.54  
% 0.20/0.54  
% 0.20/0.54  Search stopped by max_proofs option.
% 0.20/0.54  
% 0.20/0.54  ============ end of search ============
% 0.20/0.54  
% 0.20/0.54  That finishes the proof of the theorem.
% 0.20/0.54  
% 0.20/0.54  Process 792 finished Mon Jul  4 05:11:52 2022
%------------------------------------------------------------------------------