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

View Problem - Process Solution

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

% Computer : n012.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:27:45 EDT 2022

% Result   : Unsatisfiable 0.45s 0.69s
% Output   : Refutation 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : ANA018-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n012.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jul  8 02:56:59 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.35  ----- Otter 3.2, August 2001 -----
% 0.18/0.35  The process was started by sandbox on n012.cluster.edu,
% 0.18/0.35  Fri Jul  8 02:56:59 2022
% 0.18/0.35  The command was "./sos".  The process ID is 15744.
% 0.18/0.35  
% 0.18/0.35  set(prolog_style_variables).
% 0.18/0.35  set(auto).
% 0.18/0.35     dependent: set(auto1).
% 0.18/0.35     dependent: set(process_input).
% 0.18/0.35     dependent: clear(print_kept).
% 0.18/0.35     dependent: clear(print_new_demod).
% 0.18/0.35     dependent: clear(print_back_demod).
% 0.18/0.35     dependent: clear(print_back_sub).
% 0.18/0.35     dependent: set(control_memory).
% 0.18/0.35     dependent: assign(max_mem, 12000).
% 0.18/0.35     dependent: assign(pick_given_ratio, 4).
% 0.18/0.35     dependent: assign(stats_level, 1).
% 0.18/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35     dependent: assign(sos_limit, 5000).
% 0.18/0.35     dependent: assign(max_weight, 60).
% 0.18/0.35  clear(print_given).
% 0.18/0.35  
% 0.18/0.35  list(usable).
% 0.18/0.35  
% 0.18/0.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.18/0.35  
% 0.18/0.35  This is a Horn set with equality.  The strategy will be
% 0.18/0.35  Knuth-Bendix and hyper_res, with positive clauses in
% 0.18/0.35  sos and nonpositive clauses in usable.
% 0.18/0.35  
% 0.18/0.35     dependent: set(knuth_bendix).
% 0.18/0.35     dependent: set(para_from).
% 0.18/0.35     dependent: set(para_into).
% 0.18/0.35     dependent: clear(para_from_right).
% 0.18/0.35     dependent: clear(para_into_right).
% 0.18/0.35     dependent: set(para_from_vars).
% 0.18/0.35     dependent: set(eq_units_both_ways).
% 0.18/0.35     dependent: set(dynamic_demod_all).
% 0.18/0.35     dependent: set(dynamic_demod).
% 0.18/0.35     dependent: set(order_eq).
% 0.18/0.35     dependent: set(back_demod).
% 0.18/0.35     dependent: set(lrpo).
% 0.18/0.35     dependent: set(hyper_res).
% 0.18/0.35     dependent: clear(order_hyper).
% 0.18/0.35  
% 0.18/0.35  ------------> process usable:
% 0.18/0.35  
% 0.18/0.35  ------------> process sos:
% 0.18/0.35    Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} A=A.
% 0.18/0.35  
% 0.18/0.35  ======= end of input processing =======
% 0.18/0.37  
% 0.18/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.37  
% 0.18/0.37  Stopped by limit on number of solutions
% 0.18/0.37  
% 0.18/0.37  
% 0.18/0.37  -------------- Softie stats --------------
% 0.18/0.37  
% 0.18/0.37  UPDATE_STOP: 300
% 0.18/0.37  SFINDER_TIME_LIMIT: 2
% 0.18/0.37  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.37  number of clauses in intial UL: 9
% 0.18/0.37  number of clauses initially in problem: 14
% 0.18/0.37  percentage of clauses intially in UL: 64
% 0.18/0.37  percentage of distinct symbols occuring in initial UL: 94
% 0.18/0.37  percent of all initial clauses that are short: 92
% 0.18/0.37  absolute distinct symbol count: 18
% 0.18/0.37     distinct predicate count: 8
% 0.18/0.37     distinct function count: 5
% 0.18/0.37     distinct constant count: 5
% 0.18/0.37  
% 0.18/0.37  ---------- no more Softie stats ----------
% 0.18/0.37  
% 0.18/0.37  
% 0.18/0.37  
% 0.18/0.37  =========== start of search ===========
% 0.45/0.69  
% 0.45/0.69  -------- PROOF -------- 
% 0.45/0.69  % SZS status Unsatisfiable
% 0.45/0.69  % SZS output start Refutation
% 0.45/0.69  
% 0.45/0.69  Model 2 (0.00 seconds, 0 Inserts)
% 0.45/0.69  
% 0.45/0.69  Stopped by limit on number of solutions
% 0.45/0.69  
% 0.45/0.69  Stopped by limit on insertions
% 0.45/0.69  
% 0.45/0.69  Model 3 [ 1 1 813 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.69  
% 0.45/0.69  Stopped by limit on insertions
% 0.45/0.69  
% 0.45/0.69  Model 4 [ 1 1 960 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.69  
% 0.45/0.69  Stopped by limit on insertions
% 0.45/0.69  
% 0.45/0.69  Model 5 [ 1 0 383 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.69  
% 0.45/0.69  Model 6 (0.00 seconds, 250000 Inserts)
% 0.45/0.69  
% 0.45/0.69  Stopped by limit on number of solutions
% 0.45/0.69  
% 0.45/0.69  ----> UNIT CONFLICT at   0.32 sec ----> 31 [binary,30.1,21.1] {-} $F.
% 0.45/0.69  
% 0.45/0.69  Length of proof is 9.  Level of proof is 5.
% 0.45/0.69  
% 0.45/0.69  ---------------- PROOF ----------------
% 0.45/0.69  % SZS status Unsatisfiable
% 0.45/0.69  % SZS output start Refutation
% 0.45/0.69  
% 0.45/0.69  1 [] {+} -c_lessequals(c_HOL_Oabs(v_x(v_xa),t_b),c_times(c_times(v_ca,v_c,t_b),c_HOL_Oabs(v_g(v_xa),t_b),t_b),t_b).
% 0.45/0.69  2 [] {+} -class_OrderedGroup_Osemigroup__mult(A)|c_times(c_times(B,C,A),D,A)=c_times(B,c_times(C,D,A),A).
% 0.45/0.69  3 [] {+} -class_Orderings_Oorder(A)| -c_lessequals(B,C,A)| -c_lessequals(D,B,A)|c_lessequals(D,C,A).
% 0.45/0.69  4 [] {+} -class_Orderings_Oorder(A)| -c_less(B,C,A)|c_lessequals(B,C,A).
% 0.45/0.69  5 [] {+} -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.45/0.69  6 [] {+} -class_LOrder_Ojoin__semilorder(A)|class_Orderings_Oorder(A).
% 0.45/0.69  7 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Osemigroup__mult(A).
% 0.45/0.69  8 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_LOrder_Ojoin__semilorder(A).
% 0.45/0.69  9 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_Ring__and__Field_Opordered__semiring(A).
% 0.45/0.69  10 [] {+} c_lessequals(c_HOL_Oabs(v_f(A),t_b),c_times(v_c,c_HOL_Oabs(v_g(A),t_b),t_b),t_b).
% 0.45/0.69  11 [] {+} c_less(c_0,v_ca,t_b).
% 0.45/0.69  12 [] {-} c_lessequals(c_HOL_Oabs(v_x(A),t_b),c_times(v_ca,c_HOL_Oabs(v_f(A),t_b),t_b),t_b).
% 0.45/0.69  13 [] {+} class_Ring__and__Field_Oordered__idom(t_b).
% 0.45/0.69  15 [hyper,13,9] {+} class_Ring__and__Field_Opordered__semiring(t_b).
% 0.45/0.69  16 [hyper,13,8] {+} class_LOrder_Ojoin__semilorder(t_b).
% 0.45/0.69  17 [hyper,13,7] {+} class_OrderedGroup_Osemigroup__mult(t_b).
% 0.45/0.69  18 [hyper,16,6] {+} class_Orderings_Oorder(t_b).
% 0.45/0.69  20,19 [hyper,17,2] {+} c_times(c_times(A,B,t_b),C,t_b)=c_times(A,c_times(B,C,t_b),t_b).
% 0.45/0.69  21 [back_demod,1,demod,20] {+} -c_lessequals(c_HOL_Oabs(v_x(v_xa),t_b),c_times(v_ca,c_times(v_c,c_HOL_Oabs(v_g(v_xa),t_b),t_b),t_b),t_b).
% 0.45/0.69  22 [hyper,18,4,11] {+} c_lessequals(c_0,v_ca,t_b).
% 0.45/0.69  25 [hyper,22,5,15,10] {-} c_lessequals(c_times(v_ca,c_HOL_Oabs(v_f(A),t_b),t_b),c_times(v_ca,c_times(v_c,c_HOL_Oabs(v_g(A),t_b),t_b),t_b),t_b).
% 0.45/0.69  30 [hyper,25,3,18,12] {-} c_lessequals(c_HOL_Oabs(v_x(A),t_b),c_times(v_ca,c_times(v_c,c_HOL_Oabs(v_g(A),t_b),t_b),t_b),t_b).
% 0.45/0.69  31 [binary,30.1,21.1] {-} $F.
% 0.45/0.69  
% 0.45/0.69  % SZS output end Refutation
% 0.45/0.69  ------------ end of proof -------------
% 0.45/0.69  
% 0.45/0.69  
% 0.45/0.69  Search stopped by max_proofs option.
% 0.45/0.69  
% 0.45/0.69  
% 0.45/0.69  Search stopped by max_proofs option.
% 0.45/0.69  
% 0.45/0.69  ============ end of search ============
% 0.45/0.69  
% 0.45/0.69  ----------- soft-scott stats ----------
% 0.45/0.69  
% 0.45/0.69  true clauses given           6      (42.9%)
% 0.45/0.69  false clauses given          8
% 0.45/0.69  
% 0.45/0.69        FALSE     TRUE
% 0.45/0.69    16  0         2
% 0.45/0.69    25  1         0
% 0.45/0.69    29  0         1
% 0.45/0.69  tot:  1         3      (75.0% true)
% 0.45/0.69  
% 0.45/0.69  
% 0.45/0.69  Model 6 (0.00 seconds, 250000 Inserts)
% 0.45/0.69  
% 0.45/0.69  That finishes the proof of the theorem.
% 0.45/0.69  
% 0.45/0.69  Process 15744 finished Fri Jul  8 02:57:00 2022
%------------------------------------------------------------------------------