TSTP Solution File: SET994+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET994+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:39 EDT 2022
% Result : Theorem 2.35s 2.53s
% Output : Refutation 2.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of clauses : 51 ( 35 unt; 2 nHn; 42 RR)
% Number of literals : 75 ( 26 equ; 33 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
( empty(A)
| ~ relation(A)
| ~ empty(relation_dom(A)) ),
file('SET994+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ empty(A)
| empty(relation_dom(A)) ),
file('SET994+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ in(A,B)
| apply(dollar_f4(B),A) = n0 ),
file('SET994+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ in(A,B)
| apply(dollar_f5(B),A) = n1 ),
file('SET994+1.p',unknown),
[] ).
cnf(13,axiom,
~ empty(n1),
file('SET994+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ relation(A)
| ~ function(A)
| ~ relation(B)
| ~ function(B)
| relation_dom(A) != dollar_c7
| relation_dom(B) != dollar_c7
| A = B ),
file('SET994+1.p',unknown),
[] ).
cnf(15,axiom,
dollar_c7 != empty_set,
file('SET994+1.p',unknown),
[] ).
cnf(16,plain,
empty_set != dollar_c7,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[15])]),
[iquote('copy,15,flip.1')] ).
cnf(18,axiom,
( ~ element(A,B)
| empty(B)
| in(A,B) ),
file('SET994+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ empty(A)
| A = empty_set ),
file('SET994+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ empty(A)
| A = B
| ~ empty(B) ),
file('SET994+1.p',unknown),
[] ).
cnf(29,axiom,
A = A,
file('SET994+1.p',unknown),
[] ).
cnf(30,axiom,
element(dollar_f1(A),A),
file('SET994+1.p',unknown),
[] ).
cnf(31,axiom,
empty(empty_set),
file('SET994+1.p',unknown),
[] ).
cnf(36,axiom,
empty(dollar_c2),
file('SET994+1.p',unknown),
[] ).
cnf(46,axiom,
relation(dollar_f4(A)),
file('SET994+1.p',unknown),
[] ).
cnf(47,axiom,
function(dollar_f4(A)),
file('SET994+1.p',unknown),
[] ).
cnf(48,axiom,
relation_dom(dollar_f4(A)) = A,
file('SET994+1.p',unknown),
[] ).
cnf(50,axiom,
relation(dollar_f5(A)),
file('SET994+1.p',unknown),
[] ).
cnf(51,axiom,
function(dollar_f5(A)),
file('SET994+1.p',unknown),
[] ).
cnf(52,axiom,
relation_dom(dollar_f5(A)) = A,
file('SET994+1.p',unknown),
[] ).
cnf(54,axiom,
empty(n0),
file('SET994+1.p',unknown),
[] ).
cnf(62,plain,
( empty(A)
| in(dollar_f1(A),A) ),
inference(hyper,[status(thm)],[30,18]),
[iquote('hyper,30,18')] ).
cnf(67,plain,
empty_set = dollar_c2,
inference(hyper,[status(thm)],[36,25,31]),
[iquote('hyper,36,25,31')] ).
cnf(69,plain,
empty(relation_dom(dollar_c2)),
inference(hyper,[status(thm)],[36,6]),
[iquote('hyper,36,6')] ).
cnf(75,plain,
( ~ empty(A)
| A = dollar_c2 ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[23]),67]),
[iquote('back_demod,23,demod,67')] ).
cnf(76,plain,
dollar_c7 != dollar_c2,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[16]),67])]),
[iquote('back_demod,16,demod,67,flip.1')] ).
cnf(99,plain,
n0 = dollar_c2,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[54,25,36])]),
[iquote('hyper,54,25,36,flip.1')] ).
cnf(100,plain,
( ~ in(A,B)
| apply(dollar_f4(B),A) = dollar_c2 ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[11]),99]),
[iquote('back_demod,11,demod,99')] ).
cnf(125,plain,
( empty(dollar_f4(A))
| ~ empty(A) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[48,5]),46]),
[iquote('para_from,48.1.1,5.3.1,unit_del,46')] ).
cnf(129,plain,
relation_dom(dollar_c2) = dollar_c2,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[69,25,36])]),
[iquote('hyper,69,25,36,flip.1')] ).
cnf(134,plain,
dollar_f5(dollar_c7) = dollar_f4(dollar_c7),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[52,14,46,47,50,51,48])]),
[iquote('hyper,52,14,46,47,50,51,48,flip.1')] ).
cnf(140,plain,
( empty(dollar_f5(A))
| ~ empty(A) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[52,5]),50]),
[iquote('para_from,52.1.1,5.3.1,unit_del,50')] ).
cnf(152,plain,
( relation_dom(A) = dollar_c2
| ~ empty(A) ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[129,25]),36]),
[iquote('para_into,129.1.1.1,25.2.1,unit_del,36')] ).
cnf(210,plain,
~ empty(dollar_c7),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[75,76]),29]),
[iquote('para_from,75.2.1,76.1.1,unit_del,29')] ).
cnf(213,plain,
in(dollar_f1(dollar_c7),dollar_c7),
inference(hyper,[status(thm)],[210,62]),
[iquote('hyper,210,62')] ).
cnf(217,plain,
apply(dollar_f4(dollar_c7),dollar_f1(dollar_c7)) = n1,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[213,12]),134]),
[iquote('hyper,213,12,demod,134')] ).
cnf(279,plain,
empty(dollar_f4(dollar_c2)),
inference(hyper,[status(thm)],[125,36]),
[iquote('hyper,125,36')] ).
cnf(336,plain,
dollar_f4(dollar_c2) = dollar_c2,
inference(hyper,[status(thm)],[279,75]),
[iquote('hyper,279,75')] ).
cnf(363,plain,
empty(dollar_f5(dollar_c2)),
inference(hyper,[status(thm)],[140,36]),
[iquote('hyper,140,36')] ).
cnf(367,plain,
dollar_f5(dollar_c2) = dollar_c2,
inference(hyper,[status(thm)],[363,75]),
[iquote('hyper,363,75')] ).
cnf(474,plain,
( A = dollar_c2
| ~ empty(dollar_f5(A)) ),
inference(para_into,[status(thm),theory(equality)],[152,52]),
[iquote('para_into,152.1.1,52.1.1')] ).
cnf(475,plain,
( A = dollar_c2
| ~ empty(dollar_f4(A)) ),
inference(para_into,[status(thm),theory(equality)],[152,48]),
[iquote('para_into,152.1.1,48.1.1')] ).
cnf(737,plain,
~ empty(dollar_f5(n1)),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[474,13]),36]),
[iquote('para_from,474.1.1,13.1.1,unit_del,36')] ).
cnf(778,plain,
~ empty(dollar_f5(dollar_f5(n1))),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[737,474]),36]),
[iquote('para_into,737.1.1,474.1.1,unit_del,36')] ).
cnf(854,plain,
~ empty(dollar_f5(dollar_f5(dollar_f5(n1)))),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[778,474]),36]),
[iquote('para_into,778.1.1,474.1.1,unit_del,36')] ).
cnf(960,plain,
~ empty(dollar_f4(dollar_f5(n1))),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[475,854]),367,367]),36]),
[iquote('para_from,475.1.1,854.1.1.1.1,demod,367,367,unit_del,36')] ).
cnf(1103,plain,
~ empty(dollar_f5(dollar_f4(dollar_f5(n1)))),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[960,474]),36]),
[iquote('para_into,960.1.1,474.1.1,unit_del,36')] ).
cnf(1115,plain,
n1 = dollar_c2,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[100,213]),217]),
[iquote('hyper,100,213,demod,217')] ).
cnf(1132,plain,
~ empty(dollar_c2),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1103]),1115,367,336,367]),
[iquote('back_demod,1103,demod,1115,367,336,367')] ).
cnf(1133,plain,
$false,
inference(binary,[status(thm)],[1132,36]),
[iquote('binary,1132.1,36.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET994+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 10:40:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.15/2.31 ----- Otter 3.3f, August 2004 -----
% 2.15/2.31 The process was started by sandbox2 on n015.cluster.edu,
% 2.15/2.31 Wed Jul 27 10:40:27 2022
% 2.15/2.31 The command was "./otter". The process ID is 30769.
% 2.15/2.31
% 2.15/2.31 set(prolog_style_variables).
% 2.15/2.31 set(auto).
% 2.15/2.31 dependent: set(auto1).
% 2.15/2.31 dependent: set(process_input).
% 2.15/2.31 dependent: clear(print_kept).
% 2.15/2.31 dependent: clear(print_new_demod).
% 2.15/2.31 dependent: clear(print_back_demod).
% 2.15/2.31 dependent: clear(print_back_sub).
% 2.15/2.31 dependent: set(control_memory).
% 2.15/2.31 dependent: assign(max_mem, 12000).
% 2.15/2.31 dependent: assign(pick_given_ratio, 4).
% 2.15/2.31 dependent: assign(stats_level, 1).
% 2.15/2.31 dependent: assign(max_seconds, 10800).
% 2.15/2.31 clear(print_given).
% 2.15/2.31
% 2.15/2.31 formula_list(usable).
% 2.15/2.31 all A (A=A).
% 2.15/2.31 all A B (in(A,B)-> -in(B,A)).
% 2.15/2.31 all A (empty(A)->function(A)).
% 2.15/2.31 all A (empty(A)->relation(A)).
% 2.15/2.31 all A exists B element(B,A).
% 2.15/2.31 empty(empty_set).
% 2.15/2.31 relation(empty_set).
% 2.15/2.31 relation_empty_yielding(empty_set).
% 2.15/2.31 all A (-empty(powerset(A))).
% 2.15/2.31 empty(empty_set).
% 2.15/2.31 empty(empty_set).
% 2.15/2.31 relation(empty_set).
% 2.15/2.31 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.15/2.31 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.15/2.31 exists A (relation(A)&function(A)).
% 2.15/2.31 exists A (empty(A)&relation(A)).
% 2.15/2.31 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.15/2.31 exists A empty(A).
% 2.15/2.31 exists A (-empty(A)&relation(A)).
% 2.15/2.31 all A exists B (element(B,powerset(A))&empty(B)).
% 2.15/2.31 exists A (-empty(A)).
% 2.15/2.31 exists A (relation(A)&relation_empty_yielding(A)).
% 2.15/2.31 all A B subset(A,A).
% 2.15/2.31 all A exists B (relation(B)&function(B)&relation_dom(B)=A& (all C (in(C,A)->apply(B,C)=n0))).
% 2.15/2.31 all A exists B (relation(B)&function(B)&relation_dom(B)=A& (all C (in(C,A)->apply(B,C)=n1))).
% 2.15/2.31 empty(n0).
% 2.15/2.31 -empty(n1).
% 2.15/2.31 -(all A ((all B (relation(B)&function(B)-> (all C (relation(C)&function(C)-> (relation_dom(B)=A&relation_dom(C)=A->B=C)))))->A=empty_set)).
% 2.15/2.31 all A B (in(A,B)->element(A,B)).
% 2.15/2.31 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.15/2.31 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.15/2.31 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.15/2.31 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.15/2.31 all A (empty(A)->A=empty_set).
% 2.15/2.31 all A B (-(in(A,B)&empty(B))).
% 2.15/2.31 all A B (-(empty(A)&A!=B&empty(B))).
% 2.15/2.31 end_of_list.
% 2.15/2.31
% 2.15/2.31 -------> usable clausifies to:
% 2.15/2.31
% 2.15/2.31 list(usable).
% 2.15/2.31 0 [] A=A.
% 2.15/2.31 0 [] -in(A,B)| -in(B,A).
% 2.15/2.31 0 [] -empty(A)|function(A).
% 2.15/2.31 0 [] -empty(A)|relation(A).
% 2.15/2.31 0 [] element($f1(A),A).
% 2.15/2.31 0 [] empty(empty_set).
% 2.15/2.31 0 [] relation(empty_set).
% 2.15/2.31 0 [] relation_empty_yielding(empty_set).
% 2.15/2.31 0 [] -empty(powerset(A)).
% 2.15/2.31 0 [] empty(empty_set).
% 2.15/2.31 0 [] empty(empty_set).
% 2.15/2.31 0 [] relation(empty_set).
% 2.15/2.31 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.15/2.31 0 [] -empty(A)|empty(relation_dom(A)).
% 2.15/2.31 0 [] -empty(A)|relation(relation_dom(A)).
% 2.15/2.31 0 [] relation($c1).
% 2.15/2.31 0 [] function($c1).
% 2.15/2.31 0 [] empty($c2).
% 2.15/2.31 0 [] relation($c2).
% 2.15/2.31 0 [] empty(A)|element($f2(A),powerset(A)).
% 2.15/2.31 0 [] empty(A)| -empty($f2(A)).
% 2.15/2.31 0 [] empty($c3).
% 2.15/2.31 0 [] -empty($c4).
% 2.15/2.31 0 [] relation($c4).
% 2.15/2.31 0 [] element($f3(A),powerset(A)).
% 2.15/2.31 0 [] empty($f3(A)).
% 2.15/2.31 0 [] -empty($c5).
% 2.15/2.31 0 [] relation($c6).
% 2.15/2.31 0 [] relation_empty_yielding($c6).
% 2.15/2.31 0 [] subset(A,A).
% 2.15/2.31 0 [] relation($f4(A)).
% 2.15/2.31 0 [] function($f4(A)).
% 2.15/2.31 0 [] relation_dom($f4(A))=A.
% 2.15/2.31 0 [] -in(C,A)|apply($f4(A),C)=n0.
% 2.15/2.31 0 [] relation($f5(A)).
% 2.15/2.31 0 [] function($f5(A)).
% 2.15/2.31 0 [] relation_dom($f5(A))=A.
% 2.15/2.31 0 [] -in(C,A)|apply($f5(A),C)=n1.
% 2.15/2.31 0 [] empty(n0).
% 2.15/2.31 0 [] -empty(n1).
% 2.15/2.31 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|relation_dom(B)!=$c7|relation_dom(C)!=$c7|B=C.
% 2.15/2.31 0 [] $c7!=empty_set.
% 2.15/2.31 0 [] -in(A,B)|element(A,B).
% 2.15/2.31 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.15/2.31 0 [] -element(A,powerset(B))|subset(A,B).
% 2.15/2.31 0 [] element(A,powerset(B))| -subset(A,B).
% 2.15/2.31 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.15/2.31 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.15/2.31 0 [] -empty(A)|A=empty_set.
% 2.15/2.31 0 [] -in(A,B)| -empty(B).
% 2.15/2.31 0 [] -empty(A)|A=B| -empty(B).
% 2.15/2.31 end_of_list.
% 2.15/2.31
% 2.15/2.31 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 2.15/2.31
% 2.15/2.31 This ia a non-Horn set with equality. The strategy will be
% 2.15/2.31 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.15/2.31 deletion, with positive clauses in sos and nonpositive
% 2.15/2.31 clauses in usable.
% 2.15/2.31
% 2.15/2.31 dependent: set(knuth_bendix).
% 2.15/2.31 dependent: set(anl_eq).
% 2.15/2.31 dependent: set(para_from).
% 2.15/2.31 dependent: set(para_into).
% 2.15/2.31 dependent: clear(para_from_right).
% 2.15/2.31 dependent: clear(para_into_right).
% 2.35/2.53 dependent: set(para_from_vars).
% 2.35/2.53 dependent: set(eq_units_both_ways).
% 2.35/2.53 dependent: set(dynamic_demod_all).
% 2.35/2.53 dependent: set(dynamic_demod).
% 2.35/2.53 dependent: set(order_eq).
% 2.35/2.53 dependent: set(back_demod).
% 2.35/2.53 dependent: set(lrpo).
% 2.35/2.53 dependent: set(hyper_res).
% 2.35/2.53 dependent: set(unit_deletion).
% 2.35/2.53 dependent: set(factor).
% 2.35/2.53
% 2.35/2.53 ------------> process usable:
% 2.35/2.53 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.35/2.53 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.35/2.53 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 2.35/2.53 ** KEPT (pick-wt=3): 4 [] -empty(powerset(A)).
% 2.35/2.53 ** KEPT (pick-wt=7): 5 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.35/2.53 ** KEPT (pick-wt=5): 6 [] -empty(A)|empty(relation_dom(A)).
% 2.35/2.53 ** KEPT (pick-wt=5): 7 [] -empty(A)|relation(relation_dom(A)).
% 2.35/2.53 ** KEPT (pick-wt=5): 8 [] empty(A)| -empty($f2(A)).
% 2.35/2.53 ** KEPT (pick-wt=2): 9 [] -empty($c4).
% 2.35/2.53 ** KEPT (pick-wt=2): 10 [] -empty($c5).
% 2.35/2.53 ** KEPT (pick-wt=9): 11 [] -in(A,B)|apply($f4(B),A)=n0.
% 2.35/2.53 ** KEPT (pick-wt=9): 12 [] -in(A,B)|apply($f5(B),A)=n1.
% 2.35/2.53 ** KEPT (pick-wt=2): 13 [] -empty(n1).
% 2.35/2.53 ** KEPT (pick-wt=19): 14 [] -relation(A)| -function(A)| -relation(B)| -function(B)|relation_dom(A)!=$c7|relation_dom(B)!=$c7|A=B.
% 2.35/2.53 ** KEPT (pick-wt=3): 16 [copy,15,flip.1] empty_set!=$c7.
% 2.35/2.53 ** KEPT (pick-wt=6): 17 [] -in(A,B)|element(A,B).
% 2.35/2.53 ** KEPT (pick-wt=8): 18 [] -element(A,B)|empty(B)|in(A,B).
% 2.35/2.53 ** KEPT (pick-wt=7): 19 [] -element(A,powerset(B))|subset(A,B).
% 2.35/2.53 ** KEPT (pick-wt=7): 20 [] element(A,powerset(B))| -subset(A,B).
% 2.35/2.53 ** KEPT (pick-wt=10): 21 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.35/2.53 ** KEPT (pick-wt=9): 22 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.35/2.53 ** KEPT (pick-wt=5): 23 [] -empty(A)|A=empty_set.
% 2.35/2.53 ** KEPT (pick-wt=5): 24 [] -in(A,B)| -empty(B).
% 2.35/2.53 ** KEPT (pick-wt=7): 25 [] -empty(A)|A=B| -empty(B).
% 2.35/2.53
% 2.35/2.53 ------------> process sos:
% 2.35/2.53 ** KEPT (pick-wt=3): 29 [] A=A.
% 2.35/2.53 ** KEPT (pick-wt=4): 30 [] element($f1(A),A).
% 2.35/2.53 ** KEPT (pick-wt=2): 31 [] empty(empty_set).
% 2.35/2.53 ** KEPT (pick-wt=2): 32 [] relation(empty_set).
% 2.35/2.53 ** KEPT (pick-wt=2): 33 [] relation_empty_yielding(empty_set).
% 2.35/2.53 Following clause subsumed by 31 during input processing: 0 [] empty(empty_set).
% 2.35/2.53 Following clause subsumed by 31 during input processing: 0 [] empty(empty_set).
% 2.35/2.53 Following clause subsumed by 32 during input processing: 0 [] relation(empty_set).
% 2.35/2.53 ** KEPT (pick-wt=2): 34 [] relation($c1).
% 2.35/2.53 ** KEPT (pick-wt=2): 35 [] function($c1).
% 2.35/2.53 ** KEPT (pick-wt=2): 36 [] empty($c2).
% 2.35/2.53 ** KEPT (pick-wt=2): 37 [] relation($c2).
% 2.35/2.53 ** KEPT (pick-wt=7): 38 [] empty(A)|element($f2(A),powerset(A)).
% 2.35/2.53 ** KEPT (pick-wt=2): 39 [] empty($c3).
% 2.35/2.53 ** KEPT (pick-wt=2): 40 [] relation($c4).
% 2.35/2.53 ** KEPT (pick-wt=5): 41 [] element($f3(A),powerset(A)).
% 2.35/2.53 ** KEPT (pick-wt=3): 42 [] empty($f3(A)).
% 2.35/2.53 ** KEPT (pick-wt=2): 43 [] relation($c6).
% 2.35/2.53 ** KEPT (pick-wt=2): 44 [] relation_empty_yielding($c6).
% 2.35/2.53 ** KEPT (pick-wt=3): 45 [] subset(A,A).
% 2.35/2.53 ** KEPT (pick-wt=3): 46 [] relation($f4(A)).
% 2.35/2.53 ** KEPT (pick-wt=3): 47 [] function($f4(A)).
% 2.35/2.53 ** KEPT (pick-wt=5): 48 [] relation_dom($f4(A))=A.
% 2.35/2.53 ---> New Demodulator: 49 [new_demod,48] relation_dom($f4(A))=A.
% 2.35/2.53 ** KEPT (pick-wt=3): 50 [] relation($f5(A)).
% 2.35/2.53 ** KEPT (pick-wt=3): 51 [] function($f5(A)).
% 2.35/2.53 ** KEPT (pick-wt=5): 52 [] relation_dom($f5(A))=A.
% 2.35/2.53 ---> New Demodulator: 53 [new_demod,52] relation_dom($f5(A))=A.
% 2.35/2.53 ** KEPT (pick-wt=2): 54 [] empty(n0).
% 2.35/2.53 Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] A=A.
% 2.35/2.53 29 back subsumes 28.
% 2.35/2.53 29 back subsumes 27.
% 2.35/2.53 >>>> Starting back demodulation with 49.
% 2.35/2.53 >>>> Starting back demodulation with 53.
% 2.35/2.53
% 2.35/2.53 ======= end of input processing =======
% 2.35/2.53
% 2.35/2.53 =========== start of search ===========
% 2.35/2.53
% 2.35/2.53 -------- PROOF --------
% 2.35/2.53
% 2.35/2.53 ----> UNIT CONFLICT at 0.23 sec ----> 1133 [binary,1132.1,36.1] $F.
% 2.35/2.53
% 2.35/2.53 Length of proof is 29. Level of proof is 10.
% 2.35/2.53
% 2.35/2.53 ---------------- PROOF ----------------
% 2.35/2.53 % SZS status Theorem
% 2.35/2.53 % SZS output start Refutation
% See solution above
% 2.35/2.53 ------------ end of proof -------------
% 2.35/2.53
% 2.35/2.53
% 2.35/2.53 Search stopped by max_proofs option.
% 2.35/2.53
% 2.35/2.53
% 2.35/2.53 Search stopped by max_proofs option.
% 2.35/2.53
% 2.35/2.53 ============ end of search ============
% 2.35/2.53
% 2.35/2.53 -------------- statistics -------------
% 2.35/2.53 clauses given 136
% 2.35/2.53 clauses generated 4422
% 2.35/2.53 clauses kept 1094
% 2.35/2.53 clauses forward subsumed 3383
% 2.35/2.53 clauses back subsumed 134
% 2.35/2.53 Kbytes malloced 3906
% 2.35/2.53
% 2.35/2.53 ----------- times (seconds) -----------
% 2.35/2.53 user CPU time 0.23 (0 hr, 0 min, 0 sec)
% 2.35/2.53 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.35/2.53 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.35/2.53
% 2.35/2.53 That finishes the proof of the theorem.
% 2.35/2.53
% 2.35/2.53 Process 30769 finished Wed Jul 27 10:40:29 2022
% 2.35/2.53 Otter interrupted
% 2.35/2.53 PROOF FOUND
%------------------------------------------------------------------------------