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

View Problem - Process Solution

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

% Computer : n008.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:28:03 EDT 2022

% Result   : Unsatisfiable 46.38s 46.57s
% Output   : Refutation 46.38s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL119-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.13/0.33  % Computer : n008.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 : Mon Jul  4 15:38:23 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.35  ----- Otter 3.2, August 2001 -----
% 0.19/0.35  The process was started by sandbox on n008.cluster.edu,
% 0.19/0.35  Mon Jul  4 15:38:23 2022
% 0.19/0.35  The command was "./sos".  The process ID is 32381.
% 0.19/0.35  
% 0.19/0.35  set(prolog_style_variables).
% 0.19/0.35  set(auto).
% 0.19/0.35     dependent: set(auto1).
% 0.19/0.35     dependent: set(process_input).
% 0.19/0.35     dependent: clear(print_kept).
% 0.19/0.35     dependent: clear(print_new_demod).
% 0.19/0.35     dependent: clear(print_back_demod).
% 0.19/0.35     dependent: clear(print_back_sub).
% 0.19/0.35     dependent: set(control_memory).
% 0.19/0.35     dependent: assign(max_mem, 12000).
% 0.19/0.35     dependent: assign(pick_given_ratio, 4).
% 0.19/0.35     dependent: assign(stats_level, 1).
% 0.19/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35     dependent: assign(sos_limit, 5000).
% 0.19/0.35     dependent: assign(max_weight, 60).
% 0.19/0.35  clear(print_given).
% 0.19/0.35  
% 0.19/0.35  list(usable).
% 0.19/0.35  
% 0.19/0.35  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.19/0.35  
% 0.19/0.35  This is a Horn set without equality.  The strategy will
% 0.19/0.35  be hyperresolution, with satellites in sos and nuclei
% 0.19/0.35  in usable.
% 0.19/0.35  
% 0.19/0.35     dependent: set(hyper_res).
% 0.19/0.35     dependent: clear(order_hyper).
% 0.19/0.35  
% 0.19/0.35  ------------> process usable:
% 0.19/0.35  
% 0.19/0.35  ------------> process sos:
% 0.19/0.35  
% 0.19/0.35  ======= end of input processing =======
% 0.19/0.37  
% 0.19/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.37  
% 0.19/0.37  Stopped by limit on number of solutions
% 0.19/0.37  
% 0.19/0.37  
% 0.19/0.37  -------------- Softie stats --------------
% 0.19/0.37  
% 0.19/0.37  UPDATE_STOP: 300
% 0.19/0.37  SFINDER_TIME_LIMIT: 2
% 0.19/0.37  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.37  number of clauses in intial UL: 2
% 0.19/0.37  number of clauses initially in problem: 3
% 0.19/0.37  percentage of clauses intially in UL: 66
% 0.19/0.37  percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.37  percent of all initial clauses that are short: 100
% 0.19/0.37  absolute distinct symbol count: 5
% 0.19/0.37     distinct predicate count: 1
% 0.19/0.37     distinct function count: 1
% 0.19/0.37     distinct constant count: 3
% 0.19/0.37  
% 0.19/0.37  ---------- no more Softie stats ----------
% 0.19/0.37  
% 0.19/0.37  
% 0.19/0.37  
% 0.19/0.37  =========== start of search ===========
% 5.81/6.02  
% 5.81/6.02  
% 5.81/6.02  Changing weight limit from 60 to 48.
% 5.81/6.02  
% 5.81/6.02  Model 2 (0.00 seconds, 0 Inserts)
% 5.81/6.02  
% 5.81/6.02  Stopped by limit on number of solutions
% 5.81/6.02  
% 5.81/6.02  Model 3 (0.00 seconds, 0 Inserts)
% 5.81/6.02  
% 5.81/6.02  Stopped by limit on number of solutions
% 5.81/6.02  
% 5.81/6.02  Resetting weight limit to 48 after 85 givens.
% 5.81/6.02  
% 6.21/6.47  
% 6.21/6.47  
% 6.21/6.47  Changing weight limit from 48 to 44.
% 6.21/6.47  
% 6.21/6.47  Resetting weight limit to 44 after 90 givens.
% 6.21/6.47  
% 6.99/7.17  
% 6.99/7.17  
% 6.99/7.17  Changing weight limit from 44 to 40.
% 6.99/7.17  
% 6.99/7.17  Resetting weight limit to 40 after 100 givens.
% 6.99/7.17  
% 7.76/7.93  
% 7.76/7.93  
% 7.76/7.93  Changing weight limit from 40 to 36.
% 7.76/7.93  
% 7.76/7.93  Resetting weight limit to 36 after 110 givens.
% 7.76/7.93  
% 32.79/32.96  
% 32.79/32.96  
% 32.79/32.96  Changing weight limit from 36 to 32.
% 32.79/32.96  
% 32.79/32.96  Resetting weight limit to 32 after 315 givens.
% 32.79/32.96  
% 32.98/33.19  
% 32.98/33.19  
% 32.98/33.19  Changing weight limit from 32 to 28.
% 32.98/33.19  
% 32.98/33.19  Resetting weight limit to 28 after 325 givens.
% 32.98/33.19  
% 34.84/35.04  
% 34.84/35.04  
% 34.84/35.04  Changing weight limit from 28 to 24.
% 34.84/35.04  
% 34.84/35.04  Modelling stopped after 300 given clauses and 0.00 seconds
% 34.84/35.04  
% 34.84/35.04  
% 34.84/35.04  Resetting weight limit to 24 after 480 givens.
% 34.84/35.04  
% 41.95/42.15  
% 41.95/42.15  
% 41.95/42.15  Changing weight limit from 24 to 20.
% 41.95/42.15  
% 41.95/42.15  Resetting weight limit to 20 after 1235 givens.
% 41.95/42.15  
% 46.38/46.57  
% 46.38/46.57  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 46.38/46.57  
% 46.38/46.57  ----> UNIT CONFLICT at  45.71 sec ----> 88789 [binary,88788.1,2.1] {-} $F.
% 46.38/46.57  
% 46.38/46.57  Length of proof is 72.  Level of proof is 29.
% 46.38/46.57  
% 46.38/46.57  ---------------- PROOF ----------------
% 46.38/46.57  % SZS status Unsatisfiable
% 46.38/46.57  % SZS output start Refutation
% 46.38/46.57  
% 46.38/46.57  1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 46.38/46.57  2 [] {+} -is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(b,a)))).
% 46.38/46.57  3 [] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(C,A)),equivalent(B,C)))).
% 46.38/46.57  4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(equivalent(D,equivalent(E,C)),equivalent(D,E))))),equivalent(A,B))).
% 46.38/46.57  5 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(equivalent(C,equivalent(D,B)),equivalent(C,D))),equivalent(E,equivalent(equivalent(F,equivalent(G,E)),equivalent(F,G))))),A)).
% 46.38/46.57  7 [hyper,4,1,3] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(C,equivalent(D,B)),equivalent(C,D)),A)))).
% 46.38/46.57  9 [hyper,7,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(D,E)),equivalent(C,D)))),equivalent(A,B)),E)).
% 46.38/46.57  10 [hyper,7,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(D,equivalent(equivalent(equivalent(E,equivalent(F,D)),equivalent(E,F)),C))))),equivalent(A,B))).
% 46.38/46.57  15 [hyper,9,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(C,equivalent(D,equivalent(equivalent(E,equivalent(F,G)),equivalent(E,F)))),equivalent(C,D)),G))),equivalent(A,B))).
% 46.38/46.57  32 [hyper,5,1,3] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),A)).
% 46.38/46.57  38 [hyper,32,1,3] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(D,D)),C))),equivalent(A,B))).
% 46.38/46.57  40 [hyper,32,1,9] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(D,equivalent(E,E))),equivalent(C,D)))),equivalent(A,B))).
% 46.38/46.57  42 [hyper,32,1,4] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(D,B)),equivalent(C,D)))))).
% 46.38/46.57  45 [hyper,42,1,4] {+} is_a_theorem(equivalent(A,A)).
% 46.38/46.57  55 [hyper,45,1,10] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(equivalent(equivalent(D,equivalent(E,C)),equivalent(D,E)),B)))),A)).
% 46.38/46.57  57 [hyper,45,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(D,B)),equivalent(C,D)))),A)).
% 46.38/46.57  58 [hyper,45,1,3] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,C))),equivalent(A,B))).
% 46.38/46.57  148 [hyper,58,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,B)),C)).
% 46.38/46.57  152 [hyper,58,1,3] {+} is_a_theorem(equivalent(A,equivalent(B,equivalent(B,A)))).
% 46.38/46.57  160 [hyper,152,1,3] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(D,equivalent(D,C))))),equivalent(A,B))).
% 46.38/46.57  174 [hyper,148,1,152] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,D)),equivalent(B,C)),D)))).
% 46.38/46.57  184 [hyper,148,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(C,equivalent(D,E)),equivalent(C,D)),E))),equivalent(A,B))).
% 46.38/46.57  230 [hyper,174,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(C,equivalent(equivalent(equivalent(D,equivalent(E,F)),equivalent(D,E)),F))))),equivalent(A,B))).
% 46.38/46.57  756 [hyper,15,1,45] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,equivalent(equivalent(D,equivalent(E,F)),equivalent(D,E)))),equivalent(B,C)),F)),A)).
% 46.38/46.57  1995 [hyper,184,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,D)),equivalent(B,C)),equivalent(D,A)))).
% 46.38/46.57  2131 [hyper,1995,1,55] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,B)),equivalent(equivalent(D,equivalent(E,C)),equivalent(D,E)))).
% 46.38/46.57  4069 [hyper,38,1,1995] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(C,equivalent(A,equivalent(D,D)))),equivalent(B,C)))).
% 46.38/46.57  4104 [hyper,38,1,7] {+} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),B)).
% 46.38/46.57  4118 [hyper,4069,1,184] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,D)),equivalent(B,C)),equivalent(D,equivalent(A,equivalent(E,E)))))).
% 46.38/46.57  4372 [hyper,4104,1,3] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(C,D)),D))),equivalent(A,B))).
% 46.38/46.57  5199 [hyper,40,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,B),C)),A),C)).
% 46.38/46.57  5254 [hyper,5199,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(C,equivalent(equivalent(D,D),E)),C),E))),equivalent(A,B))).
% 46.38/46.57  8729 [hyper,2131,1,58] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,B)),equivalent(D,equivalent(D,C)))).
% 46.38/46.57  8911 [hyper,8729,1,152] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,D)),equivalent(B,C)),equivalent(E,equivalent(E,D)))))).
% 46.38/46.57  10498 [hyper,4118,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),equivalent(equivalent(C,equivalent(D,B)),equivalent(C,D)))).
% 46.38/46.57  14967 [hyper,5254,1,152] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(equivalent(C,C),A)),B))).
% 46.38/46.57  15081 [hyper,14967,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(equivalent(D,equivalent(equivalent(E,E),C)),D)))),equivalent(A,B))).
% 46.38/46.57  30799 [hyper,230,1,45] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(B,equivalent(equivalent(equivalent(C,equivalent(D,E)),equivalent(C,D)),E)))),A)).
% 46.38/46.57  32098 [hyper,15081,1,10498] {-} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),equivalent(C,equivalent(equivalent(equivalent(D,equivalent(equivalent(E,E),C)),D),B)))).
% 46.38/46.57  32149 [hyper,15081,1,1995] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,B),C)),A),equivalent(equivalent(D,equivalent(E,C)),equivalent(D,E)))).
% 46.38/46.57  32198 [hyper,15081,1,3] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(C,equivalent(equivalent(D,D),B)),C),A)))).
% 46.38/46.57  32499 [hyper,32198,1,57] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,C),B)),A)).
% 46.38/46.57  35554 [hyper,4372,1,1995] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(C,equivalent(D,equivalent(D,A)))),equivalent(B,C)))).
% 46.38/46.57  37154 [hyper,32149,1,32499] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),A),equivalent(equivalent(C,C),B))).
% 46.38/46.57  37189 [hyper,37154,1,14967] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,B),equivalent(equivalent(equivalent(C,D),C),equivalent(equivalent(E,E),D)))),A)).
% 46.38/46.57  37244 [hyper,37154,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(C,D),C),equivalent(equivalent(E,E),D)))),equivalent(A,B))).
% 46.38/46.57  37245 [hyper,37154,1,32098] {-} is_a_theorem(equivalent(equivalent(A,A),equivalent(equivalent(B,equivalent(equivalent(equivalent(C,equivalent(equivalent(D,D),B)),C),E)),E))).
% 46.38/46.57  46594 [hyper,37189,1,37154] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),B),equivalent(equivalent(D,D),C))),A)).
% 46.38/46.57  47258 [hyper,37244,1,152] {-} is_a_theorem(equivalent(equivalent(equivalent(A,A),B),equivalent(equivalent(C,B),C))).
% 46.38/46.57  48222 [hyper,47258,1,152] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(equivalent(B,B),C),equivalent(equivalent(D,C),D))))).
% 46.38/46.57  50269 [hyper,48222,1,45] {-} is_a_theorem(equivalent(equivalent(A,A),equivalent(equivalent(equivalent(B,B),C),equivalent(equivalent(D,C),D)))).
% 46.38/46.57  51770 [hyper,37245,1,50269] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(equivalent(C,C),A)),B),D)),D)).
% 46.38/46.57  51841 [hyper,51770,1,35554] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,equivalent(B,C))),equivalent(equivalent(D,D),C)),A)).
% 46.38/46.57  52109 [hyper,51841,1,2131] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(equivalent(B,C),B)),C))).
% 46.38/46.57  52720 [hyper,52109,1,756] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,equivalent(equivalent(C,equivalent(D,B)),equivalent(C,D))))).
% 46.38/46.57  52737 [hyper,52109,1,152] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(B,equivalent(equivalent(B,equivalent(equivalent(C,D),C)),D))))).
% 46.38/46.57  54548 [hyper,52720,1,46594] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),B)),A),C)).
% 46.38/46.57  54561 [hyper,52720,1,30799] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,B)),equivalent(C,D)),D)).
% 46.38/46.57  55042 [hyper,54548,1,152] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(equivalent(B,equivalent(equivalent(C,D),C)),B),D)))).
% 46.38/46.57  55160 [hyper,52737,1,45] {-} is_a_theorem(equivalent(equivalent(A,A),equivalent(B,equivalent(equivalent(B,equivalent(equivalent(C,D),C)),D)))).
% 46.38/46.57  56346 [hyper,55160,1,47258] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(B,equivalent(equivalent(C,D),C)),D))),A)).
% 46.38/46.57  56923 [hyper,56346,1,54561] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),B)),C),A)).
% 46.38/46.57  56992 [hyper,56346,1,55042] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),A),equivalent(equivalent(C,B),C))).
% 46.38/46.57  57039 [hyper,56346,1,8911] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(B,C))),equivalent(A,C))).
% 46.38/46.57  57344 [hyper,56923,1,2131] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,D)),equivalent(B,C))),equivalent(A,D))).
% 46.38/46.57  57527 [hyper,56992,1,160] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),A),equivalent(equivalent(C,equivalent(D,equivalent(D,C))),B))).
% 46.38/46.57  58600 [hyper,57039,1,52720] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),C),equivalent(A,B))).
% 46.38/46.57  66066 [hyper,57344,1,58600] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,B),D)),D),C)).
% 46.38/46.57  67448 [hyper,57527,1,57344] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),A),equivalent(C,B))).
% 46.38/46.57  67624 [hyper,67448,1,58600] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A)).
% 46.38/46.57  68083 [hyper,67624,1,56923] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,equivalent(B,A)),C))).
% 46.38/46.57  68121 [hyper,67624,1,2131] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,equivalent(B,C)),C))).
% 46.38/46.57  68818 [hyper,68121,1,68083] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,D)),D),equivalent(B,C))),A)).
% 46.38/46.57  73928 [hyper,66066,1,67624] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,D))),equivalent(equivalent(A,B),equivalent(D,C)))).
% 46.38/46.57  88788 [hyper,73928,1,68818] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,equivalent(B,A)))).
% 46.38/46.57  88789 [binary,88788.1,2.1] {-} $F.
% 46.38/46.57  
% 46.38/46.57  % SZS output end Refutation
% 46.38/46.57  ------------ end of proof -------------
% 46.38/46.57  
% 46.38/46.57  
% 46.38/46.57  Search stopped by max_proofs option.
% 46.38/46.57  
% 46.38/46.57  
% 46.38/46.57  Search stopped by max_proofs option.
% 46.38/46.57  
% 46.38/46.57  ============ end of search ============
% 46.38/46.57  
% 46.38/46.57  ----------- soft-scott stats ----------
% 46.38/46.57  
% 46.38/46.57  true clauses given         370      (20.5%)
% 46.38/46.57  false clauses given       1434
% 46.38/46.57  
% 46.38/46.57        FALSE     TRUE
% 46.38/46.57    16  309       472
% 46.38/46.57    20  2361      2052
% 46.38/46.57  tot:  2670      2524      (48.6% true)
% 46.38/46.57  
% 46.38/46.57  
% 46.38/46.57  Model 3 (0.00 seconds, 0 Inserts)
% 46.38/46.57  
% 46.38/46.57  That finishes the proof of the theorem.
% 46.38/46.57  
% 46.38/46.57  Process 32381 finished Mon Jul  4 15:39:09 2022
%------------------------------------------------------------------------------