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