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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : ALG069+1 : TPTP v8.1.0. Released v2.7.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 : Thu Jul 14 18:01:00 EDT 2022

% Result   : Theorem 0.54s 0.76s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07  % Problem  : ALG069+1 : TPTP v8.1.0. Released v2.7.0.
% 0.04/0.08  % Command  : sos-script %s
% 0.07/0.27  % Computer : n032.cluster.edu
% 0.07/0.27  % Model    : x86_64 x86_64
% 0.07/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27  % Memory   : 8042.1875MB
% 0.07/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27  % CPULimit : 300
% 0.07/0.27  % WCLimit  : 600
% 0.07/0.27  % DateTime : Wed Jun  8 16:46:52 EDT 2022
% 0.07/0.27  % CPUTime  : 
% 0.07/0.28  ----- Otter 3.2, August 2001 -----
% 0.07/0.28  The process was started by sandbox2 on n032.cluster.edu,
% 0.07/0.28  Wed Jun  8 16:46:52 2022
% 0.07/0.28  The command was "./sos".  The process ID is 5830.
% 0.07/0.28  
% 0.07/0.28  set(prolog_style_variables).
% 0.07/0.28  set(auto).
% 0.07/0.28     dependent: set(auto1).
% 0.07/0.28     dependent: set(process_input).
% 0.07/0.28     dependent: clear(print_kept).
% 0.07/0.28     dependent: clear(print_new_demod).
% 0.07/0.28     dependent: clear(print_back_demod).
% 0.07/0.28     dependent: clear(print_back_sub).
% 0.07/0.28     dependent: set(control_memory).
% 0.07/0.28     dependent: assign(max_mem, 12000).
% 0.07/0.28     dependent: assign(pick_given_ratio, 4).
% 0.07/0.28     dependent: assign(stats_level, 1).
% 0.07/0.28     dependent: assign(pick_semantic_ratio, 3).
% 0.07/0.28     dependent: assign(sos_limit, 5000).
% 0.07/0.28     dependent: assign(max_weight, 60).
% 0.07/0.28  clear(print_given).
% 0.07/0.28  
% 0.07/0.28  formula_list(usable).
% 0.07/0.28  
% 0.07/0.28  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.07/0.28  
% 0.07/0.28  This is a Horn set with equality.  The strategy will be
% 0.07/0.28  Knuth-Bendix and hyper_res, with positive clauses in
% 0.07/0.28  sos and nonpositive clauses in usable.
% 0.07/0.28  
% 0.07/0.28     dependent: set(knuth_bendix).
% 0.07/0.28     dependent: set(para_from).
% 0.07/0.28     dependent: set(para_into).
% 0.07/0.28     dependent: clear(para_from_right).
% 0.07/0.28     dependent: clear(para_into_right).
% 0.07/0.28     dependent: set(para_from_vars).
% 0.07/0.28     dependent: set(eq_units_both_ways).
% 0.07/0.28     dependent: set(dynamic_demod_all).
% 0.07/0.28     dependent: set(dynamic_demod).
% 0.07/0.28     dependent: set(order_eq).
% 0.07/0.28     dependent: set(back_demod).
% 0.07/0.28     dependent: set(lrpo).
% 0.07/0.28     dependent: set(hyper_res).
% 0.07/0.28     dependent: clear(order_hyper).
% 0.07/0.28  
% 0.07/0.28  ------------> process usable:
% 0.07/0.28  
% 0.07/0.28  ------------> process sos:
% 0.07/0.28    Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.07/0.28  
% 0.07/0.28  ======= end of input processing =======
% 0.44/0.64  
% 0.44/0.64  Model 1 (0.00 seconds, 0 Inserts)
% 0.44/0.64  
% 0.44/0.64  Stopped by limit on number of solutions
% 0.44/0.64  
% 0.44/0.64  
% 0.44/0.64  -------------- Softie stats --------------
% 0.44/0.64  
% 0.44/0.64  UPDATE_STOP: 300
% 0.44/0.64  SFINDER_TIME_LIMIT: 2
% 0.44/0.64  SHORT_CLAUSE_CUTOFF: 4
% 0.44/0.64  number of clauses in intial UL: 11
% 0.44/0.64  number of clauses initially in problem: 13
% 0.44/0.64  percentage of clauses intially in UL: 84
% 0.44/0.64  percentage of distinct symbols occuring in initial UL: 100
% 0.44/0.64  percent of all initial clauses that are short: 100
% 0.44/0.64  absolute distinct symbol count: 9
% 0.44/0.64     distinct predicate count: 3
% 0.44/0.64     distinct function count: 5
% 0.44/0.64     distinct constant count: 1
% 0.44/0.64  
% 0.44/0.64  ---------- no more Softie stats ----------
% 0.44/0.64  
% 0.44/0.64  
% 0.44/0.64  
% 0.44/0.64  Stopped by limit on insertions
% 0.44/0.64  
% 0.44/0.64  =========== start of search ===========
% 0.54/0.76  
% 0.54/0.76  -------- PROOF -------- 
% 0.54/0.76  % SZS status Theorem
% 0.54/0.76  % SZS output start Refutation
% 0.54/0.76  
% 0.54/0.76  Model 2 [ 1 0 194 ] (0.00 seconds, 2968 Inserts)
% 0.54/0.76  
% 0.54/0.76  Model 3 [ 2 1 53 ] (0.00 seconds, 3097 Inserts)
% 0.54/0.76  
% 0.54/0.76  Stopped by limit on insertions
% 0.54/0.76  
% 0.54/0.76  Model 4 [ 2 0 105 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.76  
% 0.54/0.76  Stopped by limit on insertions
% 0.54/0.76  
% 0.54/0.76  Model 5 [ 2 1 124 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.76  
% 0.54/0.76  -----> EMPTY CLAUSE at   0.45 sec ----> 68 [hyper,61,67,13] {-} $F.
% 0.54/0.76  
% 0.54/0.76  Length of proof is 7.  Level of proof is 4.
% 0.54/0.76  
% 0.54/0.76  ---------------- PROOF ----------------
% 0.54/0.76  % SZS status Theorem
% 0.54/0.76  % SZS output start Refutation
% 0.54/0.76  
% 0.54/0.76  3 [] {+} -sorti1(A)|sorti1($f1(A)).
% 0.54/0.76  4 [] {+} -sorti1(A)|op1($f1(A),$f1(A))=A.
% 0.54/0.76  5 [] {+} -sorti2(A)|op2(A,A)!=$c1.
% 0.54/0.76  6 [] {+} -sorti1(A)|sorti2(h(A)).
% 0.54/0.76  7 [] {+} -sorti2(A)|sorti1(j(A)).
% 0.54/0.76  8 [] {+} -sorti1(A)| -sorti1(B)|h(op1(A,B))=op2(h(A),h(B)).
% 0.54/0.76  10 [] {+} -sorti2(A)|h(j(A))=A.
% 0.54/0.76  12 [] {-} sorti2($c1).
% 0.54/0.76  13 [] {+} A=A.
% 0.54/0.76  15,14 [hyper,12,10] {+} h(j($c1))=$c1.
% 0.54/0.76  18 [hyper,12,7] {+} sorti1(j($c1)).
% 0.54/0.76  23,22 [hyper,18,4] {+} op1($f1(j($c1)),$f1(j($c1)))=j($c1).
% 0.54/0.76  24 [hyper,18,3] {+} sorti1($f1(j($c1))).
% 0.54/0.76  55 [hyper,24,8,24,demod,23,15,flip.1] {-} op2(h($f1(j($c1))),h($f1(j($c1))))=$c1.
% 0.54/0.76  61 [hyper,24,6] {+} sorti2(h($f1(j($c1)))).
% 0.54/0.76  67 [para_from,55.1.1,5.2.1] {-} -sorti2(h($f1(j($c1))))|$c1!=$c1.
% 0.54/0.76  68 [hyper,61,67,13] {-} $F.
% 0.54/0.76  
% 0.54/0.76  % SZS output end Refutation
% 0.54/0.76  ------------ end of proof -------------
% 0.54/0.76  
% 0.54/0.76  
% 0.54/0.76  Search stopped by max_proofs option.
% 0.54/0.76  
% 0.54/0.76  
% 0.54/0.76  Search stopped by max_proofs option.
% 0.54/0.76  
% 0.54/0.76  ============ end of search ============
% 0.54/0.76  
% 0.54/0.76  ----------- soft-scott stats ----------
% 0.54/0.76  
% 0.54/0.76  true clauses given           5      (38.5%)
% 0.54/0.76  false clauses given          8
% 0.54/0.76  
% 0.54/0.76        FALSE     TRUE
% 0.54/0.76     5  0         1
% 0.54/0.76     6  0         2
% 0.54/0.76     7  0         2
% 0.54/0.76     8  0         3
% 0.54/0.76     9  0         2
% 0.54/0.76    10  0         3
% 0.54/0.76    12  0         1
% 0.54/0.76    13  0         1
% 0.54/0.76    14  1         1
% 0.54/0.76    15  1         1
% 0.54/0.76    20  1         2
% 0.54/0.76    25  1         1
% 0.54/0.76    30  1         0
% 0.54/0.76  tot:  5         20      (80.0% true)
% 0.54/0.76  
% 0.54/0.76  
% 0.54/0.76  Model 5 [ 2 1 124 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.76  
% 0.54/0.76  That finishes the proof of the theorem.
% 0.54/0.76  
% 0.54/0.76  Process 5830 finished Wed Jun  8 16:46:52 2022
%------------------------------------------------------------------------------