TSTP Solution File: SEU025+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU025+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:14:41 EDT 2022
% Result : Timeout 299.87s 300.04s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU025+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 07:54:18 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.99/2.16 ----- Otter 3.3f, August 2004 -----
% 1.99/2.16 The process was started by sandbox2 on n028.cluster.edu,
% 1.99/2.16 Wed Jul 27 07:54:19 2022
% 1.99/2.16 The command was "./otter". The process ID is 20104.
% 1.99/2.16
% 1.99/2.16 set(prolog_style_variables).
% 1.99/2.16 set(auto).
% 1.99/2.16 dependent: set(auto1).
% 1.99/2.16 dependent: set(process_input).
% 1.99/2.16 dependent: clear(print_kept).
% 1.99/2.16 dependent: clear(print_new_demod).
% 1.99/2.16 dependent: clear(print_back_demod).
% 1.99/2.16 dependent: clear(print_back_sub).
% 1.99/2.16 dependent: set(control_memory).
% 1.99/2.16 dependent: assign(max_mem, 12000).
% 1.99/2.16 dependent: assign(pick_given_ratio, 4).
% 1.99/2.16 dependent: assign(stats_level, 1).
% 1.99/2.16 dependent: assign(max_seconds, 10800).
% 1.99/2.16 clear(print_given).
% 1.99/2.16
% 1.99/2.16 formula_list(usable).
% 1.99/2.16 all A (A=A).
% 1.99/2.16 all A B (in(A,B)-> -in(B,A)).
% 1.99/2.16 all A (empty(A)->function(A)).
% 1.99/2.16 all A (empty(A)->relation(A)).
% 1.99/2.16 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.99/2.16 all A (relation(A)&function(A)->relation(function_inverse(A))&function(function_inverse(A))).
% 1.99/2.16 all A B (relation(A)&relation(B)->relation(relation_composition(A,B))).
% 1.99/2.16 all A exists B element(B,A).
% 1.99/2.16 all A B (empty(A)&relation(B)->empty(relation_composition(B,A))&relation(relation_composition(B,A))).
% 1.99/2.16 empty(empty_set).
% 1.99/2.16 relation(empty_set).
% 1.99/2.16 relation_empty_yielding(empty_set).
% 1.99/2.16 all A B (relation(A)&function(A)&relation(B)&function(B)->relation(relation_composition(A,B))&function(relation_composition(A,B))).
% 1.99/2.16 all A (-empty(powerset(A))).
% 1.99/2.16 empty(empty_set).
% 1.99/2.16 empty(empty_set).
% 1.99/2.16 relation(empty_set).
% 1.99/2.16 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 1.99/2.16 all A (-empty(A)&relation(A)-> -empty(relation_rng(A))).
% 1.99/2.16 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 1.99/2.16 all A (empty(A)->empty(relation_rng(A))&relation(relation_rng(A))).
% 1.99/2.16 all A B (empty(A)&relation(B)->empty(relation_composition(A,B))&relation(relation_composition(A,B))).
% 1.99/2.16 exists A (relation(A)&function(A)).
% 1.99/2.16 exists A (empty(A)&relation(A)).
% 1.99/2.16 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.99/2.16 exists A empty(A).
% 1.99/2.16 exists A (relation(A)&empty(A)&function(A)).
% 1.99/2.16 exists A (-empty(A)&relation(A)).
% 1.99/2.16 all A exists B (element(B,powerset(A))&empty(B)).
% 1.99/2.16 exists A (-empty(A)).
% 1.99/2.16 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.99/2.16 exists A (relation(A)&relation_empty_yielding(A)).
% 1.99/2.16 all A B subset(A,A).
% 1.99/2.16 all A B (in(A,B)->element(A,B)).
% 1.99/2.16 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.99/2.16 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.99/2.16 all A (relation(A)-> (all B (relation(B)-> (subset(relation_rng(A),relation_dom(B))->relation_dom(relation_composition(A,B))=relation_dom(A))))).
% 1.99/2.16 all A (relation(A)-> (all B (relation(B)-> (subset(relation_dom(A),relation_rng(B))->relation_rng(relation_composition(B,A))=relation_rng(A))))).
% 1.99/2.16 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.99/2.16 all A (relation(A)&function(A)-> (one_to_one(A)->relation_rng(A)=relation_dom(function_inverse(A))&relation_dom(A)=relation_rng(function_inverse(A)))).
% 1.99/2.16 -(all A (relation(A)&function(A)-> (one_to_one(A)->relation_dom(relation_composition(A,function_inverse(A)))=relation_dom(A)&relation_rng(relation_composition(A,function_inverse(A)))=relation_dom(A)))).
% 1.99/2.16 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.99/2.17 all A (empty(A)->A=empty_set).
% 1.99/2.17 all A B (-(in(A,B)&empty(B))).
% 1.99/2.17 all A B (-(empty(A)&A!=B&empty(B))).
% 1.99/2.17 end_of_list.
% 1.99/2.17
% 1.99/2.17 -------> usable clausifies to:
% 1.99/2.17
% 1.99/2.17 list(usable).
% 1.99/2.17 0 [] A=A.
% 1.99/2.17 0 [] -in(A,B)| -in(B,A).
% 1.99/2.17 0 [] -empty(A)|function(A).
% 1.99/2.17 0 [] -empty(A)|relation(A).
% 1.99/2.17 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.99/2.17 0 [] -relation(A)| -function(A)|relation(function_inverse(A)).
% 1.99/2.17 0 [] -relation(A)| -function(A)|function(function_inverse(A)).
% 1.99/2.17 0 [] -relation(A)| -relation(B)|relation(relation_composition(A,B)).
% 1.99/2.17 0 [] element($f1(A),A).
% 1.99/2.17 0 [] -empty(A)| -relation(B)|empty(relation_composition(B,A)).
% 1.99/2.17 0 [] -empty(A)| -relation(B)|relation(relation_composition(B,A)).
% 1.99/2.17 0 [] empty(empty_set).
% 1.99/2.17 0 [] relation(empty_set).
% 1.99/2.17 0 [] relation_empty_yielding(empty_set).
% 1.99/2.17 0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|relation(relation_composition(A,B)).
% 1.99/2.17 0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|function(relation_composition(A,B)).
% 1.99/2.17 0 [] -empty(powerset(A)).
% 1.99/2.17 0 [] empty(empty_set).
% 1.99/2.17 0 [] empty(empty_set).
% 1.99/2.17 0 [] relation(empty_set).
% 1.99/2.17 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.99/2.17 0 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 1.99/2.17 0 [] -empty(A)|empty(relation_dom(A)).
% 1.99/2.17 0 [] -empty(A)|relation(relation_dom(A)).
% 1.99/2.17 0 [] -empty(A)|empty(relation_rng(A)).
% 1.99/2.17 0 [] -empty(A)|relation(relation_rng(A)).
% 1.99/2.17 0 [] -empty(A)| -relation(B)|empty(relation_composition(A,B)).
% 1.99/2.17 0 [] -empty(A)| -relation(B)|relation(relation_composition(A,B)).
% 1.99/2.17 0 [] relation($c1).
% 1.99/2.17 0 [] function($c1).
% 1.99/2.17 0 [] empty($c2).
% 1.99/2.17 0 [] relation($c2).
% 1.99/2.17 0 [] empty(A)|element($f2(A),powerset(A)).
% 1.99/2.17 0 [] empty(A)| -empty($f2(A)).
% 1.99/2.17 0 [] empty($c3).
% 1.99/2.17 0 [] relation($c4).
% 1.99/2.17 0 [] empty($c4).
% 1.99/2.17 0 [] function($c4).
% 1.99/2.17 0 [] -empty($c5).
% 1.99/2.17 0 [] relation($c5).
% 1.99/2.17 0 [] element($f3(A),powerset(A)).
% 1.99/2.17 0 [] empty($f3(A)).
% 1.99/2.17 0 [] -empty($c6).
% 1.99/2.17 0 [] relation($c7).
% 1.99/2.17 0 [] function($c7).
% 1.99/2.17 0 [] one_to_one($c7).
% 1.99/2.17 0 [] relation($c8).
% 1.99/2.17 0 [] relation_empty_yielding($c8).
% 1.99/2.17 0 [] subset(A,A).
% 1.99/2.17 0 [] -in(A,B)|element(A,B).
% 1.99/2.17 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.99/2.17 0 [] -element(A,powerset(B))|subset(A,B).
% 1.99/2.17 0 [] element(A,powerset(B))| -subset(A,B).
% 1.99/2.17 0 [] -relation(A)| -relation(B)| -subset(relation_rng(A),relation_dom(B))|relation_dom(relation_composition(A,B))=relation_dom(A).
% 1.99/2.17 0 [] -relation(A)| -relation(B)| -subset(relation_dom(A),relation_rng(B))|relation_rng(relation_composition(B,A))=relation_rng(A).
% 1.99/2.17 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.99/2.17 0 [] -relation(A)| -function(A)| -one_to_one(A)|relation_rng(A)=relation_dom(function_inverse(A)).
% 1.99/2.17 0 [] -relation(A)| -function(A)| -one_to_one(A)|relation_dom(A)=relation_rng(function_inverse(A)).
% 1.99/2.17 0 [] relation($c9).
% 1.99/2.17 0 [] function($c9).
% 1.99/2.17 0 [] one_to_one($c9).
% 1.99/2.17 0 [] relation_dom(relation_composition($c9,function_inverse($c9)))!=relation_dom($c9)|relation_rng(relation_composition($c9,function_inverse($c9)))!=relation_dom($c9).
% 1.99/2.17 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.99/2.17 0 [] -empty(A)|A=empty_set.
% 1.99/2.17 0 [] -in(A,B)| -empty(B).
% 1.99/2.17 0 [] -empty(A)|A=B| -empty(B).
% 1.99/2.17 end_of_list.
% 1.99/2.17
% 1.99/2.17 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.99/2.17
% 1.99/2.17 This ia a non-Horn set with equality. The strategy will be
% 1.99/2.17 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.99/2.17 deletion, with positive clauses in sos and nonpositive
% 1.99/2.17 clauses in usable.
% 1.99/2.17
% 1.99/2.17 dependent: set(knuth_bendix).
% 1.99/2.17 dependent: set(anl_eq).
% 1.99/2.17 dependent: set(para_from).
% 1.99/2.17 dependent: set(para_into).
% 1.99/2.17 dependent: clear(para_from_right).
% 1.99/2.17 dependent: clear(para_into_right).
% 1.99/2.17 dependent: set(para_from_vars).
% 1.99/2.17 dependent: set(eq_units_both_ways).
% 1.99/2.17 dependent: set(dynamic_demod_all).
% 1.99/2.17 dependent: set(dynamic_demod).
% 1.99/2.17 dependent: set(order_eq).
% 1.99/2.17 dependent: set(back_demod).
% 1.99/2.17 dependent: set(lrpo).
% 1.99/2.17 dependent: set(hyper_res).
% 1.99/2.17 dependent: set(unit_deletion).
% 1.99/2.17 dependent: set(factor).
% 1.99/2.17
% 1.99/2.17 ------------> process usable:
% 1.99/2.17 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.99/2.17 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.99/2.17 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 1.99/2.17 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.99/2.17 ** KEPT (pick-wt=7): 5 [] -relation(A)| -function(A)|relation(function_inverse(A)).
% 1.99/2.17 ** KEPT (pick-wt=7): 6 [] -relation(A)| -function(A)|function(function_inverse(A)).
% 1.99/2.17 ** KEPT (pick-wt=8): 7 [] -relation(A)| -relation(B)|relation(relation_composition(A,B)).
% 1.99/2.17 ** KEPT (pick-wt=8): 8 [] -empty(A)| -relation(B)|empty(relation_composition(B,A)).
% 1.99/2.17 ** KEPT (pick-wt=8): 9 [] -empty(A)| -relation(B)|relation(relation_composition(B,A)).
% 1.99/2.17 Following clause subsumed by 7 during input processing: 0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|relation(relation_composition(A,B)).
% 1.99/2.17 ** KEPT (pick-wt=12): 10 [] -relation(A)| -function(A)| -relation(B)| -function(B)|function(relation_composition(A,B)).
% 1.99/2.17 ** KEPT (pick-wt=3): 11 [] -empty(powerset(A)).
% 1.99/2.17 ** KEPT (pick-wt=7): 12 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.99/2.17 ** KEPT (pick-wt=7): 13 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 1.99/2.17 ** KEPT (pick-wt=5): 14 [] -empty(A)|empty(relation_dom(A)).
% 1.99/2.17 ** KEPT (pick-wt=5): 15 [] -empty(A)|relation(relation_dom(A)).
% 1.99/2.17 ** KEPT (pick-wt=5): 16 [] -empty(A)|empty(relation_rng(A)).
% 1.99/2.17 ** KEPT (pick-wt=5): 17 [] -Alarm clock
% 299.87/300.04 Otter interrupted
% 299.87/300.04 PROOF NOT FOUND
%------------------------------------------------------------------------------