TSTP Solution File: SEU251+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU251+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:15:20 EDT 2022
% Result : Timeout 299.92s 300.04s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU251+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 07:59:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.16/2.29 ----- Otter 3.3f, August 2004 -----
% 2.16/2.29 The process was started by sandbox2 on n020.cluster.edu,
% 2.16/2.29 Wed Jul 27 07:59:08 2022
% 2.16/2.29 The command was "./otter". The process ID is 31391.
% 2.16/2.29
% 2.16/2.29 set(prolog_style_variables).
% 2.16/2.29 set(auto).
% 2.16/2.29 dependent: set(auto1).
% 2.16/2.29 dependent: set(process_input).
% 2.16/2.29 dependent: clear(print_kept).
% 2.16/2.29 dependent: clear(print_new_demod).
% 2.16/2.29 dependent: clear(print_back_demod).
% 2.16/2.29 dependent: clear(print_back_sub).
% 2.16/2.29 dependent: set(control_memory).
% 2.16/2.29 dependent: assign(max_mem, 12000).
% 2.16/2.29 dependent: assign(pick_given_ratio, 4).
% 2.16/2.29 dependent: assign(stats_level, 1).
% 2.16/2.29 dependent: assign(max_seconds, 10800).
% 2.16/2.29 clear(print_given).
% 2.16/2.29
% 2.16/2.29 formula_list(usable).
% 2.16/2.29 all A (A=A).
% 2.16/2.29 all A B (in(A,B)-> -in(B,A)).
% 2.16/2.29 all A (empty(A)->function(A)).
% 2.16/2.29 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.16/2.29 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.16/2.29 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.16/2.29 all A (relation(A)-> (all B C (C=fiber(A,B)<-> (all D (in(D,C)<->D!=B&in(ordered_pair(D,B),A)))))).
% 2.16/2.29 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.16/2.29 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.16/2.29 all A (relation(A)-> (all B (relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B))))).
% 2.16/2.29 $T.
% 2.16/2.29 $T.
% 2.16/2.29 $T.
% 2.16/2.29 $T.
% 2.16/2.29 $T.
% 2.16/2.29 all A B (relation(A)->relation(relation_restriction(A,B))).
% 2.16/2.29 $T.
% 2.16/2.29 $T.
% 2.16/2.29 $T.
% 2.16/2.29 $T.
% 2.16/2.29 all A exists B element(B,A).
% 2.16/2.29 empty(empty_set).
% 2.16/2.29 all A B (-empty(ordered_pair(A,B))).
% 2.16/2.29 all A B (set_intersection2(A,A)=A).
% 2.16/2.29 exists A (relation(A)&function(A)).
% 2.16/2.29 exists A empty(A).
% 2.16/2.29 exists A (relation(A)&empty(A)&function(A)).
% 2.16/2.29 exists A (-empty(A)).
% 2.16/2.29 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.16/2.29 all A B subset(A,A).
% 2.16/2.29 all A B C (relation(C)-> (in(A,relation_restriction(C,B))<->in(A,C)&in(A,cartesian_product2(B,B)))).
% 2.16/2.29 all A B (in(A,B)->element(A,B)).
% 2.16/2.29 -(all A B C (relation(C)->subset(fiber(relation_restriction(C,A),B),fiber(C,B)))).
% 2.16/2.29 all A (set_intersection2(A,empty_set)=empty_set).
% 2.16/2.29 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.16/2.29 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.16/2.29 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.16/2.29 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.16/2.29 all A (empty(A)->A=empty_set).
% 2.16/2.29 all A B (-(in(A,B)&empty(B))).
% 2.16/2.29 all A B (-(empty(A)&A!=B&empty(B))).
% 2.16/2.29 end_of_list.
% 2.16/2.29
% 2.16/2.29 -------> usable clausifies to:
% 2.16/2.29
% 2.16/2.29 list(usable).
% 2.16/2.29 0 [] A=A.
% 2.16/2.29 0 [] -in(A,B)| -in(B,A).
% 2.16/2.29 0 [] -empty(A)|function(A).
% 2.16/2.29 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.16/2.29 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.16/2.29 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.16/2.29 0 [] -relation(A)|C!=fiber(A,B)| -in(D,C)|D!=B.
% 2.16/2.29 0 [] -relation(A)|C!=fiber(A,B)| -in(D,C)|in(ordered_pair(D,B),A).
% 2.16/2.29 0 [] -relation(A)|C!=fiber(A,B)|in(D,C)|D=B| -in(ordered_pair(D,B),A).
% 2.16/2.29 0 [] -relation(A)|C=fiber(A,B)|in($f1(A,B,C),C)|$f1(A,B,C)!=B.
% 2.16/2.29 0 [] -relation(A)|C=fiber(A,B)|in($f1(A,B,C),C)|in(ordered_pair($f1(A,B,C),B),A).
% 2.16/2.29 0 [] -relation(A)|C=fiber(A,B)| -in($f1(A,B,C),C)|$f1(A,B,C)=B| -in(ordered_pair($f1(A,B,C),B),A).
% 2.16/2.29 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.16/2.29 0 [] subset(A,B)|in($f2(A,B),A).
% 2.16/2.29 0 [] subset(A,B)| -in($f2(A,B),B).
% 2.16/2.29 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.16/2.29 0 [] -relation(A)|relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B)).
% 2.16/2.29 0 [] $T.
% 2.16/2.29 0 [] $T.
% 2.16/2.29 0 [] $T.
% 2.16/2.29 0 [] $T.
% 2.16/2.29 0 [] $T.
% 2.16/2.29 0 [] -relation(A)|relation(relation_restriction(A,B)).
% 2.16/2.29 0 [] $T.
% 2.16/2.29 0 [] $T.
% 2.16/2.29 0 [] $T.
% 2.16/2.29 0 [] $T.
% 2.16/2.29 0 [] element($f3(A),A).
% 2.16/2.29 0 [] empty(empty_set).
% 2.16/2.29 0 [] -empty(ordered_pair(A,B)).
% 2.16/2.29 0 [] set_intersection2(A,A)=A.
% 2.16/2.29 0 [] relation($c1).
% 2.16/2.29 0 [] function($c1).
% 2.16/2.29 0 [] empty($c2).
% 2.16/2.29 0 [] relation($c3).
% 2.16/2.29 0 [] empty($c3).
% 2.16/2.29 0 [] function($c3).
% 2.16/2.29 0 [] -empty($c4).
% 2.16/2.29 0 [] relation($c5).
% 2.16/2.29 0 [] function($c5).
% 2.16/2.29 0 [] one_to_one($c5).
% 2.16/2.29 0 [] subset(A,A).
% 2.16/2.29 0 [] -relation(C)| -in(A,relation_restriction(C,B))|in(A,C).
% 2.16/2.29 0 [] -relation(C)| -in(A,relation_restriction(C,B))|in(A,cartesian_product2(B,B)).
% 2.16/2.29 0 [] -relation(C)|in(A,relation_restriction(C,B))| -in(A,C)| -in(A,cartesian_product2(B,B)).
% 2.16/2.29 0 [] -in(A,B)|element(A,B).
% 2.16/2.29 0 [] relation($c6).
% 2.16/2.29 0 [] -subset(fiber(relation_restriction($c6,$c8),$c7),fiber($c6,$c7)).
% 2.16/2.29 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.16/2.29 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.16/2.29 0 [] -element(A,powerset(B))|subset(A,B).
% 2.16/2.29 0 [] element(A,powerset(B))| -subset(A,B).
% 2.16/2.29 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.16/2.29 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.16/2.29 0 [] -empty(A)|A=empty_set.
% 2.16/2.29 0 [] -in(A,B)| -empty(B).
% 2.16/2.29 0 [] -empty(A)|A=B| -empty(B).
% 2.16/2.29 end_of_list.
% 2.16/2.29
% 2.16/2.29 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.16/2.29
% 2.16/2.29 This ia a non-Horn set with equality. The strategy will be
% 2.16/2.29 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.16/2.29 deletion, with positive clauses in sos and nonpositive
% 2.16/2.29 clauses in usable.
% 2.16/2.29
% 2.16/2.29 dependent: set(knuth_bendix).
% 2.16/2.29 dependent: set(anl_eq).
% 2.16/2.29 dependent: set(para_from).
% 2.16/2.29 dependent: set(para_into).
% 2.16/2.29 dependent: clear(para_from_right).
% 2.16/2.29 dependent: clear(para_into_right).
% 2.16/2.29 dependent: set(para_from_vars).
% 2.16/2.29 dependent: set(eq_units_both_ways).
% 2.16/2.29 dependent: set(dynamic_demod_all).
% 2.16/2.29 dependent: set(dynamic_demod).
% 2.16/2.29 dependent: set(order_eq).
% 2.16/2.29 dependent: set(back_demod).
% 2.16/2.29 dependent: set(lrpo).
% 2.16/2.29 dependent: set(hyper_res).
% 2.16/2.29 dependent: set(unit_deletion).
% 2.16/2.29 dependent: set(factor).
% 2.16/2.29
% 2.16/2.29 ------------> process usable:
% 2.16/2.29 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.16/2.29 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.16/2.29 ** KEPT (pick-wt=8): 3 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.16/2.29 ** KEPT (pick-wt=13): 4 [] -relation(A)|B!=fiber(A,C)| -in(D,B)|D!=C.
% 2.16/2.29 ** KEPT (pick-wt=15): 5 [] -relation(A)|B!=fiber(A,C)| -in(D,B)|in(ordered_pair(D,C),A).
% 2.16/2.29 ** KEPT (pick-wt=18): 6 [] -relation(A)|B!=fiber(A,C)|in(D,B)|D=C| -in(ordered_pair(D,C),A).
% 2.16/2.29 ** KEPT (pick-wt=19): 7 [] -relation(A)|B=fiber(A,C)|in($f1(A,C,B),B)|$f1(A,C,B)!=C.
% 2.16/2.29 ** KEPT (pick-wt=21): 8 [] -relation(A)|B=fiber(A,C)|in($f1(A,C,B),B)|in(ordered_pair($f1(A,C,B),C),A).
% 2.16/2.29 ** KEPT (pick-wt=27): 9 [] -relation(A)|B=fiber(A,C)| -in($f1(A,C,B),B)|$f1(A,C,B)=C| -in(ordered_pair($f1(A,C,B),C),A).
% 2.16/2.29 ** KEPT (pick-wt=9): 10 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.16/2.29 ** KEPT (pick-wt=8): 11 [] subset(A,B)| -in($f2(A,B),B).
% 2.16/2.29 ** KEPT (pick-wt=11): 13 [copy,12,flip.2] -relation(A)|set_intersection2(A,cartesian_product2(B,B))=relation_restriction(A,B).
% 2.16/2.29 ** KEPT (pick-wt=6): 14 [] -relation(A)|relation(relation_restriction(A,B)).
% 2.16/2.29 ** KEPT (pick-wt=4): 15 [] -empty(ordered_pair(A,B)).
% 2.16/2.29 ** KEPT (pick-wt=2): 16 [] -empty($c4).
% 2.16/2.29 ** KEPT (pick-wt=10): 17 [] -relation(A)| -in(B,relation_restriction(A,C))|in(B,A).
% 2.16/2.29 ** KEPT (pick-wt=12): 18 [] -relation(A)| -in(B,relation_restriction(A,C))|in(B,cartesian_product2(C,C)).
% 2.16/2.29 ** KEPT (pick-wt=15): 19 [] -relation(A)|in(B,relation_restriction(A,C))| -in(B,A)| -in(B,cartesian_product2(C,C)).
% 2.16/2.29 ** KEPT (pick-wt=6): 20 [] -in(A,B)|element(A,B).
% 2.16/2.29 ** KEPT (pick-wt=9): 21 [] -subset(fiber(relation_restriction($c6,$c8),$c7),fiber($c6,$c7)).
% 2.16/2.29 ** KEPT (pick-wt=8): 22 [] -element(A,B)|empty(B)|in(A,B).
% 2.16/2.29 ** KEPT (pick-wt=7): 23 [] -element(A,powerset(B))|subset(A,B).
% 2.16/2.29 ** KEPT (pick-wt=7): 24 [] element(A,powerset(B))| -subset(A,B).
% 2.16/2.29 ** KEPT (pick-wt=10): 25 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.16/2.29 ** KEPT (pick-wt=9): 26 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.16/2.29 ** KEPT (pick-wt=5): 27 [] -empty(A)|A=empty_set.
% 2.16/2.29 ** KEPT (pick-wt=5): 28 [] -in(A,B)| -empty(B).
% 2.16/2.29 ** KEPT (pick-wt=7): 29 [] -empty(A)|A=B| -empty(B).
% 2.16/2.29
% 2.16/2.29 ------------> process sos:
% 2.16/2.29 ** KEPT (pick-wt=3): 33 [] A=A.
% 2.16/2.29 ** KEPT (pick-wt=7): 34 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.16/2.29 ** KEPT (pick-wt=7): 35 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.16/2.29 ** KEPT (pick-wt=8): 36 [] subset(A,B)|in($f2(A,B),A).
% 2.16/2.29 ** KEPT (pick-wt=10): 38 [copy,37,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.16/2.29 ---> New Demodulator: 39 [new_demod,38] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.16/2.29 ** KEPT (pick-wt=4): 40 [] element($f3(A),A).
% 2.16/2.29 ** KEPT (pick-wt=2): 41 [] empty(empty_set).
% 2.16/2.29 ** KEPT (pick-wt=5): 42 [] set_intersection2(A,A)=A.
% 2.16/2.29 ---> New Demodulator: 43 [new_demod,42] set_intersection2(A,A)=A.
% 2.16/2.29 ** KEPT (pick-wt=2): 44 [] relation($c1).
% 2.16/2.29 ** KEPT (pick-wt=2): 45 [] function($c1).
% 2.16/2.29 ** KEPT (pick-wt=2): 46 [] empty($c2).
% 2.16/2.29 ** KEPT (pick-wt=2): 47 [] relation($c3).
% 2.16/2.29 ** KEPT (pick-wt=2): 48 [] empty($c3).
% 2.16/2.29 ** KEPT (pick-wtAlarm clock
% 299.92/300.04 Otter interrupted
% 299.92/300.04 PROOF NOT FOUND
%------------------------------------------------------------------------------