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

View Problem - Process Solution

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

% Computer : n003.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:04 EDT 2022

% Result   : Unsatisfiable 0.53s 0.76s
% Output   : Refutation 0.53s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : ANA045-2 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.13  % Command  : sos-script %s
% 0.14/0.34  % Computer : n003.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.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Fri Jul  8 05:34:12 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.36  ----- Otter 3.2, August 2001 -----
% 0.14/0.36  The process was started by sandbox on n003.cluster.edu,
% 0.14/0.36  Fri Jul  8 05:34:12 2022
% 0.14/0.36  The command was "./sos".  The process ID is 2320.
% 0.14/0.36  
% 0.14/0.36  set(prolog_style_variables).
% 0.14/0.36  set(auto).
% 0.14/0.36     dependent: set(auto1).
% 0.14/0.36     dependent: set(process_input).
% 0.14/0.36     dependent: clear(print_kept).
% 0.14/0.36     dependent: clear(print_new_demod).
% 0.14/0.36     dependent: clear(print_back_demod).
% 0.14/0.36     dependent: clear(print_back_sub).
% 0.14/0.36     dependent: set(control_memory).
% 0.14/0.36     dependent: assign(max_mem, 12000).
% 0.14/0.36     dependent: assign(pick_given_ratio, 4).
% 0.14/0.36     dependent: assign(stats_level, 1).
% 0.14/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36     dependent: assign(sos_limit, 5000).
% 0.14/0.36     dependent: assign(max_weight, 60).
% 0.14/0.36  clear(print_given).
% 0.14/0.36  
% 0.14/0.36  list(usable).
% 0.14/0.36  
% 0.14/0.36  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.14/0.36  
% 0.14/0.36  This is a Horn set with equality.  The strategy will be
% 0.14/0.36  Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.36  sos and nonpositive clauses in usable.
% 0.14/0.36  
% 0.14/0.36     dependent: set(knuth_bendix).
% 0.14/0.36     dependent: set(para_from).
% 0.14/0.36     dependent: set(para_into).
% 0.14/0.36     dependent: clear(para_from_right).
% 0.14/0.36     dependent: clear(para_into_right).
% 0.14/0.36     dependent: set(para_from_vars).
% 0.14/0.36     dependent: set(eq_units_both_ways).
% 0.14/0.36     dependent: set(dynamic_demod_all).
% 0.14/0.36     dependent: set(dynamic_demod).
% 0.14/0.36     dependent: set(order_eq).
% 0.14/0.36     dependent: set(back_demod).
% 0.14/0.36     dependent: set(lrpo).
% 0.14/0.36     dependent: set(hyper_res).
% 0.14/0.36     dependent: clear(order_hyper).
% 0.14/0.36  
% 0.14/0.36  ------------> process usable:
% 0.14/0.36  
% 0.14/0.36  ------------> process sos:
% 0.14/0.36    Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] {-} A=A.
% 0.14/0.36  
% 0.14/0.36  ======= end of input processing =======
% 0.42/0.61  
% 0.42/0.61  Model 1 (0.00 seconds, 0 Inserts)
% 0.42/0.61  
% 0.42/0.61  Stopped by limit on number of solutions
% 0.42/0.61  
% 0.42/0.61  
% 0.42/0.61  -------------- Softie stats --------------
% 0.42/0.61  
% 0.42/0.61  UPDATE_STOP: 300
% 0.42/0.61  SFINDER_TIME_LIMIT: 2
% 0.42/0.61  SHORT_CLAUSE_CUTOFF: 4
% 0.42/0.61  number of clauses in intial UL: 4
% 0.42/0.61  number of clauses initially in problem: 6
% 0.42/0.61  percentage of clauses intially in UL: 66
% 0.42/0.61  percentage of distinct symbols occuring in initial UL: 100
% 0.42/0.61  percent of all initial clauses that are short: 83
% 0.42/0.61  absolute distinct symbol count: 11
% 0.42/0.61     distinct predicate count: 4
% 0.42/0.61     distinct function count: 4
% 0.42/0.61     distinct constant count: 3
% 0.42/0.61  
% 0.42/0.61  ---------- no more Softie stats ----------
% 0.42/0.61  
% 0.42/0.61  
% 0.42/0.61  
% 0.42/0.61  Stopped by limit on insertions
% 0.42/0.61  
% 0.42/0.61  =========== start of search ===========
% 0.53/0.76  
% 0.53/0.76  -------- PROOF -------- 
% 0.53/0.76  % SZS status Unsatisfiable
% 0.53/0.76  % SZS output start Refutation
% 0.53/0.76  
% 0.53/0.76  Stopped by limit on insertions
% 0.53/0.76  
% 0.53/0.76  Model 2 [ 1 0 163 ] (0.00 seconds, 250000 Inserts)
% 0.53/0.76  
% 0.53/0.76  Stopped by limit on insertions
% 0.53/0.76  
% 0.53/0.76  Model 3 [ 2 1 6317 ] (0.00 seconds, 250000 Inserts)
% 0.53/0.76  
% 0.53/0.76  ----> UNIT CONFLICT at   0.37 sec ----> 13 [binary,12.1,11.1] {-} $F.
% 0.53/0.76  
% 0.53/0.76  Length of proof is 5.  Level of proof is 3.
% 0.53/0.76  
% 0.53/0.76  ---------------- PROOF ----------------
% 0.53/0.76  % SZS status Unsatisfiable
% 0.53/0.76  % SZS output start Refutation
% 0.53/0.76  
% 0.53/0.76  1 [] {+} -c_lessequals(c_0,c_times(A,c_HOL_Oabs(v_g(v_x(A)),t_b),t_b),t_b).
% 0.53/0.76  2 [] {+} -class_OrderedGroup_Olordered__ab__group__abs(A)|c_lessequals(c_0,c_HOL_Oabs(B,A),A).
% 0.53/0.76  3 [] {-} -class_Ring__and__Field_Oordered__idom(A)|B=c_times(c_1,B,A).
% 0.53/0.76  4 [copy,3,flip.2] {+} -class_Ring__and__Field_Oordered__idom(A)|c_times(c_1,B,A)=B.
% 0.53/0.76  5 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Olordered__ab__group__abs(A).
% 0.53/0.76  6 [] {-} class_Ring__and__Field_Oordered__idom(t_b).
% 0.53/0.76  8 [hyper,6,5] {+} class_OrderedGroup_Olordered__ab__group__abs(t_b).
% 0.53/0.76  9 [hyper,6,4] {+} c_times(c_1,A,t_b)=A.
% 0.53/0.76  11 [para_from,9.1.1,1.1.2] {-} -c_lessequals(c_0,c_HOL_Oabs(v_g(v_x(c_1)),t_b),t_b).
% 0.53/0.76  12 [hyper,8,2] {-} c_lessequals(c_0,c_HOL_Oabs(A,t_b),t_b).
% 0.53/0.76  13 [binary,12.1,11.1] {-} $F.
% 0.53/0.76  
% 0.53/0.76  % SZS output end Refutation
% 0.53/0.76  ------------ end of proof -------------
% 0.53/0.76  
% 0.53/0.76  
% 0.53/0.76  Search stopped by max_proofs option.
% 0.53/0.76  
% 0.53/0.76  
% 0.53/0.76  Search stopped by max_proofs option.
% 0.53/0.76  
% 0.53/0.76  ============ end of search ============
% 0.53/0.76  
% 0.53/0.76  ----------- soft-scott stats ----------
% 0.53/0.76  
% 0.53/0.76  true clauses given           0      (0.0%)
% 0.53/0.76  false clauses given          3
% 0.53/0.76  
% 0.53/0.76        FALSE     TRUE
% 0.53/0.76     3  0         1
% 0.53/0.76     8  1         0
% 0.53/0.76  tot:  1         1      (50.0% true)
% 0.53/0.76  
% 0.53/0.76  
% 0.53/0.76  Model 3 [ 2 1 6317 ] (0.00 seconds, 250000 Inserts)
% 0.53/0.76  
% 0.53/0.76  That finishes the proof of the theorem.
% 0.53/0.76  
% 0.53/0.76  Process 2320 finished Fri Jul  8 05:34:13 2022
%------------------------------------------------------------------------------