TSTP Solution File: NUM386+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM386+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:08:13 EDT 2022
% Result : Theorem 142.15s 142.34s
% Output : Refutation 142.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 30 ( 10 unt; 9 nHn; 22 RR)
% Number of literals : 70 ( 26 equ; 32 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 39 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
( A != singleton(B)
| ~ in(C,A)
| C = B ),
file('NUM386+1.p',unknown),
[] ).
cnf(6,axiom,
( A != singleton(B)
| in(C,A)
| C != B ),
file('NUM386+1.p',unknown),
[] ).
cnf(8,axiom,
( A != set_union2(B,C)
| ~ in(D,A)
| in(D,B)
| in(D,C) ),
file('NUM386+1.p',unknown),
[] ).
cnf(10,axiom,
( A != set_union2(B,C)
| in(D,A)
| ~ in(D,C) ),
file('NUM386+1.p',unknown),
[] ).
cnf(12,axiom,
( A = set_union2(B,C)
| ~ in(dollar_f2(B,C,A),A)
| ~ in(dollar_f2(B,C,A),C) ),
file('NUM386+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ in(dollar_c12,succ(dollar_c11))
| ~ in(dollar_c12,dollar_c11) ),
file('NUM386+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ in(dollar_c12,succ(dollar_c11))
| dollar_c12 != dollar_c11 ),
file('NUM386+1.p',unknown),
[] ).
cnf(32,axiom,
A = A,
file('NUM386+1.p',unknown),
[] ).
cnf(33,axiom,
set_union2(A,B) = set_union2(B,A),
file('NUM386+1.p',unknown),
[] ).
cnf(35,axiom,
succ(A) = set_union2(A,singleton(A)),
file('NUM386+1.p',unknown),
[] ).
cnf(37,axiom,
( A = set_union2(B,C)
| in(dollar_f2(B,C,A),A)
| in(dollar_f2(B,C,A),B)
| in(dollar_f2(B,C,A),C) ),
file('NUM386+1.p',unknown),
[] ).
cnf(43,axiom,
set_union2(A,A) = A,
file('NUM386+1.p',unknown),
[] ).
cnf(64,axiom,
( in(dollar_c12,succ(dollar_c11))
| in(dollar_c12,dollar_c11)
| dollar_c12 = dollar_c11 ),
file('NUM386+1.p',unknown),
[] ).
cnf(65,plain,
( in(dollar_c12,set_union2(dollar_c11,singleton(dollar_c11)))
| in(dollar_c12,dollar_c11)
| dollar_c12 = dollar_c11 ),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[64]),35]),
[iquote('copy,64,demod,35')] ).
cnf(68,plain,
( ~ in(dollar_c12,set_union2(dollar_c11,singleton(dollar_c11)))
| dollar_c12 != dollar_c11 ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[20]),35]),
[iquote('back_demod,20,demod,35')] ).
cnf(69,plain,
( ~ in(dollar_c12,set_union2(dollar_c11,singleton(dollar_c11)))
| ~ in(dollar_c12,dollar_c11) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[19]),35]),
[iquote('back_demod,19,demod,35')] ).
cnf(75,plain,
in(A,singleton(A)),
inference(hyper,[status(thm)],[32,6,32]),
[iquote('hyper,32,6,32')] ).
cnf(699,plain,
( A = B
| C != singleton(A)
| ~ in(B,C) ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[43,5]),43]),
[iquote('para_into,42.1.1,5.3.1,demod,43')] ).
cnf(716,plain,
( in(dollar_c12,dollar_c11)
| dollar_c12 = dollar_c11
| in(dollar_c12,singleton(dollar_c11)) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[65,8,33])]),
[iquote('hyper,65,8,33,factor_simp')] ).
cnf(719,plain,
( in(dollar_c12,set_union2(dollar_c11,singleton(dollar_c11)))
| dollar_c12 = dollar_c11 ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[65,10,33])]),
[iquote('hyper,65,10,33,factor_simp')] ).
cnf(721,plain,
in(A,set_union2(B,singleton(A))),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[75,10,43]),43]),
[iquote('hyper,75,10,42,demod,43')] ).
cnf(835,plain,
( ~ in(dollar_c12,set_union2(set_union2(A,B),singleton(dollar_c11)))
| dollar_c12 != dollar_c11
| in(dollar_f2(A,B,dollar_c11),dollar_c11)
| in(dollar_f2(A,B,dollar_c11),A)
| in(dollar_f2(A,B,dollar_c11),B) ),
inference(para_into,[status(thm),theory(equality)],[68,37]),
[iquote('para_into,68.1.2.1,37.1.1')] ).
cnf(838,plain,
( ~ in(dollar_c12,set_union2(set_union2(A,B),singleton(dollar_c11)))
| dollar_c12 != dollar_c11
| ~ in(dollar_f2(A,B,dollar_c11),dollar_c11)
| ~ in(dollar_f2(A,B,dollar_c11),B) ),
inference(para_into,[status(thm),theory(equality)],[68,12]),
[iquote('para_into,68.1.2.1,12.1.1')] ).
cnf(878,plain,
( ~ in(dollar_c12,set_union2(set_union2(A,dollar_c11),singleton(dollar_c11)))
| dollar_c12 != dollar_c11
| in(dollar_f2(A,dollar_c11,dollar_c11),dollar_c11)
| in(dollar_f2(A,dollar_c11,dollar_c11),A) ),
inference(factor,[status(thm)],[835]),
[iquote('factor,835.3.5')] ).
cnf(880,plain,
( ~ in(dollar_c12,set_union2(set_union2(A,dollar_c11),singleton(dollar_c11)))
| dollar_c12 != dollar_c11
| ~ in(dollar_f2(A,dollar_c11,dollar_c11),dollar_c11) ),
inference(factor,[status(thm)],[838]),
[iquote('factor,838.3.4')] ).
cnf(3871,plain,
( in(dollar_c12,dollar_c11)
| dollar_c12 = dollar_c11 ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[716,699,32])]),
[iquote('hyper,716,699,32,factor_simp')] ).
cnf(3873,plain,
dollar_c12 = dollar_c11,
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3871,69,719])]),
[iquote('hyper,3871,69,719,factor_simp')] ).
cnf(3875,plain,
~ in(dollar_f2(A,dollar_c11,dollar_c11),dollar_c11),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[880]),3873,3873]),721,32]),
[iquote('back_demod,880,demod,3873,3873,unit_del,721,32')] ).
cnf(3876,plain,
in(dollar_f2(A,dollar_c11,dollar_c11),A),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[878]),3873,3873]),721,32,3875]),
[iquote('back_demod,878,demod,3873,3873,unit_del,721,32,3875')] ).
cnf(3877,plain,
$false,
inference(binary,[status(thm)],[3876,3875]),
[iquote('binary,3876.1,3875.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM386+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 09:51:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.04/2.25 ----- Otter 3.3f, August 2004 -----
% 2.04/2.25 The process was started by sandbox2 on n006.cluster.edu,
% 2.04/2.25 Wed Jul 27 09:51:17 2022
% 2.04/2.25 The command was "./otter". The process ID is 31145.
% 2.04/2.25
% 2.04/2.25 set(prolog_style_variables).
% 2.04/2.25 set(auto).
% 2.04/2.25 dependent: set(auto1).
% 2.04/2.25 dependent: set(process_input).
% 2.04/2.25 dependent: clear(print_kept).
% 2.04/2.25 dependent: clear(print_new_demod).
% 2.04/2.25 dependent: clear(print_back_demod).
% 2.04/2.25 dependent: clear(print_back_sub).
% 2.04/2.25 dependent: set(control_memory).
% 2.04/2.25 dependent: assign(max_mem, 12000).
% 2.04/2.25 dependent: assign(pick_given_ratio, 4).
% 2.04/2.25 dependent: assign(stats_level, 1).
% 2.04/2.25 dependent: assign(max_seconds, 10800).
% 2.04/2.25 clear(print_given).
% 2.04/2.25
% 2.04/2.25 formula_list(usable).
% 2.04/2.25 all A (A=A).
% 2.04/2.25 all A B (in(A,B)-> -in(B,A)).
% 2.04/2.25 all A (empty(A)->function(A)).
% 2.04/2.25 all A (empty(A)->relation(A)).
% 2.04/2.25 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.04/2.25 all A B (set_union2(A,B)=set_union2(B,A)).
% 2.04/2.25 all A (succ(A)=set_union2(A,singleton(A))).
% 2.04/2.25 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 2.04/2.25 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 2.04/2.25 all A exists B element(B,A).
% 2.04/2.25 empty(empty_set).
% 2.04/2.25 relation(empty_set).
% 2.04/2.25 relation_empty_yielding(empty_set).
% 2.04/2.25 all A (-empty(succ(A))).
% 2.04/2.25 empty(empty_set).
% 2.04/2.25 all A B (relation(A)&relation(B)->relation(set_union2(A,B))).
% 2.04/2.25 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 2.04/2.25 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 2.04/2.25 empty(empty_set).
% 2.04/2.25 relation(empty_set).
% 2.04/2.25 all A B (set_union2(A,A)=A).
% 2.04/2.25 exists A (relation(A)&function(A)).
% 2.04/2.25 exists A (empty(A)&relation(A)).
% 2.04/2.25 exists A empty(A).
% 2.04/2.25 exists A (relation(A)&empty(A)&function(A)).
% 2.04/2.25 exists A (-empty(A)&relation(A)).
% 2.04/2.25 exists A (-empty(A)).
% 2.04/2.25 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.04/2.25 exists A (relation(A)&relation_empty_yielding(A)).
% 2.04/2.25 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.04/2.25 exists A (relation(A)&relation_non_empty(A)&function(A)).
% 2.04/2.25 -(all A B (in(A,succ(B))<->in(A,B)|A=B)).
% 2.04/2.25 all A (set_union2(A,empty_set)=A).
% 2.04/2.25 all A B (in(A,B)->element(A,B)).
% 2.04/2.25 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.04/2.25 all A (empty(A)->A=empty_set).
% 2.04/2.25 all A B (-(in(A,B)&empty(B))).
% 2.04/2.25 all A B (-(empty(A)&A!=B&empty(B))).
% 2.04/2.25 end_of_list.
% 2.04/2.25
% 2.04/2.25 -------> usable clausifies to:
% 2.04/2.25
% 2.04/2.25 list(usable).
% 2.04/2.25 0 [] A=A.
% 2.04/2.25 0 [] -in(A,B)| -in(B,A).
% 2.04/2.25 0 [] -empty(A)|function(A).
% 2.04/2.25 0 [] -empty(A)|relation(A).
% 2.04/2.25 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.04/2.25 0 [] set_union2(A,B)=set_union2(B,A).
% 2.04/2.25 0 [] succ(A)=set_union2(A,singleton(A)).
% 2.04/2.25 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 2.04/2.25 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 2.04/2.25 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 2.04/2.25 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 2.04/2.25 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 2.04/2.25 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 2.04/2.25 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 2.04/2.25 0 [] C=set_union2(A,B)|in($f2(A,B,C),C)|in($f2(A,B,C),A)|in($f2(A,B,C),B).
% 2.04/2.25 0 [] C=set_union2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),A).
% 2.04/2.25 0 [] C=set_union2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),B).
% 2.04/2.25 0 [] element($f3(A),A).
% 2.04/2.25 0 [] empty(empty_set).
% 2.04/2.25 0 [] relation(empty_set).
% 2.04/2.25 0 [] relation_empty_yielding(empty_set).
% 2.04/2.25 0 [] -empty(succ(A)).
% 2.04/2.25 0 [] empty(empty_set).
% 2.04/2.25 0 [] -relation(A)| -relation(B)|relation(set_union2(A,B)).
% 2.04/2.25 0 [] empty(A)| -empty(set_union2(A,B)).
% 2.04/2.25 0 [] empty(A)| -empty(set_union2(B,A)).
% 2.04/2.25 0 [] empty(empty_set).
% 2.04/2.25 0 [] relation(empty_set).
% 2.04/2.25 0 [] set_union2(A,A)=A.
% 2.04/2.25 0 [] relation($c1).
% 2.04/2.25 0 [] function($c1).
% 2.04/2.25 0 [] empty($c2).
% 2.04/2.25 0 [] relation($c2).
% 2.04/2.25 0 [] empty($c3).
% 2.04/2.25 0 [] relation($c4).
% 2.04/2.25 0 [] empty($c4).
% 2.04/2.25 0 [] function($c4).
% 2.04/2.25 0 [] -empty($c5).
% 2.04/2.25 0 [] relation($c5).
% 2.04/2.25 0 [] -empty($c6).
% 2.04/2.25 0 [] relation($c7).
% 2.04/2.25 0 [] function($c7).
% 2.04/2.25 0 [] one_to_one($c7).
% 2.04/2.25 0 [] relation($c8).
% 2.04/2.25 0 [] relation_empty_yielding($c8).
% 2.04/2.25 0 [] relation($c9).
% 2.04/2.25 0 [] relation_empty_yielding($c9).
% 2.04/2.25 0 [] function($c9).
% 2.04/2.25 0 [] relation($c10).
% 2.04/2.25 0 [] relation_non_empty($c10).
% 2.04/2.25 0 [] function($c10).
% 2.04/2.25 0 [] in($c12,succ($c11))|in($c12,$c11)|$c12=$c11.
% 2.04/2.25 0 [] -in($c12,succ($c11))| -in($c12,$c11).
% 2.04/2.25 0 [] -in($c12,succ($c11))|$c12!=$c11.
% 2.04/2.25 0 [] set_union2(A,empty_set)=A.
% 2.04/2.25 0 [] -in(A,B)|element(A,B).
% 2.04/2.25 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.04/2.25 0 [] -empty(A)|A=empty_set.
% 2.04/2.25 0 [] -in(A,B)| -empty(B).
% 2.04/2.25 0 [] -empty(A)|A=B| -empty(B).
% 2.04/2.25 end_of_list.
% 2.04/2.25
% 2.04/2.25 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 2.04/2.25
% 2.04/2.25 This ia a non-Horn set with equality. The strategy will be
% 2.04/2.25 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.04/2.25 deletion, with positive clauses in sos and nonpositive
% 2.04/2.25 clauses in usable.
% 2.04/2.25
% 2.04/2.25 dependent: set(knuth_bendix).
% 2.04/2.25 dependent: set(anl_eq).
% 2.04/2.25 dependent: set(para_from).
% 2.04/2.25 dependent: set(para_into).
% 2.04/2.25 dependent: clear(para_from_right).
% 2.04/2.25 dependent: clear(para_into_right).
% 2.04/2.25 dependent: set(para_from_vars).
% 2.04/2.25 dependent: set(eq_units_both_ways).
% 2.04/2.25 dependent: set(dynamic_demod_all).
% 2.04/2.25 dependent: set(dynamic_demod).
% 2.04/2.25 dependent: set(order_eq).
% 2.04/2.25 dependent: set(back_demod).
% 2.04/2.25 dependent: set(lrpo).
% 2.04/2.25 dependent: set(hyper_res).
% 2.04/2.25 dependent: set(unit_deletion).
% 2.04/2.25 dependent: set(factor).
% 2.04/2.25
% 2.04/2.25 ------------> process usable:
% 2.04/2.25 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.04/2.25 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.04/2.25 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 2.04/2.25 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.04/2.25 ** KEPT (pick-wt=10): 5 [] A!=singleton(B)| -in(C,A)|C=B.
% 2.04/2.25 ** KEPT (pick-wt=10): 6 [] A!=singleton(B)|in(C,A)|C!=B.
% 2.04/2.25 ** KEPT (pick-wt=14): 7 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 2.04/2.25 ** KEPT (pick-wt=14): 8 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 2.04/2.25 ** KEPT (pick-wt=11): 9 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 2.04/2.25 ** KEPT (pick-wt=11): 10 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 2.04/2.25 ** KEPT (pick-wt=17): 11 [] A=set_union2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),B).
% 2.04/2.25 ** KEPT (pick-wt=17): 12 [] A=set_union2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),C).
% 2.04/2.25 ** KEPT (pick-wt=3): 13 [] -empty(succ(A)).
% 2.04/2.25 ** KEPT (pick-wt=8): 14 [] -relation(A)| -relation(B)|relation(set_union2(A,B)).
% 2.04/2.25 ** KEPT (pick-wt=6): 15 [] empty(A)| -empty(set_union2(A,B)).
% 2.04/2.25 ** KEPT (pick-wt=6): 16 [] empty(A)| -empty(set_union2(B,A)).
% 2.04/2.25 ** KEPT (pick-wt=2): 17 [] -empty($c5).
% 2.04/2.25 ** KEPT (pick-wt=2): 18 [] -empty($c6).
% 2.04/2.25 ** KEPT (pick-wt=7): 19 [] -in($c12,succ($c11))| -in($c12,$c11).
% 2.04/2.25 ** KEPT (pick-wt=7): 20 [] -in($c12,succ($c11))|$c12!=$c11.
% 2.04/2.25 ** KEPT (pick-wt=6): 21 [] -in(A,B)|element(A,B).
% 2.04/2.25 ** KEPT (pick-wt=8): 22 [] -element(A,B)|empty(B)|in(A,B).
% 2.04/2.25 ** KEPT (pick-wt=5): 23 [] -empty(A)|A=empty_set.
% 2.04/2.25 ** KEPT (pick-wt=5): 24 [] -in(A,B)| -empty(B).
% 2.04/2.25 ** KEPT (pick-wt=7): 25 [] -empty(A)|A=B| -empty(B).
% 2.04/2.25
% 2.04/2.25 ------------> process sos:
% 2.04/2.25 ** KEPT (pick-wt=3): 32 [] A=A.
% 2.04/2.25 ** KEPT (pick-wt=7): 33 [] set_union2(A,B)=set_union2(B,A).
% 2.04/2.25 ** KEPT (pick-wt=7): 34 [] succ(A)=set_union2(A,singleton(A)).
% 2.04/2.25 ---> New Demodulator: 35 [new_demod,34] succ(A)=set_union2(A,singleton(A)).
% 2.04/2.25 ** KEPT (pick-wt=14): 36 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 2.04/2.25 ** KEPT (pick-wt=23): 37 [] A=set_union2(B,C)|in($f2(B,C,A),A)|in($f2(B,C,A),B)|in($f2(B,C,A),C).
% 2.04/2.25 ** KEPT (pick-wt=4): 38 [] element($f3(A),A).
% 2.04/2.25 ** KEPT (pick-wt=2): 39 [] empty(empty_set).
% 2.04/2.25 ** KEPT (pick-wt=2): 40 [] relation(empty_set).
% 2.04/2.25 ** KEPT (pick-wt=2): 41 [] relation_empty_yielding(empty_set).
% 2.04/2.25 Following clause subsumed by 39 during input processing: 0 [] empty(empty_set).
% 2.04/2.25 Following clause subsumed by 39 during input processing: 0 [] empty(empty_set).
% 2.04/2.25 Following clause subsumed by 40 during input processing: 0 [] relation(empty_set).
% 2.04/2.25 ** KEPT (pick-wt=5): 42 [] set_union2(A,A)=A.
% 2.04/2.25 ---> New Demodulator: 43 [new_demod,42] set_union2(A,A)=A.
% 2.04/2.25 ** KEPT (pick-wt=2): 44 [] relation($c1).
% 2.04/2.25 ** KEPT (pick-wt=2): 45 [] function($c1).
% 2.04/2.25 ** KEPT (pick-wt=2): 46 [] empty($c2).
% 2.04/2.25 ** KEPT (pick-wt=2): 47 [] relation($c2).
% 2.04/2.25 ** KEPT (pick-wt=2): 48 [] empty($c3).
% 2.04/2.25 ** KEPT (pick-wt=2): 49 [] relation($c4).
% 2.04/2.25 ** KEPT (pick-wt=2): 50 [] empty($c4).
% 2.04/2.25 ** KEPT (pick-wt=2): 51 [] function($c4).
% 2.04/2.25 ** KEPT (pick-wt=2): 52 [] relation($c5).
% 2.04/2.25 ** KEPT (pick-wt=2): 53 [] relation($c7).
% 2.04/2.25 ** KEPT (pick-wt=2): 54 [] function($c7).
% 2.04/2.25 ** KEPT (pick-wt=2): 55 [] one_to_one($c7).
% 2.04/2.25 ** KEPT (pick-wt=2): 56 [] relation($c8).
% 2.04/2.25 ** KEPT (pick-wt=2): 57 [] relation_empty_yielding($c8).
% 2.04/2.25 ** KEPT (pick-wt=2): 58 [] relation($c9).
% 2.04/2.25 ** KEPT (pick-wt=2): 59 [] relation_empty_yielding($c9).
% 2.04/2.25 ** KEPT (pick-wt=2): 60 [] function($c9).
% 2.04/2.25 ** KEPT (pick-wt=2): 61 [] relation($c10).
% 2.04/2.25 ** KEPT (pick-wt=2): 62 [] relation_non_empty($c10).
% 2.04/2.25 ** KEPT (pick-wt=2): 63 [] function($c10).
% 142.15/142.34 ** KEPT (pick-wt=12): 65 [copy,64,demod,35] in($c12,set_union2($c11,singleton($c11)))|in($c12,$c11)|$c12=$c11.
% 142.15/142.34 ** KEPT (pick-wt=5): 66 [] set_union2(A,empty_set)=A.
% 142.15/142.34 ---> New Demodulator: 67 [new_demod,66] set_union2(A,empty_set)=A.
% 142.15/142.34 Following clause subsumed by 32 during input processing: 0 [copy,32,flip.1] A=A.
% 142.15/142.34 32 back subsumes 31.
% 142.15/142.34 Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] set_union2(A,B)=set_union2(B,A).
% 142.15/142.34 >>>> Starting back demodulation with 35.
% 142.15/142.34 >> back demodulating 20 with 35.
% 142.15/142.34 >> back demodulating 19 with 35.
% 142.15/142.34 >> back demodulating 13 with 35.
% 142.15/142.34 >>>> Starting back demodulation with 43.
% 142.15/142.34 >> back demodulating 30 with 43.
% 142.15/142.34 >> back demodulating 27 with 43.
% 142.15/142.34 >>>> Starting back demodulation with 67.
% 142.15/142.34
% 142.15/142.34 ======= end of input processing =======
% 142.15/142.34
% 142.15/142.34 =========== start of search ===========
% 142.15/142.34
% 142.15/142.34
% 142.15/142.34 Resetting weight limit to 6.
% 142.15/142.34
% 142.15/142.34
% 142.15/142.34 Resetting weight limit to 6.
% 142.15/142.34
% 142.15/142.34 sos_size=3575
% 142.15/142.34
% 142.15/142.34 -- HEY sandbox2, WE HAVE A PROOF!! --
% 142.15/142.34
% 142.15/142.34 ----> UNIT CONFLICT at 140.10 sec ----> 3877 [binary,3876.1,3875.1] $F.
% 142.15/142.34
% 142.15/142.34 Length of proof is 16. Level of proof is 6.
% 142.15/142.34
% 142.15/142.34 ---------------- PROOF ----------------
% 142.15/142.34 % SZS status Theorem
% 142.15/142.34 % SZS output start Refutation
% See solution above
% 142.15/142.34 ------------ end of proof -------------
% 142.15/142.34
% 142.15/142.34
% 142.15/142.34 Search stopped by max_proofs option.
% 142.15/142.34
% 142.15/142.34
% 142.15/142.34 Search stopped by max_proofs option.
% 142.15/142.34
% 142.15/142.34 ============ end of search ============
% 142.15/142.34
% 142.15/142.34 -------------- statistics -------------
% 142.15/142.34 clauses given 1602
% 142.15/142.34 clauses generated 6475061
% 142.15/142.34 clauses kept 3864
% 142.15/142.34 clauses forward subsumed 7149
% 142.15/142.34 clauses back subsumed 99
% 142.15/142.34 Kbytes malloced 5859
% 142.15/142.34
% 142.15/142.34 ----------- times (seconds) -----------
% 142.15/142.34 user CPU time 140.10 (0 hr, 2 min, 20 sec)
% 142.15/142.34 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 142.15/142.34 wall-clock time 142 (0 hr, 2 min, 22 sec)
% 142.15/142.34
% 142.15/142.34 That finishes the proof of the theorem.
% 142.15/142.34
% 142.15/142.34 Process 31145 finished Wed Jul 27 09:53:39 2022
% 142.15/142.34 Otter interrupted
% 142.15/142.34 PROOF FOUND
%------------------------------------------------------------------------------