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

View Problem - Process Solution

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

% Computer : n020.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 : Sun Jul 17 14:29:44 EDT 2022

% Result   : Timeout 288.26s 288.50s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL368-1 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.12  % Command  : sos-script %s
% 0.12/0.32  % Computer : n020.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Mon Jul  4 04:06:15 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.12/0.34  ----- Otter 3.2, August 2001 -----
% 0.12/0.34  The process was started by sandbox2 on n020.cluster.edu,
% 0.12/0.34  Mon Jul  4 04:06:15 2022
% 0.12/0.34  The command was "./sos".  The process ID is 28928.
% 0.12/0.34  
% 0.12/0.34  set(prolog_style_variables).
% 0.12/0.34  set(auto).
% 0.12/0.34     dependent: set(auto1).
% 0.12/0.34     dependent: set(process_input).
% 0.12/0.34     dependent: clear(print_kept).
% 0.12/0.34     dependent: clear(print_new_demod).
% 0.12/0.34     dependent: clear(print_back_demod).
% 0.12/0.34     dependent: clear(print_back_sub).
% 0.12/0.34     dependent: set(control_memory).
% 0.12/0.34     dependent: assign(max_mem, 12000).
% 0.12/0.34     dependent: assign(pick_given_ratio, 4).
% 0.12/0.34     dependent: assign(stats_level, 1).
% 0.12/0.34     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34     dependent: assign(sos_limit, 5000).
% 0.12/0.34     dependent: assign(max_weight, 60).
% 0.12/0.34  clear(print_given).
% 0.12/0.34  
% 0.12/0.34  list(usable).
% 0.12/0.34  
% 0.12/0.34  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.34  
% 0.12/0.34  This is a Horn set without equality.  The strategy will
% 0.12/0.34  be hyperresolution, with satellites in sos and nuclei
% 0.12/0.34  in usable.
% 0.12/0.34  
% 0.12/0.34     dependent: set(hyper_res).
% 0.12/0.34     dependent: clear(order_hyper).
% 0.12/0.34  
% 0.12/0.34  ------------> process usable:
% 0.12/0.34  
% 0.12/0.34  ------------> process sos:
% 0.12/0.34  
% 0.12/0.34  ======= end of input processing =======
% 0.17/0.36  
% 0.17/0.36  Model 1 (0.00 seconds, 0 Inserts)
% 0.17/0.36  
% 0.17/0.36  Stopped by limit on number of solutions
% 0.17/0.36  
% 0.17/0.36  
% 0.17/0.36  -------------- Softie stats --------------
% 0.17/0.36  
% 0.17/0.36  UPDATE_STOP: 300
% 0.17/0.36  SFINDER_TIME_LIMIT: 2
% 0.17/0.36  SHORT_CLAUSE_CUTOFF: 4
% 0.17/0.36  number of clauses in intial UL: 2
% 0.17/0.36  number of clauses initially in problem: 5
% 0.17/0.36  percentage of clauses intially in UL: 40
% 0.17/0.36  percentage of distinct symbols occuring in initial UL: 85
% 0.17/0.36  percent of all initial clauses that are short: 100
% 0.17/0.36  absolute distinct symbol count: 7
% 0.17/0.36     distinct predicate count: 1
% 0.17/0.36     distinct function count: 2
% 0.17/0.36     distinct constant count: 4
% 0.17/0.36  
% 0.17/0.36  ---------- no more Softie stats ----------
% 0.17/0.36  
% 0.17/0.36  
% 0.17/0.36  
% 0.17/0.36  =========== start of search ===========
% 12.15/12.33  
% 12.15/12.33  
% 12.15/12.33  Changing weight limit from 60 to 34.
% 12.15/12.33  
% 12.15/12.33  Model 2 (0.00 seconds, 0 Inserts)
% 12.15/12.33  
% 12.15/12.33  Stopped by limit on number of solutions
% 12.15/12.33  
% 12.15/12.33  Stopped by limit on insertions
% 12.15/12.33  
% 12.15/12.33  Model 3 (0.00 seconds, 0 Inserts)
% 12.15/12.33  
% 12.15/12.33  Stopped by limit on number of solutions
% 12.15/12.33  
% 12.15/12.33  Stopped by limit on insertions
% 12.15/12.33  
% 12.15/12.33  Model 4 [ 1 0 212 ] (0.00 seconds, 250000 Inserts)
% 12.15/12.33  
% 12.15/12.33  Stopped by limit on insertions
% 12.15/12.33  
% 12.15/12.33  Model 5 [ 1 1 2061 ] (0.00 seconds, 250000 Inserts)
% 12.15/12.33  
% 12.15/12.33  Stopped by limit on insertions
% 12.15/12.33  
% 12.15/12.33  Model 6 [ 3 0 1550 ] (0.00 seconds, 250000 Inserts)
% 12.15/12.33  
% 12.15/12.33  Stopped by limit on insertions
% 12.15/12.33  
% 12.15/12.33  Model 7 [ 3 9 35888 ] (0.00 seconds, 250000 Inserts)
% 12.15/12.33  
% 12.15/12.33  Stopped by limit on insertions
% 12.15/12.33  
% 12.15/12.33  Model 8 [ 3 33 112237 ] (0.00 seconds, 250000 Inserts)
% 12.15/12.33  
% 12.15/12.33  Stopped by limit on insertions
% 12.15/12.33  
% 12.15/12.33  Model 9 [ 4 13 55401 ] (0.00 seconds, 250000 Inserts)
% 12.15/12.33  
% 12.15/12.33  Resetting weight limit to 34 after 145 givens.
% 12.15/12.33  
% 12.15/12.35  
% 12.15/12.35  
% 12.15/12.35  Changing weight limit from 34 to 30.
% 12.15/12.35  
% 12.15/12.35  Resetting weight limit to 30 after 150 givens.
% 12.15/12.35  
% 17.77/17.95  
% 17.77/17.95  
% 17.77/17.95  Changing weight limit from 30 to 25.
% 17.77/17.95  
% 17.77/17.95  Stopped by limit on insertions
% 17.77/17.95  
% 17.77/17.95  Stopped by limit on insertions
% 17.77/17.95  
% 17.77/17.95  Model 10 [ 5 9 33009 ] (0.00 seconds, 250000 Inserts)
% 17.77/17.95  
% 17.77/17.95  Resetting weight limit to 25 after 325 givens.
% 17.77/17.95  
% 17.77/17.97  
% 17.77/17.97  
% 17.77/17.97  Changing weight limit from 25 to 24.
% 17.77/17.97  
% 17.77/17.97  Resetting weight limit to 24 after 330 givens.
% 17.77/17.97  
% 17.77/18.02  
% 17.77/18.02  
% 17.77/18.02  Changing weight limit from 24 to 22.
% 17.77/18.02  
% 17.77/18.02  Resetting weight limit to 22 after 335 givens.
% 17.77/18.02  
% 17.86/18.05  
% 17.86/18.05  
% 17.86/18.05  Changing weight limit from 22 to 21.
% 17.86/18.05  
% 17.86/18.05  Resetting weight limit to 21 after 340 givens.
% 17.86/18.05  
% 17.86/18.07  
% 17.86/18.07  
% 17.86/18.07  Changing weight limit from 21 to 20.
% 17.86/18.07  
% 17.86/18.07  Resetting weight limit to 20 after 345 givens.
% 17.86/18.07  
% 17.86/18.08  
% 17.86/18.08  
% 17.86/18.08  Changing weight limit from 20 to 19.
% 17.86/18.08  
% 17.86/18.08  Resetting weight limit to 19 after 350 givens.
% 17.86/18.08  
% 17.92/18.16  
% 17.92/18.16  
% 17.92/18.16  Changing weight limit from 19 to 18.
% 17.92/18.16  
% 17.92/18.16  Resetting weight limit to 18 after 360 givens.
% 17.92/18.16  
% 18.04/18.23  
% 18.04/18.23  
% 18.04/18.23  Changing weight limit from 18 to 17.
% 18.04/18.23  
% 18.04/18.23  Modelling stopped after 300 given clauses and 0.00 seconds
% 18.04/18.23  
% 18.04/18.23  
% 18.04/18.23  Resetting weight limit to 17 after 380 givens.
% 18.04/18.23  
% 18.15/18.37  
% 18.15/18.37  
% 18.15/18.37  Changing weight limit from 17 to 16.
% 18.15/18.37  
% 18.15/18.37  Resetting weight limit to 16 after 440 givens.
% 18.15/18.37  
% 18.73/18.97  
% 18.73/18.97  
% 18.73/18.97  Changing weight limit from 16 to 15.
% 18.73/18.97  
% 18.73/18.97  Resetting weight limit to 15 after 700 givens.
% 18.73/18.97  
% 19.51/19.70  
% 19.51/19.70  
% 19.51/19.70  Changing weight limit from 15 to 14.
% 19.51/19.70  
% 19.51/19.70  Resetting weight limit to 14 after 920 givens.
% 19.51/19.70  
% 47.32/47.58  
% 47.32/47.58  
% 47.32/47.58  Changing weight limit from 14 to 15.
% 47.32/47.58  
% 47.32/47.58  Resetting weight limit to 15 after 6100 givens.
% 47.32/47.58  
% 285.44/285.60  
% 285.44/285.60  
% 285.44/285.60  Changing weight limit from 15 to 16.
% 285.44/285.60  
% 285.44/285.60  Resetting weight limit to 16 after 18285 givens.
% 285.44/285.60  
% 288.26/288.50  
% 288.26/288.50  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 288.26/288.50  
% 288.26/288.50  ----> UNIT CONFLICT at 250.77 sec ----> 307093 [binary,307092.1,2.1] {+} $F.
% 288.26/288.50  
% 288.26/288.50  Length of proof is 81.  Level of proof is 28.
% 288.26/288.50  
% 288.26/288.50  ---------------- PROOF ----------------
% 288.26/288.50  % SZS status Unsatisfiable
% 288.26/288.50  % SZS output start Refutation
% 288.26/288.50  
% 288.26/288.50  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 288.26/288.50  2 [] {+} -is_a_theorem(implies(implies(implies(x,implies(y,z)),u),implies(implies(y,implies(x,z)),u))).
% 288.26/288.50  3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 288.26/288.50  4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 288.26/288.50  5 [] {-} is_a_theorem(implies(A,implies(not(A),B))).
% 288.26/288.50  6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 288.26/288.50  7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 288.26/288.50  9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 288.26/288.50  16 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 288.26/288.50  27 [hyper,7,1,6] {-} is_a_theorem(implies(implies(not(implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(C,A),D))).
% 288.26/288.50  30 [hyper,7,1,3] {-} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))).
% 288.26/288.50  35 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 288.26/288.50  40 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 288.26/288.50  46 [hyper,35,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 288.26/288.50  49 [hyper,35,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 288.26/288.50  74 [hyper,46,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 288.26/288.50  92 [hyper,74,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 288.26/288.50  105 [hyper,92,1,40] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 288.26/288.50  130 [hyper,105,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 288.26/288.50  175 [hyper,130,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 288.26/288.50  182 [hyper,16,1,6] {-} is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(implies(B,D),implies(C,D))))).
% 288.26/288.50  194 [hyper,16,1,7] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(implies(B,C),implies(A,C)))).
% 288.26/288.50  196 [hyper,175,1,175] {+} is_a_theorem(implies(A,implies(B,implies(C,C)))).
% 288.26/288.50  206 [hyper,175,1,35] {-} is_a_theorem(implies(A,implies(B,implies(not(B),C)))).
% 288.26/288.50  208 [hyper,175,1,7] {-} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 288.26/288.50  219 [hyper,196,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,B)),C),implies(D,C))).
% 288.26/288.50  299 [hyper,206,1,16] {+} is_a_theorem(implies(implies(A,B),implies(C,implies(A,implies(not(B),D))))).
% 288.26/288.50  305 [hyper,208,1,16] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 288.26/288.50  525 [hyper,305,1,74] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 288.26/288.50  533 [hyper,305,1,6] {+} is_a_theorem(implies(implies(not(A),B),implies(C,implies(implies(B,A),A)))).
% 288.26/288.50  537 [hyper,305,1,219] {-} is_a_theorem(implies(A,implies(implies(implies(B,implies(C,C)),D),D))).
% 288.26/288.50  544 [hyper,525,1,305] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 288.26/288.50  626 [hyper,544,1,544] {+} is_a_theorem(implies(A,implies(B,A))).
% 288.26/288.50  639 [hyper,544,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,A)),C),implies(D,C))).
% 288.26/288.50  793 [hyper,626,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 288.26/288.50  809 [hyper,793,1,305] {-} is_a_theorem(implies(A,implies(implies(implies(B,not(C)),C),C))).
% 288.26/288.50  831 [hyper,793,1,3] {+} is_a_theorem(implies(A,implies(implies(A,B),implies(C,B)))).
% 288.26/288.50  832 [hyper,809,1,809] {-} is_a_theorem(implies(implies(implies(A,not(B)),B),B)).
% 288.26/288.50  996 [hyper,537,1,832] {-} is_a_theorem(implies(implies(implies(A,implies(B,B)),C),C)).
% 288.26/288.50  2202 [hyper,49,1,305] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 288.26/288.50  2236 [hyper,2202,1,305] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 288.26/288.50  2296 [hyper,2236,1,2236] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 288.26/288.50  2329 [hyper,2296,1,793] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 288.26/288.50  2348 [hyper,2329,1,305] {-} is_a_theorem(implies(A,implies(not(not(B)),B))).
% 288.26/288.50  2361 [hyper,2329,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 288.26/288.50  2362 [hyper,2348,1,2348] {+} is_a_theorem(implies(not(not(A)),A)).
% 288.26/288.50  2377 [hyper,2348,1,30] {+} is_a_theorem(implies(implies(A,B),implies(not(not(A)),B))).
% 288.26/288.50  2384 [hyper,2362,1,2296] {+} is_a_theorem(implies(A,not(not(A)))).
% 288.26/288.50  2415 [hyper,2384,1,831] {-} is_a_theorem(implies(implies(implies(A,not(not(A))),B),implies(C,B))).
% 288.26/288.50  2418 [hyper,2384,1,793] {-} is_a_theorem(implies(A,not(not(implies(B,A))))).
% 288.26/288.50  5189 [hyper,2377,1,2418] {-} is_a_theorem(implies(not(not(A)),not(not(implies(B,A))))).
% 288.26/288.50  5578 [hyper,5189,1,2296] {-} is_a_theorem(implies(not(implies(A,B)),not(B))).
% 288.26/288.50  5630 [hyper,5578,1,3] {-} is_a_theorem(implies(implies(not(A),B),implies(not(implies(C,A)),B))).
% 288.26/288.50  9054 [hyper,2361,1,305] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 288.26/288.50  9482 [hyper,9054,1,27] {+} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 288.26/288.50  15295 [hyper,9482,1,639] {-} is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)).
% 288.26/288.50  15297 [hyper,9482,1,305] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 288.26/288.50  15712 [hyper,15297,1,6] {+} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 288.26/288.50  17437 [hyper,2415,1,15297] {+} is_a_theorem(implies(implies(implies(A,not(not(A))),B),B)).
% 288.26/288.50  18664 [hyper,299,1,15297] {+} is_a_theorem(implies(implies(A,B),implies(A,implies(not(B),C)))).
% 288.26/288.50  19959 [hyper,5630,1,15297] {-} is_a_theorem(implies(implies(not(A),implies(B,A)),implies(B,A))).
% 288.26/288.50  23134 [hyper,533,1,793] {+} is_a_theorem(implies(A,implies(B,implies(implies(A,C),C)))).
% 288.26/288.50  23378 [hyper,23134,1,15297] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 288.26/288.50  23416 [hyper,23134,1,194] {-} is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(A,C))).
% 288.26/288.50  23665 [hyper,23378,1,16] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 288.26/288.50  25157 [hyper,23416,1,6] {-} is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 288.26/288.50  25471 [hyper,23665,1,626] {-} is_a_theorem(implies(A,implies(implies(B,implies(C,D)),implies(C,implies(B,D))))).
% 288.26/288.50  25514 [hyper,23665,1,2296] {+} is_a_theorem(implies(A,implies(implies(not(B),not(A)),B))).
% 288.26/288.50  25749 [hyper,25514,1,996] {-} is_a_theorem(implies(implies(not(A),not(implies(B,implies(C,C)))),A)).
% 288.26/288.50  26161 [hyper,25157,1,17437] {-} is_a_theorem(implies(implies(A,implies(implies(B,not(not(B))),C)),implies(A,C))).
% 288.26/288.50  26181 [hyper,25157,1,15295] {-} is_a_theorem(implies(implies(A,implies(implies(B,implies(C,B)),D)),implies(A,D))).
% 288.26/288.50  29256 [hyper,15712,1,23665] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(B),A),B))).
% 288.26/288.50  29449 [hyper,18664,1,23665] {+} is_a_theorem(implies(A,implies(implies(A,B),implies(not(B),C)))).
% 288.26/288.50  30428 [hyper,29256,1,2361] {+} is_a_theorem(implies(not(A),implies(implies(not(B),A),B))).
% 288.26/288.50  30554 [hyper,30428,1,23665] {+} is_a_theorem(implies(implies(not(A),B),implies(not(B),A))).
% 288.26/288.50  30750 [hyper,29449,1,30554] {+} is_a_theorem(implies(not(implies(implies(not(A),B),implies(not(B),C))),A)).
% 288.26/288.50  40985 [hyper,26161,1,182] {-} is_a_theorem(implies(implies(not(not(A)),B),implies(implies(B,C),implies(A,C)))).
% 288.26/288.50  41339 [hyper,26181,1,182] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,D),implies(B,D)))).
% 288.26/288.50  67649 [hyper,40985,1,23665] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(not(C)),A),implies(C,B)))).
% 288.26/288.50  85467 [hyper,67649,1,23416] {-} is_a_theorem(implies(A,implies(implies(not(not(B)),implies(A,C)),implies(B,C)))).
% 288.26/288.50  93256 [hyper,85467,1,19959] {-} is_a_theorem(implies(implies(not(not(A)),implies(not(implies(A,B)),B)),implies(A,B))).
% 288.26/288.50  96808 [hyper,30750,1,25749] {-} is_a_theorem(implies(implies(not(not(implies(A,implies(B,B)))),C),implies(not(C),D))).
% 288.26/288.50  186223 [hyper,93256,1,41339] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(not(implies(A,B)),B),C))).
% 288.26/288.50  187398 [hyper,96808,1,25471] {-} is_a_theorem(implies(not(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))),D)).
% 288.26/288.50  243640 [hyper,186223,1,3] {-} is_a_theorem(implies(implies(not(implies(A,B)),B),implies(implies(B,C),implies(A,C)))).
% 288.26/288.50  307092 [hyper,243640,1,187398] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,implies(A,C)),D))).
% 288.26/288.50  307093 [binary,307092.1,2.1] {+} $F.
% 288.26/288.50  
% 288.26/288.50  % SZS output end Refutation
% 288.26/288.50  ------------ end of proof -------------
% 288.26/288.50  
% 288.26/288.50  
% 288.26/288.50  Search stopped by max_proofs option.
% 288.26/288.50  
% 288.26/288.50  
% 288.26/288.50  Search stopped by max_proofs option.
% 288.26/288.50  
% 288.26/288.50  ============ end of search ============
% 288.26/288.50  
% 288.26/288.50  ----------- soft-scott stats ----------
% 288.26/288.50  
% 288.26/288.50  true clauses given        7065      (38.5%)
% 288.26/288.50  false clauses given      11277
% 288.26/288.50  
% 288.26/288.50        FALSE     TRUE
% 288.26/288.50    14  0         787
% 288.26/288.50    15  443       1718
% 288.26/288.50    16  2375      1
% 288.26/288.50  tot:  2818      2506      (47.1% true)
% 288.26/288.50  
% 288.26/288.50  
% 288.26/288.50  Model 10 [ 5 9 33009 ] (0.02 seconds, 250000 Inserts)
% 288.26/288.50  
% 288.26/288.50  That finishes the proof of the theorem.
% 288.26/288.50  
% 288.26/288.50  Process 28928 finished Mon Jul  4 04:11:03 2022
%------------------------------------------------------------------------------