TSTP Solution File: SET624+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET624+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:54 EDT 2022
% Result : Timeout 299.81s 300.01s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET624+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n019.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:48:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 6.33/6.55 ----- Otter 3.3f, August 2004 -----
% 6.33/6.55 The process was started by sandbox2 on n019.cluster.edu,
% 6.33/6.55 Wed Jul 27 10:48:37 2022
% 6.33/6.55 The command was "./otter". The process ID is 24560.
% 6.33/6.55
% 6.33/6.55 set(prolog_style_variables).
% 6.33/6.55 set(auto).
% 6.33/6.55 dependent: set(auto1).
% 6.33/6.55 dependent: set(process_input).
% 6.33/6.55 dependent: clear(print_kept).
% 6.33/6.55 dependent: clear(print_new_demod).
% 6.33/6.55 dependent: clear(print_back_demod).
% 6.33/6.55 dependent: clear(print_back_sub).
% 6.33/6.55 dependent: set(control_memory).
% 6.33/6.55 dependent: assign(max_mem, 12000).
% 6.33/6.55 dependent: assign(pick_given_ratio, 4).
% 6.33/6.55 dependent: assign(stats_level, 1).
% 6.33/6.55 dependent: assign(max_seconds, 10800).
% 6.33/6.55 clear(print_given).
% 6.33/6.55
% 6.33/6.55 formula_list(usable).
% 6.33/6.55 all A (A=A).
% 6.33/6.55 all B C D (member(D,union(B,C))<->member(D,B)|member(D,C)).
% 6.33/6.55 all B C (intersect(B,C)<-> (exists D (member(D,B)&member(D,C)))).
% 6.33/6.55 all B C (union(B,C)=union(C,B)).
% 6.33/6.55 all B C (intersect(B,C)->intersect(C,B)).
% 6.33/6.55 all B C (B=C<-> (all D (member(D,B)<->member(D,C)))).
% 6.33/6.55 -(all B C D (intersect(B,union(C,D))<->intersect(B,C)|intersect(B,D))).
% 6.33/6.55 end_of_list.
% 6.33/6.55
% 6.33/6.55 -------> usable clausifies to:
% 6.33/6.55
% 6.33/6.55 list(usable).
% 6.33/6.55 0 [] A=A.
% 6.33/6.55 0 [] -member(D,union(B,C))|member(D,B)|member(D,C).
% 6.33/6.55 0 [] member(D,union(B,C))| -member(D,B).
% 6.33/6.55 0 [] member(D,union(B,C))| -member(D,C).
% 6.33/6.55 0 [] -intersect(B,C)|member($f1(B,C),B).
% 6.33/6.55 0 [] -intersect(B,C)|member($f1(B,C),C).
% 6.33/6.55 0 [] intersect(B,C)| -member(D,B)| -member(D,C).
% 6.33/6.55 0 [] union(B,C)=union(C,B).
% 6.33/6.55 0 [] -intersect(B,C)|intersect(C,B).
% 6.33/6.55 0 [] B!=C| -member(D,B)|member(D,C).
% 6.33/6.55 0 [] B!=C|member(D,B)| -member(D,C).
% 6.33/6.55 0 [] B=C|member($f2(B,C),B)|member($f2(B,C),C).
% 6.33/6.55 0 [] B=C| -member($f2(B,C),B)| -member($f2(B,C),C).
% 6.33/6.55 0 [] intersect($c3,union($c2,$c1))|intersect($c3,$c2)|intersect($c3,$c1).
% 6.33/6.55 0 [] -intersect($c3,union($c2,$c1))| -intersect($c3,$c2).
% 6.33/6.55 0 [] -intersect($c3,union($c2,$c1))| -intersect($c3,$c1).
% 6.33/6.55 end_of_list.
% 6.33/6.55
% 6.33/6.55 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 6.33/6.55
% 6.33/6.55 This ia a non-Horn set with equality. The strategy will be
% 6.33/6.55 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 6.33/6.55 deletion, with positive clauses in sos and nonpositive
% 6.33/6.55 clauses in usable.
% 6.33/6.55
% 6.33/6.55 dependent: set(knuth_bendix).
% 6.33/6.55 dependent: set(anl_eq).
% 6.33/6.55 dependent: set(para_from).
% 6.33/6.55 dependent: set(para_into).
% 6.33/6.55 dependent: clear(para_from_right).
% 6.33/6.55 dependent: clear(para_into_right).
% 6.33/6.55 dependent: set(para_from_vars).
% 6.33/6.55 dependent: set(eq_units_both_ways).
% 6.33/6.55 dependent: set(dynamic_demod_all).
% 6.33/6.55 dependent: set(dynamic_demod).
% 6.33/6.55 dependent: set(order_eq).
% 6.33/6.55 dependent: set(back_demod).
% 6.33/6.55 dependent: set(lrpo).
% 6.33/6.55 dependent: set(hyper_res).
% 6.33/6.55 dependent: set(unit_deletion).
% 6.33/6.55 dependent: set(factor).
% 6.33/6.55
% 6.33/6.55 ------------> process usable:
% 6.33/6.55 ** KEPT (pick-wt=11): 1 [] -member(A,union(B,C))|member(A,B)|member(A,C).
% 6.33/6.55 ** KEPT (pick-wt=8): 2 [] member(A,union(B,C))| -member(A,B).
% 6.33/6.55 ** KEPT (pick-wt=8): 3 [] member(A,union(B,C))| -member(A,C).
% 6.33/6.55 ** KEPT (pick-wt=8): 4 [] -intersect(A,B)|member($f1(A,B),A).
% 6.33/6.55 ** KEPT (pick-wt=8): 5 [] -intersect(A,B)|member($f1(A,B),B).
% 6.33/6.55 ** KEPT (pick-wt=9): 6 [] intersect(A,B)| -member(C,A)| -member(C,B).
% 6.33/6.55 ** KEPT (pick-wt=6): 7 [] -intersect(A,B)|intersect(B,A).
% 6.33/6.55 ** KEPT (pick-wt=9): 8 [] A!=B| -member(C,A)|member(C,B).
% 6.33/6.55 ** KEPT (pick-wt=9): 9 [] A!=B|member(C,A)| -member(C,B).
% 6.33/6.55 ** KEPT (pick-wt=13): 10 [] A=B| -member($f2(A,B),A)| -member($f2(A,B),B).
% 6.33/6.55 ** KEPT (pick-wt=8): 11 [] -intersect($c3,union($c2,$c1))| -intersect($c3,$c2).
% 6.33/6.55 ** KEPT (pick-wt=8): 12 [] -intersect($c3,union($c2,$c1))| -intersect($c3,$c1).
% 6.33/6.55
% 6.33/6.55 ------------> process sos:
% 6.33/6.55 ** KEPT (pick-wt=3): 16 [] A=A.
% 6.33/6.55 ** KEPT (pick-wt=7): 17 [] union(A,B)=union(B,A).
% 6.33/6.55 ** KEPT (pick-wt=13): 18 [] A=B|member($f2(A,B),A)|member($f2(A,B),B).
% 6.33/6.55 ** KEPT (pick-wt=11): 19 [] intersect($c3,union($c2,$c1))|intersect($c3,$c2)|intersect($c3,$c1).
% 6.33/6.55 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] A=A.
% 6.33/6.55 16 back subsumes 15.
% 6.33/6.55 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] union(A,B)=union(B,A).
% 6.33/6.55
% 6.33/6.55 ======= end of input processing =======
% 6.33/6.55
% 6.33/6.55 =========== start of search ===========
% 6.33/6.55
% 6.33/6.55
% 6.33/6.55 Resetting weight limit to 14.
% 6.33/6.55
% 6.33/6.55
% 6.33/6.55 Resetting weight limit to 14.
% 6.33/6.55
% 6.33/6.55 sos_size=3415
% 6.33/6.55
% 6.33/6.55
% 6.33/6.55 Resetting weight limit to 13.
% 6.33/6.55
% 6.33/6.55
% 6.33/6.55 Resetting weight limit to 13.
% 6.33/6.55
% 6.33/6.55 sos_siAlarm clock
% 299.81/300.01 Otter interrupted
% 299.81/300.01 PROOF NOT FOUND
%------------------------------------------------------------------------------