TSTP Solution File: SET952+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET952+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:35 EDT 2022
% Result : Unknown 23.75s 23.95s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET952+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n027.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 10:43:21 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.79/2.01 ----- Otter 3.3f, August 2004 -----
% 1.79/2.01 The process was started by sandbox2 on n027.cluster.edu,
% 1.79/2.01 Wed Jul 27 10:43:22 2022
% 1.79/2.01 The command was "./otter". The process ID is 9163.
% 1.79/2.01
% 1.79/2.01 set(prolog_style_variables).
% 1.79/2.01 set(auto).
% 1.79/2.01 dependent: set(auto1).
% 1.79/2.01 dependent: set(process_input).
% 1.79/2.01 dependent: clear(print_kept).
% 1.79/2.01 dependent: clear(print_new_demod).
% 1.79/2.01 dependent: clear(print_back_demod).
% 1.79/2.01 dependent: clear(print_back_sub).
% 1.79/2.01 dependent: set(control_memory).
% 1.79/2.01 dependent: assign(max_mem, 12000).
% 1.79/2.01 dependent: assign(pick_given_ratio, 4).
% 1.79/2.01 dependent: assign(stats_level, 1).
% 1.79/2.01 dependent: assign(max_seconds, 10800).
% 1.79/2.01 clear(print_given).
% 1.79/2.01
% 1.79/2.01 formula_list(usable).
% 1.79/2.01 all A (A=A).
% 1.79/2.01 all A B (in(A,B)-> -in(B,A)).
% 1.79/2.01 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.79/2.01 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.79/2.01 all A B (B=powerset(A)<-> (all C (in(C,B)<->subset(C,A)))).
% 1.79/2.01 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 1.79/2.01 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 1.79/2.01 all A B C (C=cartesian_product2(A,B)<-> (all D (in(D,C)<-> (exists E F (in(E,A)&in(F,B)&D=ordered_pair(E,F)))))).
% 1.79/2.01 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.79/2.01 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.79/2.01 all A B (-empty(ordered_pair(A,B))).
% 1.79/2.01 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.79/2.01 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.79/2.01 all A B (set_union2(A,A)=A).
% 1.79/2.01 all A B (subset(singleton(A),B)<->in(A,B)).
% 1.79/2.01 exists A empty(A).
% 1.79/2.01 exists A (-empty(A)).
% 1.79/2.01 all A B subset(A,A).
% 1.79/2.01 -(all A B subset(cartesian_product2(A,B),powerset(powerset(set_union2(A,B))))).
% 1.79/2.01 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 1.79/2.01 all A B C (subset(unordered_pair(A,B),C)<->in(A,C)&in(B,C)).
% 1.79/2.01 all A B subset(A,set_union2(A,B)).
% 1.79/2.01 end_of_list.
% 1.79/2.01
% 1.79/2.01 -------> usable clausifies to:
% 1.79/2.01
% 1.79/2.01 list(usable).
% 1.79/2.01 0 [] A=A.
% 1.79/2.01 0 [] -in(A,B)| -in(B,A).
% 1.79/2.01 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.79/2.01 0 [] set_union2(A,B)=set_union2(B,A).
% 1.79/2.01 0 [] B!=powerset(A)| -in(C,B)|subset(C,A).
% 1.79/2.01 0 [] B!=powerset(A)|in(C,B)| -subset(C,A).
% 1.79/2.01 0 [] B=powerset(A)|in($f1(A,B),B)|subset($f1(A,B),A).
% 1.79/2.01 0 [] B=powerset(A)| -in($f1(A,B),B)| -subset($f1(A,B),A).
% 1.79/2.01 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 1.79/2.01 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 1.79/2.01 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 1.79/2.01 0 [] C=unordered_pair(A,B)|in($f2(A,B,C),C)|$f2(A,B,C)=A|$f2(A,B,C)=B.
% 1.79/2.01 0 [] C=unordered_pair(A,B)| -in($f2(A,B,C),C)|$f2(A,B,C)!=A.
% 1.79/2.01 0 [] C=unordered_pair(A,B)| -in($f2(A,B,C),C)|$f2(A,B,C)!=B.
% 1.79/2.01 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 1.79/2.01 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 1.79/2.01 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 1.79/2.01 0 [] C=set_union2(A,B)|in($f3(A,B,C),C)|in($f3(A,B,C),A)|in($f3(A,B,C),B).
% 1.79/2.01 0 [] C=set_union2(A,B)| -in($f3(A,B,C),C)| -in($f3(A,B,C),A).
% 1.79/2.01 0 [] C=set_union2(A,B)| -in($f3(A,B,C),C)| -in($f3(A,B,C),B).
% 1.79/2.01 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f5(A,B,C,D),A).
% 1.79/2.01 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f4(A,B,C,D),B).
% 1.79/2.01 0 [] C!=cartesian_product2(A,B)| -in(D,C)|D=ordered_pair($f5(A,B,C,D),$f4(A,B,C,D)).
% 1.79/2.01 0 [] C!=cartesian_product2(A,B)|in(D,C)| -in(E,A)| -in(F,B)|D!=ordered_pair(E,F).
% 1.79/2.01 0 [] C=cartesian_product2(A,B)|in($f8(A,B,C),C)|in($f7(A,B,C),A).
% 1.79/2.01 0 [] C=cartesian_product2(A,B)|in($f8(A,B,C),C)|in($f6(A,B,C),B).
% 1.79/2.01 0 [] C=cartesian_product2(A,B)|in($f8(A,B,C),C)|$f8(A,B,C)=ordered_pair($f7(A,B,C),$f6(A,B,C)).
% 1.79/2.01 0 [] C=cartesian_product2(A,B)| -in($f8(A,B,C),C)| -in(X1,A)| -in(X2,B)|$f8(A,B,C)!=ordered_pair(X1,X2).
% 1.79/2.01 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.79/2.01 0 [] subset(A,B)|in($f9(A,B),A).
% 1.79/2.01 0 [] subset(A,B)| -in($f9(A,B),B).
% 1.79/2.01 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.79/2.01 0 [] -empty(ordered_pair(A,B)).
% 1.79/2.01 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.79/2.01 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.79/2.01 0 [] set_union2(A,A)=A.
% 1.79/2.01 0 [] -subset(singleton(A),B)|in(A,B).
% 1.79/2.01 0 [] subset(singleton(A),B)| -in(A,B).
% 1.79/2.01 0 [] empty($c1).
% 1.79/2.01 0 [] -empty($c2).
% 1.79/2.01 0 [] subset(A,A).
% 1.79/2.01 0 [] -subset(cartesian_product2($c4,$c3),powerset(powerset(set_union2($c4,$c3)))).
% 1.79/2.01 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.79/2.01 0 [] -subset(unordered_pair(A,B),C)|in(A,C).
% 1.79/2.01 0 [] -subset(unordered_pair(A,B),C)|in(B,C).
% 1.79/2.01 0 [] subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 1.79/2.01 0 [] subset(A,set_union2(A,B)).
% 1.79/2.01 end_of_list.
% 1.79/2.01
% 1.79/2.01 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.79/2.01
% 1.79/2.01 This ia a non-Horn set with equality. The strategy will be
% 1.79/2.01 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.79/2.01 deletion, with positive clauses in sos and nonpositive
% 1.79/2.01 clauses in usable.
% 1.79/2.01
% 1.79/2.01 dependent: set(knuth_bendix).
% 1.79/2.01 dependent: set(anl_eq).
% 1.79/2.01 dependent: set(para_from).
% 1.79/2.01 dependent: set(para_into).
% 1.79/2.01 dependent: clear(para_from_right).
% 1.79/2.01 dependent: clear(para_into_right).
% 1.79/2.01 dependent: set(para_from_vars).
% 1.79/2.01 dependent: set(eq_units_both_ways).
% 1.79/2.01 dependent: set(dynamic_demod_all).
% 1.79/2.01 dependent: set(dynamic_demod).
% 1.79/2.01 dependent: set(order_eq).
% 1.79/2.01 dependent: set(back_demod).
% 1.79/2.01 dependent: set(lrpo).
% 1.79/2.01 dependent: set(hyper_res).
% 1.79/2.01 dependent: set(unit_deletion).
% 1.79/2.01 dependent: set(factor).
% 1.79/2.01
% 1.79/2.01 ------------> process usable:
% 1.79/2.01 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.79/2.01 ** KEPT (pick-wt=10): 2 [] A!=powerset(B)| -in(C,A)|subset(C,B).
% 1.79/2.01 ** KEPT (pick-wt=10): 3 [] A!=powerset(B)|in(C,A)| -subset(C,B).
% 1.79/2.01 ** KEPT (pick-wt=14): 4 [] A=powerset(B)| -in($f1(B,A),A)| -subset($f1(B,A),B).
% 1.79/2.01 ** KEPT (pick-wt=14): 5 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 1.79/2.01 ** KEPT (pick-wt=11): 6 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 1.79/2.01 ** KEPT (pick-wt=11): 7 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 1.79/2.01 ** KEPT (pick-wt=17): 8 [] A=unordered_pair(B,C)| -in($f2(B,C,A),A)|$f2(B,C,A)!=B.
% 1.79/2.01 ** KEPT (pick-wt=17): 9 [] A=unordered_pair(B,C)| -in($f2(B,C,A),A)|$f2(B,C,A)!=C.
% 1.79/2.01 ** KEPT (pick-wt=14): 10 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 1.79/2.01 ** KEPT (pick-wt=11): 11 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 1.79/2.01 ** KEPT (pick-wt=11): 12 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 1.79/2.01 ** KEPT (pick-wt=17): 13 [] A=set_union2(B,C)| -in($f3(B,C,A),A)| -in($f3(B,C,A),B).
% 1.79/2.01 ** KEPT (pick-wt=17): 14 [] A=set_union2(B,C)| -in($f3(B,C,A),A)| -in($f3(B,C,A),C).
% 1.79/2.01 ** KEPT (pick-wt=15): 15 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f5(B,C,A,D),B).
% 1.79/2.01 ** KEPT (pick-wt=15): 16 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f4(B,C,A,D),C).
% 1.79/2.01 ** KEPT (pick-wt=21): 18 [copy,17,flip.3] A!=cartesian_product2(B,C)| -in(D,A)|ordered_pair($f5(B,C,A,D),$f4(B,C,A,D))=D.
% 1.79/2.01 ** KEPT (pick-wt=19): 19 [] A!=cartesian_product2(B,C)|in(D,A)| -in(E,B)| -in(F,C)|D!=ordered_pair(E,F).
% 1.79/2.01 ** KEPT (pick-wt=25): 20 [] A=cartesian_product2(B,C)| -in($f8(B,C,A),A)| -in(D,B)| -in(E,C)|$f8(B,C,A)!=ordered_pair(D,E).
% 1.79/2.01 ** KEPT (pick-wt=9): 21 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.79/2.01 ** KEPT (pick-wt=8): 22 [] subset(A,B)| -in($f9(A,B),B).
% 1.79/2.01 ** KEPT (pick-wt=4): 23 [] -empty(ordered_pair(A,B)).
% 1.79/2.01 ** KEPT (pick-wt=6): 24 [] empty(A)| -empty(set_union2(A,B)).
% 1.79/2.01 ** KEPT (pick-wt=6): 25 [] empty(A)| -empty(set_union2(B,A)).
% 1.79/2.01 ** KEPT (pick-wt=7): 26 [] -subset(singleton(A),B)|in(A,B).
% 1.79/2.01 ** KEPT (pick-wt=7): 27 [] subset(singleton(A),B)| -in(A,B).
% 1.79/2.01 ** KEPT (pick-wt=2): 28 [] -empty($c2).
% 1.79/2.01 ** KEPT (pick-wt=9): 29 [] -subset(cartesian_product2($c4,$c3),powerset(powerset(set_union2($c4,$c3)))).
% 1.79/2.01 ** KEPT (pick-wt=9): 30 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.79/2.01 ** KEPT (pick-wt=8): 31 [] -subset(unordered_pair(A,B),C)|in(A,C).
% 1.79/2.01 ** KEPT (pick-wt=8): 32 [] -subset(unordered_pair(A,B),C)|in(B,C).
% 1.79/2.01 ** KEPT (pick-wt=11): 33 [] subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 1.79/2.01
% 1.79/2.01 ------------> process sos:
% 1.79/2.01 ** KEPT (pick-wt=3): 45 [] A=A.
% 1.79/2.01 ** KEPT (pick-wt=7): 46 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.79/2.01 ** KEPT (pick-wt=7): 47 [] set_union2(A,B)=set_union2(B,A).
% 1.79/2.01 ** KEPT (pick-wt=14): 48 [] A=powerset(B)|in($f1(B,A),A)|subset($f1(B,A),B).
% 1.79/2.01 ** KEPT (pick-wt=23): 49 [] A=unordered_pair(B,C)|in($f2(B,C,A),A)|$f2(B,C,A)=B|$f2(B,C,A)=C.
% 1.79/2.01 ** KEPT (pick-wt=23): 50 [] A=set_union2(B,C)|in($f3(B,C,A),A)|in($f3(B,C,A),B)|in($f3(B,C,A),C).
% 1.79/2.01 ** KEPT (pick-wt=17): 51 [] A=cartesian_product2(B,C)|in($f8(B,C,A),A)|in($f7(B,C,A),B).
% 1.79/2.01 ** KEPT (pick-wt=17): 52 [] A=cartesian_product2(B,C)|in($f8(B,C,A),A)|in($f6(B,C,A),C).
% 1.79/2.01 ** KEPT (pick-wt=25): 54 [copy,53,flip.3] A=cartesian_product2(B,C)|in($f8(B,C,A),A)|ordered_pair($f7(B,C,A),$f6(B,C,A))=$f8(B,C,A).
% 1.79/2.01 ** KEPT (pick-wt=8): 55 [] subset(A,B)|in($f9(A,B),A).
% 1.79/2.01 ** KEPT (pick-wt=10): 57 [copy,56,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 23.75/23.95 ---> New Demodulator: 58 [new_demod,57] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 23.75/23.95 ** KEPT (pick-wt=5): 59 [] set_union2(A,A)=A.
% 23.75/23.95 ---> New Demodulator: 60 [new_demod,59] set_union2(A,A)=A.
% 23.75/23.95 ** KEPT (pick-wt=2): 61 [] empty($c1).
% 23.75/23.95 ** KEPT (pick-wt=3): 62 [] subset(A,A).
% 23.75/23.95 ** KEPT (pick-wt=5): 63 [] subset(A,set_union2(A,B)).
% 23.75/23.95 Following clause subsumed by 45 during input processing: 0 [copy,45,flip.1] A=A.
% 23.75/23.95 Following clause subsumed by 46 during input processing: 0 [copy,46,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 23.75/23.95 Following clause subsumed by 47 during input processing: 0 [copy,47,flip.1] set_union2(A,B)=set_union2(B,A).
% 23.75/23.95 >>>> Starting back demodulation with 58.
% 23.75/23.95 >>>> Starting back demodulation with 60.
% 23.75/23.95 >> back demodulating 36 with 60.
% 23.75/23.95
% 23.75/23.95 ======= end of input processing =======
% 23.75/23.95
% 23.75/23.95 =========== start of search ===========
% 23.75/23.95
% 23.75/23.95
% 23.75/23.95 Resetting weight limit to 8.
% 23.75/23.95
% 23.75/23.95
% 23.75/23.95 Resetting weight limit to 8.
% 23.75/23.95
% 23.75/23.95 sos_size=575
% 23.75/23.95
% 23.75/23.95 Search stopped because sos empty.
% 23.75/23.95
% 23.75/23.95
% 23.75/23.95 Search stopped because sos empty.
% 23.75/23.95
% 23.75/23.95 ============ end of search ============
% 23.75/23.95
% 23.75/23.95 -------------- statistics -------------
% 23.75/23.95 clauses given 652
% 23.75/23.95 clauses generated 552437
% 23.75/23.95 clauses kept 707
% 23.75/23.95 clauses forward subsumed 1839
% 23.75/23.95 clauses back subsumed 12
% 23.75/23.95 Kbytes malloced 7812
% 23.75/23.95
% 23.75/23.95 ----------- times (seconds) -----------
% 23.75/23.95 user CPU time 21.93 (0 hr, 0 min, 21 sec)
% 23.75/23.95 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 23.75/23.95 wall-clock time 23 (0 hr, 0 min, 23 sec)
% 23.75/23.95
% 23.75/23.95 Process 9163 finished Wed Jul 27 10:43:45 2022
% 23.75/23.95 Otter interrupted
% 23.75/23.95 PROOF NOT FOUND
%------------------------------------------------------------------------------