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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SWV409+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n032.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:21 EDT 2022

% Result   : Theorem 0.16s 0.51s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SWV409+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : sos-script %s
% 0.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 600
% 0.11/0.31  % DateTime : Tue Jun 14 17:09:58 EDT 2022
% 0.11/0.31  % CPUTime  : 
% 0.16/0.33  ----- Otter 3.2, August 2001 -----
% 0.16/0.33  The process was started by sandbox2 on n032.cluster.edu,
% 0.16/0.33  Tue Jun 14 17:09:58 2022
% 0.16/0.33  The command was "./sos".  The process ID is 27629.
% 0.16/0.33  
% 0.16/0.33  set(prolog_style_variables).
% 0.16/0.33  set(auto).
% 0.16/0.33     dependent: set(auto1).
% 0.16/0.33     dependent: set(process_input).
% 0.16/0.33     dependent: clear(print_kept).
% 0.16/0.33     dependent: clear(print_new_demod).
% 0.16/0.33     dependent: clear(print_back_demod).
% 0.16/0.33     dependent: clear(print_back_sub).
% 0.16/0.33     dependent: set(control_memory).
% 0.16/0.33     dependent: assign(max_mem, 12000).
% 0.16/0.33     dependent: assign(pick_given_ratio, 4).
% 0.16/0.33     dependent: assign(stats_level, 1).
% 0.16/0.33     dependent: assign(pick_semantic_ratio, 3).
% 0.16/0.33     dependent: assign(sos_limit, 5000).
% 0.16/0.33     dependent: assign(max_weight, 60).
% 0.16/0.33  clear(print_given).
% 0.16/0.33  
% 0.16/0.33  formula_list(usable).
% 0.16/0.33  
% 0.16/0.33  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.16/0.33  
% 0.16/0.33  This ia a non-Horn set with equality.  The strategy will be
% 0.16/0.33  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.16/0.33  unit deletion, with positive clauses in sos and nonpositive
% 0.16/0.33  clauses in usable.
% 0.16/0.33  
% 0.16/0.33     dependent: set(knuth_bendix).
% 0.16/0.33     dependent: set(para_from).
% 0.16/0.33     dependent: set(para_into).
% 0.16/0.33     dependent: clear(para_from_right).
% 0.16/0.33     dependent: clear(para_into_right).
% 0.16/0.33     dependent: set(para_from_vars).
% 0.16/0.33     dependent: set(eq_units_both_ways).
% 0.16/0.33     dependent: set(dynamic_demod_all).
% 0.16/0.33     dependent: set(dynamic_demod).
% 0.16/0.33     dependent: set(order_eq).
% 0.16/0.33     dependent: set(back_demod).
% 0.16/0.33     dependent: set(lrpo).
% 0.16/0.33     dependent: set(hyper_res).
% 0.16/0.33     dependent: set(unit_deletion).
% 0.16/0.33     dependent: set(factor).
% 0.16/0.33  
% 0.16/0.33  ------------> process usable:
% 0.16/0.33  
% 0.16/0.33  ------------> process sos:
% 0.16/0.33    Following clause subsumed by 39 during input processing: 0 [copy,39,flip.1] {-} A=A.
% 0.16/0.33  
% 0.16/0.33  ======= end of input processing =======
% 0.16/0.43  
% 0.16/0.43  
% 0.16/0.43  Failed to model usable list: disabling FINDER
% 0.16/0.43  
% 0.16/0.43  
% 0.16/0.43  
% 0.16/0.43  -------------- Softie stats --------------
% 0.16/0.43  
% 0.16/0.43  UPDATE_STOP: 300
% 0.16/0.43  SFINDER_TIME_LIMIT: 2
% 0.16/0.43  SHORT_CLAUSE_CUTOFF: 4
% 0.16/0.43  number of clauses in intial UL: 26
% 0.16/0.43  number of clauses initially in problem: 39
% 0.16/0.43  percentage of clauses intially in UL: 66
% 0.16/0.43  percentage of distinct symbols occuring in initial UL: 94
% 0.16/0.43  percent of all initial clauses that are short: 100
% 0.16/0.43  absolute distinct symbol count: 18
% 0.16/0.43     distinct predicate count: 6
% 0.16/0.43     distinct function count: 7
% 0.16/0.43     distinct constant count: 5
% 0.16/0.43  
% 0.16/0.43  ---------- no more Softie stats ----------
% 0.16/0.43  
% 0.16/0.43  
% 0.16/0.43  
% 0.16/0.43  =========== start of search ===========
% 0.16/0.51  
% 0.16/0.51  -------- PROOF -------- 
% 0.16/0.51  % SZS status Theorem
% 0.16/0.51  % SZS output start Refutation
% 0.16/0.51  
% 0.16/0.51  -----> EMPTY CLAUSE at   0.15 sec ----> 1023 [hyper,177,24,175] {-} $F.
% 0.16/0.51  
% 0.16/0.51  Length of proof is 5.  Level of proof is 3.
% 0.16/0.51  
% 0.16/0.51  ---------------- PROOF ----------------
% 0.16/0.51  % SZS status Theorem
% 0.16/0.51  % SZS output start Refutation
% 0.16/0.51  
% 0.16/0.51  4 [] {+} strictly_less_than(A,B)| -less_than(A,B)|less_than(B,A).
% 0.16/0.51  19 [] {+} -contains_slb(A,B)|pair_in_list(A,B,$f1(A,B)).
% 0.16/0.51  20 [] {+} -pair_in_list(A,B,C)| -strictly_less_than(B,D)| -strictly_less_than(C,D)|pair_in_list(update_slb(A,D),B,D).
% 0.16/0.51  21 [] {+} -pair_in_list(A,B,C)| -strictly_less_than(B,D)| -less_than(D,C)|pair_in_list(update_slb(A,D),B,$f2(A,B,C,D)).
% 0.16/0.51  22 [] {+} -pair_in_list(A,B,C)| -strictly_less_than(B,D)| -less_than(D,C)|less_than(D,$f2(A,B,C,D)).
% 0.16/0.51  23 [] {+} -pair_in_list(update_slb($c3,$c1),$c2,$c1).
% 0.16/0.51  24 [] {+} -pair_in_list(update_slb($c3,$c1),$c2,A)| -less_than($c1,A).
% 0.16/0.51  27 [] {-} less_than(A,B)|less_than(B,A).
% 0.16/0.51  37 [] {-} contains_slb($c3,$c2).
% 0.16/0.51  38 [] {-} strictly_less_than($c2,$c1).
% 0.16/0.51  41 [hyper,27,4,factor_simp] {-} less_than(A,B)|strictly_less_than(B,A).
% 0.16/0.51  52 [hyper,37,19] {-} pair_in_list($c3,$c2,$f1($c3,$c2)).
% 0.16/0.51  140 [hyper,52,20,38,41,unit_del,23] {-} less_than($c1,$f1($c3,$c2)).
% 0.16/0.51  175 [hyper,140,22,52,38] {-} less_than($c1,$f2($c3,$c2,$f1($c3,$c2),$c1)).
% 0.16/0.51  177 [hyper,140,21,52,38] {-} pair_in_list(update_slb($c3,$c1),$c2,$f2($c3,$c2,$f1($c3,$c2),$c1)).
% 0.16/0.51  1023 [hyper,177,24,175] {-} $F.
% 0.16/0.51  
% 0.16/0.51  % SZS output end Refutation
% 0.16/0.51  ------------ end of proof -------------
% 0.16/0.51  
% 0.16/0.51  
% 0.16/0.51  Search stopped by max_proofs option.
% 0.16/0.51  
% 0.16/0.51  
% 0.16/0.51  Search stopped by max_proofs option.
% 0.16/0.51  
% 0.16/0.51  ============ end of search ============
% 0.16/0.51  
% 0.16/0.51  That finishes the proof of the theorem.
% 0.16/0.51  
% 0.16/0.51  Process 27629 finished Tue Jun 14 17:09:58 2022
%------------------------------------------------------------------------------