TSTP Solution File: SET970+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET970+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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 : Unknown 161.36s 161.53s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET970+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n010.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:37:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.71/1.92 ----- Otter 3.3f, August 2004 -----
% 1.71/1.92 The process was started by sandbox on n010.cluster.edu,
% 1.71/1.92 Wed Jul 27 10:37:39 2022
% 1.71/1.92 The command was "./otter". The process ID is 2083.
% 1.71/1.92
% 1.71/1.92 set(prolog_style_variables).
% 1.71/1.92 set(auto).
% 1.71/1.92 dependent: set(auto1).
% 1.71/1.92 dependent: set(process_input).
% 1.71/1.92 dependent: clear(print_kept).
% 1.71/1.92 dependent: clear(print_new_demod).
% 1.71/1.92 dependent: clear(print_back_demod).
% 1.71/1.92 dependent: clear(print_back_sub).
% 1.71/1.92 dependent: set(control_memory).
% 1.71/1.92 dependent: assign(max_mem, 12000).
% 1.71/1.92 dependent: assign(pick_given_ratio, 4).
% 1.71/1.92 dependent: assign(stats_level, 1).
% 1.71/1.92 dependent: assign(max_seconds, 10800).
% 1.71/1.92 clear(print_given).
% 1.71/1.92
% 1.71/1.92 formula_list(usable).
% 1.71/1.92 all A (A=A).
% 1.71/1.92 all A B (in(A,B)-> -in(B,A)).
% 1.71/1.92 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.71/1.92 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.71/1.92 all A B (A=B<->subset(A,B)&subset(B,A)).
% 1.71/1.92 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.71/1.92 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.71/1.92 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.71/1.92 all A B (-empty(ordered_pair(A,B))).
% 1.71/1.92 all A B (set_intersection2(A,A)=A).
% 1.71/1.92 exists A empty(A).
% 1.71/1.92 exists A (-empty(A)).
% 1.71/1.92 all A B subset(A,A).
% 1.71/1.92 all A B C D E (-(in(A,set_intersection2(cartesian_product2(B,C),cartesian_product2(D,E)))& (all F G (-(A=ordered_pair(F,G)&in(F,set_intersection2(B,D))&in(G,set_intersection2(C,E))))))).
% 1.71/1.92 all A B C D (subset(A,B)&subset(C,D)->subset(cartesian_product2(A,C),cartesian_product2(B,D))).
% 1.71/1.92 -(all A B C D (cartesian_product2(set_intersection2(A,B),set_intersection2(C,D))=set_intersection2(cartesian_product2(A,C),cartesian_product2(B,D)))).
% 1.71/1.92 all A B subset(set_intersection2(A,B),A).
% 1.71/1.92 all A B C (subset(A,B)&subset(A,C)->subset(A,set_intersection2(B,C))).
% 1.71/1.92 end_of_list.
% 1.71/1.92
% 1.71/1.92 -------> usable clausifies to:
% 1.71/1.92
% 1.71/1.92 list(usable).
% 1.71/1.92 0 [] A=A.
% 1.71/1.92 0 [] -in(A,B)| -in(B,A).
% 1.71/1.92 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.71/1.92 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.71/1.92 0 [] A!=B|subset(A,B).
% 1.71/1.92 0 [] A!=B|subset(B,A).
% 1.71/1.92 0 [] A=B| -subset(A,B)| -subset(B,A).
% 1.71/1.92 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f2(A,B,C,D),A).
% 1.71/1.92 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f1(A,B,C,D),B).
% 1.71/1.92 0 [] C!=cartesian_product2(A,B)| -in(D,C)|D=ordered_pair($f2(A,B,C,D),$f1(A,B,C,D)).
% 1.71/1.92 0 [] C!=cartesian_product2(A,B)|in(D,C)| -in(E,A)| -in(F,B)|D!=ordered_pair(E,F).
% 1.71/1.92 0 [] C=cartesian_product2(A,B)|in($f5(A,B,C),C)|in($f4(A,B,C),A).
% 1.71/1.92 0 [] C=cartesian_product2(A,B)|in($f5(A,B,C),C)|in($f3(A,B,C),B).
% 1.71/1.92 0 [] C=cartesian_product2(A,B)|in($f5(A,B,C),C)|$f5(A,B,C)=ordered_pair($f4(A,B,C),$f3(A,B,C)).
% 1.71/1.92 0 [] C=cartesian_product2(A,B)| -in($f5(A,B,C),C)| -in(X1,A)| -in(X2,B)|$f5(A,B,C)!=ordered_pair(X1,X2).
% 1.71/1.92 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.71/1.92 0 [] subset(A,B)|in($f6(A,B),A).
% 1.71/1.92 0 [] subset(A,B)| -in($f6(A,B),B).
% 1.71/1.92 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.71/1.92 0 [] -empty(ordered_pair(A,B)).
% 1.71/1.92 0 [] set_intersection2(A,A)=A.
% 1.71/1.92 0 [] empty($c1).
% 1.71/1.92 0 [] -empty($c2).
% 1.71/1.92 0 [] subset(A,A).
% 1.71/1.92 0 [] -in(A,set_intersection2(cartesian_product2(B,C),cartesian_product2(D,E)))|A=ordered_pair($f8(A,B,C,D,E),$f7(A,B,C,D,E)).
% 1.71/1.92 0 [] -in(A,set_intersection2(cartesian_product2(B,C),cartesian_product2(D,E)))|in($f8(A,B,C,D,E),set_intersection2(B,D)).
% 1.71/1.92 0 [] -in(A,set_intersection2(cartesian_product2(B,C),cartesian_product2(D,E)))|in($f7(A,B,C,D,E),set_intersection2(C,E)).
% 1.71/1.92 0 [] -subset(A,B)| -subset(C,D)|subset(cartesian_product2(A,C),cartesian_product2(B,D)).
% 1.71/1.92 0 [] cartesian_product2(set_intersection2($c6,$c5),set_intersection2($c4,$c3))!=set_intersection2(cartesian_product2($c6,$c4),cartesian_product2($c5,$c3)).
% 1.71/1.92 0 [] subset(set_intersection2(A,B),A).
% 1.71/1.92 0 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 1.71/1.92 end_of_list.
% 1.71/1.92
% 1.71/1.92 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.71/1.92
% 1.71/1.92 This ia a non-Horn set with equality. The strategy will be
% 1.71/1.92 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.71/1.92 deletion, with positive clauses in sos and nonpositive
% 1.71/1.92 clauses in usable.
% 1.71/1.92
% 1.71/1.92 dependent: set(knuth_bendix).
% 1.71/1.92 dependent: set(anl_eq).
% 1.71/1.92 dependent: set(para_from).
% 1.71/1.92 dependent: set(para_into).
% 1.71/1.92 dependent: clear(para_from_right).
% 161.36/161.53 dependent: clear(para_into_right).
% 161.36/161.53 dependent: set(para_from_vars).
% 161.36/161.53 dependent: set(eq_units_both_ways).
% 161.36/161.53 dependent: set(dynamic_demod_all).
% 161.36/161.53 dependent: set(dynamic_demod).
% 161.36/161.53 dependent: set(order_eq).
% 161.36/161.53 dependent: set(back_demod).
% 161.36/161.53 dependent: set(lrpo).
% 161.36/161.53 dependent: set(hyper_res).
% 161.36/161.53 dependent: set(unit_deletion).
% 161.36/161.53 dependent: set(factor).
% 161.36/161.53
% 161.36/161.53 ------------> process usable:
% 161.36/161.53 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 161.36/161.53 ** KEPT (pick-wt=6): 2 [] A!=B|subset(A,B).
% 161.36/161.53 ** KEPT (pick-wt=6): 3 [] A!=B|subset(B,A).
% 161.36/161.53 ** KEPT (pick-wt=9): 4 [] A=B| -subset(A,B)| -subset(B,A).
% 161.36/161.53 ** KEPT (pick-wt=15): 5 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f2(B,C,A,D),B).
% 161.36/161.53 ** KEPT (pick-wt=15): 6 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f1(B,C,A,D),C).
% 161.36/161.53 ** KEPT (pick-wt=21): 8 [copy,7,flip.3] A!=cartesian_product2(B,C)| -in(D,A)|ordered_pair($f2(B,C,A,D),$f1(B,C,A,D))=D.
% 161.36/161.53 ** KEPT (pick-wt=19): 9 [] A!=cartesian_product2(B,C)|in(D,A)| -in(E,B)| -in(F,C)|D!=ordered_pair(E,F).
% 161.36/161.53 ** KEPT (pick-wt=25): 10 [] A=cartesian_product2(B,C)| -in($f5(B,C,A),A)| -in(D,B)| -in(E,C)|$f5(B,C,A)!=ordered_pair(D,E).
% 161.36/161.53 ** KEPT (pick-wt=9): 11 [] -subset(A,B)| -in(C,A)|in(C,B).
% 161.36/161.53 ** KEPT (pick-wt=8): 12 [] subset(A,B)| -in($f6(A,B),B).
% 161.36/161.53 ** KEPT (pick-wt=4): 13 [] -empty(ordered_pair(A,B)).
% 161.36/161.53 ** KEPT (pick-wt=2): 14 [] -empty($c2).
% 161.36/161.53 ** KEPT (pick-wt=24): 16 [copy,15,flip.2] -in(A,set_intersection2(cartesian_product2(B,C),cartesian_product2(D,E)))|ordered_pair($f8(A,B,C,D,E),$f7(A,B,C,D,E))=A.
% 161.36/161.53 ** KEPT (pick-wt=19): 17 [] -in(A,set_intersection2(cartesian_product2(B,C),cartesian_product2(D,E)))|in($f8(A,B,C,D,E),set_intersection2(B,D)).
% 161.36/161.53 ** KEPT (pick-wt=19): 18 [] -in(A,set_intersection2(cartesian_product2(B,C),cartesian_product2(D,E)))|in($f7(A,B,C,D,E),set_intersection2(C,E)).
% 161.36/161.53 ** KEPT (pick-wt=13): 19 [] -subset(A,B)| -subset(C,D)|subset(cartesian_product2(A,C),cartesian_product2(B,D)).
% 161.36/161.53 ** KEPT (pick-wt=15): 21 [copy,20,flip.1] set_intersection2(cartesian_product2($c6,$c4),cartesian_product2($c5,$c3))!=cartesian_product2(set_intersection2($c6,$c5),set_intersection2($c4,$c3)).
% 161.36/161.53 ** KEPT (pick-wt=11): 22 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 161.36/161.53
% 161.36/161.53 ------------> process sos:
% 161.36/161.53 ** KEPT (pick-wt=3): 32 [] A=A.
% 161.36/161.53 ** KEPT (pick-wt=7): 33 [] unordered_pair(A,B)=unordered_pair(B,A).
% 161.36/161.53 ** KEPT (pick-wt=7): 34 [] set_intersection2(A,B)=set_intersection2(B,A).
% 161.36/161.53 ** KEPT (pick-wt=17): 35 [] A=cartesian_product2(B,C)|in($f5(B,C,A),A)|in($f4(B,C,A),B).
% 161.36/161.53 ** KEPT (pick-wt=17): 36 [] A=cartesian_product2(B,C)|in($f5(B,C,A),A)|in($f3(B,C,A),C).
% 161.36/161.53 ** KEPT (pick-wt=25): 38 [copy,37,flip.3] A=cartesian_product2(B,C)|in($f5(B,C,A),A)|ordered_pair($f4(B,C,A),$f3(B,C,A))=$f5(B,C,A).
% 161.36/161.53 ** KEPT (pick-wt=8): 39 [] subset(A,B)|in($f6(A,B),A).
% 161.36/161.53 ** KEPT (pick-wt=10): 41 [copy,40,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 161.36/161.53 ---> New Demodulator: 42 [new_demod,41] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 161.36/161.53 ** KEPT (pick-wt=5): 43 [] set_intersection2(A,A)=A.
% 161.36/161.53 ---> New Demodulator: 44 [new_demod,43] set_intersection2(A,A)=A.
% 161.36/161.53 ** KEPT (pick-wt=2): 45 [] empty($c1).
% 161.36/161.53 ** KEPT (pick-wt=3): 46 [] subset(A,A).
% 161.36/161.53 ** KEPT (pick-wt=5): 47 [] subset(set_intersection2(A,B),A).
% 161.36/161.53 Following clause subsumed by 32 during input processing: 0 [copy,32,flip.1] A=A.
% 161.36/161.53 32 back subsumes 24.
% 161.36/161.53 Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 161.36/161.53 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 161.36/161.53 >>>> Starting back demodulation with 42.
% 161.36/161.53 >>>> Starting back demodulation with 44.
% 161.36/161.53 >> back demodulating 30 with 44.
% 161.36/161.53
% 161.36/161.53 ======= end of input processing =======
% 161.36/161.53
% 161.36/161.53 =========== start of search ===========
% 161.36/161.53
% 161.36/161.53
% 161.36/161.53 Resetting weight limit to 11.
% 161.36/161.53
% 161.36/161.53
% 161.36/161.53 Resetting weight limit to 11.
% 161.36/161.53
% 161.36/161.53 sos_size=269
% 161.36/161.53
% 161.36/161.53 Search stopped because sos empty.
% 161.36/161.53
% 161.36/161.53
% 161.36/161.53 Search stopped because sos empty.
% 161.36/161.53
% 161.36/161.53 ============ end of search ============
% 161.36/161.53
% 161.36/161.53 -------------- statistics -------------
% 161.36/161.53 clauses given 302
% 161.36/161.53 clauses generated 428721
% 161.36/161.53 clauses kept 375
% 161.36/161.53 clauses forward subsumed 1531
% 161.36/161.53 clauses back subsumed 6
% 161.36/161.53 Kbytes malloced 7812
% 161.36/161.53
% 161.36/161.53 ----------- times (seconds) -----------
% 161.36/161.53 user CPU time 159.60 (0 hr, 2 min, 39 sec)
% 161.36/161.53 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 161.36/161.53 wall-clock time 162 (0 hr, 2 min, 42 sec)
% 161.36/161.53
% 161.36/161.53 Process 2083 finished Wed Jul 27 10:40:21 2022
% 161.36/161.53 Otter interrupted
% 161.36/161.53 PROOF NOT FOUND
%------------------------------------------------------------------------------