TSTP Solution File: SWV401+1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SWV401+1 : TPTP v8.1.0. Released v3.3.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 : Wed Jul 20 21:38:20 EDT 2022

% Result   : Theorem 5.74s 5.96s
% Output   : Refutation 5.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV401+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jun 14 17:48:25 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.35  ----- Otter 3.2, August 2001 -----
% 0.19/0.35  The process was started by sandbox2 on n012.cluster.edu,
% 0.19/0.35  Tue Jun 14 17:48:25 2022
% 0.19/0.35  The command was "./sos".  The process ID is 25364.
% 0.19/0.35  
% 0.19/0.35  set(prolog_style_variables).
% 0.19/0.35  set(auto).
% 0.19/0.35     dependent: set(auto1).
% 0.19/0.35     dependent: set(process_input).
% 0.19/0.35     dependent: clear(print_kept).
% 0.19/0.35     dependent: clear(print_new_demod).
% 0.19/0.35     dependent: clear(print_back_demod).
% 0.19/0.35     dependent: clear(print_back_sub).
% 0.19/0.35     dependent: set(control_memory).
% 0.19/0.35     dependent: assign(max_mem, 12000).
% 0.19/0.35     dependent: assign(pick_given_ratio, 4).
% 0.19/0.35     dependent: assign(stats_level, 1).
% 0.19/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35     dependent: assign(sos_limit, 5000).
% 0.19/0.35     dependent: assign(max_weight, 60).
% 0.19/0.35  clear(print_given).
% 0.19/0.35  
% 0.19/0.35  formula_list(usable).
% 0.19/0.35  
% 0.19/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.19/0.35  
% 0.19/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.19/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.35  clauses in usable.
% 0.19/0.35  
% 0.19/0.35     dependent: set(knuth_bendix).
% 0.19/0.35     dependent: set(para_from).
% 0.19/0.35     dependent: set(para_into).
% 0.19/0.35     dependent: clear(para_from_right).
% 0.19/0.35     dependent: clear(para_into_right).
% 0.19/0.35     dependent: set(para_from_vars).
% 0.19/0.35     dependent: set(eq_units_both_ways).
% 0.19/0.35     dependent: set(dynamic_demod_all).
% 0.19/0.35     dependent: set(dynamic_demod).
% 0.19/0.35     dependent: set(order_eq).
% 0.19/0.35     dependent: set(back_demod).
% 0.19/0.35     dependent: set(lrpo).
% 0.19/0.35     dependent: set(hyper_res).
% 0.19/0.35     dependent: set(unit_deletion).
% 0.19/0.35     dependent: set(factor).
% 0.19/0.35  
% 0.19/0.35  ------------> process usable:
% 0.19/0.35  
% 0.19/0.35  ------------> process sos:
% 0.19/0.35    Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] {-} A=A.
% 0.19/0.35  
% 0.19/0.35  ======= end of input processing =======
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Failed to model usable list: disabling FINDER
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  -------------- Softie stats --------------
% 0.19/0.44  
% 0.19/0.44  UPDATE_STOP: 300
% 0.19/0.44  SFINDER_TIME_LIMIT: 2
% 0.19/0.44  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.44  number of clauses in intial UL: 21
% 0.19/0.44  number of clauses initially in problem: 34
% 0.19/0.44  percentage of clauses intially in UL: 61
% 0.19/0.44  percentage of distinct symbols occuring in initial UL: 94
% 0.19/0.44  percent of all initial clauses that are short: 100
% 0.19/0.44  absolute distinct symbol count: 19
% 0.19/0.44     distinct predicate count: 6
% 0.19/0.44     distinct function count: 5
% 0.19/0.44     distinct constant count: 8
% 0.19/0.44  
% 0.19/0.44  ---------- no more Softie stats ----------
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  =========== start of search ===========
% 3.35/3.54  
% 3.35/3.54  
% 3.35/3.54  Changing weight limit from 60 to 42.
% 3.35/3.54  
% 3.35/3.54  Resetting weight limit to 42 after 150 givens.
% 3.35/3.54  
% 3.87/4.10  
% 3.87/4.10  
% 3.87/4.10  Changing weight limit from 42 to 34.
% 3.87/4.10  
% 3.87/4.10  Resetting weight limit to 34 after 155 givens.
% 3.87/4.10  
% 4.40/4.57  
% 4.40/4.57  
% 4.40/4.57  Changing weight limit from 34 to 32.
% 4.40/4.57  
% 4.40/4.57  Resetting weight limit to 32 after 160 givens.
% 4.40/4.57  
% 4.76/4.94  
% 4.76/4.94  
% 4.76/4.94  Changing weight limit from 32 to 31.
% 4.76/4.94  
% 4.76/4.94  Resetting weight limit to 31 after 165 givens.
% 4.76/4.94  
% 5.14/5.34  
% 5.14/5.34  
% 5.14/5.34  Changing weight limit from 31 to 30.
% 5.14/5.34  
% 5.14/5.34  Resetting weight limit to 30 after 170 givens.
% 5.14/5.34  
% 5.63/5.83  
% 5.63/5.83  
% 5.63/5.83  Changing weight limit from 30 to 28.
% 5.63/5.83  
% 5.63/5.83  Resetting weight limit to 28 after 175 givens.
% 5.63/5.83  
% 5.74/5.96  
% 5.74/5.96  -------- PROOF -------- 
% 5.74/5.96  % SZS status Theorem
% 5.74/5.96  % SZS output start Refutation
% 5.74/5.96  
% 5.74/5.96  ----> UNIT CONFLICT at   5.58 sec ----> 8622 [binary,8621.1,2742.1] {-} $F.
% 5.74/5.96  
% 5.74/5.96  Length of proof is 14.  Level of proof is 10.
% 5.74/5.96  
% 5.74/5.96  ---------------- PROOF ----------------
% 5.74/5.96  % SZS status Theorem
% 5.74/5.96  % SZS output start Refutation
% 5.74/5.96  
% 5.74/5.96  4 [] {+} strictly_less_than(A,B)| -less_than(A,B)|less_than(B,A).
% 5.74/5.96  11 [] {+} -pair_in_list(insert_slb(A,pair(B,C)),D,E)|pair_in_list(A,D,E)|B=D.
% 5.74/5.96  12 [] {+} -pair_in_list(insert_slb(A,pair(B,C)),D,E)|pair_in_list(A,D,E)|C=E.
% 5.74/5.96  13 [] {+} pair_in_list(insert_slb(A,pair(B,C)),D,E)| -pair_in_list(A,D,E).
% 5.74/5.96  14 [] {+} pair_in_list(insert_slb(A,pair(B,C)),D,E)|B!=D|C!=E.
% 5.74/5.96  17 [] {+} -strictly_less_than(A,B)|update_slb(insert_slb(C,pair(D,A)),B)=insert_slb(update_slb(C,B),pair(D,B)).
% 5.74/5.96  18 [] {+} -less_than(A,B)|update_slb(insert_slb(C,pair(D,B)),A)=insert_slb(update_slb(C,A),pair(D,B)).
% 5.74/5.96  19 [] {+} -pair_in_list($c6,A,B)| -less_than(C,B)|pair_in_list(update_slb($c6,C),A,B).
% 5.74/5.96  20 [] {+} -pair_in_list(update_slb(insert_slb($c6,pair($c2,$c1)),$c3),$c5,$c4).
% 5.74/5.96  22 [] {-} less_than(A,B)|less_than(B,A).
% 5.74/5.96  32 [] {-} pair_in_list(insert_slb($c6,pair($c2,$c1)),$c5,$c4).
% 5.74/5.96  33 [] {-} less_than($c3,$c4).
% 5.74/5.96  34 [] {-} A=A.
% 5.74/5.96  36 [hyper,22,4,factor_simp] {-} less_than(A,B)|strictly_less_than(B,A).
% 5.74/5.96  48,47 [hyper,33,18] {-} update_slb(insert_slb(A,pair(B,$c4)),$c3)=insert_slb(update_slb(A,$c3),pair(B,$c4)).
% 5.74/5.96  61 [hyper,34,14,34] {-} pair_in_list(insert_slb(A,pair(B,C)),B,C).
% 5.74/5.96  83 [hyper,36,17] {-} less_than(A,B)|update_slb(insert_slb(C,pair(D,B)),A)=insert_slb(update_slb(C,A),pair(D,A)).
% 5.74/5.96  129 [hyper,32,11,flip.2] {-} pair_in_list($c6,$c5,$c4)|$c5=$c2.
% 5.74/5.96  248 [para_from,129.2.1,20.1.2] {-} -pair_in_list(update_slb(insert_slb($c6,pair($c2,$c1)),$c3),$c2,$c4)|pair_in_list($c6,$c5,$c4).
% 5.74/5.96  2625 [para_into,248.1.1.1.2.2,12.3.1] {-} -pair_in_list(update_slb(insert_slb($c6,pair($c2,A)),$c3),$c2,$c4)|pair_in_list($c6,$c5,$c4)| -pair_in_list(insert_slb(B,pair(C,$c1)),D,A)|pair_in_list(B,D,A).
% 5.74/5.96  2688 [factor,2625.2.4,demod,48,unit_del,61] {-} pair_in_list($c6,$c5,$c4)| -pair_in_list(insert_slb($c6,pair(A,$c1)),$c5,$c4).
% 5.74/5.96  2706 [hyper,2688,32] {-} pair_in_list($c6,$c5,$c4).
% 5.74/5.96  2713 [hyper,2706,19,33] {-} pair_in_list(update_slb($c6,$c3),$c5,$c4).
% 5.74/5.96  2742 [hyper,2713,13] {-} pair_in_list(insert_slb(update_slb($c6,$c3),pair(A,B)),$c5,$c4).
% 5.74/5.96  8606 [para_from,83.2.1,20.1.1,unit_del,2742] {-} less_than($c3,$c1).
% 5.74/5.96  8608,8607 [hyper,8606,18] {-} update_slb(insert_slb(A,pair(B,$c1)),$c3)=insert_slb(update_slb(A,$c3),pair(B,$c1)).
% 5.74/5.96  8621 [back_demod,20,demod,8608] {-} -pair_in_list(insert_slb(update_slb($c6,$c3),pair($c2,$c1)),$c5,$c4).
% 5.74/5.96  8622 [binary,8621.1,2742.1] {-} $F.
% 5.74/5.96  
% 5.74/5.96  % SZS output end Refutation
% 5.74/5.96  ------------ end of proof -------------
% 5.74/5.96  
% 5.74/5.96  
% 5.74/5.96  Search stopped by max_proofs option.
% 5.74/5.96  
% 5.74/5.96  
% 5.74/5.96  Search stopped by max_proofs option.
% 5.74/5.96  
% 5.74/5.96  ============ end of search ============
% 5.74/5.96  
% 5.74/5.96  That finishes the proof of the theorem.
% 5.74/5.96  
% 5.74/5.96  Process 25364 finished Tue Jun 14 17:48:30 2022
%------------------------------------------------------------------------------