TSTP Solution File: SEU224+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU224+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n017.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:14 EDT 2022
% Result : Theorem 43.26s 43.43s
% Output : Refutation 43.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of clauses : 22 ( 12 unt; 3 nHn; 14 RR)
% Number of literals : 41 ( 8 equ; 18 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
( A != set_intersection2(B,C)
| ~ in(D,A)
| in(D,C) ),
file('SEU224+1.p',unknown),
[] ).
cnf(7,axiom,
( A != set_intersection2(B,C)
| in(D,A)
| ~ in(D,B)
| ~ in(D,C) ),
file('SEU224+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ relation(A)
| relation(relation_dom_restriction(A,B)) ),
file('SEU224+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ relation(A)
| ~ function(A)
| function(relation_dom_restriction(A,B)) ),
file('SEU224+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ in(dollar_c2,relation_dom(relation_dom_restriction(dollar_c1,dollar_c3)))
| ~ in(dollar_c2,relation_dom(dollar_c1))
| ~ in(dollar_c2,dollar_c3) ),
file('SEU224+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ relation(A)
| ~ function(A)
| ~ relation(B)
| ~ function(B)
| A != relation_dom_restriction(B,C)
| relation_dom(A) = set_intersection2(relation_dom(B),C) ),
file('SEU224+1.p',unknown),
[] ).
cnf(40,axiom,
A = A,
file('SEU224+1.p',unknown),
[] ).
cnf(41,axiom,
set_intersection2(A,B) = set_intersection2(B,A),
file('SEU224+1.p',unknown),
[] ).
cnf(49,axiom,
set_intersection2(A,A) = A,
file('SEU224+1.p',unknown),
[] ).
cnf(50,axiom,
relation(dollar_c1),
file('SEU224+1.p',unknown),
[] ).
cnf(51,axiom,
function(dollar_c1),
file('SEU224+1.p',unknown),
[] ).
cnf(52,axiom,
( in(dollar_c2,relation_dom(relation_dom_restriction(dollar_c1,dollar_c3)))
| in(dollar_c2,relation_dom(dollar_c1)) ),
file('SEU224+1.p',unknown),
[] ).
cnf(53,axiom,
( in(dollar_c2,relation_dom(relation_dom_restriction(dollar_c1,dollar_c3)))
| in(dollar_c2,dollar_c3) ),
file('SEU224+1.p',unknown),
[] ).
cnf(94,plain,
relation(relation_dom_restriction(dollar_c1,A)),
inference(hyper,[status(thm)],[50,9]),
[iquote('hyper,50,9')] ).
cnf(112,plain,
function(relation_dom_restriction(dollar_c1,A)),
inference(hyper,[status(thm)],[51,12,50]),
[iquote('hyper,51,12,50')] ).
cnf(794,plain,
( in(dollar_c2,relation_dom(relation_dom_restriction(dollar_c1,dollar_c3)))
| in(dollar_c2,set_intersection2(relation_dom(dollar_c1),dollar_c3)) ),
inference(factor_simp,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[53,7,49,52]),49])]),
[iquote('hyper,53,7,48,52,demod,49,factor_simp')] ).
cnf(890,plain,
relation_dom(relation_dom_restriction(dollar_c1,A)) = set_intersection2(relation_dom(dollar_c1),A),
inference(hyper,[status(thm)],[112,21,94,50,51,40]),
[iquote('hyper,112,21,94,50,51,40')] ).
cnf(963,plain,
in(dollar_c2,set_intersection2(relation_dom(dollar_c1),dollar_c3)),
inference(factor_simp,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[794]),890])]),
[iquote('back_demod,794,demod,890,factor_simp')] ).
cnf(1038,plain,
( ~ in(dollar_c2,relation_dom(dollar_c1))
| ~ in(dollar_c2,dollar_c3) ),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[16]),890]),963]),
[iquote('back_demod,16,demod,890,unit_del,963')] ).
cnf(1596,plain,
in(dollar_c2,relation_dom(dollar_c1)),
inference(hyper,[status(thm)],[963,6,41]),
[iquote('hyper,963,6,41')] ).
cnf(1597,plain,
in(dollar_c2,dollar_c3),
inference(hyper,[status(thm)],[963,6,40]),
[iquote('hyper,963,6,40')] ).
cnf(1624,plain,
$false,
inference(hyper,[status(thm)],[1038,1596,1597]),
[iquote('hyper,1038,1596,1597')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU224+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n017.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.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 07:03:03 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.89/2.09 ----- Otter 3.3f, August 2004 -----
% 1.89/2.09 The process was started by sandbox on n017.cluster.edu,
% 1.89/2.09 Wed Jul 27 07:03:03 2022
% 1.89/2.09 The command was "./otter". The process ID is 12151.
% 1.89/2.09
% 1.89/2.09 set(prolog_style_variables).
% 1.89/2.09 set(auto).
% 1.89/2.09 dependent: set(auto1).
% 1.89/2.09 dependent: set(process_input).
% 1.89/2.09 dependent: clear(print_kept).
% 1.89/2.09 dependent: clear(print_new_demod).
% 1.89/2.09 dependent: clear(print_back_demod).
% 1.89/2.09 dependent: clear(print_back_sub).
% 1.89/2.09 dependent: set(control_memory).
% 1.89/2.09 dependent: assign(max_mem, 12000).
% 1.89/2.09 dependent: assign(pick_given_ratio, 4).
% 1.89/2.09 dependent: assign(stats_level, 1).
% 1.89/2.09 dependent: assign(max_seconds, 10800).
% 1.89/2.09 clear(print_given).
% 1.89/2.09
% 1.89/2.09 formula_list(usable).
% 1.89/2.09 all A (A=A).
% 1.89/2.09 all A B (in(A,B)-> -in(B,A)).
% 1.89/2.09 all A (empty(A)->function(A)).
% 1.89/2.09 all A (empty(A)->relation(A)).
% 1.89/2.09 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.89/2.09 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.89/2.09 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.89/2.09 $T.
% 1.89/2.09 $T.
% 1.89/2.09 $T.
% 1.89/2.09 $T.
% 1.89/2.09 all A B (relation(A)->relation(relation_dom_restriction(A,B))).
% 1.89/2.09 $T.
% 1.89/2.09 all A exists B element(B,A).
% 1.89/2.09 empty(empty_set).
% 1.89/2.09 relation(empty_set).
% 1.89/2.09 relation_empty_yielding(empty_set).
% 1.89/2.09 all A B (relation(A)&relation_empty_yielding(A)->relation(relation_dom_restriction(A,B))&relation_empty_yielding(relation_dom_restriction(A,B))).
% 1.89/2.09 all A B (relation(A)&relation(B)->relation(set_intersection2(A,B))).
% 1.89/2.09 empty(empty_set).
% 1.89/2.09 all A B (relation(A)&function(A)->relation(relation_dom_restriction(A,B))&function(relation_dom_restriction(A,B))).
% 1.89/2.09 empty(empty_set).
% 1.89/2.09 relation(empty_set).
% 1.89/2.09 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 1.89/2.09 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 1.89/2.09 all A B (set_intersection2(A,A)=A).
% 1.89/2.09 -(all A B C (relation(C)&function(C)-> (in(B,relation_dom(relation_dom_restriction(C,A)))<->in(B,relation_dom(C))&in(B,A)))).
% 1.89/2.09 exists A (relation(A)&function(A)).
% 1.89/2.09 exists A (empty(A)&relation(A)).
% 1.89/2.09 exists A empty(A).
% 1.89/2.09 exists A (relation(A)&empty(A)&function(A)).
% 1.89/2.09 exists A (-empty(A)&relation(A)).
% 1.89/2.09 exists A (-empty(A)).
% 1.89/2.09 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.89/2.09 exists A (relation(A)&relation_empty_yielding(A)).
% 1.89/2.09 all A B (in(A,B)->element(A,B)).
% 1.89/2.09 all A (set_intersection2(A,empty_set)=empty_set).
% 1.89/2.09 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.89/2.09 all A B (relation(B)&function(B)-> (all C (relation(C)&function(C)-> (B=relation_dom_restriction(C,A)<->relation_dom(B)=set_intersection2(relation_dom(C),A)& (all D (in(D,relation_dom(B))->apply(B,D)=apply(C,D))))))).
% 1.89/2.09 all A (empty(A)->A=empty_set).
% 1.89/2.09 all A B (-(in(A,B)&empty(B))).
% 1.89/2.09 all A B (-(empty(A)&A!=B&empty(B))).
% 1.89/2.09 end_of_list.
% 1.89/2.09
% 1.89/2.09 -------> usable clausifies to:
% 1.89/2.09
% 1.89/2.09 list(usable).
% 1.89/2.09 0 [] A=A.
% 1.89/2.09 0 [] -in(A,B)| -in(B,A).
% 1.89/2.09 0 [] -empty(A)|function(A).
% 1.89/2.09 0 [] -empty(A)|relation(A).
% 1.89/2.09 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.89/2.09 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.89/2.09 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.89/2.09 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.89/2.09 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.89/2.09 0 [] C=set_intersection2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),A).
% 1.89/2.09 0 [] C=set_intersection2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),B).
% 1.89/2.09 0 [] C=set_intersection2(A,B)| -in($f1(A,B,C),C)| -in($f1(A,B,C),A)| -in($f1(A,B,C),B).
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] element($f2(A),A).
% 1.89/2.09 0 [] empty(empty_set).
% 1.89/2.09 0 [] relation(empty_set).
% 1.89/2.09 0 [] relation_empty_yielding(empty_set).
% 1.89/2.09 0 [] -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 1.89/2.09 0 [] -relation(A)| -relation_empty_yielding(A)|relation_empty_yielding(relation_dom_restriction(A,B)).
% 1.89/2.09 0 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 1.89/2.09 0 [] empty(empty_set).
% 1.89/2.09 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 1.89/2.09 0 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 1.89/2.09 0 [] empty(empty_set).
% 1.89/2.09 0 [] relation(empty_set).
% 1.89/2.09 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.89/2.09 0 [] -empty(A)|empty(relation_dom(A)).
% 1.89/2.09 0 [] -empty(A)|relation(relation_dom(A)).
% 1.89/2.09 0 [] set_intersection2(A,A)=A.
% 1.89/2.09 0 [] relation($c1).
% 1.89/2.09 0 [] function($c1).
% 1.89/2.09 0 [] in($c2,relation_dom(relation_dom_restriction($c1,$c3)))|in($c2,relation_dom($c1)).
% 1.89/2.09 0 [] in($c2,relation_dom(relation_dom_restriction($c1,$c3)))|in($c2,$c3).
% 1.89/2.09 0 [] -in($c2,relation_dom(relation_dom_restriction($c1,$c3)))| -in($c2,relation_dom($c1))| -in($c2,$c3).
% 1.89/2.09 0 [] relation($c4).
% 1.89/2.09 0 [] function($c4).
% 1.89/2.09 0 [] empty($c5).
% 1.89/2.09 0 [] relation($c5).
% 1.89/2.09 0 [] empty($c6).
% 1.89/2.09 0 [] relation($c7).
% 1.89/2.09 0 [] empty($c7).
% 1.89/2.09 0 [] function($c7).
% 1.89/2.09 0 [] -empty($c8).
% 1.89/2.09 0 [] relation($c8).
% 1.89/2.09 0 [] -empty($c9).
% 1.89/2.09 0 [] relation($c10).
% 1.89/2.09 0 [] function($c10).
% 1.89/2.09 0 [] one_to_one($c10).
% 1.89/2.09 0 [] relation($c11).
% 1.89/2.09 0 [] relation_empty_yielding($c11).
% 1.89/2.09 0 [] -in(A,B)|element(A,B).
% 1.89/2.09 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.89/2.09 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.89/2.09 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|B!=relation_dom_restriction(C,A)|relation_dom(B)=set_intersection2(relation_dom(C),A).
% 1.89/2.09 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|B!=relation_dom_restriction(C,A)| -in(D,relation_dom(B))|apply(B,D)=apply(C,D).
% 1.89/2.09 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|B=relation_dom_restriction(C,A)|relation_dom(B)!=set_intersection2(relation_dom(C),A)|in($f3(A,B,C),relation_dom(B)).
% 1.89/2.09 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|B=relation_dom_restriction(C,A)|relation_dom(B)!=set_intersection2(relation_dom(C),A)|apply(B,$f3(A,B,C))!=apply(C,$f3(A,B,C)).
% 1.89/2.09 0 [] -empty(A)|A=empty_set.
% 1.89/2.09 0 [] -in(A,B)| -empty(B).
% 1.89/2.09 0 [] -empty(A)|A=B| -empty(B).
% 1.89/2.09 end_of_list.
% 1.89/2.09
% 1.89/2.09 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.89/2.09
% 1.89/2.09 This ia a non-Horn set with equality. The strategy will be
% 1.89/2.09 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.89/2.09 deletion, with positive clauses in sos and nonpositive
% 1.89/2.09 clauses in usable.
% 1.89/2.09
% 1.89/2.09 dependent: set(knuth_bendix).
% 1.89/2.09 dependent: set(anl_eq).
% 1.89/2.09 dependent: set(para_from).
% 1.89/2.09 dependent: set(para_into).
% 1.89/2.09 dependent: clear(para_from_right).
% 1.89/2.09 dependent: clear(para_into_right).
% 1.89/2.09 dependent: set(para_from_vars).
% 1.89/2.09 dependent: set(eq_units_both_ways).
% 1.89/2.09 dependent: set(dynamic_demod_all).
% 1.89/2.09 dependent: set(dynamic_demod).
% 1.89/2.09 dependent: set(order_eq).
% 1.89/2.09 dependent: set(back_demod).
% 1.89/2.09 dependent: set(lrpo).
% 1.89/2.09 dependent: set(hyper_res).
% 1.89/2.09 dependent: set(unit_deletion).
% 1.89/2.09 dependent: set(factor).
% 1.89/2.09
% 1.89/2.09 ------------> process usable:
% 1.89/2.09 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.89/2.09 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.89/2.09 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 1.89/2.09 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.89/2.09 ** KEPT (pick-wt=11): 5 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 1.89/2.09 ** KEPT (pick-wt=11): 6 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 1.89/2.09 ** KEPT (pick-wt=14): 7 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 1.89/2.09 ** KEPT (pick-wt=23): 8 [] A=set_intersection2(B,C)| -in($f1(B,C,A),A)| -in($f1(B,C,A),B)| -in($f1(B,C,A),C).
% 1.89/2.09 ** KEPT (pick-wt=6): 9 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 1.89/2.09 Following clause subsumed by 9 during input processing: 0 [] -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 1.89/2.09 ** KEPT (pick-wt=8): 10 [] -relation(A)| -relation_empty_yielding(A)|relation_empty_yielding(relation_dom_restriction(A,B)).
% 1.89/2.09 ** KEPT (pick-wt=8): 11 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 1.89/2.09 Following clause subsumed by 9 during input processing: 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 1.89/2.09 ** KEPT (pick-wt=8): 12 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 1.89/2.09 ** KEPT (pick-wt=7): 13 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.89/2.09 ** KEPT (pick-wt=5): 14 [] -empty(A)|empty(relation_dom(A)).
% 1.89/2.09 ** KEPT (pick-wt=5): 15 [] -empty(A)|relation(relation_dom(A)).
% 1.89/2.09 ** KEPT (pick-wt=13): 16 [] -in($c2,relation_dom(relation_dom_restriction($c1,$c3)))| -in($c2,relation_dom($c1))| -in($c2,$c3).
% 1.89/2.09 ** KEPT (pick-wt=2): 17 [] -empty($c8).
% 1.89/2.09 ** KEPT (pick-wt=2): 18 [] -empty($c9).
% 1.89/2.09 ** KEPT (pick-wt=6): 19 [] -in(A,B)|element(A,B).
% 1.89/2.09 ** KEPT (pick-wt=8): 20 [] -element(A,B)|empty(B)|in(A,B).
% 1.89/2.09 ** KEPT (pick-wt=20): 21 [] -relation(A)| -function(A)| -relation(B)| -function(B)|A!=relation_dom_restriction(B,C)|relation_dom(A)=set_intersection2(relation_dom(B),C).
% 43.26/43.43 ** KEPT (pick-wt=24): 22 [] -relation(A)| -function(A)| -relation(B)| -function(B)|A!=relation_dom_restriction(B,C)| -in(D,relation_dom(A))|apply(A,D)=apply(B,D).
% 43.26/43.43 ** KEPT (pick-wt=27): 23 [] -relation(A)| -function(A)| -relation(B)| -function(B)|A=relation_dom_restriction(B,C)|relation_dom(A)!=set_intersection2(relation_dom(B),C)|in($f3(C,A,B),relation_dom(A)).
% 43.26/43.43 ** KEPT (pick-wt=33): 24 [] -relation(A)| -function(A)| -relation(B)| -function(B)|A=relation_dom_restriction(B,C)|relation_dom(A)!=set_intersection2(relation_dom(B),C)|apply(A,$f3(C,A,B))!=apply(B,$f3(C,A,B)).
% 43.26/43.43 ** KEPT (pick-wt=5): 25 [] -empty(A)|A=empty_set.
% 43.26/43.43 ** KEPT (pick-wt=5): 26 [] -in(A,B)| -empty(B).
% 43.26/43.43 ** KEPT (pick-wt=7): 27 [] -empty(A)|A=B| -empty(B).
% 43.26/43.43
% 43.26/43.43 ------------> process sos:
% 43.26/43.43 ** KEPT (pick-wt=3): 40 [] A=A.
% 43.26/43.43 ** KEPT (pick-wt=7): 41 [] set_intersection2(A,B)=set_intersection2(B,A).
% 43.26/43.43 ** KEPT (pick-wt=17): 42 [] A=set_intersection2(B,C)|in($f1(B,C,A),A)|in($f1(B,C,A),B).
% 43.26/43.43 ** KEPT (pick-wt=17): 43 [] A=set_intersection2(B,C)|in($f1(B,C,A),A)|in($f1(B,C,A),C).
% 43.26/43.43 ** KEPT (pick-wt=4): 44 [] element($f2(A),A).
% 43.26/43.43 ** KEPT (pick-wt=2): 45 [] empty(empty_set).
% 43.26/43.43 ** KEPT (pick-wt=2): 46 [] relation(empty_set).
% 43.26/43.43 ** KEPT (pick-wt=2): 47 [] relation_empty_yielding(empty_set).
% 43.26/43.43 Following clause subsumed by 45 during input processing: 0 [] empty(empty_set).
% 43.26/43.43 Following clause subsumed by 45 during input processing: 0 [] empty(empty_set).
% 43.26/43.43 Following clause subsumed by 46 during input processing: 0 [] relation(empty_set).
% 43.26/43.43 ** KEPT (pick-wt=5): 48 [] set_intersection2(A,A)=A.
% 43.26/43.43 ---> New Demodulator: 49 [new_demod,48] set_intersection2(A,A)=A.
% 43.26/43.43 ** KEPT (pick-wt=2): 50 [] relation($c1).
% 43.26/43.43 ** KEPT (pick-wt=2): 51 [] function($c1).
% 43.26/43.43 ** KEPT (pick-wt=10): 52 [] in($c2,relation_dom(relation_dom_restriction($c1,$c3)))|in($c2,relation_dom($c1)).
% 43.26/43.43 ** KEPT (pick-wt=9): 53 [] in($c2,relation_dom(relation_dom_restriction($c1,$c3)))|in($c2,$c3).
% 43.26/43.43 ** KEPT (pick-wt=2): 54 [] relation($c4).
% 43.26/43.43 ** KEPT (pick-wt=2): 55 [] function($c4).
% 43.26/43.43 ** KEPT (pick-wt=2): 56 [] empty($c5).
% 43.26/43.43 ** KEPT (pick-wt=2): 57 [] relation($c5).
% 43.26/43.43 ** KEPT (pick-wt=2): 58 [] empty($c6).
% 43.26/43.43 ** KEPT (pick-wt=2): 59 [] relation($c7).
% 43.26/43.43 ** KEPT (pick-wt=2): 60 [] empty($c7).
% 43.26/43.43 ** KEPT (pick-wt=2): 61 [] function($c7).
% 43.26/43.43 ** KEPT (pick-wt=2): 62 [] relation($c8).
% 43.26/43.43 ** KEPT (pick-wt=2): 63 [] relation($c10).
% 43.26/43.43 ** KEPT (pick-wt=2): 64 [] function($c10).
% 43.26/43.43 ** KEPT (pick-wt=2): 65 [] one_to_one($c10).
% 43.26/43.43 ** KEPT (pick-wt=2): 66 [] relation($c11).
% 43.26/43.43 ** KEPT (pick-wt=2): 67 [] relation_empty_yielding($c11).
% 43.26/43.43 ** KEPT (pick-wt=5): 68 [] set_intersection2(A,empty_set)=empty_set.
% 43.26/43.43 ---> New Demodulator: 69 [new_demod,68] set_intersection2(A,empty_set)=empty_set.
% 43.26/43.43 Following clause subsumed by 40 during input processing: 0 [copy,40,flip.1] A=A.
% 43.26/43.43 40 back subsumes 38.
% 43.26/43.43 40 back subsumes 35.
% 43.26/43.43 Following clause subsumed by 41 during input processing: 0 [copy,41,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 43.26/43.43 >>>> Starting back demodulation with 49.
% 43.26/43.43 >> back demodulating 39 with 49.
% 43.26/43.43 >> back demodulating 33 with 49.
% 43.26/43.43 >> back demodulating 32 with 49.
% 43.26/43.43 >> back demodulating 29 with 49.
% 43.26/43.43 >>>> Starting back demodulation with 69.
% 43.26/43.43
% 43.26/43.43 ======= end of input processing =======
% 43.26/43.43
% 43.26/43.43 =========== start of search ===========
% 43.26/43.43
% 43.26/43.43
% 43.26/43.43 Resetting weight limit to 6.
% 43.26/43.43
% 43.26/43.43
% 43.26/43.43 Resetting weight limit to 6.
% 43.26/43.43
% 43.26/43.43 sos_size=903
% 43.26/43.43
% 43.26/43.43 -- HEY sandbox, WE HAVE A PROOF!! --
% 43.26/43.43
% 43.26/43.43 -----> EMPTY CLAUSE at 41.34 sec ----> 1624 [hyper,1038,1596,1597] $F.
% 43.26/43.43
% 43.26/43.43 Length of proof is 8. Level of proof is 4.
% 43.26/43.43
% 43.26/43.43 ---------------- PROOF ----------------
% 43.26/43.43 % SZS status Theorem
% 43.26/43.43 % SZS output start Refutation
% See solution above
% 43.26/43.43 ------------ end of proof -------------
% 43.26/43.43
% 43.26/43.43
% 43.26/43.43 Search stopped by max_proofs option.
% 43.26/43.43
% 43.26/43.43
% 43.26/43.43 Search stopped by max_proofs option.
% 43.26/43.43
% 43.26/43.43 ============ end of search ============
% 43.26/43.43
% 43.26/43.43 -------------- statistics -------------
% 43.26/43.43 clauses given 493
% 43.26/43.43 clauses generated 560142
% 43.26/43.43 clauses kept 1606
% 43.26/43.43 clauses forward subsumed 5029
% 43.26/43.43 clauses back subsumed 206
% 43.26/43.43 Kbytes malloced 4882
% 43.26/43.43
% 43.26/43.43 ----------- times (seconds) -----------
% 43.26/43.43 user CPU time 41.34 (0 hr, 0 min, 41 sec)
% 43.26/43.43 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 43.26/43.43 wall-clock time 43 (0 hr, 0 min, 43 sec)
% 43.26/43.43
% 43.26/43.43 That finishes the proof of the theorem.
% 43.26/43.43
% 43.26/43.43 Process 12151 finished Wed Jul 27 07:03:46 2022
% 43.26/43.43 Otter interrupted
% 43.26/43.43 PROOF FOUND
%------------------------------------------------------------------------------