TSTP Solution File: SET143+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET143+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:13:10 EDT 2022
% Result : Timeout 299.89s 300.07s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET143+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.14 % Command : otter-tptp-script %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Jul 27 10:46:23 EDT 2022
% 0.14/0.35 % CPUTime :
% 2.85/3.06 ----- Otter 3.3f, August 2004 -----
% 2.85/3.06 The process was started by sandbox on n021.cluster.edu,
% 2.85/3.06 Wed Jul 27 10:46:23 2022
% 2.85/3.06 The command was "./otter". The process ID is 22504.
% 2.85/3.06
% 2.85/3.06 set(prolog_style_variables).
% 2.85/3.06 set(auto).
% 2.85/3.06 dependent: set(auto1).
% 2.85/3.06 dependent: set(process_input).
% 2.85/3.06 dependent: clear(print_kept).
% 2.85/3.06 dependent: clear(print_new_demod).
% 2.85/3.06 dependent: clear(print_back_demod).
% 2.85/3.06 dependent: clear(print_back_sub).
% 2.85/3.06 dependent: set(control_memory).
% 2.85/3.06 dependent: assign(max_mem, 12000).
% 2.85/3.06 dependent: assign(pick_given_ratio, 4).
% 2.85/3.06 dependent: assign(stats_level, 1).
% 2.85/3.06 dependent: assign(max_seconds, 10800).
% 2.85/3.06 clear(print_given).
% 2.85/3.06
% 2.85/3.06 formula_list(usable).
% 2.85/3.06 all A (A=A).
% 2.85/3.06 all B C D (member(D,intersection(B,C))<->member(D,B)&member(D,C)).
% 2.85/3.06 all B C (B=C<->subset(B,C)&subset(C,B)).
% 2.85/3.06 all B C (intersection(B,C)=intersection(C,B)).
% 2.85/3.06 all B C (subset(B,C)<-> (all D (member(D,B)->member(D,C)))).
% 2.85/3.06 all B subset(B,B).
% 2.85/3.06 all B C (B=C<-> (all D (member(D,B)<->member(D,C)))).
% 2.85/3.06 -(all B C D (intersection(intersection(B,C),D)=intersection(B,intersection(C,D)))).
% 2.85/3.06 end_of_list.
% 2.85/3.06
% 2.85/3.06 -------> usable clausifies to:
% 2.85/3.06
% 2.85/3.06 list(usable).
% 2.85/3.06 0 [] A=A.
% 2.85/3.06 0 [] -member(D,intersection(B,C))|member(D,B).
% 2.85/3.06 0 [] -member(D,intersection(B,C))|member(D,C).
% 2.85/3.06 0 [] member(D,intersection(B,C))| -member(D,B)| -member(D,C).
% 2.85/3.06 0 [] B!=C|subset(B,C).
% 2.85/3.06 0 [] B!=C|subset(C,B).
% 2.85/3.06 0 [] B=C| -subset(B,C)| -subset(C,B).
% 2.85/3.06 0 [] intersection(B,C)=intersection(C,B).
% 2.85/3.06 0 [] -subset(B,C)| -member(D,B)|member(D,C).
% 2.85/3.06 0 [] subset(B,C)|member($f1(B,C),B).
% 2.85/3.06 0 [] subset(B,C)| -member($f1(B,C),C).
% 2.85/3.06 0 [] subset(B,B).
% 2.85/3.06 0 [] B!=C| -member(D,B)|member(D,C).
% 2.85/3.06 0 [] B!=C|member(D,B)| -member(D,C).
% 2.85/3.06 0 [] B=C|member($f2(B,C),B)|member($f2(B,C),C).
% 2.85/3.06 0 [] B=C| -member($f2(B,C),B)| -member($f2(B,C),C).
% 2.85/3.06 0 [] intersection(intersection($c3,$c2),$c1)!=intersection($c3,intersection($c2,$c1)).
% 2.85/3.06 end_of_list.
% 2.85/3.06
% 2.85/3.06 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 2.85/3.06
% 2.85/3.06 This ia a non-Horn set with equality. The strategy will be
% 2.85/3.06 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.85/3.06 deletion, with positive clauses in sos and nonpositive
% 2.85/3.06 clauses in usable.
% 2.85/3.06
% 2.85/3.06 dependent: set(knuth_bendix).
% 2.85/3.06 dependent: set(anl_eq).
% 2.85/3.06 dependent: set(para_from).
% 2.85/3.06 dependent: set(para_into).
% 2.85/3.06 dependent: clear(para_from_right).
% 2.85/3.06 dependent: clear(para_into_right).
% 2.85/3.06 dependent: set(para_from_vars).
% 2.85/3.06 dependent: set(eq_units_both_ways).
% 2.85/3.06 dependent: set(dynamic_demod_all).
% 2.85/3.06 dependent: set(dynamic_demod).
% 2.85/3.06 dependent: set(order_eq).
% 2.85/3.06 dependent: set(back_demod).
% 2.85/3.06 dependent: set(lrpo).
% 2.85/3.06 dependent: set(hyper_res).
% 2.85/3.06 dependent: set(unit_deletion).
% 2.85/3.06 dependent: set(factor).
% 2.85/3.06
% 2.85/3.06 ------------> process usable:
% 2.85/3.06 ** KEPT (pick-wt=8): 1 [] -member(A,intersection(B,C))|member(A,B).
% 2.85/3.06 ** KEPT (pick-wt=8): 2 [] -member(A,intersection(B,C))|member(A,C).
% 2.85/3.06 ** KEPT (pick-wt=11): 3 [] member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 2.85/3.06 ** KEPT (pick-wt=6): 4 [] A!=B|subset(A,B).
% 2.85/3.06 ** KEPT (pick-wt=6): 5 [] A!=B|subset(B,A).
% 2.85/3.06 ** KEPT (pick-wt=9): 6 [] A=B| -subset(A,B)| -subset(B,A).
% 2.85/3.06 ** KEPT (pick-wt=9): 7 [] -subset(A,B)| -member(C,A)|member(C,B).
% 2.85/3.06 ** KEPT (pick-wt=8): 8 [] subset(A,B)| -member($f1(A,B),B).
% 2.85/3.06 ** KEPT (pick-wt=9): 9 [] A!=B| -member(C,A)|member(C,B).
% 2.85/3.06 ** KEPT (pick-wt=9): 10 [] A!=B|member(C,A)| -member(C,B).
% 2.85/3.06 ** KEPT (pick-wt=13): 11 [] A=B| -member($f2(A,B),A)| -member($f2(A,B),B).
% 2.85/3.06 ** KEPT (pick-wt=11): 12 [] intersection(intersection($c3,$c2),$c1)!=intersection($c3,intersection($c2,$c1)).
% 2.85/3.06
% 2.85/3.06 ------------> process sos:
% 2.85/3.06 ** KEPT (pick-wt=3): 16 [] A=A.
% 2.85/3.06 ** KEPT (pick-wt=7): 17 [] intersection(A,B)=intersection(B,A).
% 2.85/3.06 ** KEPT (pick-wt=8): 18 [] subset(A,B)|member($f1(A,B),A).
% 2.85/3.06 ** KEPT (pick-wt=3): 19 [] subset(A,A).
% 2.85/3.06 ** KEPT (pick-wt=13): 20 [] A=B|member($f2(A,B),A)|member($f2(A,B),B).
% 2.85/3.06 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] A=A.
% 2.85/3.06 16 back subsumes 15.
% 2.85/3.06 16 back subsumes 14.
% 2.85/3.06 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] intersection(A,B)=intersection(B,A).
% 2.85/3.06
% 2.85/3.06 ======= end of input processing =======
% 2.85/3.06
% 2.85/3.06 =========== start of search ===========
% 2.85/3.06
% 2.85/3.06
% 2.85/3.06 Resetting weight limit to 17.
% 2.85/3.06
% 2.85/3.06
% 2.85/3.06 Resetting weight limit to 17.
% 2.85/3.06
% 2.85/3.06 sos_sizeAlarm clock
% 299.89/300.07 Otter interrupted
% 299.89/300.07 PROOF NOT FOUND
%------------------------------------------------------------------------------