TSTP Solution File: SEU124+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU124+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:49 EDT 2022
% Result : Timeout 299.89s 300.04s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU124+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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 08:15:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.74/1.95 ----- Otter 3.3f, August 2004 -----
% 1.74/1.95 The process was started by sandbox on n027.cluster.edu,
% 1.74/1.95 Wed Jul 27 08:15:36 2022
% 1.74/1.95 The command was "./otter". The process ID is 21647.
% 1.74/1.95
% 1.74/1.95 set(prolog_style_variables).
% 1.74/1.95 set(auto).
% 1.74/1.95 dependent: set(auto1).
% 1.74/1.95 dependent: set(process_input).
% 1.74/1.95 dependent: clear(print_kept).
% 1.74/1.95 dependent: clear(print_new_demod).
% 1.74/1.95 dependent: clear(print_back_demod).
% 1.74/1.95 dependent: clear(print_back_sub).
% 1.74/1.95 dependent: set(control_memory).
% 1.74/1.95 dependent: assign(max_mem, 12000).
% 1.74/1.95 dependent: assign(pick_given_ratio, 4).
% 1.74/1.95 dependent: assign(stats_level, 1).
% 1.74/1.95 dependent: assign(max_seconds, 10800).
% 1.74/1.95 clear(print_given).
% 1.74/1.95
% 1.74/1.95 formula_list(usable).
% 1.74/1.95 all A (A=A).
% 1.74/1.95 all A B (in(A,B)-> -in(B,A)).
% 1.74/1.95 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.74/1.95 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.74/1.95 all A B (A=B<->subset(A,B)&subset(B,A)).
% 1.74/1.95 all A (A=empty_set<-> (all B (-in(B,A)))).
% 1.74/1.95 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 1.74/1.95 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.74/1.95 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.74/1.95 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 1.74/1.95 $T.
% 1.74/1.95 $T.
% 1.74/1.95 $T.
% 1.74/1.95 empty(empty_set).
% 1.74/1.95 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.74/1.95 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.74/1.95 all A B (set_union2(A,A)=A).
% 1.74/1.95 all A B (set_intersection2(A,A)=A).
% 1.74/1.95 exists A empty(A).
% 1.74/1.95 exists A (-empty(A)).
% 1.74/1.95 all A B subset(A,A).
% 1.74/1.95 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.74/1.95 all A (set_union2(A,empty_set)=A).
% 1.74/1.95 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 1.74/1.95 all A subset(empty_set,A).
% 1.74/1.95 all A B (-(-disjoint(A,B)& (all C (-(in(C,A)&in(C,B)))))& -((exists C (in(C,A)&in(C,B)))&disjoint(A,B))).
% 1.74/1.95 all A (subset(A,empty_set)->A=empty_set).
% 1.74/1.95 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.74/1.95 all A (empty(A)->A=empty_set).
% 1.74/1.95 all A B (-(in(A,B)&empty(B))).
% 1.74/1.95 -(all A B subset(A,set_union2(A,B))).
% 1.74/1.95 all A B (-(empty(A)&A!=B&empty(B))).
% 1.74/1.95 end_of_list.
% 1.74/1.95
% 1.74/1.95 -------> usable clausifies to:
% 1.74/1.95
% 1.74/1.95 list(usable).
% 1.74/1.95 0 [] A=A.
% 1.74/1.95 0 [] -in(A,B)| -in(B,A).
% 1.74/1.95 0 [] set_union2(A,B)=set_union2(B,A).
% 1.74/1.95 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.74/1.95 0 [] A!=B|subset(A,B).
% 1.74/1.95 0 [] A!=B|subset(B,A).
% 1.74/1.95 0 [] A=B| -subset(A,B)| -subset(B,A).
% 1.74/1.95 0 [] A!=empty_set| -in(B,A).
% 1.74/1.95 0 [] A=empty_set|in($f1(A),A).
% 1.74/1.95 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 1.74/1.95 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 1.74/1.95 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 1.74/1.95 0 [] C=set_union2(A,B)|in($f2(A,B,C),C)|in($f2(A,B,C),A)|in($f2(A,B,C),B).
% 1.74/1.95 0 [] C=set_union2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),A).
% 1.74/1.95 0 [] C=set_union2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),B).
% 1.74/1.95 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.74/1.95 0 [] subset(A,B)|in($f3(A,B),A).
% 1.74/1.95 0 [] subset(A,B)| -in($f3(A,B),B).
% 1.74/1.95 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.74/1.95 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.74/1.95 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.74/1.95 0 [] C=set_intersection2(A,B)|in($f4(A,B,C),C)|in($f4(A,B,C),A).
% 1.74/1.95 0 [] C=set_intersection2(A,B)|in($f4(A,B,C),C)|in($f4(A,B,C),B).
% 1.74/1.95 0 [] C=set_intersection2(A,B)| -in($f4(A,B,C),C)| -in($f4(A,B,C),A)| -in($f4(A,B,C),B).
% 1.74/1.95 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.74/1.95 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.74/1.95 0 [] $T.
% 1.74/1.95 0 [] $T.
% 1.74/1.95 0 [] $T.
% 1.74/1.95 0 [] empty(empty_set).
% 1.74/1.95 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.74/1.95 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.74/1.95 0 [] set_union2(A,A)=A.
% 1.74/1.95 0 [] set_intersection2(A,A)=A.
% 1.74/1.95 0 [] empty($c1).
% 1.74/1.95 0 [] -empty($c2).
% 1.74/1.95 0 [] subset(A,A).
% 1.74/1.95 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.74/1.95 0 [] set_union2(A,empty_set)=A.
% 1.74/1.95 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.74/1.95 0 [] subset(empty_set,A).
% 1.74/1.95 0 [] disjoint(A,B)|in($f5(A,B),A).
% 1.74/1.95 0 [] disjoint(A,B)|in($f5(A,B),B).
% 1.74/1.95 0 [] -in(C,A)| -in(C,B)| -disjoint(A,B).
% 1.74/1.95 0 [] -subset(A,empty_set)|A=empty_set.
% 1.74/1.95 0 [] disjoint(A,B)|in($f6(A,B),set_intersection2(A,B)).
% 1.74/1.95 0 [] -in(C,set_intersection2(A,B))| -disjoint(A,B).
% 1.74/1.95 0 [] -empty(A)|A=empty_set.
% 1.74/1.95 0 [] -in(A,B)| -empty(B).
% 1.74/1.95 0 [] -subset($c4,set_union2($c4,$c3)).
% 1.74/1.95 0 [] -empty(A)|A=B| -empty(B).
% 1.74/1.95 end_of_list.
% 1.74/1.95
% 1.74/1.95 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.74/1.95
% 1.74/1.95 This ia a non-Horn set with equality. The strategy will be
% 1.74/1.95 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.74/1.95 deletion, with positive clauses in sos and nonpositive
% 1.74/1.95 clauses in usable.
% 1.74/1.95
% 1.74/1.95 dependent: set(knuth_bendix).
% 1.74/1.95 dependent: set(anl_eq).
% 1.74/1.95 dependent: set(para_from).
% 1.74/1.95 dependent: set(para_into).
% 1.74/1.95 dependent: clear(para_from_right).
% 1.74/1.95 dependent: clear(para_into_right).
% 1.74/1.95 dependent: set(para_from_vars).
% 1.74/1.95 dependent: set(eq_units_both_ways).
% 1.74/1.95 dependent: set(dynamic_demod_all).
% 1.74/1.95 dependent: set(dynamic_demod).
% 1.74/1.95 dependent: set(order_eq).
% 1.74/1.95 dependent: set(back_demod).
% 1.74/1.95 dependent: set(lrpo).
% 1.74/1.95 dependent: set(hyper_res).
% 1.74/1.95 dependent: set(unit_deletion).
% 1.74/1.95 dependent: set(factor).
% 1.74/1.95
% 1.74/1.95 ------------> process usable:
% 1.74/1.95 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.74/1.95 ** KEPT (pick-wt=6): 2 [] A!=B|subset(A,B).
% 1.74/1.95 ** KEPT (pick-wt=6): 3 [] A!=B|subset(B,A).
% 1.74/1.95 ** KEPT (pick-wt=9): 4 [] A=B| -subset(A,B)| -subset(B,A).
% 1.74/1.95 ** KEPT (pick-wt=6): 5 [] A!=empty_set| -in(B,A).
% 1.74/1.95 ** KEPT (pick-wt=14): 6 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 1.74/1.95 ** KEPT (pick-wt=11): 7 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 1.74/1.95 ** KEPT (pick-wt=11): 8 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 1.74/1.95 ** KEPT (pick-wt=17): 9 [] A=set_union2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),B).
% 1.74/1.95 ** KEPT (pick-wt=17): 10 [] A=set_union2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),C).
% 1.74/1.95 ** KEPT (pick-wt=9): 11 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.74/1.95 ** KEPT (pick-wt=8): 12 [] subset(A,B)| -in($f3(A,B),B).
% 1.74/1.95 ** KEPT (pick-wt=11): 13 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 1.74/1.95 ** KEPT (pick-wt=11): 14 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 1.74/1.95 ** KEPT (pick-wt=14): 15 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 1.74/1.95 ** KEPT (pick-wt=23): 16 [] A=set_intersection2(B,C)| -in($f4(B,C,A),A)| -in($f4(B,C,A),B)| -in($f4(B,C,A),C).
% 1.74/1.95 ** KEPT (pick-wt=8): 17 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.74/1.95 ** KEPT (pick-wt=8): 18 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.74/1.95 ** KEPT (pick-wt=6): 19 [] empty(A)| -empty(set_union2(A,B)).
% 1.74/1.95 ** KEPT (pick-wt=6): 20 [] empty(A)| -empty(set_union2(B,A)).
% 1.74/1.95 ** KEPT (pick-wt=2): 21 [] -empty($c2).
% 1.74/1.95 ** KEPT (pick-wt=6): 22 [] -disjoint(A,B)|disjoint(B,A).
% 1.74/1.95 ** KEPT (pick-wt=9): 23 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.74/1.95 ** KEPT (pick-wt=9): 24 [] -in(A,B)| -in(A,C)| -disjoint(B,C).
% 1.74/1.95 ** KEPT (pick-wt=6): 25 [] -subset(A,empty_set)|A=empty_set.
% 1.74/1.95 ** KEPT (pick-wt=8): 26 [] -in(A,set_intersection2(B,C))| -disjoint(B,C).
% 1.74/1.95 ** KEPT (pick-wt=5): 27 [] -empty(A)|A=empty_set.
% 1.74/1.95 ** KEPT (pick-wt=5): 28 [] -in(A,B)| -empty(B).
% 1.74/1.95 ** KEPT (pick-wt=5): 29 [] -subset($c4,set_union2($c4,$c3)).
% 1.74/1.95 ** KEPT (pick-wt=7): 30 [] -empty(A)|A=B| -empty(B).
% 1.74/1.95
% 1.74/1.95 ------------> process sos:
% 1.74/1.95 ** KEPT (pick-wt=3): 43 [] A=A.
% 1.74/1.95 ** KEPT (pick-wt=7): 44 [] set_union2(A,B)=set_union2(B,A).
% 1.74/1.95 ** KEPT (pick-wt=7): 45 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.74/1.95 ** KEPT (pick-wt=7): 46 [] A=empty_set|in($f1(A),A).
% 1.74/1.95 ** KEPT (pick-wt=23): 47 [] A=set_union2(B,C)|in($f2(B,C,A),A)|in($f2(B,C,A),B)|in($f2(B,C,A),C).
% 1.74/1.95 ** KEPT (pick-wt=8): 48 [] subset(A,B)|in($f3(A,B),A).
% 1.74/1.95 ** KEPT (pick-wt=17): 49 [] A=set_intersection2(B,C)|in($f4(B,C,A),A)|in($f4(B,C,A),B).
% 1.74/1.95 ** KEPT (pick-wt=17): 50 [] A=set_intersection2(B,C)|in($f4(B,C,A),A)|in($f4(B,C,A),C).
% 1.74/1.95 ** KEPT (pick-wt=2): 51 [] empty(empty_set).
% 1.74/1.95 ** KEPT (pick-wt=5): 52 [] set_union2(A,A)=A.
% 1.74/1.95 ---> New Demodulator: 53 [new_demod,52] set_union2(A,A)=A.
% 1.74/1.95 ** KEPT (pick-wt=5): 54 [] set_intersection2(A,A)=A.
% 1.74/1.95 ---> New Demodulator: 55 [new_demod,54] set_intersection2(A,A)=A.
% 1.74/1.95 ** KEPT (pick-wt=2): 56 [] empty($c1).
% 1.74/1.95 ** KEPT (pick-wt=3): 57 [] subset(A,A).
% 1.74/1.95 ** KEPT (pick-wt=5): 58 [] set_union2(A,empty_set)=A.
% 1.74/1.95 ---> New Demodulator: 59 [new_demod,58] set_union2(A,empty_set)=A.
% 1.74/1.95 ** KEPT (pick-wt=3): 60 [] subset(empty_set,A).
% 1.74/1.95 ** KEPT (pick-wt=8): 61 [] disjoint(A,B)|in($f5(A,B),A).
% 1.74/1.95 ** KEPT (pick-wt=8): 62 [] disjoint(A,B)|in($f5(A,B),B).
% 1.74/1.95 ** KEPT (pick-wt=10): 63 [] disjoint(A,B)|in($f6(A,B),set_intersection2(A,B)).
% 1.74/1.95 Following clause subsumed by 43 during input processing: 0 [copy,43,flip.1] A=A.
% 1.74/1.95 43 back subsumes 41.
% 1.74/1.95 43 back subsumes 32.
% 1.74/1.95 Following clause subsumed by 44 during input processing: 0 [copy,44,Alarm clock
% 299.89/300.04 Otter interrupted
% 299.89/300.04 PROOF NOT FOUND
%------------------------------------------------------------------------------