TSTP Solution File: SET007-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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 : Tue Jul 19 05:14:01 EDT 2022
% Result : Unsatisfiable 24.20s 24.39s
% Output : Refutation 24.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 00:36:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n006.cluster.edu,
% 0.12/0.35 Sun Jul 10 00:36:21 2022
% 0.12/0.35 The command was "./sos". The process ID is 15730.
% 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=0, equality=1, symmetry=0, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 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.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 24
% 0.12/0.39 number of clauses initially in problem: 38
% 0.12/0.39 percentage of clauses intially in UL: 63
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 73
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 15
% 0.12/0.39 distinct predicate count: 5
% 0.12/0.39 distinct function count: 3
% 0.12/0.39 distinct constant count: 7
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 2.83/3.03
% 2.83/3.03
% 2.83/3.03 Changing weight limit from 60 to 41.
% 2.83/3.03
% 2.83/3.03 Model 3 (0.00 seconds, 0 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on number of solutions
% 2.83/3.03
% 2.83/3.03 Model 4 (0.00 seconds, 0 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on number of solutions
% 2.83/3.03
% 2.83/3.03 Model 5 (0.00 seconds, 0 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on number of solutions
% 2.83/3.03
% 2.83/3.03 Model 6 (0.00 seconds, 0 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on number of solutions
% 2.83/3.03
% 2.83/3.03 Model 7 (0.00 seconds, 0 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on number of solutions
% 2.83/3.03
% 2.83/3.03 Model 8 (0.00 seconds, 0 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on number of solutions
% 2.83/3.03
% 2.83/3.03 Model 9 (0.00 seconds, 0 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on number of solutions
% 2.83/3.03
% 2.83/3.03 Model 10 (0.00 seconds, 0 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on number of solutions
% 2.83/3.03
% 2.83/3.03 Model 11 (0.00 seconds, 0 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on number of solutions
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 12 [ 13 9 243096 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Model 13 (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on number of solutions
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 14 [ 13 0 190 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 15 [ 17 1 159 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 16 [ 26 1 1017 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 17 [ 20 0 333 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Model 18 (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on number of solutions
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 19 [ 29 1 217 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 20 [ 23 1 174 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 21 [ 24 1 236 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 22 [ 22 1 221 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 23 [ 22 0 557 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 24 [ 28 0 177 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 25 [ 26 0 166 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on insertions
% 2.83/3.03
% 2.83/3.03 Model 26 [ 34 1 1386 ] (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Model 27 (0.00 seconds, 250000 Inserts)
% 2.83/3.03
% 2.83/3.03 Stopped by limit on number of solutions
% 2.83/3.03
% 2.83/3.03 Resetting weight limit to 41 after 160 givens.
% 2.83/3.03
% 8.70/8.92
% 8.70/8.92
% 8.70/8.92 Changing weight limit from 41 to 35.
% 8.70/8.92
% 8.70/8.92 Resetting weight limit to 35 after 355 givens.
% 8.70/8.92
% 8.89/9.07
% 8.89/9.07
% 8.89/9.07 Changing weight limit from 35 to 32.
% 8.89/9.07
% 8.89/9.07 Resetting weight limit to 32 after 360 givens.
% 8.89/9.07
% 9.10/9.27
% 9.10/9.27
% 9.10/9.27 Changing weight limit from 32 to 31.
% 9.10/9.27
% 9.10/9.27 Resetting weight limit to 31 after 365 givens.
% 9.10/9.27
% 9.17/9.39
% 9.17/9.39
% 9.17/9.39 Changing weight limit from 31 to 29.
% 9.17/9.39
% 9.17/9.39 Resetting weight limit to 29 after 370 givens.
% 9.17/9.39
% 9.33/9.54
% 9.33/9.54
% 9.33/9.54 Changing weight limit from 29 to 28.
% 9.33/9.54
% 9.33/9.54 Resetting weight limit to 28 after 380 givens.
% 9.33/9.54
% 9.93/10.17
% 9.93/10.17
% 9.93/10.17 Changing weight limit from 28 to 27.
% 9.93/10.17
% 9.93/10.17 Resetting weight limit to 27 after 400 givens.
% 9.93/10.17
% 15.70/15.87
% 15.70/15.87
% 15.70/15.87 Changing weight limit from 27 to 26.
% 15.70/15.87
% 15.70/15.87 Stopped by limit on insertions
% 15.70/15.87
% 15.70/15.87 Model 28 [ 33 1 842 ] (0.00 seconds, 250000 Inserts)
% 15.70/15.87
% 15.70/15.87 Stopped by limit on insertions
% 15.70/15.87
% 15.70/15.87 Model 29 [ 27 1 7129 ] (0.00 seconds, 250000 Inserts)
% 15.70/15.87
% 15.70/15.87 Modelling stopped after 300 given clauses and 0.00 seconds
% 15.70/15.87
% 15.70/15.87
% 15.70/15.87 Resetting weight limit to 26 after 605 givens.
% 15.70/15.87
% 15.90/16.10
% 15.90/16.10
% 15.90/16.10 Changing weight limit from 26 to 25.
% 15.90/16.10
% 15.90/16.10 Resetting weight limit to 25 after 610 givens.
% 15.90/16.10
% 15.97/16.18
% 15.97/16.18
% 15.97/16.18 Changing weight limit from 25 to 22.
% 15.97/16.18
% 15.97/16.18 Resetting weight limit to 22 after 615 givens.
% 15.97/16.18
% 16.48/16.67
% 16.48/16.67
% 16.48/16.67 Changing weight limit from 22 to 21.
% 16.48/16.67
% 16.48/16.67 Resetting weight limit to 21 after 635 givens.
% 16.48/16.67
% 22.51/22.69
% 22.51/22.69
% 22.51/22.69 Changing weight limit from 21 to 20.
% 22.51/22.69
% 22.51/22.69 Resetting weight limit to 20 after 865 givens.
% 22.51/22.69
% 24.20/24.39
% 24.20/24.39 -- HEY sandbox2, WE HAVE A PROOF!! --
% 24.20/24.39
% 24.20/24.39 ----> UNIT CONFLICT at 23.75 sec ----> 23701 [binary,23700.1,15.1] {-} $F.
% 24.20/24.39
% 24.20/24.39 WARNING, clause 11154 not found, proof is incomplete.
% 24.20/24.39 Length of proof is 51. Level of proof is 16.
% 24.20/24.39
% 24.20/24.39 ---------------- PROOF ----------------
% 24.20/24.39 % SZS status Unsatisfiable
% 24.20/24.39 % SZS output start Refutation
% 24.20/24.39
% 24.20/24.39 6 [] {+} -union(A,B,C)| -member(D,C)|member(D,A)|member(D,B).
% 24.20/24.39 8 [] {+} -union(A,B,C)| -member(D,B)|member(D,C).
% 24.20/24.39 9 [] {+} -member(g(A,B,C),A)| -member(g(A,B,C),C)|union(A,B,C).
% 24.20/24.39 10 [] {+} -member(g(A,B,C),B)| -member(g(A,B,C),C)|union(A,B,C).
% 24.20/24.39 11 [] {+} -intersection(A,B,C)| -member(D,C)|member(D,A).
% 24.20/24.39 12 [] {+} -intersection(A,B,C)| -member(D,C)|member(D,B).
% 24.20/24.39 13 [] {+} -intersection(A,B,C)| -member(D,B)| -member(D,A)|member(D,C).
% 24.20/24.39 14 [] {+} -member(h(A,B,C),C)| -member(h(A,B,C),B)| -member(h(A,B,C),A)|intersection(A,B,C).
% 24.20/24.39 15 [] {+} -union(aIb,aIc,aI_bUc).
% 24.20/24.39 18 [factor,9.1.2] {+} -member(g(A,B,A),A)|union(A,B,A).
% 24.20/24.39 22 [factor,14.1.3] {+} -member(h(A,B,A),A)| -member(h(A,B,A),B)|intersection(A,B,A).
% 24.20/24.39 26 [] {-} union(A,B,C)|member(g(A,B,C),A)|member(g(A,B,C),B)|member(g(A,B,C),C).
% 24.20/24.39 27 [] {+} member(h(A,B,C),C)|intersection(A,B,C)|member(h(A,B,C),A).
% 24.20/24.39 28 [] {+} member(h(A,B,C),C)|intersection(A,B,C)|member(h(A,B,C),B).
% 24.20/24.39 29 [] {+} union(b,c,bUc).
% 24.20/24.39 30 [] {+} intersection(a,b,aIb).
% 24.20/24.39 31 [] {+} intersection(a,c,aIc).
% 24.20/24.39 32 [] {+} intersection(a,bUc,aI_bUc).
% 24.20/24.39 34 [factor,26.2.4] {+} union(A,B,A)|member(g(A,B,A),A)|member(g(A,B,A),B).
% 24.20/24.39 36 [factor,27.1.3] {+} member(h(A,B,A),A)|intersection(A,B,A).
% 24.20/24.39 59 [hyper,26,11,30] {-} union(aIb,A,B)|member(g(aIb,A,B),A)|member(g(aIb,A,B),B)|member(g(aIb,A,B),a).
% 24.20/24.39 225 [hyper,36,12,32] {-} intersection(aI_bUc,A,aI_bUc)|member(h(aI_bUc,A,aI_bUc),bUc).
% 24.20/24.39 226 [hyper,36,12,31] {-} intersection(aIc,A,aIc)|member(h(aIc,A,aIc),c).
% 24.20/24.39 231 [hyper,36,8,29] {+} intersection(c,A,c)|member(h(c,A,c),bUc).
% 24.20/24.39 248 [hyper,27,12,32] {-} intersection(A,B,aI_bUc)|member(h(A,B,aI_bUc),A)|member(h(A,B,aI_bUc),bUc).
% 24.20/24.39 249 [hyper,27,12,31] {-} intersection(A,B,aIc)|member(h(A,B,aIc),A)|member(h(A,B,aIc),c).
% 24.20/24.39 250 [hyper,27,12,30] {-} intersection(A,B,aIb)|member(h(A,B,aIb),A)|member(h(A,B,aIb),b).
% 24.20/24.39 268 [factor,248.2.3] {+} intersection(bUc,A,aI_bUc)|member(h(bUc,A,aI_bUc),bUc).
% 24.20/24.39 269 [factor,249.2.3] {+} intersection(c,A,aIc)|member(h(c,A,aIc),c).
% 24.20/24.39 270 [factor,250.2.3] {+} intersection(b,A,aIb)|member(h(b,A,aIb),b).
% 24.20/24.39 310 [hyper,28,11,32] {-} intersection(A,B,aI_bUc)|member(h(A,B,aI_bUc),B)|member(h(A,B,aI_bUc),a).
% 24.20/24.39 311 [hyper,28,11,31] {-} intersection(A,B,aIc)|member(h(A,B,aIc),B)|member(h(A,B,aIc),a).
% 24.20/24.39 312 [hyper,28,11,30] {-} intersection(A,B,aIb)|member(h(A,B,aIb),B)|member(h(A,B,aIb),a).
% 24.20/24.39 317 [hyper,28,13,32,27,factor_simp,factor_simp] {-} member(h(bUc,a,A),A)|intersection(bUc,a,A)|member(h(bUc,a,A),aI_bUc).
% 24.20/24.39 318 [hyper,28,13,31,27,factor_simp,factor_simp] {-} member(h(c,a,A),A)|intersection(c,a,A)|member(h(c,a,A),aIc).
% 24.20/24.39 319 [hyper,28,13,30,27,factor_simp,factor_simp] {-} member(h(b,a,A),A)|intersection(b,a,A)|member(h(b,a,A),aIb).
% 24.20/24.39 336 [factor,310.2.3] {+} intersection(A,a,aI_bUc)|member(h(A,a,aI_bUc),a).
% 24.20/24.39 337 [factor,311.2.3] {+} intersection(A,a,aIc)|member(h(A,a,aIc),a).
% 24.20/24.39 338 [factor,312.2.3] {-} intersection(A,a,aIb)|member(h(A,a,aIb),a).
% 24.20/24.39 344 [factor,317.1.3] {-} member(h(bUc,a,aI_bUc),aI_bUc)|intersection(bUc,a,aI_bUc).
% 24.20/24.39 345 [factor,318.1.3] {-} member(h(c,a,aIc),aIc)|intersection(c,a,aIc).
% 24.20/24.39 346 [factor,319.1.3] {+} member(h(b,a,aIb),aIb)|intersection(b,a,aIb).
% 24.20/24.39 399 [hyper,226,22,36,factor_simp,factor_simp] {+} intersection(aIc,c,aIc).
% 24.20/24.39 423 [hyper,34,18,factor_simp] {+} union(A,B,A)|member(g(A,B,A),B).
% 24.20/24.39 668 [hyper,423,12,399] {-} union(A,aIc,A)|member(g(A,aIc,A),c).
% 24.20/24.39 671 [hyper,423,11,31] {-} union(A,aIc,A)|member(g(A,aIc,A),a).
% 24.20/24.39 748 [hyper,225,22,36,factor_simp,factor_simp] {+} intersection(aI_bUc,bUc,aI_bUc).
% 24.20/24.39 4007 [hyper,231,22,36,factor_simp,factor_simp] {+} intersection(c,bUc,c).
% 24.20/24.39 9412 [hyper,336,14,344,268,factor_simp,factor_simp,factor_simp] {+} intersection(bUc,a,aI_bUc).
% 24.20/24.39 9769 [hyper,337,14,345,269,factor_simp,factor_simp,factor_simp] {+} intersection(c,a,aIc).
% 24.20/24.39 10210 [hyper,668,12,4007] {-} union(A,aIc,A)|member(g(A,aIc,A),bUc).
% 24.20/24.39 10839 [hyper,10210,13,9412,671,factor_simp] {-} union(A,aIc,A)|member(g(A,aIc,A),aI_bUc).
% 24.20/24.39 11206 [factor,11154.1.3,unit_del,15] {-} member(g(aIb,aIc,aI_bUc),aI_bUc)|member(g(aIb,aIc,aI_bUc),c).
% 24.20/24.39 11371 [hyper,10839,18,factor_simp] {-} union(aI_bUc,aIc,aI_bUc).
% 24.20/24.39 11450 [hyper,11371,8,28] {-} member(h(A,B,aIc),aI_bUc)|intersection(A,B,aIc)|member(h(A,B,aIc),B).
% 24.20/24.39 11505 [factor,11450.1.3] {-} member(h(A,aI_bUc,aIc),aI_bUc)|intersection(A,aI_bUc,aIc).
% 24.20/24.39 11740 [hyper,11505,22,36,factor_simp,factor_simp] {+} intersection(aIc,aI_bUc,aIc).
% 24.20/24.39 12295 [hyper,11206,12,748] {-} member(g(aIb,aIc,aI_bUc),c)|member(g(aIb,aIc,aI_bUc),bUc).
% 24.20/24.39 12304 [hyper,11206,13,9769,59,unit_del,15,factor_simp,factor_simp] {-} member(g(aIb,aIc,aI_bUc),aI_bUc)|member(g(aIb,aIc,aI_bUc),aIc).
% 24.20/24.39 12378 [hyper,346,14,338,270,factor_simp,factor_simp,factor_simp] {+} intersection(b,a,aIb).
% 24.20/24.39 12916 [hyper,12295,6,29,factor_simp] {-} member(g(aIb,aIc,aI_bUc),c)|member(g(aIb,aIc,aI_bUc),b).
% 24.20/24.39 17813 [hyper,12304,12,11740,factor_simp] {-} member(g(aIb,aIc,aI_bUc),aI_bUc).
% 24.20/24.39 17814 [hyper,17813,12,9412] {-} member(g(aIb,aIc,aI_bUc),a).
% 24.20/24.39 23538 [hyper,12916,13,9769,17814] {-} member(g(aIb,aIc,aI_bUc),b)|member(g(aIb,aIc,aI_bUc),aIc).
% 24.20/24.39 23688 [hyper,23538,10,17813,unit_del,15] {-} member(g(aIb,aIc,aI_bUc),b).
% 24.20/24.39 23690 [hyper,23688,13,12378,17814] {-} member(g(aIb,aIc,aI_bUc),aIb).
% 24.20/24.39 23700 [hyper,23690,9,17813] {-} union(aIb,aIc,aI_bUc).
% 24.20/24.39 23701 [binary,23700.1,15.1] {-} $F.
% 24.20/24.39
% 24.20/24.39 % SZS output end Refutation
% 24.20/24.39 ------------ end of proof -------------
% 24.20/24.39
% 24.20/24.39
% 24.20/24.39 Search stopped by max_proofs option.
% 24.20/24.39
% 24.20/24.39
% 24.20/24.39 Search stopped by max_proofs option.
% 24.20/24.39
% 24.20/24.39 ============ end of search ============
% 24.20/24.39
% 24.20/24.39 ----------- soft-scott stats ----------
% 24.20/24.39
% 24.20/24.39 true clauses given 274 (26.8%)
% 24.20/24.39 false clauses given 750
% 24.20/24.39
% 24.20/24.39 FALSE TRUE
% 24.20/24.39 9 0 43
% 24.20/24.39 10 0 289
% 24.20/24.39 11 0 25
% 24.20/24.39 12 11 9
% 24.20/24.39 13 10 29
% 24.20/24.39 14 15 299
% 24.20/24.39 15 485 1320
% 24.20/24.39 16 1218 402
% 24.20/24.39 17 166 13
% 24.20/24.39 18 184 0
% 24.20/24.39 19 161 69
% 24.20/24.39 20 172 8
% 24.20/24.39 tot: 2422 2506 (50.9% true)
% 24.20/24.39
% 24.20/24.39
% 24.20/24.39 Model 29 [ 27 1 7129 ] (0.00 seconds, 250000 Inserts)
% 24.20/24.39
% 24.20/24.39 That finishes the proof of the theorem.
% 24.20/24.39
% 24.20/24.39 Process 15730 finished Sun Jul 10 00:36:45 2022
%------------------------------------------------------------------------------