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