TSTP Solution File: CAT018-1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : CAT018-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n017.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 : Fri Jul 15 00:07:20 EDT 2022

% Result   : Unsatisfiable 1.88s 2.07s
% Output   : Refutation 1.88s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : CAT018-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.11  % Command  : sos-script %s
% 0.11/0.31  % Computer : n017.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 : Sun May 29 16:04:54 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.11/0.33  ----- Otter 3.2, August 2001 -----
% 0.11/0.33  The process was started by sandbox on n017.cluster.edu,
% 0.11/0.33  Sun May 29 16:04:54 2022
% 0.11/0.33  The command was "./sos".  The process ID is 21237.
% 0.11/0.33  
% 0.11/0.33  set(prolog_style_variables).
% 0.11/0.33  set(auto).
% 0.11/0.33     dependent: set(auto1).
% 0.11/0.33     dependent: set(process_input).
% 0.11/0.33     dependent: clear(print_kept).
% 0.11/0.33     dependent: clear(print_new_demod).
% 0.11/0.33     dependent: clear(print_back_demod).
% 0.11/0.33     dependent: clear(print_back_sub).
% 0.11/0.33     dependent: set(control_memory).
% 0.11/0.33     dependent: assign(max_mem, 12000).
% 0.11/0.33     dependent: assign(pick_given_ratio, 4).
% 0.11/0.33     dependent: assign(stats_level, 1).
% 0.11/0.33     dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.33     dependent: assign(sos_limit, 5000).
% 0.11/0.33     dependent: assign(max_weight, 60).
% 0.11/0.33  clear(print_given).
% 0.11/0.33  
% 0.11/0.33  list(usable).
% 0.11/0.33  
% 0.11/0.33  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.11/0.33  
% 0.11/0.33  This is a Horn set with equality.  The strategy will be
% 0.11/0.33  Knuth-Bendix and hyper_res, with positive clauses in
% 0.11/0.33  sos and nonpositive clauses in usable.
% 0.11/0.33  
% 0.11/0.33     dependent: set(knuth_bendix).
% 0.11/0.33     dependent: set(para_from).
% 0.11/0.33     dependent: set(para_into).
% 0.11/0.33     dependent: clear(para_from_right).
% 0.11/0.33     dependent: clear(para_into_right).
% 0.11/0.33     dependent: set(para_from_vars).
% 0.11/0.33     dependent: set(eq_units_both_ways).
% 0.11/0.33     dependent: set(dynamic_demod_all).
% 0.11/0.33     dependent: set(dynamic_demod).
% 0.11/0.33     dependent: set(order_eq).
% 0.11/0.33     dependent: set(back_demod).
% 0.11/0.33     dependent: set(lrpo).
% 0.11/0.33     dependent: set(hyper_res).
% 0.11/0.33     dependent: clear(order_hyper).
% 0.11/0.33  
% 0.11/0.33  ------------> process usable:
% 0.11/0.33  
% 0.11/0.33  ------------> process sos:
% 0.11/0.33    Following clause subsumed by 22 during input processing: 0 [copy,22,flip.1] {-} A=A.
% 0.11/0.33  
% 0.11/0.33  ======= end of input processing =======
% 0.17/0.39  
% 0.17/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.17/0.39  
% 0.17/0.39  Stopped by limit on number of solutions
% 0.17/0.39  
% 0.17/0.39  
% 0.17/0.39  -------------- Softie stats --------------
% 0.17/0.39  
% 0.17/0.39  UPDATE_STOP: 300
% 0.17/0.39  SFINDER_TIME_LIMIT: 2
% 0.17/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.17/0.39  number of clauses in intial UL: 13
% 0.17/0.39  number of clauses initially in problem: 22
% 0.17/0.39  percentage of clauses intially in UL: 59
% 0.17/0.39  percentage of distinct symbols occuring in initial UL: 80
% 0.17/0.39  percent of all initial clauses that are short: 100
% 0.17/0.39  absolute distinct symbol count: 10
% 0.17/0.39     distinct predicate count: 4
% 0.17/0.39     distinct function count: 3
% 0.17/0.39     distinct constant count: 3
% 0.17/0.39  
% 0.17/0.39  ---------- no more Softie stats ----------
% 0.17/0.39  
% 0.17/0.39  
% 0.17/0.39  
% 0.17/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.17/0.39  
% 0.17/0.39  Stopped by limit on number of solutions
% 0.17/0.39  
% 0.17/0.39  =========== start of search ===========
% 1.88/2.07  
% 1.88/2.07  -------- PROOF -------- 
% 1.88/2.07  % SZS status Unsatisfiable
% 1.88/2.07  % SZS output start Refutation
% 1.88/2.07  
% 1.88/2.07  Model 3 (0.00 seconds, 0 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on number of solutions
% 1.88/2.07  
% 1.88/2.07  Model 4 (0.00 seconds, 0 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on number of solutions
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 5 [ 1 2 284 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 6 [ 1 1 156 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 7 [ 1 1 36262 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Model 8 [ 1 2 47958 ] (0.00 seconds, 179239 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 9 [ 2 6 174334 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 10 [ 8 1 925 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 11 [ 3 1 465 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 12 [ 9 1 86 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 13 [ 3 2 42680 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 14 [ 9 1 146 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 15 [ 3 1 25684 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 16 [ 4 15 213146 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 17 [ 4 4 98741 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 18 [ 5 9 133401 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 19 [ 8 2 60129 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  Stopped by limit on insertions
% 1.88/2.07  
% 1.88/2.07  Model 20 [ 5 8 105963 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  ----> UNIT CONFLICT at   1.70 sec ----> 334 [binary,333.1,13.1] {+} $F.
% 1.88/2.07  
% 1.88/2.07  Length of proof is 5.  Level of proof is 4.
% 1.88/2.07  
% 1.88/2.07  ---------------- PROOF ----------------
% 1.88/2.07  % SZS status Unsatisfiable
% 1.88/2.07  % SZS output start Refutation
% 1.88/2.07  
% 1.88/2.07  1 [] {+} -defined(A,B)|product(A,B,compose(A,B)).
% 1.88/2.07  3 [] {+} -product(A,B,C)| -defined(C,D)|defined(B,D).
% 1.88/2.07  4 [] {+} -product(A,B,C)| -product(B,D,E)| -defined(C,D)|defined(A,E).
% 1.88/2.07  9 [] {+} -defined(A,B)| -defined(B,C)| -identity_map(B)|defined(A,C).
% 1.88/2.07  10 [] {+} -defined(A,B)| -identity_map(A)|product(A,B,B).
% 1.88/2.07  13 [] {+} -defined(a,compose(b,c)).
% 1.88/2.07  14 [] {+} identity_map(domain(A)).
% 1.88/2.07  16 [] {+} defined(A,domain(A)).
% 1.88/2.07  18 [] {+} product(A,domain(A),A).
% 1.88/2.07  20 [] {+} defined(a,b).
% 1.88/2.07  21 [] {+} defined(b,c).
% 1.88/2.07  28 [hyper,21,1] {+} product(b,c,compose(b,c)).
% 1.88/2.07  54 [hyper,18,3,20] {+} defined(domain(a),b).
% 1.88/2.07  58 [hyper,54,10,14] {+} product(domain(a),b,b).
% 1.88/2.07  114 [hyper,58,4,28,21] {-} defined(domain(a),compose(b,c)).
% 1.88/2.07  333 [hyper,114,9,16,14] {-} defined(a,compose(b,c)).
% 1.88/2.07  334 [binary,333.1,13.1] {+} $F.
% 1.88/2.07  
% 1.88/2.07  % SZS output end Refutation
% 1.88/2.07  ------------ end of proof -------------
% 1.88/2.07  
% 1.88/2.07  
% 1.88/2.07  Search stopped by max_proofs option.
% 1.88/2.07  
% 1.88/2.07  
% 1.88/2.07  Search stopped by max_proofs option.
% 1.88/2.07  
% 1.88/2.07  ============ end of search ============
% 1.88/2.07  
% 1.88/2.07  ----------- soft-scott stats ----------
% 1.88/2.07  
% 1.88/2.07  true clauses given           9      (21.4%)
% 1.88/2.07  false clauses given         33
% 1.88/2.07  
% 1.88/2.07        FALSE     TRUE
% 1.88/2.07     5  0         4
% 1.88/2.07     6  22        32
% 1.88/2.07     7  24        22
% 1.88/2.07     8  8         10
% 1.88/2.07     9  5         10
% 1.88/2.07    10  7         8
% 1.88/2.07    11  0         7
% 1.88/2.07    12  8         8
% 1.88/2.07    13  32        32
% 1.88/2.07    14  20        5
% 1.88/2.07    19  3         4
% 1.88/2.07  tot:  129       142      (52.4% true)
% 1.88/2.07  
% 1.88/2.07  
% 1.88/2.07  Model 20 [ 5 8 105963 ] (0.00 seconds, 250000 Inserts)
% 1.88/2.07  
% 1.88/2.07  That finishes the proof of the theorem.
% 1.88/2.07  
% 1.88/2.07  Process 21237 finished Sun May 29 16:04:56 2022
%------------------------------------------------------------------------------