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

View Problem - Process Solution

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

% Computer : n010.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 : Sat Jul 16 19:12:41 EDT 2022

% Result   : Unsatisfiable 1.87s 2.08s
% Output   : Refutation 1.87s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.17  % Problem  : HWV019-2 : TPTP v8.1.0. Released v2.5.0.
% 0.14/0.18  % Command  : sos-script %s
% 0.15/0.40  % Computer : n010.cluster.edu
% 0.15/0.40  % Model    : x86_64 x86_64
% 0.15/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40  % Memory   : 8042.1875MB
% 0.15/0.40  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.40  % CPULimit : 300
% 0.15/0.40  % WCLimit  : 600
% 0.15/0.40  % DateTime : Fri Jun 17 07:21:23 EDT 2022
% 0.15/0.41  % CPUTime  : 
% 0.23/0.44  ----- Otter 3.2, August 2001 -----
% 0.23/0.44  The process was started by sandbox2 on n010.cluster.edu,
% 0.23/0.44  Fri Jun 17 07:21:23 2022
% 0.23/0.44  The command was "./sos".  The process ID is 26028.
% 0.23/0.44  
% 0.23/0.44  set(prolog_style_variables).
% 0.23/0.44  set(auto).
% 0.23/0.44     dependent: set(auto1).
% 0.23/0.44     dependent: set(process_input).
% 0.23/0.44     dependent: clear(print_kept).
% 0.23/0.44     dependent: clear(print_new_demod).
% 0.23/0.44     dependent: clear(print_back_demod).
% 0.23/0.44     dependent: clear(print_back_sub).
% 0.23/0.44     dependent: set(control_memory).
% 0.23/0.44     dependent: assign(max_mem, 12000).
% 0.23/0.44     dependent: assign(pick_given_ratio, 4).
% 0.23/0.44     dependent: assign(stats_level, 1).
% 0.23/0.44     dependent: assign(pick_semantic_ratio, 3).
% 0.23/0.44     dependent: assign(sos_limit, 5000).
% 0.23/0.44     dependent: assign(max_weight, 60).
% 0.23/0.44  clear(print_given).
% 0.23/0.44  
% 0.23/0.44  list(usable).
% 0.23/0.44  
% 0.23/0.44  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.23/0.44  
% 0.23/0.44  This ia a non-Horn set with equality.  The strategy will be
% 0.23/0.44  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.23/0.44  unit deletion, with positive clauses in sos and nonpositive
% 0.23/0.44  clauses in usable.
% 0.23/0.44  
% 0.23/0.44     dependent: set(knuth_bendix).
% 0.23/0.44     dependent: set(para_from).
% 0.23/0.44     dependent: set(para_into).
% 0.23/0.44     dependent: clear(para_from_right).
% 0.23/0.44     dependent: clear(para_into_right).
% 0.23/0.44     dependent: set(para_from_vars).
% 0.23/0.44     dependent: set(eq_units_both_ways).
% 0.23/0.44     dependent: set(dynamic_demod_all).
% 0.23/0.44     dependent: set(dynamic_demod).
% 0.23/0.44     dependent: set(order_eq).
% 0.23/0.44     dependent: set(back_demod).
% 0.23/0.44     dependent: set(lrpo).
% 0.23/0.44     dependent: set(hyper_res).
% 0.23/0.44     dependent: set(unit_deletion).
% 0.23/0.44     dependent: set(factor).
% 0.23/0.44  
% 0.23/0.44  ------------> process usable:
% 0.23/0.44  
% 0.23/0.44  ------------> process sos:
% 0.23/0.44    Following clause subsumed by 190 during input processing: 0 [copy,144,flip.1] {-} n1=n1.
% 0.23/0.44    Following clause subsumed by 190 during input processing: 0 [copy,190,flip.1] {-} A=A.
% 0.23/0.44  190 back subsumes 144.
% 0.23/0.44  190 back subsumes 119.
% 0.23/0.44  
% 0.23/0.44  ======= end of input processing =======
% 0.42/0.69  
% 0.42/0.69  Stopped by limit on insertions
% 0.42/0.69  
% 0.42/0.69  
% 0.42/0.69  Failed to model usable list: disabling FINDER
% 0.42/0.69  
% 0.42/0.69  
% 0.42/0.69  
% 0.42/0.69  -------------- Softie stats --------------
% 0.42/0.69  
% 0.42/0.69  UPDATE_STOP: 300
% 0.42/0.69  SFINDER_TIME_LIMIT: 2
% 0.42/0.69  SHORT_CLAUSE_CUTOFF: 4
% 0.42/0.69  number of clauses in intial UL: 121
% 0.42/0.69  number of clauses initially in problem: 180
% 0.42/0.69  percentage of clauses intially in UL: 67
% 0.42/0.69  percentage of distinct symbols occuring in initial UL: 77
% 0.42/0.69  percent of all initial clauses that are short: 100
% 0.42/0.69  absolute distinct symbol count: 57
% 0.42/0.69     distinct predicate count: 4
% 0.42/0.69     distinct function count: 42
% 0.42/0.69     distinct constant count: 11
% 0.42/0.69  
% 0.42/0.69  ---------- no more Softie stats ----------
% 0.42/0.69  
% 0.42/0.69  
% 0.42/0.69  
% 0.42/0.69  =========== start of search ===========
% 1.87/2.08  
% 1.87/2.08  -------- PROOF -------- 
% 1.87/2.08  % SZS status Unsatisfiable
% 1.87/2.08  % SZS output start Refutation
% 1.87/2.09  
% 1.87/2.09  ----> UNIT CONFLICT at   1.62 sec ----> 4940 [binary,4939.1,102.1] {-} $F.
% 1.87/2.09  
% 1.87/2.09  Length of proof is 3.  Level of proof is 3.
% 1.87/2.09  
% 1.87/2.09  ---------------- PROOF ----------------
% 1.87/2.09  % SZS status Unsatisfiable
% 1.87/2.09  % SZS output start Refutation
% 1.87/2.09  
% 1.87/2.09  17 [] {+} -p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(A,n1)))|p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(A))|p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(A))| -p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(A))|p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(A)).
% 1.87/2.09  37 [] {+} -p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(A,n1)))| -p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(A))| -p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(A))|p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(A)).
% 1.87/2.09  102 [] {+} -p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)).
% 1.87/2.09  103 [] {-} -p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)).
% 1.87/2.09  134,133 [] {-} fwork_DOTfifo_DOTrtl_DOTlevel_(A)=fwork_DOTfifo_DOTrtl_DOTint__level_(A).
% 1.87/2.09  188 [] {-} p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(t_206,n1))).
% 1.87/2.09  189 [] {-} p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)).
% 1.87/2.09  191 [back_demod,103,demod,134] {-} -p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(t_206)).
% 1.87/2.09  3835 [hyper,188,17,189,unit_del,191,102] {-} p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)).
% 1.87/2.09  4939 [hyper,3835,37,188,189] {-} p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)).
% 1.87/2.09  4940 [binary,4939.1,102.1] {-} $F.
% 1.87/2.09  
% 1.87/2.09  % SZS output end Refutation
% 1.87/2.09  ------------ end of proof -------------
% 1.87/2.09  
% 1.87/2.09  
% 1.87/2.09  Search stopped by max_proofs option.
% 1.87/2.09  
% 1.87/2.09  
% 1.87/2.09  Search stopped by max_proofs option.
% 1.87/2.09  
% 1.87/2.09  ============ end of search ============
% 1.87/2.09  
% 1.87/2.09  That finishes the proof of the theorem.
% 1.87/2.09  
% 1.87/2.09  Process 26028 finished Fri Jun 17 07:21:25 2022
%------------------------------------------------------------------------------