TSTP Solution File: LCL194-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL194-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:32 EDT 2022
% Result : Unsatisfiable 122.13s 122.32s
% Output : Refutation 122.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : LCL194-3 : TPTP v8.1.0. Released v2.3.0.
% 0.08/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 02:36:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n004.cluster.edu,
% 0.13/0.36 Mon Jul 4 02:36:23 2022
% 0.13/0.36 The command was "./sos". The process ID is 26826.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 3
% 0.13/0.40 number of clauses initially in problem: 11
% 0.13/0.40 percentage of clauses intially in UL: 27
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 77
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 9
% 0.13/0.40 distinct predicate count: 3
% 0.13/0.40 distinct function count: 3
% 0.13/0.40 distinct constant count: 3
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 11.41/11.61
% 11.41/11.61
% 11.41/11.61 Changing weight limit from 60 to 34.
% 11.41/11.61
% 11.41/11.61 Model 3 (0.00 seconds, 0 Inserts)
% 11.41/11.61
% 11.41/11.61 Stopped by limit on number of solutions
% 11.41/11.61
% 11.41/11.61 Model 4 (0.00 seconds, 0 Inserts)
% 11.41/11.61
% 11.41/11.61 Stopped by limit on number of solutions
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Model 5 [ 1 1 2236 ] (0.00 seconds, 250000 Inserts)
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Model 6 [ 22 25 148483 ] (0.00 seconds, 250000 Inserts)
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Model 7 [ 2 1 1297 ] (0.00 seconds, 250000 Inserts)
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Model 8 [ 30 3 16187 ] (0.00 seconds, 250000 Inserts)
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Model 9 [ 2 2 5774 ] (0.00 seconds, 250000 Inserts)
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Model 10 [ 33 2 3018 ] (0.00 seconds, 250000 Inserts)
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Model 11 [ 31 0 47 ] (0.00 seconds, 250000 Inserts)
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Model 12 [ 31 27 55879 ] (0.00 seconds, 250000 Inserts)
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Model 13 [ 31 8 15138 ] (0.00 seconds, 250000 Inserts)
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Model 14 [ 31 4 5070 ] (0.00 seconds, 250000 Inserts)
% 11.41/11.61
% 11.41/11.61 Stopped by limit on insertions
% 11.41/11.61
% 11.41/11.61 Model 15 [ 1 3 4896 ] (0.00 seconds, 250000 Inserts)
% 11.41/11.61
% 11.41/11.61 Resetting weight limit to 34 after 345 givens.
% 11.41/11.61
% 11.63/11.83
% 11.63/11.83
% 11.63/11.83 Changing weight limit from 34 to 22.
% 11.63/11.83
% 11.63/11.83 Resetting weight limit to 22 after 390 givens.
% 11.63/11.83
% 11.80/11.99
% 11.80/11.99
% 11.80/11.99 Changing weight limit from 22 to 16.
% 11.80/11.99
% 11.80/11.99 Resetting weight limit to 16 after 400 givens.
% 11.80/11.99
% 12.24/12.45
% 12.24/12.45
% 12.24/12.45 Changing weight limit from 16 to 15.
% 12.24/12.45
% 12.24/12.45 Resetting weight limit to 15 after 465 givens.
% 12.24/12.45
% 13.33/13.55
% 13.33/13.55
% 13.33/13.55 Changing weight limit from 15 to 14.
% 13.33/13.55
% 13.33/13.55 Modelling stopped after 300 given clauses and 0.00 seconds
% 13.33/13.55
% 13.33/13.55
% 13.33/13.55 Resetting weight limit to 14 after 620 givens.
% 13.33/13.55
% 18.35/18.57
% 18.35/18.57
% 18.35/18.57 Changing weight limit from 14 to 13.
% 18.35/18.57
% 18.35/18.57 Resetting weight limit to 13 after 1675 givens.
% 18.35/18.57
% 109.11/109.32
% 109.11/109.32
% 109.11/109.32 Changing weight limit from 13 to 14.
% 109.11/109.32
% 109.11/109.32 Resetting weight limit to 14 after 13405 givens.
% 109.11/109.32
% 109.11/109.37
% 109.11/109.37
% 109.11/109.37 Changing weight limit from 14 to 13.
% 109.11/109.37
% 109.11/109.37 Resetting weight limit to 13 after 13410 givens.
% 109.11/109.37
% 109.81/110.01
% 109.81/110.01
% 109.81/110.01 Changing weight limit from 13 to 14.
% 109.81/110.01
% 109.81/110.01 Resetting weight limit to 14 after 13485 givens.
% 109.81/110.01
% 122.13/122.32
% 122.13/122.32 -- HEY sandbox, WE HAVE A PROOF!! --
% 122.13/122.32
% 122.13/122.32 ----> UNIT CONFLICT at 110.86 sec ----> 343983 [binary,343982.1,3.1] {+} $F.
% 122.13/122.32
% 122.13/122.32 Length of proof is 102. Level of proof is 30.
% 122.13/122.32
% 122.13/122.32 ---------------- PROOF ----------------
% 122.13/122.32 % SZS status Unsatisfiable
% 122.13/122.32 % SZS output start Refutation
% 122.13/122.32
% 122.13/122.32 1 [] {+} theorem(A)| -axiom(A).
% 122.13/122.32 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 122.13/122.32 3 [] {+} -theorem(implies(implies(q,r),implies(or(q,p),or(p,r)))).
% 122.13/122.32 4 [] {+} axiom(implies(or(A,A),A)).
% 122.13/122.32 5 [] {+} axiom(implies(A,or(B,A))).
% 122.13/122.32 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 122.13/122.32 7 [] {+} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 122.13/122.32 8 [] {+} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 122.13/122.32 9 [] {-} implies(A,B)=or(not(A),B).
% 122.13/122.32 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 122.13/122.32 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 122.13/122.32 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 122.13/122.32 15 [hyper,6,1] {-} theorem(implies(or(A,B),or(B,A))).
% 122.13/122.32 20 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 122.13/122.32 23 [para_into,15.1.1.1,10.1.1] {-} theorem(implies(implies(A,B),or(B,not(A)))).
% 122.13/122.32 24 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 122.13/122.32 27 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 122.13/122.32 32 [para_into,23.1.1.2,10.1.1] {+} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 122.13/122.32 38 [para_into,14.1.1.2,10.1.1] {+} theorem(implies(A,implies(B,A))).
% 122.13/122.32 60 [para_into,20.1.1.1.2,10.1.1,demod,11] {+} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 122.13/122.32 61 [para_into,20.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 122.13/122.32 87 [hyper,27,2,38] {-} theorem(implies(or(A,B),or(A,implies(C,B)))).
% 122.13/122.32 89 [hyper,27,2,24] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 122.13/122.32 90 [hyper,27,2,23] {+} theorem(implies(or(A,implies(B,C)),or(A,or(C,not(B))))).
% 122.13/122.32 93 [hyper,27,2,14] {-} theorem(implies(or(A,B),or(A,or(C,B)))).
% 122.13/122.32 94 [hyper,27,2,13] {-} theorem(implies(or(A,or(B,B)),or(A,B))).
% 122.13/122.32 95 [para_into,27.1.1.2.1,10.1.1,demod,11] {+} theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 122.13/122.32 176 [para_into,94.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,B)),implies(A,B))).
% 122.13/122.32 184 [hyper,176,2,87] {+} theorem(implies(or(implies(A,B),B),implies(A,B))).
% 122.13/122.32 186 [hyper,176,2,14] {-} theorem(implies(A,A)).
% 122.13/122.32 188 [para_into,176.1.1.1.2,10.1.1] {+} theorem(implies(implies(A,implies(B,not(B))),implies(A,not(B)))).
% 122.13/122.32 190 [hyper,186,2,32] {+} theorem(implies(A,not(not(A)))).
% 122.13/122.32 191 [hyper,186,2,23] {+} theorem(or(A,not(A))).
% 122.13/122.32 193 [hyper,191,2,93] {+} theorem(or(A,or(B,not(A)))).
% 122.13/122.32 241 [hyper,190,2,27] {-} theorem(implies(or(A,B),or(A,not(not(B))))).
% 122.13/122.32 298 [hyper,241,2,23] {-} theorem(or(or(A,not(not(B))),not(or(A,B)))).
% 122.13/122.32 322 [para_into,241.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,B),implies(A,not(not(B))))).
% 122.13/122.32 332 [hyper,298,2,93] {-} theorem(or(or(A,not(not(B))),or(C,not(or(A,B))))).
% 122.13/122.32 428 [para_into,89.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,not(C))),implies(A,implies(C,B)))).
% 122.13/122.32 450 [hyper,193,2,89] {+} theorem(or(A,implies(A,B))).
% 122.13/122.32 475 [hyper,450,2,15] {+} theorem(or(implies(A,B),A)).
% 122.13/122.32 477 [para_into,450.1.1,10.1.1] {+} theorem(implies(A,implies(not(A),B))).
% 122.13/122.32 643 [hyper,475,2,89] {-} theorem(or(implies(or(A,not(B)),C),implies(B,A))).
% 122.13/122.32 698 [hyper,332,2,89] {-} theorem(or(or(A,not(not(B))),implies(or(A,B),C))).
% 122.13/122.32 718 [hyper,698,2,15] {-} theorem(or(implies(or(A,B),C),or(A,not(not(B))))).
% 122.13/122.32 726 [hyper,718,2,89] {-} theorem(or(implies(or(A,B),C),implies(not(B),A))).
% 122.13/122.32 751 [hyper,726,2,184] {-} theorem(implies(or(A,B),implies(not(B),A))).
% 122.13/122.32 769 [hyper,751,2,643] {-} theorem(implies(not(implies(A,B)),implies(or(B,not(A)),C))).
% 122.13/122.32 780 [hyper,751,2,191] {+} theorem(implies(not(not(A)),A)).
% 122.13/122.32 856 [hyper,780,2,27] {-} theorem(implies(or(A,not(not(B))),or(A,B))).
% 122.13/122.32 916 [para_into,60.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 122.13/122.32 1048 [hyper,61,2,186] {+} theorem(or(A,implies(or(A,B),B))).
% 122.13/122.32 1057 [hyper,61,2,15] {+} theorem(or(A,implies(or(B,A),B))).
% 122.13/122.32 1153 [hyper,477,2,27] {-} theorem(implies(or(A,B),or(A,implies(not(B),C)))).
% 122.13/122.32 2702 [hyper,95,2,751] {-} theorem(implies(implies(A,or(B,C)),implies(A,implies(not(C),B)))).
% 122.13/122.32 8887 [hyper,1048,2,751] {-} theorem(implies(not(implies(or(A,B),B)),A)).
% 122.13/122.32 8897 [hyper,1048,2,15] {+} theorem(or(implies(or(A,B),B),A)).
% 122.13/122.32 8899 [para_into,1048.1.1.2.1,10.1.1,demod,11] {+} theorem(implies(A,implies(implies(A,B),B))).
% 122.13/122.32 8910 [hyper,8887,2,95] {-} theorem(implies(implies(A,not(implies(or(B,C),C))),implies(A,B))).
% 122.13/122.32 8956 [hyper,1057,2,751] {-} theorem(implies(not(implies(or(A,B),A)),B)).
% 122.13/122.32 8963 [hyper,1057,2,90] {+} theorem(or(A,or(B,not(or(B,A))))).
% 122.13/122.32 8967 [hyper,1057,2,15] {+} theorem(or(implies(or(A,B),A),B)).
% 122.13/122.32 8980 [hyper,8956,2,95] {-} theorem(implies(implies(A,not(implies(or(B,C),B))),implies(A,C))).
% 122.13/122.32 12932 [hyper,188,2,769] {-} theorem(implies(not(implies(A,B)),not(or(B,not(A))))).
% 122.13/122.32 13017 [hyper,12932,2,32] {-} theorem(implies(or(A,not(B)),not(not(implies(B,A))))).
% 122.13/122.32 13972 [hyper,8897,2,1153] {-} theorem(or(implies(or(A,B),B),implies(not(A),C))).
% 122.13/122.32 13985 [hyper,8897,2,751] {-} theorem(implies(not(A),implies(or(A,B),B))).
% 122.13/122.32 14022 [hyper,13985,2,95] {-} theorem(implies(implies(A,not(B)),implies(A,implies(or(B,C),C)))).
% 122.13/122.32 14138 [hyper,8899,2,27] {-} theorem(implies(or(A,B),or(A,implies(implies(B,C),C)))).
% 122.13/122.32 14561 [hyper,8967,2,856] {-} theorem(or(implies(or(A,not(not(B))),A),B)).
% 122.13/122.32 14662 [hyper,14561,2,15] {-} theorem(or(A,implies(or(B,not(not(A))),B))).
% 122.13/122.32 14737 [hyper,14662,2,60] {-} theorem(implies(or(A,not(not(B))),or(B,A))).
% 122.13/122.32 14765 [hyper,14737,2,8897,demod,11] {+} theorem(or(A,implies(implies(not(A),B),B))).
% 122.13/122.32 15017 [hyper,13972,2,15] {-} theorem(or(implies(not(A),B),implies(or(A,C),C))).
% 122.13/122.32 15860 [hyper,15017,2,90] {-} theorem(or(implies(not(A),B),or(C,not(or(A,C))))).
% 122.13/122.32 21428 [hyper,14138,2,1057] {-} theorem(or(A,implies(implies(implies(or(B,A),B),C),C))).
% 122.13/122.32 23351 [hyper,15860,2,184] {-} theorem(implies(not(A),or(B,not(or(A,B))))).
% 122.13/122.32 23385 [hyper,23351,2,61] {-} theorem(or(A,implies(not(B),not(or(B,A))))).
% 122.13/122.32 23528 [hyper,23385,2,90,demod,11] {-} theorem(or(A,implies(or(B,A),not(not(B))))).
% 122.13/122.32 23576 [hyper,23528,2,60] {-} theorem(implies(or(A,B),or(B,not(not(A))))).
% 122.13/122.32 26757 [hyper,428,2,23576] {-} theorem(implies(or(A,B),implies(not(A),B))).
% 122.13/122.32 26822 [hyper,26757,2,322] {-} theorem(implies(or(A,B),not(not(implies(not(A),B))))).
% 122.13/122.32 31916 [hyper,8963,2,14138] {-} theorem(or(A,implies(implies(or(B,not(or(B,A))),C),C))).
% 122.13/122.32 31976 [hyper,21428,2,60] {-} theorem(implies(implies(implies(or(A,B),A),C),or(B,C))).
% 122.13/122.32 35634 [hyper,14765,2,60] {+} theorem(implies(implies(not(A),B),or(A,B))).
% 122.13/122.32 64190 [hyper,8910,2,31976,demod,11] {-} theorem(or(A,implies(implies(implies(or(B,C),C),A),B))).
% 122.13/122.32 64245 [hyper,64190,2,60] {-} theorem(implies(implies(implies(or(A,B),B),C),or(C,A))).
% 122.13/122.32 64541 [hyper,8980,2,31976,demod,11] {-} theorem(or(A,implies(implies(implies(or(B,C),B),A),C))).
% 122.13/122.32 64560 [hyper,64541,2,60] {-} theorem(implies(implies(implies(or(A,B),A),C),or(C,B))).
% 122.13/122.32 64579 [hyper,64560,2,2702] {-} theorem(implies(implies(implies(or(A,B),A),C),implies(not(B),C))).
% 122.13/122.32 72657 [hyper,14022,2,26822,demod,11] {-} theorem(implies(or(A,B),implies(implies(implies(not(A),B),C),C))).
% 122.13/122.32 72660 [hyper,14022,2,13017,demod,11] {-} theorem(implies(or(A,not(B)),implies(implies(implies(B,A),C),C))).
% 122.13/122.32 109324 [hyper,31916,2,60] {-} theorem(implies(implies(or(A,not(or(A,B))),C),or(B,C))).
% 122.13/122.32 144331 [hyper,64579,2,95] {-} theorem(implies(not(A),implies(implies(B,or(C,A)),implies(B,C)))).
% 122.13/122.32 151229 [hyper,72657,2,916] {-} theorem(implies(implies(implies(not(A),B),C),implies(or(A,B),C))).
% 122.13/122.32 151470 [hyper,72660,2,916] {-} theorem(implies(implies(implies(A,B),C),implies(or(B,not(A)),C))).
% 122.13/122.32 230179 [hyper,144331,2,916] {-} theorem(implies(implies(A,or(B,C)),implies(not(C),implies(A,B)))).
% 122.13/122.32 237209 [hyper,151229,2,95] {-} theorem(implies(or(A,B),implies(implies(C,not(A)),implies(C,B)))).
% 122.13/122.32 237266 [hyper,151470,2,916] {-} theorem(implies(or(implies(A,B),not(C)),implies(A,implies(C,B)))).
% 122.13/122.32 277714 [hyper,237209,2,916] {-} theorem(implies(implies(A,not(B)),implies(or(B,C),implies(A,C)))).
% 122.13/122.32 283040 [hyper,277714,2,151470,demod,11] {-} theorem(implies(implies(A,not(B)),implies(or(A,C),implies(B,C)))).
% 122.13/122.32 283047 [hyper,277714,2,31976,demod,11] {-} theorem(or(A,implies(or(B,C),implies(implies(B,A),C)))).
% 122.13/122.32 283191 [hyper,283047,2,60] {-} theorem(implies(or(A,B),or(C,implies(implies(A,C),B)))).
% 122.13/122.32 283193 [hyper,283191,2,230179] {-} theorem(implies(not(implies(implies(A,B),C)),implies(or(A,C),B))).
% 122.13/122.32 288148 [hyper,283040,2,64245] {-} theorem(or(implies(or(or(A,not(B)),C),implies(B,C)),A)).
% 122.13/122.32 288388 [hyper,283193,2,35634] {-} theorem(or(implies(implies(A,B),C),implies(or(A,C),B))).
% 122.13/122.32 288431 [hyper,288388,2,60] {-} theorem(implies(or(A,B),or(implies(implies(A,C),B),C))).
% 122.13/122.32 288641 [hyper,288431,2,109324] {-} theorem(or(A,or(implies(implies(B,C),not(or(B,A))),C))).
% 122.13/122.32 297981 [hyper,288148,2,237266,demod,11] {-} theorem(implies(or(implies(A,not(B)),C),implies(A,implies(B,C)))).
% 122.13/122.32 298786 [hyper,288641,2,20] {-} theorem(or(implies(implies(A,B),not(or(A,C))),or(C,B))).
% 122.13/122.32 343982 [hyper,298786,2,297981] {-} theorem(implies(implies(A,B),implies(or(A,C),or(C,B)))).
% 122.13/122.32 343983 [binary,343982.1,3.1] {+} $F.
% 122.13/122.32
% 122.13/122.32 % SZS output end Refutation
% 122.13/122.32 ------------ end of proof -------------
% 122.13/122.32
% 122.13/122.32
% 122.13/122.32 Search stopped by max_proofs option.
% 122.13/122.32
% 122.13/122.32
% 122.13/122.32 Search stopped by max_proofs option.
% 122.13/122.32
% 122.13/122.32 ============ end of search ============
% 122.13/122.32
% 122.13/122.32 ----------- soft-scott stats ----------
% 122.13/122.32
% 122.13/122.32 true clauses given 5489 (38.8%)
% 122.13/122.32 false clauses given 8645
% 122.13/122.32
% 122.13/122.32 FALSE TRUE
% 122.13/122.32 12 0 2511
% 122.13/122.32 13 330 64
% 122.13/122.32 14 2229 204
% 122.13/122.32 tot: 2559 2779 (52.1% true)
% 122.13/122.32
% 122.13/122.32
% 122.13/122.32 Model 15 [ 1 3 4896 ] (0.01 seconds, 250000 Inserts)
% 122.13/122.32
% 122.13/122.32 That finishes the proof of the theorem.
% 122.13/122.32
% 122.13/122.32 Process 26826 finished Mon Jul 4 02:38:25 2022
%------------------------------------------------------------------------------