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