TSTP Solution File: SEU037+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU037+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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:41 EDT 2022
% Result : Timeout 299.93s 300.10s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU037+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Jul 27 07:29:21 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.94/2.15 ----- Otter 3.3f, August 2004 -----
% 1.94/2.15 The process was started by sandbox2 on n004.cluster.edu,
% 1.94/2.15 Wed Jul 27 07:29:21 2022
% 1.94/2.15 The command was "./otter". The process ID is 20122.
% 1.94/2.15
% 1.94/2.15 set(prolog_style_variables).
% 1.94/2.15 set(auto).
% 1.94/2.15 dependent: set(auto1).
% 1.94/2.15 dependent: set(process_input).
% 1.94/2.15 dependent: clear(print_kept).
% 1.94/2.15 dependent: clear(print_new_demod).
% 1.94/2.15 dependent: clear(print_back_demod).
% 1.94/2.15 dependent: clear(print_back_sub).
% 1.94/2.15 dependent: set(control_memory).
% 1.94/2.15 dependent: assign(max_mem, 12000).
% 1.94/2.15 dependent: assign(pick_given_ratio, 4).
% 1.94/2.15 dependent: assign(stats_level, 1).
% 1.94/2.15 dependent: assign(max_seconds, 10800).
% 1.94/2.15 clear(print_given).
% 1.94/2.15
% 1.94/2.15 formula_list(usable).
% 1.94/2.15 all A (A=A).
% 1.94/2.15 all A B (in(A,B)-> -in(B,A)).
% 1.94/2.15 all A (empty(A)->function(A)).
% 1.94/2.15 all A (empty(A)->relation(A)).
% 1.94/2.15 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.94/2.15 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.94/2.15 all A B (relation(A)->relation(relation_dom_restriction(A,B))).
% 1.94/2.15 all A exists B element(B,A).
% 1.94/2.15 empty(empty_set).
% 1.94/2.15 relation(empty_set).
% 1.94/2.15 relation_empty_yielding(empty_set).
% 1.94/2.15 all A B (relation(A)&relation_empty_yielding(A)->relation(relation_dom_restriction(A,B))&relation_empty_yielding(relation_dom_restriction(A,B))).
% 1.94/2.15 all A B (relation(A)&relation(B)->relation(set_intersection2(A,B))).
% 1.94/2.15 all A (-empty(powerset(A))).
% 1.94/2.15 empty(empty_set).
% 1.94/2.15 all A B (relation(A)&function(A)->relation(relation_dom_restriction(A,B))&function(relation_dom_restriction(A,B))).
% 1.94/2.15 empty(empty_set).
% 1.94/2.15 relation(empty_set).
% 1.94/2.15 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 1.94/2.15 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 1.94/2.15 all A B (set_intersection2(A,A)=A).
% 1.94/2.15 exists A (relation(A)&function(A)).
% 1.94/2.15 exists A (empty(A)&relation(A)).
% 1.94/2.15 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.94/2.15 exists A empty(A).
% 1.94/2.15 exists A (relation(A)&empty(A)&function(A)).
% 1.94/2.15 exists A (-empty(A)&relation(A)).
% 1.94/2.15 all A exists B (element(B,powerset(A))&empty(B)).
% 1.94/2.15 exists A (-empty(A)).
% 1.94/2.15 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.94/2.15 exists A (relation(A)&relation_empty_yielding(A)).
% 1.94/2.15 all A B subset(A,A).
% 1.94/2.15 all A B (in(A,B)->element(A,B)).
% 1.94/2.15 all A (set_intersection2(A,empty_set)=empty_set).
% 1.94/2.15 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.94/2.15 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.94/2.15 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.94/2.15 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.94/2.15 all A B (relation(B)&function(B)-> (all C (relation(C)&function(C)-> (B=relation_dom_restriction(C,A)<->relation_dom(B)=set_intersection2(relation_dom(C),A)& (all D (in(D,relation_dom(B))->apply(B,D)=apply(C,D))))))).
% 1.94/2.15 all A (empty(A)->A=empty_set).
% 1.94/2.15 -(all A B C (relation(C)&function(C)-> (in(B,set_intersection2(relation_dom(C),A))->apply(relation_dom_restriction(C,A),B)=apply(C,B)))).
% 1.94/2.15 all A B (-(in(A,B)&empty(B))).
% 1.94/2.15 all A B (-(empty(A)&A!=B&empty(B))).
% 1.94/2.15 end_of_list.
% 1.94/2.15
% 1.94/2.15 -------> usable clausifies to:
% 1.94/2.15
% 1.94/2.15 list(usable).
% 1.94/2.15 0 [] A=A.
% 1.94/2.15 0 [] -in(A,B)| -in(B,A).
% 1.94/2.15 0 [] -empty(A)|function(A).
% 1.94/2.15 0 [] -empty(A)|relation(A).
% 1.94/2.15 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.94/2.15 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.94/2.16 0 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 1.94/2.16 0 [] element($f1(A),A).
% 1.94/2.16 0 [] empty(empty_set).
% 1.94/2.16 0 [] relation(empty_set).
% 1.94/2.16 0 [] relation_empty_yielding(empty_set).
% 1.94/2.16 0 [] -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 1.94/2.16 0 [] -relation(A)| -relation_empty_yielding(A)|relation_empty_yielding(relation_dom_restriction(A,B)).
% 1.94/2.16 0 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 1.94/2.16 0 [] -empty(powerset(A)).
% 1.94/2.16 0 [] empty(empty_set).
% 1.94/2.16 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 1.94/2.16 0 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 1.94/2.16 0 [] empty(empty_set).
% 1.94/2.16 0 [] relation(empty_set).
% 1.94/2.16 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.94/2.16 0 [] -empty(A)|empty(relation_dom(A)).
% 1.94/2.16 0 [] -empty(A)|relation(relation_dom(A)).
% 1.94/2.16 0 [] set_intersection2(A,A)=A.
% 1.94/2.16 0 [] relation($c1).
% 1.94/2.16 0 [] function($c1).
% 1.94/2.16 0 [] empty($c2).
% 1.94/2.16 0 [] relation($c2).
% 1.94/2.16 0 [] empty(A)|element($f2(A),powerset(A)).
% 1.94/2.16 0 [] empty(A)| -empty($f2(A)).
% 1.94/2.16 0 [] empty($c3).
% 1.94/2.16 0 [] relation($c4).
% 1.94/2.16 0 [] empty($c4).
% 1.94/2.16 0 [] function($c4).
% 1.94/2.16 0 [] -empty($c5).
% 1.94/2.16 0 [] relation($c5).
% 1.94/2.16 0 [] element($f3(A),powerset(A)).
% 1.94/2.16 0 [] empty($f3(A)).
% 1.94/2.16 0 [] -empty($c6).
% 1.94/2.16 0 [] relation($c7).
% 1.94/2.16 0 [] function($c7).
% 1.94/2.16 0 [] one_to_one($c7).
% 1.94/2.16 0 [] relation($c8).
% 1.94/2.16 0 [] relation_empty_yielding($c8).
% 1.94/2.16 0 [] subset(A,A).
% 1.94/2.16 0 [] -in(A,B)|element(A,B).
% 1.94/2.16 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.94/2.16 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.94/2.16 0 [] -element(A,powerset(B))|subset(A,B).
% 1.94/2.16 0 [] element(A,powerset(B))| -subset(A,B).
% 1.94/2.16 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.94/2.16 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.94/2.16 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|B!=relation_dom_restriction(C,A)|relation_dom(B)=set_intersection2(relation_dom(C),A).
% 1.94/2.16 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|B!=relation_dom_restriction(C,A)| -in(D,relation_dom(B))|apply(B,D)=apply(C,D).
% 1.94/2.16 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|B=relation_dom_restriction(C,A)|relation_dom(B)!=set_intersection2(relation_dom(C),A)|in($f4(A,B,C),relation_dom(B)).
% 1.94/2.16 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|B=relation_dom_restriction(C,A)|relation_dom(B)!=set_intersection2(relation_dom(C),A)|apply(B,$f4(A,B,C))!=apply(C,$f4(A,B,C)).
% 1.94/2.16 0 [] -empty(A)|A=empty_set.
% 1.94/2.16 0 [] relation($c9).
% 1.94/2.16 0 [] function($c9).
% 1.94/2.16 0 [] in($c10,set_intersection2(relation_dom($c9),$c11)).
% 1.94/2.16 0 [] apply(relation_dom_restriction($c9,$c11),$c10)!=apply($c9,$c10).
% 1.94/2.16 0 [] -in(A,B)| -empty(B).
% 1.94/2.16 0 [] -empty(A)|A=B| -empty(B).
% 1.94/2.16 end_of_list.
% 1.94/2.16
% 1.94/2.16 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.94/2.16
% 1.94/2.16 This ia a non-Horn set with equality. The strategy will be
% 1.94/2.16 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.94/2.16 deletion, with positive clauses in sos and nonpositive
% 1.94/2.16 clauses in usable.
% 1.94/2.16
% 1.94/2.16 dependent: set(knuth_bendix).
% 1.94/2.16 dependent: set(anl_eq).
% 1.94/2.16 dependent: set(para_from).
% 1.94/2.16 dependent: set(para_into).
% 1.94/2.16 dependent: clear(para_from_right).
% 1.94/2.16 dependent: clear(para_into_right).
% 1.94/2.16 dependent: set(para_from_vars).
% 1.94/2.16 dependent: set(eq_units_both_ways).
% 1.94/2.16 dependent: set(dynamic_demod_all).
% 1.94/2.16 dependent: set(dynamic_demod).
% 1.94/2.16 dependent: set(order_eq).
% 1.94/2.16 dependent: set(back_demod).
% 1.94/2.16 dependent: set(lrpo).
% 1.94/2.16 dependent: set(hyper_res).
% 1.94/2.16 dependent: set(unit_deletion).
% 1.94/2.16 dependent: set(factor).
% 1.94/2.16
% 1.94/2.16 ------------> process usable:
% 1.94/2.16 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.94/2.16 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.94/2.16 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 1.94/2.16 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.94/2.16 ** KEPT (pick-wt=6): 5 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 1.94/2.16 Following clause subsumed by 5 during input processing: 0 [] -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 1.94/2.16 ** KEPT (pick-wt=8): 6 [] -relation(A)| -relation_empty_yielding(A)|relation_empty_yielding(relation_dom_restriction(A,B)).
% 1.94/2.16 ** KEPT (pick-wt=8): 7 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 1.94/2.16 ** KEPT (pick-wt=3): 8 [] -empty(powerset(A)).
% 1.94/2.16 Following clause subsumed by 5 during input processing: 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 1.94/2.16 ** KEPT (pick-wt=8): 9 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 1.94/2.16 ** KEPT (pick-wt=7): 10 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.94/2.16 ** KEPT (pick-wt=5): 11 [] -empty(A)|empty(relation_dom(A)).
% 1.94/2.16 ** KEPT (pick-wt=5): 12 [] -empty(A)|relation(relation_dom(A)).
% 1.94/2.16 ** KEPT (pick-wt=5): 13 [] empty(A)| -empty($f2(A)).
% 1.94/2.16 ** KEPT (pick-wt=2): 14 [] -empty($c5).
% 1.94/2.16 ** KEPT (pick-wt=2): 15 [] -empty($c6).
% 1.94/2.16 ** KEPT (pick-wt=6): 16 [] -in(A,B)|element(A,B).
% 1.94/2.16 ** KEPT (pick-wt=8): 17 [] -element(A,B)|empty(B)|in(A,B).
% 1.94/2.16 ** KEPT (pick-wt=7): 18 [] -element(A,powerset(B))|subset(A,B).
% 1.94/2.16 ** KEPT (pick-wt=7): 19 [] element(A,powerset(B))| -subset(A,B).
% 1.94/2.16 ** KEPT (pick-wt=10): 20 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.94/2.16 ** KEPT (pick-wt=9): 21 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.94/2.16 ** KEPT (pick-wt=20): 22 [] -relation(A)| -function(A)| -relation(B)| -function(B)|A!=relation_dom_restriction(B,C)|relation_domAlarm clock
% 299.93/300.10 Otter interrupted
% 299.93/300.10 PROOF NOT FOUND
%------------------------------------------------------------------------------