TSTP Solution File: SET016+4 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET016+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:12:48 EDT 2022
% Result : Unknown 6.30s 6.49s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET016+4 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n013.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 10:31:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.55/2.13 ----- Otter 3.3f, August 2004 -----
% 1.55/2.13 The process was started by sandbox2 on n013.cluster.edu,
% 1.55/2.13 Wed Jul 27 10:31:15 2022
% 1.55/2.13 The command was "./otter". The process ID is 22246.
% 1.55/2.13
% 1.55/2.13 set(prolog_style_variables).
% 1.55/2.13 set(auto).
% 1.55/2.13 dependent: set(auto1).
% 1.55/2.13 dependent: set(process_input).
% 1.55/2.13 dependent: clear(print_kept).
% 1.55/2.13 dependent: clear(print_new_demod).
% 1.55/2.13 dependent: clear(print_back_demod).
% 1.55/2.13 dependent: clear(print_back_sub).
% 1.55/2.13 dependent: set(control_memory).
% 1.55/2.13 dependent: assign(max_mem, 12000).
% 1.55/2.13 dependent: assign(pick_given_ratio, 4).
% 1.55/2.13 dependent: assign(stats_level, 1).
% 1.55/2.13 dependent: assign(max_seconds, 10800).
% 1.55/2.13 clear(print_given).
% 1.55/2.13
% 1.55/2.13 formula_list(usable).
% 1.55/2.13 all A (A=A).
% 1.55/2.13 all A B (subset(A,B)<-> (all X (member(X,A)->member(X,B)))).
% 1.55/2.13 all A B (e_qual_set(A,B)<->subset(A,B)&subset(B,A)).
% 1.55/2.13 all X A (member(X,power_set(A))<->subset(X,A)).
% 1.55/2.13 all X A B (member(X,intersection(A,B))<->member(X,A)&member(X,B)).
% 1.55/2.13 all X A B (member(X,union(A,B))<->member(X,A)|member(X,B)).
% 1.55/2.13 all X (-member(X,empty_set)).
% 1.55/2.13 all B A E (member(B,difference(E,A))<->member(B,E)& -member(B,A)).
% 1.55/2.13 all X A (member(X,singleton(A))<->X=A).
% 1.55/2.13 all X A B (member(X,unordered_pair(A,B))<->X=A|X=B).
% 1.55/2.13 all X A (member(X,sum(A))<-> (exists Y (member(Y,A)&member(X,Y)))).
% 1.55/2.13 all X A (member(X,product(A))<-> (all Y (member(Y,A)->member(X,Y)))).
% 1.55/2.13 -(all A B U V (e_qual_set(unordered_pair(singleton(A),unordered_pair(A,B)),unordered_pair(singleton(U),unordered_pair(U,V)))->A=U)).
% 1.55/2.13 end_of_list.
% 1.55/2.13
% 1.55/2.13 -------> usable clausifies to:
% 1.55/2.13
% 1.55/2.13 list(usable).
% 1.55/2.13 0 [] A=A.
% 1.55/2.13 0 [] -subset(A,B)| -member(X,A)|member(X,B).
% 1.55/2.13 0 [] subset(A,B)|member($f1(A,B),A).
% 1.55/2.13 0 [] subset(A,B)| -member($f1(A,B),B).
% 1.55/2.13 0 [] -e_qual_set(A,B)|subset(A,B).
% 1.55/2.13 0 [] -e_qual_set(A,B)|subset(B,A).
% 1.55/2.13 0 [] e_qual_set(A,B)| -subset(A,B)| -subset(B,A).
% 1.55/2.13 0 [] -member(X,power_set(A))|subset(X,A).
% 1.55/2.13 0 [] member(X,power_set(A))| -subset(X,A).
% 1.55/2.13 0 [] -member(X,intersection(A,B))|member(X,A).
% 1.55/2.13 0 [] -member(X,intersection(A,B))|member(X,B).
% 1.55/2.13 0 [] member(X,intersection(A,B))| -member(X,A)| -member(X,B).
% 1.55/2.13 0 [] -member(X,union(A,B))|member(X,A)|member(X,B).
% 1.55/2.13 0 [] member(X,union(A,B))| -member(X,A).
% 1.55/2.13 0 [] member(X,union(A,B))| -member(X,B).
% 1.55/2.13 0 [] -member(X,empty_set).
% 1.55/2.13 0 [] -member(B,difference(E,A))|member(B,E).
% 1.55/2.13 0 [] -member(B,difference(E,A))| -member(B,A).
% 1.55/2.13 0 [] member(B,difference(E,A))| -member(B,E)|member(B,A).
% 1.55/2.13 0 [] -member(X,singleton(A))|X=A.
% 1.55/2.13 0 [] member(X,singleton(A))|X!=A.
% 1.55/2.13 0 [] -member(X,unordered_pair(A,B))|X=A|X=B.
% 1.55/2.13 0 [] member(X,unordered_pair(A,B))|X!=A.
% 1.55/2.13 0 [] member(X,unordered_pair(A,B))|X!=B.
% 1.55/2.13 0 [] -member(X,sum(A))|member($f2(X,A),A).
% 1.55/2.13 0 [] -member(X,sum(A))|member(X,$f2(X,A)).
% 1.55/2.13 0 [] member(X,sum(A))| -member(Y,A)| -member(X,Y).
% 1.55/2.13 0 [] -member(X,product(A))| -member(Y,A)|member(X,Y).
% 1.55/2.13 0 [] member(X,product(A))|member($f3(X,A),A).
% 1.55/2.13 0 [] member(X,product(A))| -member(X,$f3(X,A)).
% 1.55/2.13 0 [] e_qual_set(unordered_pair(singleton($c4),unordered_pair($c4,$c3)),unordered_pair(singleton($c2),unordered_pair($c2,$c1))).
% 1.55/2.13 0 [] $c4!=$c2.
% 1.55/2.13 end_of_list.
% 1.55/2.13
% 1.55/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.55/2.13
% 1.55/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.55/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.55/2.13 deletion, with positive clauses in sos and nonpositive
% 1.55/2.13 clauses in usable.
% 1.55/2.13
% 1.55/2.13 dependent: set(knuth_bendix).
% 1.55/2.13 dependent: set(anl_eq).
% 1.55/2.13 dependent: set(para_from).
% 1.55/2.13 dependent: set(para_into).
% 1.55/2.13 dependent: clear(para_from_right).
% 1.55/2.13 dependent: clear(para_into_right).
% 1.55/2.13 dependent: set(para_from_vars).
% 1.55/2.13 dependent: set(eq_units_both_ways).
% 1.55/2.13 dependent: set(dynamic_demod_all).
% 1.55/2.13 dependent: set(dynamic_demod).
% 1.55/2.13 dependent: set(order_eq).
% 1.55/2.13 dependent: set(back_demod).
% 1.55/2.13 dependent: set(lrpo).
% 1.55/2.13 dependent: set(hyper_res).
% 1.55/2.13 dependent: set(unit_deletion).
% 1.55/2.13 dependent: set(factor).
% 1.55/2.13
% 1.55/2.13 ------------> process usable:
% 1.55/2.13 ** KEPT (pick-wt=9): 1 [] -subset(A,B)| -member(C,A)|member(C,B).
% 1.55/2.13 ** KEPT (pick-wt=8): 2 [] subset(A,B)| -member($f1(A,B),B).
% 1.55/2.13 ** KEPT (pick-wt=6): 3 [] -e_qual_set(A,B)|subset(A,B).
% 1.55/2.13 ** KEPT (pick-wt=6): 4 [] -e_qual_set(A,B)|subset(B,A).
% 1.55/2.13 ** KEPT (pick-wt=9): 5 [] e_qual_set(A,B)| -subset(A,B)| -subset(B,A).
% 1.55/2.13 ** KEPT (pick-wt=7): 6 [] -member(A,power_set(B))|subset(A,B).
% 1.55/2.13 ** KEPT (pick-wt=7): 7 [] member(A,power_set(B))| -subset(A,B).
% 6.30/6.49 ** KEPT (pick-wt=8): 8 [] -member(A,intersection(B,C))|member(A,B).
% 6.30/6.49 ** KEPT (pick-wt=8): 9 [] -member(A,intersection(B,C))|member(A,C).
% 6.30/6.49 ** KEPT (pick-wt=11): 10 [] member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 6.30/6.49 ** KEPT (pick-wt=11): 11 [] -member(A,union(B,C))|member(A,B)|member(A,C).
% 6.30/6.49 ** KEPT (pick-wt=8): 12 [] member(A,union(B,C))| -member(A,B).
% 6.30/6.49 ** KEPT (pick-wt=8): 13 [] member(A,union(B,C))| -member(A,C).
% 6.30/6.49 ** KEPT (pick-wt=3): 14 [] -member(A,empty_set).
% 6.30/6.49 ** KEPT (pick-wt=8): 15 [] -member(A,difference(B,C))|member(A,B).
% 6.30/6.49 ** KEPT (pick-wt=8): 16 [] -member(A,difference(B,C))| -member(A,C).
% 6.30/6.49 ** KEPT (pick-wt=11): 17 [] member(A,difference(B,C))| -member(A,B)|member(A,C).
% 6.30/6.49 ** KEPT (pick-wt=7): 18 [] -member(A,singleton(B))|A=B.
% 6.30/6.49 ** KEPT (pick-wt=7): 19 [] member(A,singleton(B))|A!=B.
% 6.30/6.49 ** KEPT (pick-wt=11): 20 [] -member(A,unordered_pair(B,C))|A=B|A=C.
% 6.30/6.49 ** KEPT (pick-wt=8): 21 [] member(A,unordered_pair(B,C))|A!=B.
% 6.30/6.49 ** KEPT (pick-wt=8): 22 [] member(A,unordered_pair(B,C))|A!=C.
% 6.30/6.49 ** KEPT (pick-wt=9): 23 [] -member(A,sum(B))|member($f2(A,B),B).
% 6.30/6.49 ** KEPT (pick-wt=9): 24 [] -member(A,sum(B))|member(A,$f2(A,B)).
% 6.30/6.49 ** KEPT (pick-wt=10): 25 [] member(A,sum(B))| -member(C,B)| -member(A,C).
% 6.30/6.49 ** KEPT (pick-wt=10): 26 [] -member(A,product(B))| -member(C,B)|member(A,C).
% 6.30/6.49 ** KEPT (pick-wt=9): 27 [] member(A,product(B))| -member(A,$f3(A,B)).
% 6.30/6.49 ** KEPT (pick-wt=3): 28 [] $c4!=$c2.
% 6.30/6.49
% 6.30/6.49 ------------> process sos:
% 6.30/6.49 ** KEPT (pick-wt=3): 34 [] A=A.
% 6.30/6.49 ** KEPT (pick-wt=8): 35 [] subset(A,B)|member($f1(A,B),A).
% 6.30/6.49 ** KEPT (pick-wt=9): 36 [] member(A,product(B))|member($f3(A,B),B).
% 6.30/6.49 ** KEPT (pick-wt=13): 37 [] e_qual_set(unordered_pair(singleton($c4),unordered_pair($c4,$c3)),unordered_pair(singleton($c2),unordered_pair($c2,$c1))).
% 6.30/6.49 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] A=A.
% 6.30/6.49
% 6.30/6.49 ======= end of input processing =======
% 6.30/6.49
% 6.30/6.49 =========== start of search ===========
% 6.30/6.49
% 6.30/6.49
% 6.30/6.49 Resetting weight limit to 8.
% 6.30/6.49
% 6.30/6.49
% 6.30/6.49 Resetting weight limit to 8.
% 6.30/6.49
% 6.30/6.49 sos_size=515
% 6.30/6.49
% 6.30/6.49
% 6.30/6.49 Resetting weight limit to 7.
% 6.30/6.49
% 6.30/6.49
% 6.30/6.49 Resetting weight limit to 7.
% 6.30/6.49
% 6.30/6.49 sos_size=569
% 6.30/6.49
% 6.30/6.49 Search stopped because sos empty.
% 6.30/6.49
% 6.30/6.49
% 6.30/6.49 Search stopped because sos empty.
% 6.30/6.49
% 6.30/6.49 ============ end of search ============
% 6.30/6.49
% 6.30/6.49 -------------- statistics -------------
% 6.30/6.49 clauses given 874
% 6.30/6.49 clauses generated 1070899
% 6.30/6.49 clauses kept 930
% 6.30/6.49 clauses forward subsumed 42240
% 6.30/6.49 clauses back subsumed 46
% 6.30/6.49 Kbytes malloced 10742
% 6.30/6.49
% 6.30/6.49 ----------- times (seconds) -----------
% 6.30/6.49 user CPU time 4.36 (0 hr, 0 min, 4 sec)
% 6.30/6.49 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 6.30/6.49 wall-clock time 6 (0 hr, 0 min, 6 sec)
% 6.30/6.49
% 6.30/6.49 Process 22246 finished Wed Jul 27 10:31:21 2022
% 6.30/6.49 Otter interrupted
% 6.30/6.49 PROOF NOT FOUND
%------------------------------------------------------------------------------