TSTP Solution File: LCL216-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL216-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:46 EDT 2022
% Result : Unsatisfiable 90.34s 90.53s
% Output : Refutation 90.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL216-3 : TPTP v8.1.0. Released v2.3.0.
% 0.04/0.14 % Command : sos-script %s
% 0.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sun Jul 3 20:31:11 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.22/0.37 ----- Otter 3.2, August 2001 -----
% 0.22/0.37 The process was started by sandbox on n025.cluster.edu,
% 0.22/0.37 Sun Jul 3 20:31:11 2022
% 0.22/0.37 The command was "./sos". The process ID is 23710.
% 0.22/0.37
% 0.22/0.37 set(prolog_style_variables).
% 0.22/0.37 set(auto).
% 0.22/0.37 dependent: set(auto1).
% 0.22/0.37 dependent: set(process_input).
% 0.22/0.37 dependent: clear(print_kept).
% 0.22/0.37 dependent: clear(print_new_demod).
% 0.22/0.37 dependent: clear(print_back_demod).
% 0.22/0.37 dependent: clear(print_back_sub).
% 0.22/0.37 dependent: set(control_memory).
% 0.22/0.37 dependent: assign(max_mem, 12000).
% 0.22/0.37 dependent: assign(pick_given_ratio, 4).
% 0.22/0.37 dependent: assign(stats_level, 1).
% 0.22/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.22/0.37 dependent: assign(sos_limit, 5000).
% 0.22/0.37 dependent: assign(max_weight, 60).
% 0.22/0.37 clear(print_given).
% 0.22/0.37
% 0.22/0.37 list(usable).
% 0.22/0.37
% 0.22/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.22/0.37
% 0.22/0.37 This is a Horn set with equality. The strategy will be
% 0.22/0.37 Knuth-Bendix and hyper_res, with positive clauses in
% 0.22/0.37 sos and nonpositive clauses in usable.
% 0.22/0.37
% 0.22/0.37 dependent: set(knuth_bendix).
% 0.22/0.37 dependent: set(para_from).
% 0.22/0.37 dependent: set(para_into).
% 0.22/0.37 dependent: clear(para_from_right).
% 0.22/0.37 dependent: clear(para_into_right).
% 0.22/0.37 dependent: set(para_from_vars).
% 0.22/0.37 dependent: set(eq_units_both_ways).
% 0.22/0.37 dependent: set(dynamic_demod_all).
% 0.22/0.37 dependent: set(dynamic_demod).
% 0.22/0.37 dependent: set(order_eq).
% 0.22/0.37 dependent: set(back_demod).
% 0.22/0.37 dependent: set(lrpo).
% 0.22/0.37 dependent: set(hyper_res).
% 0.22/0.37 dependent: clear(order_hyper).
% 0.22/0.37
% 0.22/0.37 ------------> process usable:
% 0.22/0.37
% 0.22/0.37 ------------> process sos:
% 0.22/0.37 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.22/0.37
% 0.22/0.37 ======= end of input processing =======
% 0.22/0.41
% 0.22/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.22/0.41
% 0.22/0.41 Stopped by limit on number of solutions
% 0.22/0.41
% 0.22/0.41
% 0.22/0.41 -------------- Softie stats --------------
% 0.22/0.41
% 0.22/0.41 UPDATE_STOP: 300
% 0.22/0.41 SFINDER_TIME_LIMIT: 2
% 0.22/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.41 number of clauses in intial UL: 3
% 0.22/0.41 number of clauses initially in problem: 11
% 0.22/0.41 percentage of clauses intially in UL: 27
% 0.22/0.41 percentage of distinct symbols occuring in initial UL: 87
% 0.22/0.41 percent of all initial clauses that are short: 100
% 0.22/0.41 absolute distinct symbol count: 8
% 0.22/0.41 distinct predicate count: 3
% 0.22/0.41 distinct function count: 3
% 0.22/0.41 distinct constant count: 2
% 0.22/0.41
% 0.22/0.41 ---------- no more Softie stats ----------
% 0.22/0.41
% 0.22/0.41
% 0.22/0.41
% 0.22/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.22/0.41
% 0.22/0.41 Stopped by limit on number of solutions
% 0.22/0.41
% 0.22/0.41 =========== start of search ===========
% 3.46/3.63
% 3.46/3.63
% 3.46/3.63 Changing weight limit from 60 to 34.
% 3.46/3.63
% 3.46/3.63 Model 3 (0.00 seconds, 0 Inserts)
% 3.46/3.63
% 3.46/3.63 Stopped by limit on number of solutions
% 3.46/3.63
% 3.46/3.63 Stopped by limit on insertions
% 3.46/3.63
% 3.46/3.63 Stopped by limit on insertions
% 3.46/3.63
% 3.46/3.63 Model 4 [ 21 0 150 ] (0.00 seconds, 250000 Inserts)
% 3.46/3.63
% 3.46/3.63 Stopped by limit on insertions
% 3.46/3.63
% 3.46/3.63 Model 5 [ 1 1 6157 ] (0.00 seconds, 250000 Inserts)
% 3.46/3.63
% 3.46/3.63 Stopped by limit on insertions
% 3.46/3.63
% 3.46/3.63 Model 6 [ 1 1 11214 ] (0.00 seconds, 250000 Inserts)
% 3.46/3.63
% 3.46/3.63 Stopped by limit on insertions
% 3.46/3.63
% 3.46/3.63 Stopped by limit on insertions
% 3.46/3.63
% 3.46/3.63 Model 7 [ 22 2 16333 ] (0.00 seconds, 250000 Inserts)
% 3.46/3.63
% 3.46/3.63 Stopped by limit on insertions
% 3.46/3.63
% 3.46/3.63 Model 8 [ 1 2 9870 ] (0.00 seconds, 250000 Inserts)
% 3.46/3.63
% 3.46/3.63 Stopped by limit on insertions
% 3.46/3.63
% 3.46/3.63 Model 9 [ 1 2 10448 ] (0.00 seconds, 250000 Inserts)
% 3.46/3.63
% 3.46/3.63 Resetting weight limit to 34 after 255 givens.
% 3.46/3.63
% 4.20/4.40
% 4.20/4.40
% 4.20/4.40 Changing weight limit from 34 to 26.
% 4.20/4.40
% 4.20/4.40 Resetting weight limit to 26 after 340 givens.
% 4.20/4.40
% 4.31/4.52
% 4.31/4.52
% 4.31/4.52 Changing weight limit from 26 to 18.
% 4.31/4.52
% 4.31/4.52 Resetting weight limit to 18 after 345 givens.
% 4.31/4.52
% 4.31/4.54
% 4.31/4.54
% 4.31/4.54 Changing weight limit from 18 to 17.
% 4.31/4.54
% 4.31/4.54 Resetting weight limit to 17 after 350 givens.
% 4.31/4.54
% 4.38/4.57
% 4.38/4.57
% 4.38/4.57 Changing weight limit from 17 to 16.
% 4.38/4.57
% 4.38/4.57 Resetting weight limit to 16 after 360 givens.
% 4.38/4.57
% 4.56/4.74
% 4.56/4.74
% 4.56/4.74 Changing weight limit from 16 to 15.
% 4.56/4.74
% 4.56/4.74 Resetting weight limit to 15 after 395 givens.
% 4.56/4.74
% 5.38/5.57
% 5.38/5.57
% 5.38/5.57 Changing weight limit from 15 to 14.
% 5.38/5.57
% 5.38/5.57 Modelling stopped after 300 given clauses and 0.00 seconds
% 5.38/5.57
% 5.38/5.57
% 5.38/5.57 Resetting weight limit to 14 after 540 givens.
% 5.38/5.57
% 8.93/9.13
% 8.93/9.13
% 8.93/9.13 Changing weight limit from 14 to 13.
% 8.93/9.13
% 8.93/9.13 Resetting weight limit to 13 after 1555 givens.
% 8.93/9.13
% 74.47/74.68
% 74.47/74.68
% 74.47/74.68 Changing weight limit from 13 to 14.
% 74.47/74.68
% 74.47/74.68 Resetting weight limit to 14 after 10865 givens.
% 74.47/74.68
% 90.34/90.53
% 90.34/90.53 -- HEY sandbox, WE HAVE A PROOF!! --
% 90.34/90.53
% 90.34/90.53 ----> UNIT CONFLICT at 82.22 sec ----> 328742 [binary,328741.1,3.1] {+} $F.
% 90.34/90.53
% 90.34/90.53 Length of proof is 95. Level of proof is 35.
% 90.34/90.53
% 90.34/90.53 ---------------- PROOF ----------------
% 90.34/90.53 % SZS status Unsatisfiable
% 90.34/90.53 % SZS output start Refutation
% 90.34/90.53
% 90.34/90.53 1 [] {+} theorem(A)| -axiom(A).
% 90.34/90.53 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 90.34/90.53 3 [] {+} -theorem(implies(or(p,q),implies(or(p,not(q)),p))).
% 90.34/90.53 4 [] {+} axiom(implies(or(A,A),A)).
% 90.34/90.53 5 [] {+} axiom(implies(A,or(B,A))).
% 90.34/90.53 6 [] {-} axiom(implies(or(A,B),or(B,A))).
% 90.34/90.53 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 90.34/90.53 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 90.34/90.53 9 [] {-} implies(A,B)=or(not(A),B).
% 90.34/90.53 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 90.34/90.53 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 90.34/90.53 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 90.34/90.53 15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 90.34/90.53 17 [para_from,10.1.1,6.1.1.2] {-} axiom(implies(or(A,not(B)),implies(B,A))).
% 90.34/90.53 21 [para_into,7.1.1.1.2,10.1.1,demod,11] {-} axiom(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 90.34/90.53 22 [para_into,7.1.1.1,10.1.1,demod,11] {-} axiom(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 90.34/90.53 24 [hyper,17,1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 90.34/90.53 28 [para_into,14.1.1.2,10.1.1] {+} theorem(implies(A,implies(B,A))).
% 90.34/90.53 30 [para_into,24.1.1.1,10.1.1] {+} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 90.34/90.53 31 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 90.34/90.53 38 [hyper,21,1] {-} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 90.34/90.53 42 [para_into,15.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 90.34/90.53 53 [hyper,22,1] {-} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 90.34/90.53 57 [hyper,31,2,28] {-} theorem(implies(or(A,B),or(A,implies(C,B)))).
% 90.34/90.53 59 [hyper,31,2,15] {+} theorem(implies(or(A,or(B,C)),or(A,or(C,B)))).
% 90.34/90.53 62 [para_into,31.1.1.2.1,10.1.1,demod,11] {+} theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 90.34/90.53 71 [para_into,38.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 90.34/90.53 90 [hyper,53,2,15] {+} theorem(or(A,implies(or(B,A),B))).
% 90.34/90.53 91 [hyper,53,2,14] {+} theorem(or(A,implies(B,B))).
% 90.34/90.53 97 [hyper,91,2,13] {-} theorem(implies(A,A)).
% 90.34/90.53 101 [hyper,90,2,15] {+} theorem(or(implies(or(A,B),A),B)).
% 90.34/90.53 104 [para_into,90.1.1,10.1.1] {-} theorem(implies(A,implies(or(B,not(A)),B))).
% 90.34/90.53 108 [hyper,97,2,53] {+} theorem(or(A,implies(or(A,B),B))).
% 90.34/90.53 121 [hyper,104,2,31] {-} theorem(implies(or(A,B),or(A,implies(or(C,not(B)),C)))).
% 90.34/90.53 198 [hyper,30,2,97] {+} theorem(implies(A,not(not(A)))).
% 90.34/90.53 216 [hyper,198,2,31] {-} theorem(implies(or(A,B),or(A,not(not(B))))).
% 90.34/90.53 557 [para_into,121.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,B),implies(A,implies(or(C,not(B)),C)))).
% 90.34/90.53 597 [hyper,42,2,97] {+} theorem(or(A,not(A))).
% 90.34/90.53 607 [hyper,42,2,28] {+} theorem(or(implies(A,B),not(B))).
% 90.34/90.53 611 [hyper,42,2,14] {+} theorem(or(or(A,B),not(B))).
% 90.34/90.53 635 [hyper,597,2,121] {-} theorem(or(A,implies(or(B,not(not(A))),B))).
% 90.34/90.53 646 [hyper,635,2,38] {-} theorem(implies(or(A,not(not(B))),or(B,A))).
% 90.34/90.53 669 [hyper,607,2,121] {-} theorem(or(implies(A,B),implies(or(C,not(not(B))),C))).
% 90.34/90.53 715 [hyper,611,2,646] {+} theorem(or(A,or(B,not(A)))).
% 90.34/90.53 919 [hyper,669,2,13] {-} theorem(implies(or(A,not(not(A))),A)).
% 90.34/90.53 1003 [para_into,59.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,C)),implies(A,or(C,B)))).
% 90.34/90.53 1144 [hyper,715,2,59,demod,11] {+} theorem(or(A,implies(A,B))).
% 90.34/90.53 1168 [hyper,62,2,919] {-} theorem(implies(implies(A,or(B,not(not(B)))),implies(A,B))).
% 90.34/90.53 1225 [hyper,1144,2,38] {+} theorem(implies(A,or(A,B))).
% 90.34/90.53 1227 [hyper,1144,2,15] {+} theorem(or(implies(A,B),A)).
% 90.34/90.53 1278 [hyper,1225,2,42] {+} theorem(or(or(A,B),not(A))).
% 90.34/90.53 1514 [hyper,1227,2,646] {-} theorem(or(A,implies(not(not(A)),B))).
% 90.34/90.53 1567 [hyper,1514,2,15] {-} theorem(or(implies(not(not(A)),B),A)).
% 90.34/90.53 1659 [hyper,1567,2,57] {-} theorem(or(implies(not(not(A)),B),implies(C,A))).
% 90.34/90.53 2119 [hyper,1278,2,121] {-} theorem(or(or(A,B),implies(or(C,not(not(A))),C))).
% 90.34/90.53 2171 [hyper,71,2,31] {-} theorem(implies(or(A,B),implies(implies(B,C),or(A,C)))).
% 90.34/90.53 2307 [hyper,1659,2,13] {+} theorem(implies(not(not(A)),A)).
% 90.34/90.53 2320 [hyper,2307,2,31] {-} theorem(implies(or(A,not(not(B))),or(A,B))).
% 90.34/90.53 2333 [hyper,216,2,53] {-} theorem(or(A,implies(or(A,B),not(not(B))))).
% 90.34/90.53 2370 [hyper,216,2,101] {-} theorem(or(implies(or(A,B),A),not(not(B)))).
% 90.34/90.53 2430 [hyper,2320,2,53] {-} theorem(or(A,implies(or(A,not(not(B))),B))).
% 90.34/90.53 2453 [hyper,2333,2,15] {-} theorem(or(implies(or(A,B),not(not(B))),A)).
% 90.34/90.53 2505 [hyper,2370,2,24] {-} theorem(implies(not(A),implies(or(B,A),B))).
% 90.34/90.53 2515 [hyper,2505,2,71] {-} theorem(implies(or(A,B),implies(not(B),A))).
% 90.34/90.53 2538 [hyper,2515,2,42] {-} theorem(or(implies(not(A),B),not(or(B,A)))).
% 90.34/90.53 2641 [hyper,2430,2,15] {-} theorem(or(implies(or(A,not(not(B))),B),A)).
% 90.34/90.53 2660 [hyper,108,2,216] {-} theorem(or(A,not(not(implies(or(A,B),B))))).
% 90.34/90.53 2706 [hyper,2453,2,216] {-} theorem(or(implies(or(A,B),not(not(B))),not(not(A)))).
% 90.34/90.53 2780 [hyper,2641,2,2515] {-} theorem(implies(not(A),implies(or(A,not(not(B))),B))).
% 90.34/90.53 4651 [hyper,2780,2,71] {-} theorem(implies(or(A,not(not(B))),implies(not(A),B))).
% 90.34/90.53 6396 [hyper,4651,2,2660] {-} theorem(implies(not(A),implies(or(A,B),B))).
% 90.34/90.53 6433 [hyper,6396,2,71] {-} theorem(implies(or(A,B),implies(not(A),B))).
% 90.34/90.53 6435 [hyper,6396,2,62] {-} theorem(implies(implies(A,not(B)),implies(A,implies(or(B,C),C)))).
% 90.34/90.53 6474 [hyper,6433,2,42] {-} theorem(or(implies(not(A),B),not(or(A,B)))).
% 90.34/90.53 6486 [hyper,6433,2,2538] {-} theorem(implies(not(implies(not(A),B)),not(or(B,A)))).
% 90.34/90.53 6837 [hyper,6474,2,6433] {-} theorem(implies(not(implies(not(A),B)),not(or(A,B)))).
% 90.34/90.53 9284 [hyper,6486,2,42,demod,11] {-} theorem(implies(or(A,B),not(not(implies(not(B),A))))).
% 90.34/90.53 9483 [hyper,6837,2,42,demod,11] {-} theorem(implies(or(A,B),not(not(implies(not(A),B))))).
% 90.34/90.53 14554 [hyper,2119,2,38] {-} theorem(implies(or(A,not(not(B))),or(or(B,C),A))).
% 90.34/90.53 14582 [hyper,2171,2,42] {-} theorem(or(implies(implies(A,B),or(C,B)),not(or(C,A)))).
% 90.34/90.53 14657 [hyper,2171,2,90] {-} theorem(implies(implies(implies(or(A,B),A),C),or(B,C))).
% 90.34/90.53 22494 [hyper,14554,2,2706] {-} theorem(or(or(A,B),implies(or(A,C),not(not(C))))).
% 90.34/90.53 22804 [hyper,14657,2,42] {+} theorem(or(A,or(B,not(or(B,A))))).
% 90.34/90.53 27245 [hyper,557,2,15] {-} theorem(implies(or(A,B),implies(or(C,not(or(B,A))),C))).
% 90.34/90.53 30331 [hyper,22494,2,38] {-} theorem(implies(or(A,B),or(or(A,C),not(not(B))))).
% 90.34/90.53 37466 [hyper,30331,2,1168] {+} theorem(implies(or(A,or(A,B)),or(A,B))).
% 90.34/90.53 43509 [hyper,22804,2,15] {+} theorem(or(or(A,not(or(A,B))),B)).
% 90.34/90.53 62497 [hyper,6435,2,9483,demod,11] {-} theorem(implies(or(A,B),implies(implies(implies(not(A),B),C),C))).
% 90.34/90.53 62498 [hyper,6435,2,9284,demod,11] {-} theorem(implies(or(A,B),implies(implies(implies(not(B),A),C),C))).
% 90.34/90.53 83912 [hyper,27245,2,71] {-} theorem(implies(or(A,not(or(B,C))),implies(or(C,B),A))).
% 90.34/90.53 134978 [hyper,62497,2,71] {-} theorem(implies(implies(implies(not(A),B),C),implies(or(A,B),C))).
% 90.34/90.53 135039 [hyper,62498,2,71] {-} theorem(implies(implies(implies(not(A),B),C),implies(or(B,A),C))).
% 90.34/90.53 159025 [hyper,83912,2,14582] {-} theorem(implies(or(A,B),implies(implies(A,C),or(B,C)))).
% 90.34/90.53 159796 [hyper,159025,2,43509] {-} theorem(implies(implies(or(A,not(or(A,B))),C),or(B,C))).
% 90.34/90.53 237679 [hyper,159796,2,159025,demod,11] {-} theorem(or(A,implies(implies(B,C),implies(or(B,A),C)))).
% 90.34/90.53 237818 [hyper,237679,2,38] {-} theorem(implies(implies(A,B),or(C,implies(or(A,C),B)))).
% 90.34/90.53 237849 [hyper,237818,2,134978,demod,11] {-} theorem(implies(or(A,B),or(C,implies(implies(A,C),B)))).
% 90.34/90.53 238435 [hyper,237849,2,159796] {-} theorem(or(A,or(B,implies(implies(C,B),not(or(C,A)))))).
% 90.34/90.53 325145 [hyper,238435,2,37466] {-} theorem(or(A,implies(implies(B,A),not(or(B,A))))).
% 90.34/90.53 325222 [hyper,325145,2,38] {-} theorem(implies(implies(A,B),or(B,not(or(A,B))))).
% 90.34/90.53 325303 [hyper,325222,2,1003,demod,11] {-} theorem(implies(implies(A,B),implies(or(A,B),B))).
% 90.34/90.53 326935 [hyper,325303,2,135039,demod,11] {-} theorem(implies(or(A,B),implies(implies(B,A),A))).
% 90.34/90.53 327739 [hyper,326935,2,71] {-} theorem(implies(implies(A,B),implies(or(B,A),B))).
% 90.34/90.53 328741 [hyper,327739,2,135039] {-} theorem(implies(or(A,B),implies(or(A,not(B)),A))).
% 90.34/90.53 328742 [binary,328741.1,3.1] {+} $F.
% 90.34/90.53
% 90.34/90.53 % SZS output end Refutation
% 90.34/90.53 ------------ end of proof -------------
% 90.34/90.53
% 90.34/90.53
% 90.34/90.53 Search stopped by max_proofs option.
% 90.34/90.53
% 90.34/90.53
% 90.34/90.53 Search stopped by max_proofs option.
% 90.34/90.53
% 90.34/90.53 ============ end of search ============
% 90.34/90.53
% 90.34/90.53 ----------- soft-scott stats ----------
% 90.34/90.53
% 90.34/90.53 true clauses given 4513 (37.9%)
% 90.34/90.53 false clauses given 7399
% 90.34/90.53
% 90.34/90.53 FALSE TRUE
% 90.34/90.53 10 0 1
% 90.34/90.53 11 6 27
% 90.34/90.53 12 90 2556
% 90.34/90.53 13 597 427
% 90.34/90.53 14 2130 220
% 90.34/90.53 tot: 2823 3231 (53.4% true)
% 90.34/90.53
% 90.34/90.53
% 90.34/90.53 Model 9 [ 1 2 10448 ] (0.01 seconds, 250000 Inserts)
% 90.34/90.53
% 90.34/90.53 That finishes the proof of the theorem.
% 90.34/90.53
% 90.34/90.53 Process 23710 finished Sun Jul 3 20:32:41 2022
%------------------------------------------------------------------------------