TSTP Solution File: SEU339+2 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SEU339+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n026.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  : 600s
% DateTime : Tue Jul 19 14:28:55 EDT 2022

% Result   : Timeout 292.35s 292.59s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU339+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.13/0.34  % Computer : n026.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 19 22:56:25 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 2.93/3.10  ----- Otter 3.2, August 2001 -----
% 2.93/3.10  The process was started by sandbox on n026.cluster.edu,
% 2.93/3.10  Sun Jun 19 22:56:25 2022
% 2.93/3.10  The command was "./sos".  The process ID is 31354.
% 2.93/3.10  
% 2.93/3.10  set(prolog_style_variables).
% 2.93/3.10  set(auto).
% 2.93/3.10     dependent: set(auto1).
% 2.93/3.10     dependent: set(process_input).
% 2.93/3.10     dependent: clear(print_kept).
% 2.93/3.10     dependent: clear(print_new_demod).
% 2.93/3.10     dependent: clear(print_back_demod).
% 2.93/3.10     dependent: clear(print_back_sub).
% 2.93/3.10     dependent: set(control_memory).
% 2.93/3.10     dependent: assign(max_mem, 12000).
% 2.93/3.10     dependent: assign(pick_given_ratio, 4).
% 2.93/3.10     dependent: assign(stats_level, 1).
% 2.93/3.10     dependent: assign(pick_semantic_ratio, 3).
% 2.93/3.10     dependent: assign(sos_limit, 5000).
% 2.93/3.10     dependent: assign(max_weight, 60).
% 2.93/3.10  clear(print_given).
% 2.93/3.10  
% 2.93/3.10  formula_list(usable).
% 2.93/3.10  
% 2.93/3.10  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=23.
% 2.93/3.10  
% 2.93/3.10  This ia a non-Horn set with equality.  The strategy will be
% 2.93/3.10  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 2.93/3.10  unit deletion, with positive clauses in sos and nonpositive
% 2.93/3.10  clauses in usable.
% 2.93/3.10  
% 2.93/3.10     dependent: set(knuth_bendix).
% 2.93/3.10     dependent: set(para_from).
% 2.93/3.10     dependent: set(para_into).
% 2.93/3.10     dependent: clear(para_from_right).
% 2.93/3.10     dependent: clear(para_into_right).
% 2.93/3.10     dependent: set(para_from_vars).
% 2.93/3.10     dependent: set(eq_units_both_ways).
% 2.93/3.10     dependent: set(dynamic_demod_all).
% 2.93/3.10     dependent: set(dynamic_demod).
% 2.93/3.10     dependent: set(order_eq).
% 2.93/3.10     dependent: set(back_demod).
% 2.93/3.10     dependent: set(lrpo).
% 2.93/3.10     dependent: set(hyper_res).
% 2.93/3.10     dependent: set(unit_deletion).
% 2.93/3.10     dependent: set(factor).
% 2.93/3.10  
% 2.93/3.10  There is a clause for symmetry of equality, so it is
% 2.93/3.10  assumed that equality is fully axiomatized; therefore,
% 2.93/3.10  paramodulation is disabled.
% 2.93/3.10  
% 2.93/3.10     dependent: clear(para_from).
% 2.93/3.10     dependent: clear(para_into).
% 2.93/3.10  
% 2.93/3.10  ------------> process usable:
% 2.93/3.10    Following clause subsumed by 41 during input processing: 0 [] {-} -empty(A)| -ordinal(A)|epsilon_transitive(A).
% 2.93/3.10    Following clause subsumed by 42 during input processing: 0 [] {-} -empty(A)| -ordinal(A)|epsilon_connected(A).
% 2.93/3.10    Following clause subsumed by 41 during input processing: 0 [] {-} -ordinal(A)|epsilon_transitive(A).
% 2.93/3.10    Following clause subsumed by 42 during input processing: 0 [] {-} -ordinal(A)|epsilon_connected(A).
% 2.93/3.10    Following clause subsumed by 55 during input processing: 0 [] {-} ordinal(A)| -epsilon_transitive(A)| -epsilon_connected(A).
% 2.93/3.10    Following clause subsumed by 464 during input processing: 0 [] {-} -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 2.93/3.10    Following clause subsumed by 457 during input processing: 0 [] {-} -relation(A)| -function(A)| -relation(B)| -function(B)|relation(relation_composition(A,B)).
% 2.93/3.10    Following clause subsumed by 201 during input processing: 0 [] {-} empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 2.93/3.10    Following clause subsumed by 492 during input processing: 0 [] {-} -empty(powerset(A)).
% 2.93/3.10    Following clause subsumed by 494 during input processing: 0 [] {-} -ordinal(A)| -natural(A)| -empty(succ(A)).
% 2.93/3.10    Following clause subsumed by 491 during input processing: 0 [] {-} -empty(singleton(A)).
% 2.93/3.10    Following clause subsumed by 455 during input processing: 0 [] {-} -relation(A)| -function(A)| -one_to_one(A)|relation(relation_inverse(A)).
% 2.93/3.10    Following clause subsumed by 494 during input processing: 0 [] {-} -ordinal(A)| -empty(succ(A)).
% 2.93/3.10    Following clause subsumed by 464 during input processing: 0 [] {-} -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 2.93/3.10    Following clause subsumed by 466 during input processing: 0 [] {-} -relation(A)| -function(A)|relation(relation_rng_restriction(B,A)).
% 2.93/3.10    Following clause subsumed by 75 during input processing: 0 [] {-} subset(A,singleton(B))|A!=singleton(B).
% 2.93/3.10    Following clause subsumed by 623 during input processing: 0 [] {-} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.93/3.10    Following clause subsumed by 624 during input processing: 0 [] {-} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.93/3.10    Following clause subsumed by 625 during input processing: 0 [] {-} in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 292.35/292.59    Following clause subsumed by 289 during input processing: 0 [flip.2] {-} -one_sorted_str(A)|the_carrier(A)=cast_as_carrier_subset(A).
% 292.35/292.59    Following clause subsumed by 485 during input processing: 0 [] {-} -finite(A)|finite(set_intersection2(A,B)).
% 292.35/292.59    Following clause subsumed by 489 during input processing: 0 [] {-} -relation(A)| -function(A)| -finite(B)|finite(relation_image(A,B)).
% 292.35/292.59    Following clause subsumed by 245 during input processing: 0 [] {-} -element(A,B)|empty(B)|in(A,B).
% 292.35/292.59    Following clause subsumed by 604 during input processing: 0 [] {-} set_difference(A,B)!=empty_set|subset(A,B).
% 292.35/292.59    Following clause subsumed by 605 during input processing: 0 [] {-} set_difference(A,B)=empty_set| -subset(A,B).
% 292.35/292.59    Following clause subsumed by 600 during input processing: 0 [] {-} -subset(singleton(A),B)|in(A,B).
% 292.35/292.59    Following clause subsumed by 601 during input processing: 0 [] {-} subset(singleton(A),B)| -in(A,B).
% 292.35/292.59    Following clause subsumed by 620 during input processing: 0 [] {-} -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 292.35/292.59    Following clause subsumed by 621 during input processing: 0 [] {-} subset(A,singleton(B))|A!=empty_set.
% 292.35/292.59    Following clause subsumed by 75 during input processing: 0 [] {-} subset(A,singleton(B))|A!=singleton(B).
% 292.35/292.59    Following clause subsumed by 3881 during input processing: 0 [] {-} -element(A,powerset(powerset(B)))|A=empty_set|complements_of_subsets(B,A)!=empty_set.
% 292.35/292.59    Following clause subsumed by 593 during input processing: 0 [] {-} -in(A,B)|set_union2(singleton(A),B)=B.
% 292.35/292.59    Following clause subsumed by 575 during input processing: 0 [] {-} -topological_space(A)| -top_str(A)| -element(B,powerset(the_carrier(A)))|open_subset(interior(A,B),A).
% 292.35/292.59    Following clause subsumed by 3955 during input processing: 0 [] {-} -relation(A)| -function(A)| -in(ordered_pair(B,C),A)|in(B,relation_dom(A)).
% 292.35/292.59    Following clause subsumed by 304 during input processing: 0 [] {-} -relation(A)| -function(A)|in(ordered_pair(B,C),A)| -in(B,relation_dom(A))|C!=apply(A,B).
% 292.35/292.59    Following clause subsumed by 622 during input processing: 0 [] {-} -in(A,B)|subset(A,union(B)).
% 292.35/292.59    Following clause subsumed by 3933 during input processing: 0 [] {-} -function(A)| -quasi_total(A,B,C)| -relation_of2_as_subset(A,B,C)| -subset(C,D)|C=empty_set|relation_of2_as_subset(A,B,D).
% 292.35/292.59    Following clause subsumed by 3933 during input processing: 0 [] {-} -function(A)| -quasi_total(A,B,C)| -relation_of2_as_subset(A,B,C)| -subset(C,D)|B!=empty_set|relation_of2_as_subset(A,B,D).
% 292.35/292.59  293 back subsumes 290.
% 292.35/292.59  549 back subsumes 508.
% 292.35/292.59  550 back subsumes 509.
% 292.35/292.59  551 back subsumes 510.
% 292.35/292.59  3953 back subsumes 246.
% 292.35/292.59  3993 back subsumes 554.
% 292.35/292.59  3996 back subsumes 393.
% 292.35/292.59  3997 back subsumes 394.
% 292.35/292.59  3998 back subsumes 570.
% 292.35/292.59  4090 back subsumes 612.
% 292.35/292.59  4134 back subsumes 628.
% 292.35/292.59  4135 back subsumes 627.
% 292.35/292.59  4136 back subsumes 629.
% 292.35/292.59  4139 back subsumes 305.
% 292.35/292.59  4162 back subsumes 4161.
% 292.35/292.59  4170 back subsumes 4169.
% 292.35/292.59  
% 292.35/292.59  ------------> process sos:
% 292.35/292.59    Following clause subsumed by 13661 during input processing: 0 [] {-} empty(empty_set).
% 292.35/292.59    Following clause subsumed by 13651 during input processing: 0 [] {-} relation(identity_relation(A)).
% 292.35/292.59    Following clause subsumed by 13662 during input processing: 0 [] {-} relation(empty_set).
% 292.35/292.59    Following clause subsumed by 13663 during input processing: 0 [] {-} relation_empty_yielding(empty_set).
% 292.35/292.59    Following clause subsumed by 13661 during input processing: 0 [] {-} empty(empty_set).
% 292.35/292.59    Following clause subsumed by 13661 during input processing: 0 [] {-} empty(empty_set).
% 292.35/292.59    Following clause subsumed by 13662 during input processing: 0 [] {-} relation(empty_set).
% 292.35/292.59    Following clause subsumed by 13661 during input processing: 0 [] {-} empty(empty_set).
% 292.35/292.59    Following clause subsumed by 13613 during input processing: 0 [copy,13613,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 292.35/292.59    Following clause subsumed by 13614 during input processing: 0 [copy,13614,flip.1] {-} set_union2(A,B)=set_union2(B,A).
% 292.35/292.59  13761 back subsumes 8337.
% 292.35/292.59  13761 back subsumes 8323.
% 292.35/292.59  13761 back subsumes 8322.
% 292.35/292.59  13761 back subsumes 8302.
% 292.35/292.59  13761 back subsumes 4315.
% 292.35/292.59  13761 back subsumes 4218.
% 292.35/292.59  13761 back subsumes 4217.
% 292.35/292.59  13761 back subsumes 4200.
% 300.06/300.25  Wow, sos-wrapper got a signal XCPU
%------------------------------------------------------------------------------