TSTP Solution File: SET967+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET967+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:36 EDT 2022
% Result : Timeout 299.93s 300.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET967+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 10:33:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.06/2.22 ----- Otter 3.3f, August 2004 -----
% 2.06/2.22 The process was started by sandbox2 on n011.cluster.edu,
% 2.06/2.22 Wed Jul 27 10:33:56 2022
% 2.06/2.22 The command was "./otter". The process ID is 10127.
% 2.06/2.22
% 2.06/2.22 set(prolog_style_variables).
% 2.06/2.22 set(auto).
% 2.06/2.22 dependent: set(auto1).
% 2.06/2.22 dependent: set(process_input).
% 2.06/2.22 dependent: clear(print_kept).
% 2.06/2.22 dependent: clear(print_new_demod).
% 2.06/2.22 dependent: clear(print_back_demod).
% 2.06/2.22 dependent: clear(print_back_sub).
% 2.06/2.22 dependent: set(control_memory).
% 2.06/2.22 dependent: assign(max_mem, 12000).
% 2.06/2.22 dependent: assign(pick_given_ratio, 4).
% 2.06/2.22 dependent: assign(stats_level, 1).
% 2.06/2.22 dependent: assign(max_seconds, 10800).
% 2.06/2.22 clear(print_given).
% 2.06/2.22
% 2.06/2.22 formula_list(usable).
% 2.06/2.22 all A (A=A).
% 2.06/2.22 all A B (in(A,B)-> -in(B,A)).
% 2.06/2.22 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.06/2.22 all A B (set_union2(A,B)=set_union2(B,A)).
% 2.06/2.22 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 2.06/2.22 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.06/2.22 all A B (-empty(ordered_pair(A,B))).
% 2.06/2.22 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 2.06/2.22 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 2.06/2.22 all A B (set_union2(A,A)=A).
% 2.06/2.22 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 2.06/2.22 exists A empty(A).
% 2.06/2.22 exists A (-empty(A)).
% 2.06/2.22 all A B C (-(in(A,cartesian_product2(B,C))& (all D E (ordered_pair(D,E)!=A)))).
% 2.06/2.22 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))->in(ordered_pair(B,A),cartesian_product2(D,C))).
% 2.06/2.22 all A B ((all C (-(in(C,A)& (all D E (C!=ordered_pair(D,E))))))& (all C (-(in(C,B)& (all D E (C!=ordered_pair(D,E))))))& (all C D (in(ordered_pair(C,D),A)<->in(ordered_pair(C,D),B)))->A=B).
% 2.06/2.22 -(all A B C (cartesian_product2(set_union2(A,B),C)=set_union2(cartesian_product2(A,C),cartesian_product2(B,C))&cartesian_product2(C,set_union2(A,B))=set_union2(cartesian_product2(C,A),cartesian_product2(C,B)))).
% 2.06/2.22 end_of_list.
% 2.06/2.22
% 2.06/2.22 -------> usable clausifies to:
% 2.06/2.22
% 2.06/2.22 list(usable).
% 2.06/2.22 0 [] A=A.
% 2.06/2.22 0 [] -in(A,B)| -in(B,A).
% 2.06/2.22 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.06/2.22 0 [] set_union2(A,B)=set_union2(B,A).
% 2.06/2.22 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 2.06/2.22 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 2.06/2.22 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 2.06/2.22 0 [] C=set_union2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),A)|in($f1(A,B,C),B).
% 2.06/2.22 0 [] C=set_union2(A,B)| -in($f1(A,B,C),C)| -in($f1(A,B,C),A).
% 2.06/2.22 0 [] C=set_union2(A,B)| -in($f1(A,B,C),C)| -in($f1(A,B,C),B).
% 2.06/2.22 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.06/2.22 0 [] -empty(ordered_pair(A,B)).
% 2.06/2.22 0 [] empty(A)| -empty(set_union2(A,B)).
% 2.06/2.22 0 [] empty(A)| -empty(set_union2(B,A)).
% 2.06/2.22 0 [] set_union2(A,A)=A.
% 2.06/2.22 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.06/2.22 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.06/2.22 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.06/2.22 0 [] empty($c1).
% 2.06/2.22 0 [] -empty($c2).
% 2.06/2.22 0 [] -in(A,cartesian_product2(B,C))|ordered_pair($f3(A,B,C),$f2(A,B,C))=A.
% 2.06/2.22 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(ordered_pair(B,A),cartesian_product2(D,C)).
% 2.06/2.22 0 [] in($f4(A,B),A)|in($f5(A,B),B)|in(ordered_pair($f7(A,B),$f6(A,B)),A)|in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 0 [] in($f4(A,B),A)|in($f5(A,B),B)| -in(ordered_pair($f7(A,B),$f6(A,B)),A)| -in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 0 [] in($f4(A,B),A)|$f5(A,B)!=ordered_pair(X1,X2)|in(ordered_pair($f7(A,B),$f6(A,B)),A)|in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 0 [] in($f4(A,B),A)|$f5(A,B)!=ordered_pair(X1,X2)| -in(ordered_pair($f7(A,B),$f6(A,B)),A)| -in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 0 [] $f4(A,B)!=ordered_pair(D,E)|in($f5(A,B),B)|in(ordered_pair($f7(A,B),$f6(A,B)),A)|in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 0 [] $f4(A,B)!=ordered_pair(D,E)|in($f5(A,B),B)| -in(ordered_pair($f7(A,B),$f6(A,B)),A)| -in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 0 [] $f4(A,B)!=ordered_pair(D,E)|$f5(A,B)!=ordered_pair(X1,X2)|in(ordered_pair($f7(A,B),$f6(A,B)),A)|in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 0 [] $f4(A,B)!=ordered_pair(D,E)|$f5(A,B)!=ordered_pair(X1,X2)| -in(ordered_pair($f7(A,B),$f6(A,B)),A)| -in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 0 [] cartesian_product2(set_union2($c5,$c4),$c3)!=set_union2(cartesian_product2($c5,$c3),cartesian_product2($c4,$c3))|cartesian_product2($c3,set_union2($c5,$c4))!=set_union2(cartesian_product2($c3,$c5),cartesian_product2($c3,$c4)).
% 2.06/2.22 end_of_list.
% 2.06/2.22
% 2.06/2.22 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.06/2.22
% 2.06/2.22 This ia a non-Horn set with equality. The strategy will be
% 2.06/2.22 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.06/2.22 deletion, with positive clauses in sos and nonpositive
% 2.06/2.22 clauses in usable.
% 2.06/2.22
% 2.06/2.22 dependent: set(knuth_bendix).
% 2.06/2.22 dependent: set(anl_eq).
% 2.06/2.22 dependent: set(para_from).
% 2.06/2.22 dependent: set(para_into).
% 2.06/2.22 dependent: clear(para_from_right).
% 2.06/2.22 dependent: clear(para_into_right).
% 2.06/2.22 dependent: set(para_from_vars).
% 2.06/2.22 dependent: set(eq_units_both_ways).
% 2.06/2.22 dependent: set(dynamic_demod_all).
% 2.06/2.22 dependent: set(dynamic_demod).
% 2.06/2.22 dependent: set(order_eq).
% 2.06/2.22 dependent: set(back_demod).
% 2.06/2.22 dependent: set(lrpo).
% 2.06/2.22 dependent: set(hyper_res).
% 2.06/2.22 dependent: set(unit_deletion).
% 2.06/2.22 dependent: set(factor).
% 2.06/2.22
% 2.06/2.22 ------------> process usable:
% 2.06/2.22 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.06/2.22 ** KEPT (pick-wt=14): 2 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 2.06/2.22 ** KEPT (pick-wt=11): 3 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 2.06/2.22 ** KEPT (pick-wt=11): 4 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 2.06/2.22 ** KEPT (pick-wt=17): 5 [] A=set_union2(B,C)| -in($f1(B,C,A),A)| -in($f1(B,C,A),B).
% 2.06/2.22 ** KEPT (pick-wt=17): 6 [] A=set_union2(B,C)| -in($f1(B,C,A),A)| -in($f1(B,C,A),C).
% 2.06/2.22 ** KEPT (pick-wt=4): 7 [] -empty(ordered_pair(A,B)).
% 2.06/2.22 ** KEPT (pick-wt=6): 8 [] empty(A)| -empty(set_union2(A,B)).
% 2.06/2.22 ** KEPT (pick-wt=6): 9 [] empty(A)| -empty(set_union2(B,A)).
% 2.06/2.22 ** KEPT (pick-wt=10): 10 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.06/2.22 ** KEPT (pick-wt=10): 11 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.06/2.22 ** KEPT (pick-wt=13): 12 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.06/2.22 ** KEPT (pick-wt=2): 13 [] -empty($c2).
% 2.06/2.22 ** KEPT (pick-wt=16): 14 [] -in(A,cartesian_product2(B,C))|ordered_pair($f3(A,B,C),$f2(A,B,C))=A.
% 2.06/2.22 ** KEPT (pick-wt=14): 15 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(ordered_pair(B,A),cartesian_product2(D,C)).
% 2.06/2.22 ** KEPT (pick-wt=31): 16 [] in($f4(A,B),A)|in($f5(A,B),B)| -in(ordered_pair($f7(A,B),$f6(A,B)),A)| -in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 ** KEPT (pick-wt=33): 17 [] in($f4(A,B),A)|$f5(A,B)!=ordered_pair(C,D)|in(ordered_pair($f7(A,B),$f6(A,B)),A)|in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 ** KEPT (pick-wt=33): 18 [] in($f4(A,B),A)|$f5(A,B)!=ordered_pair(C,D)| -in(ordered_pair($f7(A,B),$f6(A,B)),A)| -in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 ** KEPT (pick-wt=33): 19 [] $f4(A,B)!=ordered_pair(C,D)|in($f5(A,B),B)|in(ordered_pair($f7(A,B),$f6(A,B)),A)|in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 ** KEPT (pick-wt=33): 20 [] $f4(A,B)!=ordered_pair(C,D)|in($f5(A,B),B)| -in(ordered_pair($f7(A,B),$f6(A,B)),A)| -in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 ** KEPT (pick-wt=35): 21 [] $f4(A,B)!=ordered_pair(C,D)|$f5(A,B)!=ordered_pair(E,F)|in(ordered_pair($f7(A,B),$f6(A,B)),A)|in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 ** KEPT (pick-wt=35): 22 [] $f4(A,B)!=ordered_pair(C,D)|$f5(A,B)!=ordered_pair(E,F)| -in(ordered_pair($f7(A,B),$f6(A,B)),A)| -in(ordered_pair($f7(A,B),$f6(A,B)),B)|A=B.
% 2.06/2.22 ** KEPT (pick-wt=26): 24 [copy,23,flip.1,flip.2] set_union2(cartesian_product2($c5,$c3),cartesian_product2($c4,$c3))!=cartesian_product2(set_union2($c5,$c4),$c3)|set_union2(cartesian_product2($c3,$c5),cartesian_product2($c3,$c4))!=cartesian_product2($c3,set_union2($c5,$c4)).
% 2.06/2.22
% 2.06/2.22 ------------> process sos:
% 2.06/2.22 ** KEPT (pick-wt=3): 37 [] A=A.
% 2.06/2.22 ** KEPT (pick-wt=7): 38 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.06/2.22 ** KEPT (pick-wt=7): 39 [] set_union2(A,B)=set_union2(B,A).
% 2.06/2.22 ** KEPT (pick-wt=23): 40 [] A=set_union2(B,C)|in($f1(B,C,A),A)|in($f1(B,C,A),B)|in($f1(B,C,A),C).
% 2.06/2.22 ** KEPT (pick-wt=10): 42 [copy,41,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.06/2.22 ---> New Demodulator: 43 [new_demod,42] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.06/2.22 ** KEPT (pick-wt=5): 44 [] set_union2(A,A)=A.
% 2.06/2.22 ---> New Demodulator: 45 [new_demod,44] set_union2(A,A)=A.
% 2.06/2.22 ** KEPT (pick-wt=2): 46 [] empty($c1).
% 2.06/2.22 ** KEPT (pick-wtAlarm clock
% 299.93/300.09 Otter interrupted
% 299.93/300.09 PROOF NOT FOUND
%------------------------------------------------------------------------------