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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : ALG177+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n021.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 18:01:12 EDT 2022

% Result   : Theorem 0.80s 0.97s
% Output   : Refutation 0.80s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : ALG177+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.13/0.33  % Computer : n021.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Thu Jun  9 02:23:07 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.35  ----- Otter 3.2, August 2001 -----
% 0.13/0.35  The process was started by sandbox on n021.cluster.edu,
% 0.13/0.35  Thu Jun  9 02:23:08 2022
% 0.13/0.35  The command was "./sos".  The process ID is 30599.
% 0.13/0.35  
% 0.13/0.35  set(prolog_style_variables).
% 0.13/0.35  set(auto).
% 0.13/0.35     dependent: set(auto1).
% 0.13/0.35     dependent: set(process_input).
% 0.13/0.35     dependent: clear(print_kept).
% 0.13/0.35     dependent: clear(print_new_demod).
% 0.13/0.35     dependent: clear(print_back_demod).
% 0.13/0.35     dependent: clear(print_back_sub).
% 0.13/0.35     dependent: set(control_memory).
% 0.13/0.35     dependent: assign(max_mem, 12000).
% 0.13/0.35     dependent: assign(pick_given_ratio, 4).
% 0.13/0.35     dependent: assign(stats_level, 1).
% 0.13/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35     dependent: assign(sos_limit, 5000).
% 0.13/0.35     dependent: assign(max_weight, 60).
% 0.13/0.35  clear(print_given).
% 0.13/0.35  
% 0.13/0.35  formula_list(usable).
% 0.13/0.35  
% 0.13/0.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.35  
% 0.13/0.35  This is a Horn set with equality.  The strategy will be
% 0.13/0.35  Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.35  sos and nonpositive clauses in usable.
% 0.13/0.35  
% 0.13/0.35     dependent: set(knuth_bendix).
% 0.13/0.35     dependent: set(para_from).
% 0.13/0.35     dependent: set(para_into).
% 0.13/0.35     dependent: clear(para_from_right).
% 0.13/0.35     dependent: clear(para_into_right).
% 0.13/0.35     dependent: set(para_from_vars).
% 0.13/0.35     dependent: set(eq_units_both_ways).
% 0.13/0.35     dependent: set(dynamic_demod_all).
% 0.13/0.35     dependent: set(dynamic_demod).
% 0.13/0.35     dependent: set(order_eq).
% 0.13/0.35     dependent: set(back_demod).
% 0.13/0.35     dependent: set(lrpo).
% 0.13/0.35     dependent: set(hyper_res).
% 0.13/0.35     dependent: clear(order_hyper).
% 0.13/0.35  
% 0.13/0.35  ------------> process usable:
% 0.13/0.35  
% 0.13/0.35  ------------> process sos:
% 0.13/0.35    Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.13/0.35  
% 0.13/0.35  ======= end of input processing =======
% 0.76/0.96  
% 0.76/0.96  Stopped by limit on insertions
% 0.76/0.96  
% 0.76/0.96  
% 0.76/0.96  Failed to model usable list: disabling FINDER
% 0.76/0.96  
% 0.76/0.96  
% 0.76/0.96  
% 0.76/0.96  -------------- Softie stats --------------
% 0.76/0.96  
% 0.76/0.96  UPDATE_STOP: 300
% 0.76/0.96  SFINDER_TIME_LIMIT: 2
% 0.76/0.96  SHORT_CLAUSE_CUTOFF: 4
% 0.76/0.96  number of clauses in intial UL: 11
% 0.76/0.96  number of clauses initially in problem: 13
% 0.76/0.96  percentage of clauses intially in UL: 84
% 0.76/0.96  percentage of distinct symbols occuring in initial UL: 100
% 0.76/0.96  percent of all initial clauses that are short: 100
% 0.76/0.96  absolute distinct symbol count: 9
% 0.76/0.96     distinct predicate count: 3
% 0.76/0.96     distinct function count: 5
% 0.76/0.96     distinct constant count: 1
% 0.76/0.96  
% 0.76/0.96  ---------- no more Softie stats ----------
% 0.76/0.96  
% 0.76/0.96  
% 0.76/0.96  
% 0.76/0.96  =========== start of search ===========
% 0.80/0.97  
% 0.80/0.97  -------- PROOF -------- 
% 0.80/0.97  % SZS status Theorem
% 0.80/0.97  % SZS output start Refutation
% 0.80/0.97  
% 0.80/0.97  -----> EMPTY CLAUSE at   0.60 sec ----> 1923 [hyper,39,3,43] {-} $F.
% 0.80/0.97  
% 0.80/0.97  Length of proof is 6.  Level of proof is 3.
% 0.80/0.97  
% 0.80/0.97  ---------------- PROOF ----------------
% 0.80/0.97  % SZS status Theorem
% 0.80/0.97  % SZS output start Refutation
% 0.80/0.97  
% 0.80/0.97  3 [] {+} -sorti1(A)|op1($c1,A)!=A.
% 0.80/0.97  4 [] {+} -sorti2(A)|sorti2($f1(A)).
% 0.80/0.97  5 [] {+} -sorti2(A)|op2(A,$f1(A))=$f1(A).
% 0.80/0.97  6 [] {+} -sorti1(A)|sorti2(h(A)).
% 0.80/0.97  7 [] {+} -sorti2(A)|sorti1(j(A)).
% 0.80/0.97  9 [] {+} -sorti2(A)| -sorti2(B)|j(op2(A,B))=op1(j(A),j(B)).
% 0.80/0.97  11 [] {+} -sorti1(A)|j(h(A))=A.
% 0.80/0.97  12 [] {-} sorti1($c1).
% 0.80/0.97  15,14 [hyper,12,11] {-} j(h($c1))=$c1.
% 0.80/0.97  18 [hyper,12,6] {-} sorti2(h($c1)).
% 0.80/0.97  23,22 [hyper,18,5] {-} op2(h($c1),$f1(h($c1)))=$f1(h($c1)).
% 0.80/0.97  24 [hyper,18,4] {-} sorti2($f1(h($c1))).
% 0.80/0.97  39 [hyper,24,9,18,demod,23,15,flip.1] {-} op1($c1,j($f1(h($c1))))=j($f1(h($c1))).
% 0.80/0.97  43 [hyper,24,7] {-} sorti1(j($f1(h($c1)))).
% 0.80/0.97  1923 [hyper,39,3,43] {-} $F.
% 0.80/0.97  
% 0.80/0.97  % SZS output end Refutation
% 0.80/0.97  ------------ end of proof -------------
% 0.80/0.97  
% 0.80/0.97  
% 0.80/0.97  Search stopped by max_proofs option.
% 0.80/0.97  
% 0.80/0.97  
% 0.80/0.97  Search stopped by max_proofs option.
% 0.80/0.97  
% 0.80/0.97  ============ end of search ============
% 0.80/0.97  
% 0.80/0.97  That finishes the proof of the theorem.
% 0.80/0.97  
% 0.80/0.97  Process 30599 finished Thu Jun  9 02:23:08 2022
%------------------------------------------------------------------------------