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