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

View Problem - Process Solution

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

% Computer : n027.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:27:24 EDT 2022

% Result   : Unsatisfiable 69.04s 69.26s
% Output   : Refutation 69.04s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : LCL021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul  4 02:26:10 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox on n027.cluster.edu,
% 0.12/0.35  Mon Jul  4 02:26:10 2022
% 0.12/0.35  The command was "./sos".  The process ID is 21740.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35  
% 0.12/0.35  This is a Horn set without equality.  The strategy will
% 0.12/0.35  be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35  in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: clear(order_hyper).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.12/0.38  
% 0.12/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38  
% 0.12/0.38  Stopped by limit on number of solutions
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  -------------- Softie stats --------------
% 0.12/0.38  
% 0.12/0.38  UPDATE_STOP: 300
% 0.12/0.38  SFINDER_TIME_LIMIT: 2
% 0.12/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38  number of clauses in intial UL: 2
% 0.12/0.38  number of clauses initially in problem: 3
% 0.12/0.38  percentage of clauses intially in UL: 66
% 0.12/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38  percent of all initial clauses that are short: 100
% 0.12/0.38  absolute distinct symbol count: 5
% 0.12/0.38     distinct predicate count: 1
% 0.12/0.38     distinct function count: 1
% 0.12/0.38     distinct constant count: 3
% 0.12/0.38  
% 0.12/0.38  ---------- no more Softie stats ----------
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  =========== start of search ===========
% 46.40/46.62  
% 46.40/46.62  
% 46.40/46.62  Changing weight limit from 60 to 56.
% 46.40/46.62  
% 46.40/46.62  Model 2 [ 1 0 82 ] (0.00 seconds, 190134 Inserts)
% 46.40/46.62  
% 46.40/46.62  Model 3 [ 1 1 34 ] (0.00 seconds, 188932 Inserts)
% 46.40/46.62  
% 46.40/46.62  Model 4 [ 1 0 391 ] (0.00 seconds, 185777 Inserts)
% 46.40/46.62  
% 46.40/46.62  Model 5 [ 2 0 264 ] (0.00 seconds, 186110 Inserts)
% 46.40/46.62  
% 46.40/46.62  Resetting weight limit to 56 after 110 givens.
% 46.40/46.62  
% 47.24/47.43  
% 47.24/47.43  
% 47.24/47.43  Changing weight limit from 56 to 52.
% 47.24/47.43  
% 47.24/47.43  Resetting weight limit to 52 after 115 givens.
% 47.24/47.43  
% 48.63/48.84  
% 48.63/48.84  
% 48.63/48.84  Changing weight limit from 52 to 44.
% 48.63/48.84  
% 48.63/48.84  Resetting weight limit to 44 after 125 givens.
% 48.63/48.84  
% 50.92/51.13  
% 50.92/51.13  
% 50.92/51.13  Changing weight limit from 44 to 40.
% 50.92/51.13  
% 50.92/51.13  Resetting weight limit to 40 after 155 givens.
% 50.92/51.13  
% 52.82/53.03  
% 52.82/53.03  
% 52.82/53.03  Changing weight limit from 40 to 36.
% 52.82/53.03  
% 52.82/53.03  Resetting weight limit to 36 after 190 givens.
% 52.82/53.03  
% 53.50/53.70  
% 53.50/53.70  
% 53.50/53.70  Changing weight limit from 36 to 32.
% 53.50/53.70  
% 53.50/53.70  Resetting weight limit to 32 after 210 givens.
% 53.50/53.70  
% 53.58/53.80  
% 53.58/53.80  
% 53.58/53.80  Changing weight limit from 32 to 28.
% 53.58/53.80  
% 53.58/53.80  Resetting weight limit to 28 after 215 givens.
% 53.58/53.80  
% 61.10/61.33  
% 61.10/61.33  
% 61.10/61.33  Changing weight limit from 28 to 24.
% 61.10/61.33  
% 61.10/61.33  Model 6 [ 4 1 889 ] (0.00 seconds, 185392 Inserts)
% 61.10/61.33  
% 61.10/61.33  Resetting weight limit to 24 after 285 givens.
% 61.10/61.33  
% 61.55/61.73  
% 61.55/61.73  
% 61.55/61.73  Changing weight limit from 24 to 20.
% 61.55/61.73  
% 61.55/61.73  Resetting weight limit to 20 after 315 givens.
% 61.55/61.73  
% 69.04/69.26  
% 69.04/69.26  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 69.04/69.26  
% 69.04/69.26  Modelling stopped after 300 given clauses and 0.00 seconds
% 69.04/69.26  
% 69.04/69.26  
% 69.04/69.26  ----> UNIT CONFLICT at  68.71 sec ----> 96004 [binary,96003.1,2.1] {-} $F.
% 69.04/69.26  
% 69.04/69.26  Length of proof is 83.  Level of proof is 35.
% 69.04/69.26  
% 69.04/69.26  ---------------- PROOF ----------------
% 69.04/69.26  % SZS status Unsatisfiable
% 69.04/69.26  % SZS output start Refutation
% 69.04/69.26  
% 69.04/69.26  1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 69.04/69.26  2 [] {+} -is_a_theorem(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(a,c),b)))).
% 69.04/69.26  3 [] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B)))).
% 69.04/69.26  4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,equivalent(equivalent(D,E),equivalent(equivalent(E,C),D)))),A))).
% 69.04/69.26  5 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(D,B),C)))),E),equivalent(F,equivalent(equivalent(G,H),equivalent(equivalent(H,F),G)))),equivalent(E,A))).
% 69.04/69.26  6 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(D,equivalent(E,equivalent(equivalent(F,G),equivalent(equivalent(G,E),F)))),C))),A))).
% 69.04/69.26  7 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E)))),C)).
% 69.04/69.26  8 [hyper,7,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(D,B),C)))),equivalent(equivalent(equivalent(E,F),equivalent(equivalent(F,A),E)),equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H)))))).
% 69.04/69.26  9 [hyper,7,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(equivalent(equivalent(equivalent(C,D),equivalent(equivalent(D,E),C)),equivalent(F,equivalent(equivalent(G,H),equivalent(equivalent(H,F),G)))),E)),A))).
% 69.04/69.26  10 [hyper,6,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E)))),B))),G),equivalent(equivalent(H,I),equivalent(equivalent(I,equivalent(J,equivalent(equivalent(K,L),equivalent(equivalent(L,J),K)))),H))),equivalent(G,A))).
% 69.04/69.26  20 [hyper,5,1,7] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B))),equivalent(equivalent(equivalent(D,E),equivalent(equivalent(E,equivalent(F,equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H))))),D)),F))).
% 69.04/69.26  53 [hyper,9,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),equivalent(equivalent(equivalent(equivalent(D,E),equivalent(equivalent(E,F),D)),equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H)))),F)),C)).
% 69.04/69.26  77 [hyper,10,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,equivalent(equivalent(D,E),equivalent(equivalent(E,equivalent(F,equivalent(equivalent(G,H),equivalent(equivalent(H,F),G)))),D)))),A)),C)).
% 69.04/69.26  101 [hyper,77,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B))),equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E)))),G),G)).
% 69.04/69.26  115 [hyper,101,1,5] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E))))),A)),C)).
% 69.04/69.26  117 [hyper,101,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(equivalent(C,equivalent(equivalent(D,E),equivalent(equivalent(E,C),D))),equivalent(F,equivalent(equivalent(G,H),equivalent(equivalent(H,F),G))))),A))).
% 69.04/69.26  125 [hyper,115,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(D,B),C)))),equivalent(equivalent(E,F),equivalent(equivalent(F,equivalent(A,equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H))))),E)))).
% 69.04/69.26  126 [hyper,115,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(equivalent(equivalent(C,D),equivalent(equivalent(D,equivalent(E,equivalent(F,equivalent(equivalent(G,H),equivalent(equivalent(H,F),G))))),C)),E)),A))).
% 69.04/69.26  180 [hyper,117,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),equivalent(equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E))),equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H))))),C)).
% 69.04/69.26  209 [hyper,126,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),equivalent(equivalent(equivalent(D,E),equivalent(equivalent(E,equivalent(F,equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H))))),D)),F)),C)).
% 69.04/69.26  274 [hyper,20,1,115] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),D),C),equivalent(D,equivalent(E,equivalent(equivalent(F,G),equivalent(equivalent(G,E),F)))))).
% 69.04/69.26  294 [hyper,274,1,115] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(B,equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E))))),equivalent(C,A)),equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H))))).
% 69.04/69.26  693 [hyper,209,1,7] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(A,B),equivalent(C,equivalent(equivalent(D,E),equivalent(equivalent(E,C),D))))),equivalent(B,equivalent(F,equivalent(equivalent(G,H),equivalent(equivalent(H,F),G)))))).
% 69.04/69.26  770 [hyper,693,1,8] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B))),D),D),equivalent(E,equivalent(equivalent(F,G),equivalent(equivalent(G,E),F))))).
% 69.04/69.26  778 [hyper,770,1,125] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(equivalent(equivalent(equivalent(C,equivalent(equivalent(D,E),equivalent(equivalent(E,C),D))),F),F),equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H))))),A))).
% 69.04/69.26  926 [hyper,294,1,274] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,D)),A)),C),D),equivalent(E,equivalent(equivalent(F,G),equivalent(equivalent(G,E),F))))).
% 69.04/69.26  1200 [hyper,778,1,115] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B))),D),D)).
% 69.04/69.26  1248 [hyper,1200,1,209] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(B,equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E))))),equivalent(C,A))).
% 69.04/69.26  1289 [hyper,1248,1,53] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B))),D),equivalent(equivalent(E,F),equivalent(equivalent(F,D),E)))).
% 69.04/69.26  1314 [hyper,1248,1,693] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),B),equivalent(C,equivalent(equivalent(D,E),equivalent(equivalent(E,C),D)))),A)).
% 69.04/69.26  1329 [hyper,1248,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,D)),A)),C),D)).
% 69.04/69.26  1390 [hyper,1329,1,180] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,C),equivalent(equivalent(C,D),B)),equivalent(E,A)),D)),E)).
% 69.04/69.26  1461 [hyper,1314,1,926] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,C)),A))).
% 69.04/69.26  1463 [hyper,1461,1,1461] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,B)),C),equivalent(D,D)),equivalent(C,A))).
% 69.04/69.26  1464 [hyper,1461,1,1248] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),A),B)).
% 69.04/69.26  1465 [hyper,1461,1,1200] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),equivalent(D,D)),C)).
% 69.04/69.26  1577 [hyper,1464,1,1461] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),equivalent(equivalent(C,A),C))).
% 69.04/69.26  1603 [hyper,1464,1,10] {+} is_a_theorem(equivalent(A,A)).
% 69.04/69.26  1608 [hyper,1464,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(equivalent(equivalent(C,D),C),D)),A))).
% 69.04/69.26  1618 [hyper,1603,1,1461] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),A)).
% 69.04/69.26  1683 [hyper,1618,1,1329] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,equivalent(D,D))),A)),C)).
% 69.04/69.26  1818 [hyper,1463,1,1329] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(A,equivalent(C,C))),B))).
% 69.04/69.26  2015 [hyper,1465,1,1248] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,A)),B)).
% 69.04/69.26  2024 [hyper,2015,1,1461] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),equivalent(C,equivalent(A,C)))).
% 69.04/69.26  2060 [hyper,2015,1,1818] {+} is_a_theorem(equivalent(A,equivalent(A,equivalent(B,B)))).
% 69.04/69.26  2091 [hyper,2060,1,2015] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,A)),B),equivalent(C,C))).
% 69.04/69.26  2095 [hyper,2060,1,1464] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),A),B),equivalent(C,C))).
% 69.04/69.26  2383 [hyper,2091,1,1577] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,B)),C)),A)).
% 69.04/69.26  2412 [hyper,2095,1,2024] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,C),B),C),A))).
% 69.04/69.26  2727 [hyper,2412,1,1461] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),A),B),C),equivalent(D,D)),C)).
% 69.04/69.26  6324 [hyper,2727,1,1683] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,B),equivalent(C,C))),equivalent(equivalent(D,A),D))).
% 69.04/69.26  8741 [hyper,1289,1,2015] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),C)).
% 69.04/69.26  8770 [hyper,8741,1,2060] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),C),equivalent(D,D))).
% 69.04/69.26  10939 [hyper,8770,1,6324] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(equivalent(C,D),B)),D)),A)).
% 69.04/69.26  10969 [hyper,8770,1,1463] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,A),B))).
% 69.04/69.26  10972 [hyper,8770,1,1248] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(equivalent(C,equivalent(D,A)),B)),D))).
% 69.04/69.26  11042 [hyper,10969,1,10969] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,B),C))),A)).
% 69.04/69.26  12202 [hyper,10939,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),B),equivalent(C,A))).
% 69.04/69.26  12236 [hyper,10939,1,1608] {+} is_a_theorem(equivalent(A,equivalent(B,equivalent(A,B)))).
% 69.04/69.26  12258 [hyper,12236,1,10969] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(B,C)))),A)).
% 69.04/69.26  12453 [hyper,12202,1,11042] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),A),C),B),C)).
% 69.04/69.26  12490 [hyper,12202,1,2383] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,equivalent(A,C))),B)).
% 69.04/69.26  12582 [hyper,12258,1,12202] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,A)),C),B),C)).
% 69.04/69.26  13023 [hyper,12490,1,8741] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,A),B))),C)).
% 69.04/69.26  13675 [hyper,13023,1,12202] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,B)),A)),C)).
% 69.04/69.26  15125 [hyper,13675,1,12582] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,A)),equivalent(C,equivalent(B,C)))).
% 69.04/69.26  15128 [hyper,13675,1,12453] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,A)),equivalent(equivalent(C,B),C))).
% 69.04/69.26  15411 [hyper,15128,1,12202] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,A),C))),B)).
% 69.04/69.26  19655 [hyper,10972,1,1390] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(B,equivalent(C,A)))).
% 69.04/69.26  19781 [hyper,19655,1,19655] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(A,C)),equivalent(C,B)))).
% 69.04/69.26  19837 [hyper,19655,1,15411] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),B)),equivalent(A,C))).
% 69.04/69.26  19856 [hyper,19655,1,15125] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,equivalent(A,C)),B))).
% 69.04/69.26  19875 [hyper,19655,1,12236] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(equivalent(C,A),B)),C))).
% 69.04/69.26  20967 [hyper,19781,1,8741] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),B),A)).
% 69.04/69.26  21682 [hyper,19837,1,12202] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),B),C)).
% 69.04/69.26  23857 [hyper,19856,1,20967] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),C),A)),B)).
% 69.04/69.26  24949 [hyper,19875,1,8741] {+} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),B)).
% 69.04/69.26  25499 [hyper,24949,1,19655] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))).
% 69.04/69.26  25683 [hyper,25499,1,19655] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,A),B))).
% 69.04/69.26  25685 [hyper,25499,1,12202] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(B,C),A),C))).
% 69.04/69.26  27990 [hyper,21682,1,25499] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(B,A)),C))).
% 69.04/69.26  32189 [hyper,23857,1,19655] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),B),C),equivalent(A,C))).
% 69.04/69.26  45349 [hyper,27990,1,25683] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(C,B)))).
% 69.04/69.26  48150 [hyper,32189,1,25685] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(A,B)),C))).
% 69.04/69.26  61185 [hyper,45349,1,25683] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C))).
% 69.04/69.26  96003 [hyper,61185,1,48150] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(A,C),B)))).
% 69.04/69.26  96004 [binary,96003.1,2.1] {-} $F.
% 69.04/69.26  
% 69.04/69.26  % SZS output end Refutation
% 69.04/69.26  ------------ end of proof -------------
% 69.04/69.26  
% 69.04/69.26  
% 69.04/69.26  Search stopped by max_proofs option.
% 69.04/69.26  
% 69.04/69.26  
% 69.04/69.26  Search stopped by max_proofs option.
% 69.04/69.26  
% 69.04/69.26  ============ end of search ============
% 69.04/69.26  
% 69.04/69.26  ----------- soft-scott stats ----------
% 69.04/69.26  
% 69.04/69.26  true clauses given         101      (12.4%)
% 69.04/69.26  false clauses given        714
% 69.04/69.26  
% 69.04/69.26        FALSE     TRUE
% 69.04/69.26    12  71        89
% 69.04/69.26    16  2429      853
% 69.04/69.26    20  0         1442
% 69.04/69.26  tot:  2500      2384      (48.8% true)
% 69.04/69.26  
% 69.04/69.26  
% 69.04/69.26  Model 6 [ 4 1 889 ] (0.00 seconds, 185392 Inserts)
% 69.04/69.26  
% 69.04/69.26  That finishes the proof of the theorem.
% 69.04/69.26  
% 69.04/69.26  Process 21740 finished Mon Jul  4 02:27:19 2022
%------------------------------------------------------------------------------