TSTP Solution File: ANA043-2 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : ANA043-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n025.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 : Thu Jul 14 19:28:02 EDT 2022

% Result   : Unsatisfiable 0.19s 0.56s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : ANA043-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n025.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 : Fri Jul  8 07:00:14 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox on n025.cluster.edu,
% 0.13/0.36  Fri Jul  8 07:00:14 2022
% 0.13/0.36  The command was "./sos".  The process ID is 29037.
% 0.13/0.36  
% 0.13/0.36  set(prolog_style_variables).
% 0.13/0.36  set(auto).
% 0.13/0.36     dependent: set(auto1).
% 0.13/0.36     dependent: set(process_input).
% 0.13/0.36     dependent: clear(print_kept).
% 0.13/0.36     dependent: clear(print_new_demod).
% 0.13/0.36     dependent: clear(print_back_demod).
% 0.13/0.36     dependent: clear(print_back_sub).
% 0.13/0.36     dependent: set(control_memory).
% 0.13/0.36     dependent: assign(max_mem, 12000).
% 0.13/0.36     dependent: assign(pick_given_ratio, 4).
% 0.13/0.36     dependent: assign(stats_level, 1).
% 0.13/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36     dependent: assign(sos_limit, 5000).
% 0.13/0.36     dependent: assign(max_weight, 60).
% 0.13/0.36  clear(print_given).
% 0.13/0.36  
% 0.13/0.36  list(usable).
% 0.13/0.36  
% 0.13/0.36  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.13/0.36  
% 0.13/0.36  This is a Horn set with equality.  The strategy will be
% 0.13/0.36  Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36  sos and nonpositive clauses in usable.
% 0.13/0.36  
% 0.13/0.36     dependent: set(knuth_bendix).
% 0.13/0.36     dependent: set(para_from).
% 0.13/0.36     dependent: set(para_into).
% 0.13/0.36     dependent: clear(para_from_right).
% 0.13/0.36     dependent: clear(para_into_right).
% 0.13/0.36     dependent: set(para_from_vars).
% 0.13/0.36     dependent: set(eq_units_both_ways).
% 0.13/0.36     dependent: set(dynamic_demod_all).
% 0.13/0.36     dependent: set(dynamic_demod).
% 0.13/0.36     dependent: set(order_eq).
% 0.13/0.36     dependent: set(back_demod).
% 0.13/0.36     dependent: set(lrpo).
% 0.13/0.36     dependent: set(hyper_res).
% 0.13/0.36     dependent: clear(order_hyper).
% 0.13/0.36  
% 0.13/0.36  ------------> process usable:
% 0.13/0.36  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36    Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] {-} A=A.
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.19/0.56  
% 0.19/0.56  Stopped by limit on insertions
% 0.19/0.56  
% 0.19/0.56  
% 0.19/0.56  Failed to model usable list: disabling FINDER
% 0.19/0.56  
% 0.19/0.56  
% 0.19/0.56  
% 0.19/0.56  -------------- Softie stats --------------
% 0.19/0.56  
% 0.19/0.56  UPDATE_STOP: 300
% 0.19/0.56  SFINDER_TIME_LIMIT: 2
% 0.19/0.56  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.56  number of clauses in intial UL: 7
% 0.19/0.56  number of clauses initially in problem: 10
% 0.19/0.56  percentage of clauses intially in UL: 70
% 0.19/0.56  percentage of distinct symbols occuring in initial UL: 94
% 0.19/0.56  percent of all initial clauses that are short: 90
% 0.19/0.56  absolute distinct symbol count: 17
% 0.19/0.56     distinct predicate count: 6
% 0.19/0.56     distinct function count: 8
% 0.19/0.56     distinct constant count: 3
% 0.19/0.56  
% 0.19/0.56  ---------- no more Softie stats ----------
% 0.19/0.56  
% 0.19/0.56  
% 0.19/0.56  
% 0.19/0.56  =========== start of search ===========
% 0.19/0.56  
% 0.19/0.56  -------- PROOF -------- 
% 0.19/0.56  % SZS status Unsatisfiable
% 0.19/0.56  % SZS output start Refutation
% 0.19/0.56  
% 0.19/0.56  ----> UNIT CONFLICT at   0.18 sec ----> 23 [binary,22.1,17.1] {-} $F.
% 0.19/0.56  
% 0.19/0.56  Length of proof is 7.  Level of proof is 3.
% 0.19/0.56  
% 0.19/0.56  ---------------- PROOF ----------------
% 0.19/0.56  % SZS status Unsatisfiable
% 0.19/0.56  % SZS output start Refutation
% 0.19/0.56  
% 0.19/0.56  1 [] {+} -c_lessequals(c_times(c_HOL_Oabs(v_l(v_x(A),v_xa(A)),t_b),c_HOL_Oabs(v_f(v_k(v_x(A),v_xa(A))),t_b),t_b),c_times(A,c_times(c_HOL_Oabs(v_l(v_x(A),v_xa(A)),t_b),c_HOL_Oabs(v_h(v_k(v_x(A),v_xa(A))),t_b),t_b),t_b),t_b).
% 0.19/0.56  2 [] {+} -class_OrderedGroup_Olordered__ab__group__abs(A)|c_lessequals(c_0,c_HOL_Oabs(B,A),A).
% 0.19/0.56  3 [] {+} -class_OrderedGroup_Oab__semigroup__mult(A)|c_times(B,c_times(C,D,A),A)=c_times(C,c_times(B,D,A),A).
% 0.19/0.56  4 [] {+} -class_Ring__and__Field_Opordered__semiring(A)| -c_lessequals(B,C,A)| -c_lessequals(c_0,D,A)|c_lessequals(c_times(D,B,A),c_times(D,C,A),A).
% 0.19/0.56  5 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Oab__semigroup__mult(A).
% 0.19/0.56  6 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_Ring__and__Field_Opordered__semiring(A).
% 0.19/0.56  7 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Olordered__ab__group__abs(A).
% 0.19/0.56  8 [] {-} c_lessequals(c_HOL_Oabs(v_f(A),t_b),c_times(v_c,c_HOL_Oabs(v_h(A),t_b),t_b),t_b).
% 0.19/0.56  9 [] {-} class_Ring__and__Field_Oordered__idom(t_b).
% 0.19/0.56  11 [hyper,9,7] {-} class_OrderedGroup_Olordered__ab__group__abs(t_b).
% 0.19/0.56  12 [hyper,9,6] {-} class_Ring__and__Field_Opordered__semiring(t_b).
% 0.19/0.56  13 [hyper,9,5] {-} class_OrderedGroup_Oab__semigroup__mult(t_b).
% 0.19/0.56  14 [hyper,11,2] {-} c_lessequals(c_0,c_HOL_Oabs(A,t_b),t_b).
% 0.19/0.56  15 [hyper,13,3] {-} c_times(A,c_times(B,C,t_b),t_b)=c_times(B,c_times(A,C,t_b),t_b).
% 0.19/0.56  17 [hyper,14,4,12,8] {-} c_lessequals(c_times(c_HOL_Oabs(A,t_b),c_HOL_Oabs(v_f(B),t_b),t_b),c_times(c_HOL_Oabs(A,t_b),c_times(v_c,c_HOL_Oabs(v_h(B),t_b),t_b),t_b),t_b).
% 0.19/0.56  22 [para_from,15.1.1,1.1.2] {-} -c_lessequals(c_times(c_HOL_Oabs(v_l(v_x(A),v_xa(A)),t_b),c_HOL_Oabs(v_f(v_k(v_x(A),v_xa(A))),t_b),t_b),c_times(c_HOL_Oabs(v_l(v_x(A),v_xa(A)),t_b),c_times(A,c_HOL_Oabs(v_h(v_k(v_x(A),v_xa(A))),t_b),t_b),t_b),t_b).
% 0.19/0.56  23 [binary,22.1,17.1] {-} $F.
% 0.19/0.56  
% 0.19/0.56  % SZS output end Refutation
% 0.19/0.56  ------------ end of proof -------------
% 0.19/0.56  
% 0.19/0.56  
% 0.19/0.56  Search stopped by max_proofs option.
% 0.19/0.56  
% 0.19/0.56  
% 0.19/0.56  Search stopped by max_proofs option.
% 0.19/0.56  
% 0.19/0.56  ============ end of search ============
% 0.19/0.56  
% 0.19/0.56  That finishes the proof of the theorem.
% 0.19/0.56  
% 0.19/0.56  Process 29037 finished Fri Jul  8 07:00:14 2022
%------------------------------------------------------------------------------