TSTP Solution File: SEU020+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU020+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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 : 300s
% DateTime : Wed Jul 27 13:14:40 EDT 2022
% Result : Theorem 3.74s 4.00s
% Output : Refutation 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 16 ( 14 unt; 0 nHn; 14 RR)
% Number of literals : 27 ( 5 equ; 12 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(21,axiom,
( ~ relation(A)
| ~ function(A)
| ~ relation(B)
| ~ function(B)
| relation_dom(relation_composition(B,A)) != relation_dom(B)
| subset(relation_rng(B),relation_dom(A)) ),
file('SEU020+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ relation(A)
| ~ function(A)
| ~ relation(B)
| ~ function(B)
| ~ one_to_one(relation_composition(B,A))
| ~ subset(relation_rng(B),relation_dom(A))
| one_to_one(B) ),
file('SEU020+1.p',unknown),
[] ).
cnf(27,axiom,
~ one_to_one(dollar_c8),
file('SEU020+1.p',unknown),
[] ).
cnf(57,axiom,
one_to_one(identity_relation(A)),
file('SEU020+1.p',unknown),
[] ).
cnf(58,axiom,
relation(dollar_c8),
file('SEU020+1.p',unknown),
[] ).
cnf(59,axiom,
function(dollar_c8),
file('SEU020+1.p',unknown),
[] ).
cnf(60,axiom,
relation(dollar_c7),
file('SEU020+1.p',unknown),
[] ).
cnf(61,axiom,
function(dollar_c7),
file('SEU020+1.p',unknown),
[] ).
cnf(62,axiom,
relation_composition(dollar_c8,dollar_c7) = identity_relation(relation_dom(dollar_c8)),
file('SEU020+1.p',unknown),
[] ).
cnf(63,plain,
identity_relation(relation_dom(dollar_c8)) = relation_composition(dollar_c8,dollar_c7),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[62])]),
[iquote('copy,62,flip.1')] ).
cnf(65,axiom,
relation_dom(identity_relation(A)) = A,
file('SEU020+1.p',unknown),
[] ).
cnf(249,plain,
one_to_one(relation_composition(dollar_c8,dollar_c7)),
inference(para_from,[status(thm),theory(equality)],[63,57]),
[iquote('para_from,63.1.1,57.1.1')] ).
cnf(295,plain,
relation_dom(relation_composition(dollar_c8,dollar_c7)) = relation_dom(dollar_c8),
inference(para_into,[status(thm),theory(equality)],[65,63]),
[iquote('para_into,65.1.1.1,63.1.1')] ).
cnf(4921,plain,
subset(relation_rng(dollar_c8),relation_dom(dollar_c7)),
inference(hyper,[status(thm)],[295,21,60,61,58,59]),
[iquote('hyper,295,21,60,61,58,59')] ).
cnf(4927,plain,
one_to_one(dollar_c8),
inference(hyper,[status(thm)],[4921,25,60,61,58,59,249]),
[iquote('hyper,4921,25,60,61,58,59,249')] ).
cnf(4928,plain,
$false,
inference(binary,[status(thm)],[4927,27]),
[iquote('binary,4927.1,27.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU020+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n028.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 08:10:49 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.88/2.08 ----- Otter 3.3f, August 2004 -----
% 1.88/2.08 The process was started by sandbox2 on n028.cluster.edu,
% 1.88/2.08 Wed Jul 27 08:10:49 2022
% 1.88/2.08 The command was "./otter". The process ID is 14436.
% 1.88/2.08
% 1.88/2.08 set(prolog_style_variables).
% 1.88/2.08 set(auto).
% 1.88/2.08 dependent: set(auto1).
% 1.88/2.08 dependent: set(process_input).
% 1.88/2.08 dependent: clear(print_kept).
% 1.88/2.08 dependent: clear(print_new_demod).
% 1.88/2.08 dependent: clear(print_back_demod).
% 1.88/2.08 dependent: clear(print_back_sub).
% 1.88/2.08 dependent: set(control_memory).
% 1.88/2.08 dependent: assign(max_mem, 12000).
% 1.88/2.08 dependent: assign(pick_given_ratio, 4).
% 1.88/2.08 dependent: assign(stats_level, 1).
% 1.88/2.08 dependent: assign(max_seconds, 10800).
% 1.88/2.08 clear(print_given).
% 1.88/2.08
% 1.88/2.08 formula_list(usable).
% 1.88/2.08 all A (A=A).
% 1.88/2.08 all A B (in(A,B)-> -in(B,A)).
% 1.88/2.08 all A (empty(A)->function(A)).
% 1.88/2.08 all A (empty(A)->relation(A)).
% 1.88/2.08 all A B (relation(A)&relation(B)->relation(relation_composition(A,B))).
% 1.88/2.08 all A relation(identity_relation(A)).
% 1.88/2.08 all A exists B element(B,A).
% 1.88/2.08 all A B (empty(A)&relation(B)->empty(relation_composition(B,A))&relation(relation_composition(B,A))).
% 1.88/2.08 empty(empty_set).
% 1.88/2.08 relation(empty_set).
% 1.88/2.08 relation_empty_yielding(empty_set).
% 1.88/2.08 all A B (relation(A)&function(A)&relation(B)&function(B)->relation(relation_composition(A,B))&function(relation_composition(A,B))).
% 1.88/2.08 all A (-empty(powerset(A))).
% 1.88/2.08 empty(empty_set).
% 1.88/2.08 all A (relation(identity_relation(A))&function(identity_relation(A))).
% 1.88/2.08 empty(empty_set).
% 1.88/2.08 relation(empty_set).
% 1.88/2.08 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 1.88/2.08 all A (-empty(A)&relation(A)-> -empty(relation_rng(A))).
% 1.88/2.08 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 1.88/2.08 all A (empty(A)->empty(relation_rng(A))&relation(relation_rng(A))).
% 1.88/2.08 all A B (empty(A)&relation(B)->empty(relation_composition(A,B))&relation(relation_composition(A,B))).
% 1.88/2.08 exists A (relation(A)&function(A)).
% 1.88/2.08 exists A (empty(A)&relation(A)).
% 1.88/2.08 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.88/2.08 exists A empty(A).
% 1.88/2.08 exists A (-empty(A)&relation(A)).
% 1.88/2.08 all A exists B (element(B,powerset(A))&empty(B)).
% 1.88/2.08 exists A (-empty(A)).
% 1.88/2.08 exists A (relation(A)&relation_empty_yielding(A)).
% 1.88/2.08 all A B subset(A,A).
% 1.88/2.08 all A B (in(A,B)->element(A,B)).
% 1.88/2.08 all A (relation(A)&function(A)-> (all B (relation(B)&function(B)-> (relation_dom(relation_composition(B,A))=relation_dom(B)->subset(relation_rng(B),relation_dom(A)))))).
% 1.88/2.08 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.88/2.08 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.88/2.08 all A (relation(A)&function(A)-> (all B (relation(B)&function(B)-> (one_to_one(relation_composition(B,A))&subset(relation_rng(B),relation_dom(A))->one_to_one(B))))).
% 1.88/2.08 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.88/2.08 all A one_to_one(identity_relation(A)).
% 1.88/2.08 -(all A (relation(A)&function(A)-> ((exists B (relation(B)&function(B)&relation_composition(A,B)=identity_relation(relation_dom(A))))->one_to_one(A)))).
% 1.88/2.08 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.88/2.08 all A (empty(A)->A=empty_set).
% 1.88/2.08 all A (relation_dom(identity_relation(A))=A&relation_rng(identity_relation(A))=A).
% 1.88/2.08 all A B (-(in(A,B)&empty(B))).
% 1.88/2.08 all A B (-(empty(A)&A!=B&empty(B))).
% 1.88/2.08 end_of_list.
% 1.88/2.08
% 1.88/2.08 -------> usable clausifies to:
% 1.88/2.08
% 1.88/2.08 list(usable).
% 1.88/2.08 0 [] A=A.
% 1.88/2.08 0 [] -in(A,B)| -in(B,A).
% 1.88/2.08 0 [] -empty(A)|function(A).
% 1.88/2.08 0 [] -empty(A)|relation(A).
% 1.88/2.08 0 [] -relation(A)| -relation(B)|relation(relation_composition(A,B)).
% 1.88/2.08 0 [] relation(identity_relation(A)).
% 1.88/2.08 0 [] element($f1(A),A).
% 1.88/2.08 0 [] -empty(A)| -relation(B)|empty(relation_composition(B,A)).
% 1.88/2.08 0 [] -empty(A)| -relation(B)|relation(relation_composition(B,A)).
% 1.88/2.08 0 [] empty(empty_set).
% 1.88/2.08 0 [] relation(empty_set).
% 1.88/2.08 0 [] relation_empty_yielding(empty_set).
% 1.88/2.08 0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|relation(relation_composition(A,B)).
% 1.88/2.08 0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|function(relation_composition(A,B)).
% 1.88/2.08 0 [] -empty(powerset(A)).
% 1.88/2.08 0 [] empty(empty_set).
% 1.88/2.08 0 [] relation(identity_relation(A)).
% 1.88/2.08 0 [] function(identity_relation(A)).
% 1.88/2.08 0 [] empty(empty_set).
% 1.88/2.08 0 [] relation(empty_set).
% 1.88/2.08 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.88/2.08 0 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 1.88/2.08 0 [] -empty(A)|empty(relation_dom(A)).
% 1.88/2.08 0 [] -empty(A)|relation(relation_dom(A)).
% 1.88/2.08 0 [] -empty(A)|empty(relation_rng(A)).
% 1.88/2.08 0 [] -empty(A)|relation(relation_rng(A)).
% 1.88/2.08 0 [] -empty(A)| -relation(B)|empty(relation_composition(A,B)).
% 1.88/2.08 0 [] -empty(A)| -relation(B)|relation(relation_composition(A,B)).
% 1.88/2.08 0 [] relation($c1).
% 1.88/2.08 0 [] function($c1).
% 1.88/2.08 0 [] empty($c2).
% 1.88/2.08 0 [] relation($c2).
% 1.88/2.08 0 [] empty(A)|element($f2(A),powerset(A)).
% 1.88/2.08 0 [] empty(A)| -empty($f2(A)).
% 1.88/2.08 0 [] empty($c3).
% 1.88/2.08 0 [] -empty($c4).
% 1.88/2.08 0 [] relation($c4).
% 1.88/2.08 0 [] element($f3(A),powerset(A)).
% 1.88/2.08 0 [] empty($f3(A)).
% 1.88/2.08 0 [] -empty($c5).
% 1.88/2.08 0 [] relation($c6).
% 1.88/2.08 0 [] relation_empty_yielding($c6).
% 1.88/2.08 0 [] subset(A,A).
% 1.88/2.08 0 [] -in(A,B)|element(A,B).
% 1.88/2.08 0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|relation_dom(relation_composition(B,A))!=relation_dom(B)|subset(relation_rng(B),relation_dom(A)).
% 1.88/2.08 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.88/2.08 0 [] -element(A,powerset(B))|subset(A,B).
% 1.88/2.08 0 [] element(A,powerset(B))| -subset(A,B).
% 1.88/2.08 0 [] -relation(A)| -function(A)| -relation(B)| -function(B)| -one_to_one(relation_composition(B,A))| -subset(relation_rng(B),relation_dom(A))|one_to_one(B).
% 1.88/2.08 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.88/2.08 0 [] one_to_one(identity_relation(A)).
% 1.88/2.08 0 [] relation($c8).
% 1.88/2.08 0 [] function($c8).
% 1.88/2.08 0 [] relation($c7).
% 1.88/2.08 0 [] function($c7).
% 1.88/2.08 0 [] relation_composition($c8,$c7)=identity_relation(relation_dom($c8)).
% 1.88/2.08 0 [] -one_to_one($c8).
% 1.88/2.08 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.88/2.08 0 [] -empty(A)|A=empty_set.
% 1.88/2.08 0 [] relation_dom(identity_relation(A))=A.
% 1.88/2.08 0 [] relation_rng(identity_relation(A))=A.
% 1.88/2.08 0 [] -in(A,B)| -empty(B).
% 1.88/2.08 0 [] -empty(A)|A=B| -empty(B).
% 1.88/2.08 end_of_list.
% 1.88/2.08
% 1.88/2.08 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.88/2.08
% 1.88/2.08 This ia a non-Horn set with equality. The strategy will be
% 1.88/2.08 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.88/2.08 deletion, with positive clauses in sos and nonpositive
% 1.88/2.08 clauses in usable.
% 1.88/2.08
% 1.88/2.08 dependent: set(knuth_bendix).
% 1.88/2.08 dependent: set(anl_eq).
% 1.88/2.08 dependent: set(para_from).
% 1.88/2.08 dependent: set(para_into).
% 1.88/2.08 dependent: clear(para_from_right).
% 1.88/2.08 dependent: clear(para_into_right).
% 1.88/2.08 dependent: set(para_from_vars).
% 1.88/2.08 dependent: set(eq_units_both_ways).
% 1.88/2.08 dependent: set(dynamic_demod_all).
% 1.88/2.08 dependent: set(dynamic_demod).
% 1.88/2.08 dependent: set(order_eq).
% 1.88/2.08 dependent: set(back_demod).
% 1.88/2.08 dependent: set(lrpo).
% 1.88/2.08 dependent: set(hyper_res).
% 1.88/2.08 dependent: set(unit_deletion).
% 1.88/2.08 dependent: set(factor).
% 1.88/2.08
% 1.88/2.08 ------------> process usable:
% 1.88/2.08 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.88/2.08 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.88/2.08 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 1.88/2.08 ** KEPT (pick-wt=8): 4 [] -relation(A)| -relation(B)|relation(relation_composition(A,B)).
% 1.88/2.08 ** KEPT (pick-wt=8): 5 [] -empty(A)| -relation(B)|empty(relation_composition(B,A)).
% 1.88/2.08 ** KEPT (pick-wt=8): 6 [] -empty(A)| -relation(B)|relation(relation_composition(B,A)).
% 1.88/2.08 Following clause subsumed by 4 during input processing: 0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|relation(relation_composition(A,B)).
% 1.88/2.08 ** KEPT (pick-wt=12): 7 [] -relation(A)| -function(A)| -relation(B)| -function(B)|function(relation_composition(A,B)).
% 1.88/2.08 ** KEPT (pick-wt=3): 8 [] -empty(powerset(A)).
% 1.88/2.08 ** KEPT (pick-wt=7): 9 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.88/2.08 ** KEPT (pick-wt=7): 10 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 1.88/2.08 ** KEPT (pick-wt=5): 11 [] -empty(A)|empty(relation_dom(A)).
% 1.88/2.08 ** KEPT (pick-wt=5): 12 [] -empty(A)|relation(relation_dom(A)).
% 1.88/2.08 ** KEPT (pick-wt=5): 13 [] -empty(A)|empty(relation_rng(A)).
% 1.88/2.08 ** KEPT (pick-wt=5): 14 [] -empty(A)|relation(relation_rng(A)).
% 1.88/2.08 ** KEPT (pick-wt=8): 15 [] -empty(A)| -relation(B)|empty(relation_composition(A,B)).
% 1.88/2.08 ** KEPT (pick-wt=8): 16 [] -empty(A)| -relation(B)|relation(relation_composition(A,B)).
% 1.88/2.08 ** KEPT (pick-wt=5): 17 [] empty(A)| -empty($f2(A)).
% 1.88/2.08 ** KEPT (pick-wt=2): 18 [] -empty($c4).
% 1.88/2.08 ** KEPT (pick-wt=2): 19 [] -empty($c5).
% 1.88/2.08 ** KEPT (pick-wt=6): 20 [] -in(A,B)|element(A,B).
% 1.88/2.08 ** KEPT (pick-wt=20): 21 [] -relation(A)| -function(A)| -relation(B)| -function(B)|relation_dom(relation_composition(B,A))!=relation_dom(B)|subset(relation_rng(B),relation_dom(A)).
% 1.88/2.08 ** KEPT (pick-wt=8): 22 [] -element(A,B)|empty(B)|in(A,B).
% 1.88/2.08 ** KEPT (pick-wt=7): 23 [] -element(A,powerset(B))|subset(A,B).
% 1.88/2.08 ** KEPT (pick-wt=7): 24 [] element(A,powerset(B))| -subset(A,B).
% 3.74/4.00 ** KEPT (pick-wt=19): 25 [] -relation(A)| -function(A)| -relation(B)| -function(B)| -one_to_one(relation_composition(B,A))| -subset(relation_rng(B),relation_dom(A))|one_to_one(B).
% 3.74/4.00 ** KEPT (pick-wt=10): 26 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 3.74/4.00 ** KEPT (pick-wt=2): 27 [] -one_to_one($c8).
% 3.74/4.00 ** KEPT (pick-wt=9): 28 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 3.74/4.00 ** KEPT (pick-wt=5): 29 [] -empty(A)|A=empty_set.
% 3.74/4.00 ** KEPT (pick-wt=5): 30 [] -in(A,B)| -empty(B).
% 3.74/4.00 ** KEPT (pick-wt=7): 31 [] -empty(A)|A=B| -empty(B).
% 3.74/4.00
% 3.74/4.00 ------------> process sos:
% 3.74/4.00 ** KEPT (pick-wt=3): 38 [] A=A.
% 3.74/4.00 ** KEPT (pick-wt=3): 39 [] relation(identity_relation(A)).
% 3.74/4.00 ** KEPT (pick-wt=4): 40 [] element($f1(A),A).
% 3.74/4.00 ** KEPT (pick-wt=2): 41 [] empty(empty_set).
% 3.74/4.00 ** KEPT (pick-wt=2): 42 [] relation(empty_set).
% 3.74/4.00 ** KEPT (pick-wt=2): 43 [] relation_empty_yielding(empty_set).
% 3.74/4.00 Following clause subsumed by 41 during input processing: 0 [] empty(empty_set).
% 3.74/4.00 Following clause subsumed by 39 during input processing: 0 [] relation(identity_relation(A)).
% 3.74/4.00 ** KEPT (pick-wt=3): 44 [] function(identity_relation(A)).
% 3.74/4.00 Following clause subsumed by 41 during input processing: 0 [] empty(empty_set).
% 3.74/4.00 Following clause subsumed by 42 during input processing: 0 [] relation(empty_set).
% 3.74/4.00 ** KEPT (pick-wt=2): 45 [] relation($c1).
% 3.74/4.00 ** KEPT (pick-wt=2): 46 [] function($c1).
% 3.74/4.00 ** KEPT (pick-wt=2): 47 [] empty($c2).
% 3.74/4.00 ** KEPT (pick-wt=2): 48 [] relation($c2).
% 3.74/4.00 ** KEPT (pick-wt=7): 49 [] empty(A)|element($f2(A),powerset(A)).
% 3.74/4.00 ** KEPT (pick-wt=2): 50 [] empty($c3).
% 3.74/4.00 ** KEPT (pick-wt=2): 51 [] relation($c4).
% 3.74/4.00 ** KEPT (pick-wt=5): 52 [] element($f3(A),powerset(A)).
% 3.74/4.00 ** KEPT (pick-wt=3): 53 [] empty($f3(A)).
% 3.74/4.00 ** KEPT (pick-wt=2): 54 [] relation($c6).
% 3.74/4.00 ** KEPT (pick-wt=2): 55 [] relation_empty_yielding($c6).
% 3.74/4.00 ** KEPT (pick-wt=3): 56 [] subset(A,A).
% 3.74/4.00 ** KEPT (pick-wt=3): 57 [] one_to_one(identity_relation(A)).
% 3.74/4.00 ** KEPT (pick-wt=2): 58 [] relation($c8).
% 3.74/4.00 ** KEPT (pick-wt=2): 59 [] function($c8).
% 3.74/4.00 ** KEPT (pick-wt=2): 60 [] relation($c7).
% 3.74/4.00 ** KEPT (pick-wt=2): 61 [] function($c7).
% 3.74/4.00 ** KEPT (pick-wt=7): 63 [copy,62,flip.1] identity_relation(relation_dom($c8))=relation_composition($c8,$c7).
% 3.74/4.00 ---> New Demodulator: 64 [new_demod,63] identity_relation(relation_dom($c8))=relation_composition($c8,$c7).
% 3.74/4.00 ** KEPT (pick-wt=5): 65 [] relation_dom(identity_relation(A))=A.
% 3.74/4.00 ---> New Demodulator: 66 [new_demod,65] relation_dom(identity_relation(A))=A.
% 3.74/4.00 ** KEPT (pick-wt=5): 67 [] relation_rng(identity_relation(A))=A.
% 3.74/4.00 ---> New Demodulator: 68 [new_demod,67] relation_rng(identity_relation(A))=A.
% 3.74/4.00 Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] A=A.
% 3.74/4.00 38 back subsumes 37.
% 3.74/4.00 >>>> Starting back demodulation with 64.
% 3.74/4.00 >>>> Starting back demodulation with 66.
% 3.74/4.00 >>>> Starting back demodulation with 68.
% 3.74/4.00
% 3.74/4.00 ======= end of input processing =======
% 3.74/4.00
% 3.74/4.00 =========== start of search ===========
% 3.74/4.00
% 3.74/4.00
% 3.74/4.00 Resetting weight limit to 6.
% 3.74/4.00
% 3.74/4.00
% 3.74/4.00 Resetting weight limit to 6.
% 3.74/4.00
% 3.74/4.00 sos_size=3888
% 3.74/4.00
% 3.74/4.00 -------- PROOF --------
% 3.74/4.00
% 3.74/4.00 ----> UNIT CONFLICT at 1.90 sec ----> 4928 [binary,4927.1,27.1] $F.
% 3.74/4.00
% 3.74/4.00 Length of proof is 5. Level of proof is 4.
% 3.74/4.00
% 3.74/4.00 ---------------- PROOF ----------------
% 3.74/4.00 % SZS status Theorem
% 3.74/4.00 % SZS output start Refutation
% See solution above
% 3.74/4.00 ------------ end of proof -------------
% 3.74/4.00
% 3.74/4.00
% 3.74/4.00 Search stopped by max_proofs option.
% 3.74/4.00
% 3.74/4.00
% 3.74/4.00 Search stopped by max_proofs option.
% 3.74/4.00
% 3.74/4.00 ============ end of search ============
% 3.74/4.00
% 3.74/4.00 -------------- statistics -------------
% 3.74/4.00 clauses given 380
% 3.74/4.00 clauses generated 193767
% 3.74/4.00 clauses kept 4902
% 3.74/4.00 clauses forward subsumed 5316
% 3.74/4.00 clauses back subsumed 139
% 3.74/4.00 Kbytes malloced 4882
% 3.74/4.00
% 3.74/4.00 ----------- times (seconds) -----------
% 3.74/4.00 user CPU time 1.90 (0 hr, 0 min, 1 sec)
% 3.74/4.00 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 3.74/4.00 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.74/4.00
% 3.74/4.00 That finishes the proof of the theorem.
% 3.74/4.00
% 3.74/4.00 Process 14436 finished Wed Jul 27 08:10:52 2022
% 3.74/4.00 Otter interrupted
% 3.74/4.00 PROOF FOUND
%------------------------------------------------------------------------------