TSTP Solution File: SET945+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET945+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:34 EDT 2022
% Result : Timeout 299.85s 300.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET945+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.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:35:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.71/1.91 ----- Otter 3.3f, August 2004 -----
% 1.71/1.91 The process was started by sandbox on n018.cluster.edu,
% 1.71/1.91 Wed Jul 27 10:35:16 2022
% 1.71/1.91 The command was "./otter". The process ID is 25678.
% 1.71/1.91
% 1.71/1.91 set(prolog_style_variables).
% 1.71/1.91 set(auto).
% 1.71/1.91 dependent: set(auto1).
% 1.71/1.91 dependent: set(process_input).
% 1.71/1.91 dependent: clear(print_kept).
% 1.71/1.91 dependent: clear(print_new_demod).
% 1.71/1.91 dependent: clear(print_back_demod).
% 1.71/1.91 dependent: clear(print_back_sub).
% 1.71/1.91 dependent: set(control_memory).
% 1.71/1.91 dependent: assign(max_mem, 12000).
% 1.71/1.91 dependent: assign(pick_given_ratio, 4).
% 1.71/1.91 dependent: assign(stats_level, 1).
% 1.71/1.91 dependent: assign(max_seconds, 10800).
% 1.71/1.91 clear(print_given).
% 1.71/1.91
% 1.71/1.91 formula_list(usable).
% 1.71/1.91 all A (A=A).
% 1.71/1.91 all A B (in(A,B)-> -in(B,A)).
% 1.71/1.91 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.71/1.91 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.71/1.91 all A B (B=union(A)<-> (all C (in(C,B)<-> (exists D (in(C,D)&in(D,A)))))).
% 1.71/1.91 all A B (set_intersection2(A,A)=A).
% 1.71/1.91 exists A empty(A).
% 1.71/1.91 exists A (-empty(A)).
% 1.71/1.91 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.71/1.91 all A B (-(-disjoint(A,B)& (all C (-in(C,set_intersection2(A,B)))))& -((exists C in(C,set_intersection2(A,B)))&disjoint(A,B))).
% 1.71/1.91 -(all A B ((all C (in(C,A)->disjoint(C,B)))->disjoint(union(A),B))).
% 1.71/1.91 end_of_list.
% 1.71/1.91
% 1.71/1.91 -------> usable clausifies to:
% 1.71/1.91
% 1.71/1.91 list(usable).
% 1.71/1.91 0 [] A=A.
% 1.71/1.91 0 [] -in(A,B)| -in(B,A).
% 1.71/1.91 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.71/1.91 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.71/1.91 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.71/1.91 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.71/1.91 0 [] C=set_intersection2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),A).
% 1.71/1.91 0 [] C=set_intersection2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),B).
% 1.71/1.91 0 [] C=set_intersection2(A,B)| -in($f1(A,B,C),C)| -in($f1(A,B,C),A)| -in($f1(A,B,C),B).
% 1.71/1.91 0 [] B!=union(A)| -in(C,B)|in(C,$f2(A,B,C)).
% 1.71/1.91 0 [] B!=union(A)| -in(C,B)|in($f2(A,B,C),A).
% 1.71/1.91 0 [] B!=union(A)|in(C,B)| -in(C,D)| -in(D,A).
% 1.71/1.91 0 [] B=union(A)|in($f4(A,B),B)|in($f4(A,B),$f3(A,B)).
% 1.71/1.91 0 [] B=union(A)|in($f4(A,B),B)|in($f3(A,B),A).
% 1.71/1.91 0 [] B=union(A)| -in($f4(A,B),B)| -in($f4(A,B),X1)| -in(X1,A).
% 1.71/1.91 0 [] set_intersection2(A,A)=A.
% 1.71/1.91 0 [] empty($c1).
% 1.71/1.91 0 [] -empty($c2).
% 1.71/1.91 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.71/1.91 0 [] disjoint(A,B)|in($f5(A,B),set_intersection2(A,B)).
% 1.71/1.91 0 [] -in(C,set_intersection2(A,B))| -disjoint(A,B).
% 1.71/1.91 0 [] -in(C,$c4)|disjoint(C,$c3).
% 1.71/1.91 0 [] -disjoint(union($c4),$c3).
% 1.71/1.91 end_of_list.
% 1.71/1.91
% 1.71/1.91 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.71/1.91
% 1.71/1.91 This ia a non-Horn set with equality. The strategy will be
% 1.71/1.91 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.71/1.91 deletion, with positive clauses in sos and nonpositive
% 1.71/1.91 clauses in usable.
% 1.71/1.91
% 1.71/1.91 dependent: set(knuth_bendix).
% 1.71/1.91 dependent: set(anl_eq).
% 1.71/1.91 dependent: set(para_from).
% 1.71/1.91 dependent: set(para_into).
% 1.71/1.91 dependent: clear(para_from_right).
% 1.71/1.91 dependent: clear(para_into_right).
% 1.71/1.91 dependent: set(para_from_vars).
% 1.71/1.91 dependent: set(eq_units_both_ways).
% 1.71/1.91 dependent: set(dynamic_demod_all).
% 1.71/1.91 dependent: set(dynamic_demod).
% 1.71/1.91 dependent: set(order_eq).
% 1.71/1.91 dependent: set(back_demod).
% 1.71/1.91 dependent: set(lrpo).
% 1.71/1.91 dependent: set(hyper_res).
% 1.71/1.91 dependent: set(unit_deletion).
% 1.71/1.91 dependent: set(factor).
% 1.71/1.91
% 1.71/1.91 ------------> process usable:
% 1.71/1.91 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.71/1.91 ** KEPT (pick-wt=11): 2 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 1.71/1.91 ** KEPT (pick-wt=11): 3 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 1.71/1.91 ** KEPT (pick-wt=14): 4 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 1.71/1.91 ** KEPT (pick-wt=23): 5 [] A=set_intersection2(B,C)| -in($f1(B,C,A),A)| -in($f1(B,C,A),B)| -in($f1(B,C,A),C).
% 1.71/1.91 ** KEPT (pick-wt=13): 6 [] A!=union(B)| -in(C,A)|in(C,$f2(B,A,C)).
% 1.71/1.91 ** KEPT (pick-wt=13): 7 [] A!=union(B)| -in(C,A)|in($f2(B,A,C),B).
% 1.71/1.91 ** KEPT (pick-wt=13): 8 [] A!=union(B)|in(C,A)| -in(C,D)| -in(D,B).
% 1.71/1.91 ** KEPT (pick-wt=17): 9 [] A=union(B)| -in($f4(B,A),A)| -in($f4(B,A),C)| -in(C,B).
% 1.71/1.91 ** KEPT (pick-wt=2): 10 [] -empty($c2).
% 1.71/1.91 ** KEPT (pick-wt=6): 11 [] -disjoint(A,B)|disjoint(B,A).
% 1.71/1.91 ** KEPT (pick-wt=8): 12 [] -in(A,set_intersection2(B,C))| -disjoint(B,C).
% 1.71/1.91 ** KEPT (pick-wt=6): 13 [] -in(A,$c4)|disjoint(A,$c3).
% 1.71/1.91 ** KEPT (pick-wt=4): 14 [] -disjoint(union($c4),$c3).
% 1.71/1.91
% 1.71/1.91 ----------Alarm clock
% 299.85/300.03 Otter interrupted
% 299.85/300.03 PROOF NOT FOUND
%------------------------------------------------------------------------------