TSTP Solution File: SEU250+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU250+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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 : Unknown 66.94s 67.13s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU250+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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:02:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.77/1.99 ----- Otter 3.3f, August 2004 -----
% 1.77/1.99 The process was started by sandbox on n012.cluster.edu,
% 1.77/1.99 Wed Jul 27 08:02:50 2022
% 1.77/1.99 The command was "./otter". The process ID is 7362.
% 1.77/1.99
% 1.77/1.99 set(prolog_style_variables).
% 1.77/1.99 set(auto).
% 1.77/1.99 dependent: set(auto1).
% 1.77/1.99 dependent: set(process_input).
% 1.77/1.99 dependent: clear(print_kept).
% 1.77/1.99 dependent: clear(print_new_demod).
% 1.77/1.99 dependent: clear(print_back_demod).
% 1.77/1.99 dependent: clear(print_back_sub).
% 1.77/1.99 dependent: set(control_memory).
% 1.77/1.99 dependent: assign(max_mem, 12000).
% 1.77/1.99 dependent: assign(pick_given_ratio, 4).
% 1.77/1.99 dependent: assign(stats_level, 1).
% 1.77/1.99 dependent: assign(max_seconds, 10800).
% 1.77/1.99 clear(print_given).
% 1.77/1.99
% 1.77/1.99 formula_list(usable).
% 1.77/1.99 all A (A=A).
% 1.77/1.99 all A B (in(A,B)-> -in(B,A)).
% 1.77/1.99 all A (empty(A)->function(A)).
% 1.77/1.99 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.77/1.99 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.77/1.99 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.77/1.99 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.77/1.99 all A (relation(A)->relation_field(A)=set_union2(relation_dom(A),relation_rng(A))).
% 1.77/1.99 all A (relation(A)-> (all B (relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B))))).
% 1.77/1.99 $T.
% 1.77/1.99 $T.
% 1.77/1.99 $T.
% 1.77/1.99 $T.
% 1.77/1.99 all A B (relation(A)->relation(relation_restriction(A,B))).
% 1.77/1.99 $T.
% 1.77/1.99 $T.
% 1.77/1.99 $T.
% 1.77/1.99 $T.
% 1.77/1.99 $T.
% 1.77/1.99 all A exists B element(B,A).
% 1.77/1.99 empty(empty_set).
% 1.77/1.99 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.77/1.99 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.77/1.99 all A B (set_union2(A,A)=A).
% 1.77/1.99 all A B (set_intersection2(A,A)=A).
% 1.77/1.99 exists A (relation(A)&function(A)).
% 1.77/1.99 exists A empty(A).
% 1.77/1.99 exists A (relation(A)&empty(A)&function(A)).
% 1.77/1.99 exists A (-empty(A)).
% 1.77/1.99 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.77/1.99 all A B subset(A,A).
% 1.77/1.99 all A B C (relation(C)-> (in(A,relation_field(relation_restriction(C,B)))->in(A,relation_field(C))&in(A,B))).
% 1.77/1.99 all A (set_union2(A,empty_set)=A).
% 1.77/1.99 all A B (in(A,B)->element(A,B)).
% 1.77/1.99 -(all A B (relation(B)->subset(relation_field(relation_restriction(B,A)),relation_field(B))&subset(relation_field(relation_restriction(B,A)),A))).
% 1.77/1.99 all A (set_intersection2(A,empty_set)=empty_set).
% 1.77/1.99 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.77/1.99 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.77/1.99 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.77/1.99 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.77/1.99 all A (empty(A)->A=empty_set).
% 1.77/1.99 all A B (-(in(A,B)&empty(B))).
% 1.77/1.99 all A B (-(empty(A)&A!=B&empty(B))).
% 1.77/1.99 end_of_list.
% 1.77/1.99
% 1.77/1.99 -------> usable clausifies to:
% 1.77/1.99
% 1.77/1.99 list(usable).
% 1.77/1.99 0 [] A=A.
% 1.77/1.99 0 [] -in(A,B)| -in(B,A).
% 1.77/1.99 0 [] -empty(A)|function(A).
% 1.77/1.99 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.77/1.99 0 [] set_union2(A,B)=set_union2(B,A).
% 1.77/1.99 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.77/1.99 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.77/1.99 0 [] subset(A,B)|in($f1(A,B),A).
% 1.77/1.99 0 [] subset(A,B)| -in($f1(A,B),B).
% 1.77/1.99 0 [] -relation(A)|relation_field(A)=set_union2(relation_dom(A),relation_rng(A)).
% 1.77/1.99 0 [] -relation(A)|relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B)).
% 1.77/1.99 0 [] $T.
% 1.77/1.99 0 [] $T.
% 1.77/1.99 0 [] $T.
% 1.77/1.99 0 [] $T.
% 1.77/1.99 0 [] -relation(A)|relation(relation_restriction(A,B)).
% 1.77/1.99 0 [] $T.
% 1.77/1.99 0 [] $T.
% 1.77/1.99 0 [] $T.
% 1.77/1.99 0 [] $T.
% 1.77/1.99 0 [] $T.
% 1.77/1.99 0 [] element($f2(A),A).
% 1.77/1.99 0 [] empty(empty_set).
% 1.77/1.99 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.77/1.99 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.77/1.99 0 [] set_union2(A,A)=A.
% 1.77/1.99 0 [] set_intersection2(A,A)=A.
% 1.77/1.99 0 [] relation($c1).
% 1.77/1.99 0 [] function($c1).
% 1.77/1.99 0 [] empty($c2).
% 1.77/1.99 0 [] relation($c3).
% 1.77/1.99 0 [] empty($c3).
% 1.77/1.99 0 [] function($c3).
% 1.77/1.99 0 [] -empty($c4).
% 1.77/1.99 0 [] relation($c5).
% 1.77/1.99 0 [] function($c5).
% 1.77/1.99 0 [] one_to_one($c5).
% 1.77/1.99 0 [] subset(A,A).
% 1.77/1.99 0 [] -relation(C)| -in(A,relation_field(relation_restriction(C,B)))|in(A,relation_field(C)).
% 1.77/1.99 0 [] -relation(C)| -in(A,relation_field(relation_restriction(C,B)))|in(A,B).
% 1.77/1.99 0 [] set_union2(A,empty_set)=A.
% 1.77/1.99 0 [] -in(A,B)|element(A,B).
% 1.77/1.99 0 [] relation($c6).
% 1.77/1.99 0 [] -subset(relation_field(relation_restriction($c6,$c7)),relation_field($c6))| -subset(relation_field(relation_restriction($c6,$c7)),$c7).
% 1.77/1.99 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.77/1.99 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.77/1.99 0 [] -element(A,powerset(B))|subset(A,B).
% 1.77/1.99 0 [] element(A,powerset(B))| -subset(A,B).
% 1.77/1.99 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.77/1.99 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.77/1.99 0 [] -empty(A)|A=empty_set.
% 1.77/1.99 0 [] -in(A,B)| -empty(B).
% 1.77/1.99 0 [] -empty(A)|A=B| -empty(B).
% 1.77/1.99 end_of_list.
% 1.77/1.99
% 1.77/1.99 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.77/1.99
% 1.77/1.99 This ia a non-Horn set with equality. The strategy will be
% 1.77/1.99 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.77/1.99 deletion, with positive clauses in sos and nonpositive
% 1.77/1.99 clauses in usable.
% 1.77/1.99
% 1.77/1.99 dependent: set(knuth_bendix).
% 1.77/1.99 dependent: set(anl_eq).
% 1.77/1.99 dependent: set(para_from).
% 1.77/1.99 dependent: set(para_into).
% 1.77/1.99 dependent: clear(para_from_right).
% 1.77/1.99 dependent: clear(para_into_right).
% 1.77/1.99 dependent: set(para_from_vars).
% 1.77/1.99 dependent: set(eq_units_both_ways).
% 1.77/1.99 dependent: set(dynamic_demod_all).
% 1.77/1.99 dependent: set(dynamic_demod).
% 1.77/1.99 dependent: set(order_eq).
% 1.77/1.99 dependent: set(back_demod).
% 1.77/1.99 dependent: set(lrpo).
% 1.77/1.99 dependent: set(hyper_res).
% 1.77/1.99 dependent: set(unit_deletion).
% 1.77/1.99 dependent: set(factor).
% 1.77/1.99
% 1.77/1.99 ------------> process usable:
% 1.77/1.99 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.77/1.99 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.77/1.99 ** KEPT (pick-wt=8): 3 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.77/1.99 ** KEPT (pick-wt=9): 4 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.77/1.99 ** KEPT (pick-wt=8): 5 [] subset(A,B)| -in($f1(A,B),B).
% 1.77/1.99 ** KEPT (pick-wt=10): 7 [copy,6,flip.2] -relation(A)|set_union2(relation_dom(A),relation_rng(A))=relation_field(A).
% 1.77/1.99 ** KEPT (pick-wt=11): 9 [copy,8,flip.2] -relation(A)|set_intersection2(A,cartesian_product2(B,B))=relation_restriction(A,B).
% 1.77/1.99 ** KEPT (pick-wt=6): 10 [] -relation(A)|relation(relation_restriction(A,B)).
% 1.77/1.99 ** KEPT (pick-wt=6): 11 [] empty(A)| -empty(set_union2(A,B)).
% 1.77/1.99 ** KEPT (pick-wt=6): 12 [] empty(A)| -empty(set_union2(B,A)).
% 1.77/1.99 ** KEPT (pick-wt=2): 13 [] -empty($c4).
% 1.77/1.99 ** KEPT (pick-wt=12): 14 [] -relation(A)| -in(B,relation_field(relation_restriction(A,C)))|in(B,relation_field(A)).
% 1.77/1.99 ** KEPT (pick-wt=11): 15 [] -relation(A)| -in(B,relation_field(relation_restriction(A,C)))|in(B,C).
% 1.77/1.99 ** KEPT (pick-wt=6): 16 [] -in(A,B)|element(A,B).
% 1.77/1.99 ** KEPT (pick-wt=13): 17 [] -subset(relation_field(relation_restriction($c6,$c7)),relation_field($c6))| -subset(relation_field(relation_restriction($c6,$c7)),$c7).
% 1.77/1.99 ** KEPT (pick-wt=8): 18 [] -element(A,B)|empty(B)|in(A,B).
% 1.77/1.99 ** KEPT (pick-wt=7): 19 [] -element(A,powerset(B))|subset(A,B).
% 1.77/1.99 ** KEPT (pick-wt=7): 20 [] element(A,powerset(B))| -subset(A,B).
% 1.77/1.99 ** KEPT (pick-wt=10): 21 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.77/1.99 ** KEPT (pick-wt=9): 22 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.77/1.99 ** KEPT (pick-wt=5): 23 [] -empty(A)|A=empty_set.
% 1.77/1.99 ** KEPT (pick-wt=5): 24 [] -in(A,B)| -empty(B).
% 1.77/1.99 ** KEPT (pick-wt=7): 25 [] -empty(A)|A=B| -empty(B).
% 1.77/1.99
% 1.77/1.99 ------------> process sos:
% 1.77/1.99 ** KEPT (pick-wt=3): 28 [] A=A.
% 1.77/1.99 ** KEPT (pick-wt=7): 29 [] set_union2(A,B)=set_union2(B,A).
% 1.77/1.99 ** KEPT (pick-wt=7): 30 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.77/1.99 ** KEPT (pick-wt=8): 31 [] subset(A,B)|in($f1(A,B),A).
% 1.77/1.99 ** KEPT (pick-wt=4): 32 [] element($f2(A),A).
% 1.77/1.99 ** KEPT (pick-wt=2): 33 [] empty(empty_set).
% 1.77/1.99 ** KEPT (pick-wt=5): 34 [] set_union2(A,A)=A.
% 1.77/1.99 ---> New Demodulator: 35 [new_demod,34] set_union2(A,A)=A.
% 1.77/1.99 ** KEPT (pick-wt=5): 36 [] set_intersection2(A,A)=A.
% 1.77/1.99 ---> New Demodulator: 37 [new_demod,36] set_intersection2(A,A)=A.
% 1.77/1.99 ** KEPT (pick-wt=2): 38 [] relation($c1).
% 1.77/1.99 ** KEPT (pick-wt=2): 39 [] function($c1).
% 1.77/1.99 ** KEPT (pick-wt=2): 40 [] empty($c2).
% 1.77/1.99 ** KEPT (pick-wt=2): 41 [] relation($c3).
% 1.77/1.99 ** KEPT (pick-wt=2): 42 [] empty($c3).
% 1.77/1.99 ** KEPT (pick-wt=2): 43 [] function($c3).
% 1.77/1.99 ** KEPT (pick-wt=2): 44 [] relation($c5).
% 1.77/1.99 ** KEPT (pick-wt=2): 45 [] function($c5).
% 1.77/1.99 ** KEPT (pick-wt=2): 46 [] one_to_one($c5).
% 1.77/1.99 ** KEPT (pick-wt=3): 47 [] subset(A,A).
% 1.77/1.99 ** KEPT (pick-wt=5): 48 [] set_union2(A,empty_set)=A.
% 1.77/1.99 ---> New Demodulator: 49 [new_demod,48] set_union2(A,empty_set)=A.
% 1.77/1.99 ** KEPT (pick-wt=2): 50 [] relation($c6).
% 1.77/1.99 ** KEPT (pick-wt=5): 51 [] set_intersection2(A,empty_set)=empty_set.
% 1.77/1.99 ---> New Demodulator: 52 [new_demod,51] set_intersection2(A,empty_set)=empty_set.
% 1.77/1.99 Following clause subsumed by 28 during input processing: 0 [copy,28,flip.1] A=A.
% 1.77/1.99 28 back subsumes 27.
% 1.77/1.99 Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] set_union2(A,B)=set_union2(B,A).
% 1.77/1.99 Following clause subsumed by 30 during input processing: 0 [copy,30,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 66.94/67.13 >>>> Starting back demodulation with 35.
% 66.94/67.13 >>>> Starting back demodulation with 37.
% 66.94/67.13 >>>> Starting back demodulation with 49.
% 66.94/67.13 >>>> Starting back demodulation with 52.
% 66.94/67.13
% 66.94/67.13 ======= end of input processing =======
% 66.94/67.13
% 66.94/67.13 =========== start of search ===========
% 66.94/67.13
% 66.94/67.13
% 66.94/67.13 Resetting weight limit to 8.
% 66.94/67.13
% 66.94/67.13
% 66.94/67.13 Resetting weight limit to 8.
% 66.94/67.13
% 66.94/67.13 sos_size=888
% 66.94/67.13
% 66.94/67.13 Search stopped because sos empty.
% 66.94/67.13
% 66.94/67.13
% 66.94/67.13 Search stopped because sos empty.
% 66.94/67.13
% 66.94/67.13 ============ end of search ============
% 66.94/67.13
% 66.94/67.13 -------------- statistics -------------
% 66.94/67.13 clauses given 1255
% 66.94/67.13 clauses generated 6838984
% 66.94/67.13 clauses kept 1747
% 66.94/67.13 clauses forward subsumed 15572
% 66.94/67.13 clauses back subsumed 376
% 66.94/67.13 Kbytes malloced 7812
% 66.94/67.13
% 66.94/67.13 ----------- times (seconds) -----------
% 66.94/67.13 user CPU time 65.14 (0 hr, 1 min, 5 sec)
% 66.94/67.13 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 66.94/67.13 wall-clock time 67 (0 hr, 1 min, 7 sec)
% 66.94/67.13
% 66.94/67.13 Process 7362 finished Wed Jul 27 08:03:57 2022
% 66.94/67.13 Otter interrupted
% 66.94/67.13 PROOF NOT FOUND
%------------------------------------------------------------------------------