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