TSTP Solution File: SEU403+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU403+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:29:26 EDT 2022
% Result : Unknown 7.03s 7.28s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU403+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 02:18:46 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.83/1.04 ----- Otter 3.2, August 2001 -----
% 0.83/1.04 The process was started by sandbox on n022.cluster.edu,
% 0.83/1.04 Sun Jun 19 02:18:46 2022
% 0.83/1.04 The command was "./sos". The process ID is 8322.
% 0.83/1.04
% 0.83/1.04 set(prolog_style_variables).
% 0.83/1.04 set(auto).
% 0.83/1.04 dependent: set(auto1).
% 0.83/1.04 dependent: set(process_input).
% 0.83/1.04 dependent: clear(print_kept).
% 0.83/1.04 dependent: clear(print_new_demod).
% 0.83/1.04 dependent: clear(print_back_demod).
% 0.83/1.04 dependent: clear(print_back_sub).
% 0.83/1.04 dependent: set(control_memory).
% 0.83/1.04 dependent: assign(max_mem, 12000).
% 0.83/1.04 dependent: assign(pick_given_ratio, 4).
% 0.83/1.04 dependent: assign(stats_level, 1).
% 0.83/1.04 dependent: assign(pick_semantic_ratio, 3).
% 0.83/1.04 dependent: assign(sos_limit, 5000).
% 0.83/1.04 dependent: assign(max_weight, 60).
% 0.83/1.04 clear(print_given).
% 0.83/1.04
% 0.83/1.04 formula_list(usable).
% 0.83/1.04
% 0.83/1.04 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=24.
% 0.83/1.04
% 0.83/1.04 This ia a non-Horn set with equality. The strategy will be
% 0.83/1.04 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.83/1.04 unit deletion, with positive clauses in sos and nonpositive
% 0.83/1.04 clauses in usable.
% 0.83/1.04
% 0.83/1.04 dependent: set(knuth_bendix).
% 0.83/1.04 dependent: set(para_from).
% 0.83/1.04 dependent: set(para_into).
% 0.83/1.04 dependent: clear(para_from_right).
% 0.83/1.04 dependent: clear(para_into_right).
% 0.83/1.04 dependent: set(para_from_vars).
% 0.83/1.04 dependent: set(eq_units_both_ways).
% 0.83/1.04 dependent: set(dynamic_demod_all).
% 0.83/1.04 dependent: set(dynamic_demod).
% 0.83/1.04 dependent: set(order_eq).
% 0.83/1.04 dependent: set(back_demod).
% 0.83/1.04 dependent: set(lrpo).
% 0.83/1.04 dependent: set(hyper_res).
% 0.83/1.04 dependent: set(unit_deletion).
% 0.83/1.04 dependent: set(factor).
% 0.83/1.04
% 0.83/1.04 ------------> process usable:
% 0.83/1.04 Following clause subsumed by 130 during input processing: 0 [] {-} -topological_space(A)| -top_str(A)| -element(B,powerset(the_carrier(A)))| -open_subset(B,A)| -nowhere_dense(B,A)|boundary_set(B,A).
% 0.83/1.04 Following clause subsumed by 147 during input processing: 0 [] {-} -one_sorted_str(A)|empty(B)| -relation_of2(C,B,B)| -function(D)| -quasi_total(D,B,the_carrier(A))| -relation_of2(D,B,the_carrier(A))|strict_net_str(net_str_of(A,B,C,D),A).
% 0.83/1.04 Following clause subsumed by 178 during input processing: 0 [] {-} empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -directed_relstr(B)| -net_str(B,A)| -element(C,the_carrier(B))|strict_net_str(netstr_restr_to_element(A,B,C),A).
% 0.83/1.04 Following clause subsumed by 192 during input processing: 0 [] {-} empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -transitive_relstr(B)| -directed_relstr(B)| -net_str(B,A)| -element(C,the_carrier(B))| -empty_carrier(netstr_restr_to_element(A,B,C)).
% 0.83/1.04 Following clause subsumed by 178 during input processing: 0 [] {-} empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -transitive_relstr(B)| -directed_relstr(B)| -net_str(B,A)| -element(C,the_carrier(B))|strict_net_str(netstr_restr_to_element(A,B,C),A).
% 0.83/1.04 214 back subsumes 202.
% 0.83/1.04 215 back subsumes 203.
% 0.83/1.04
% 0.83/1.04 ------------> process sos:
% 0.83/1.04 Following clause subsumed by 1074 during input processing: 0 [] {-} empty(empty_set).
% 0.83/1.04 Following clause subsumed by 1074 during input processing: 0 [] {-} empty(empty_set).
% 0.83/1.04 Following clause subsumed by 1075 during input processing: 0 [] {-} relation(empty_set).
% 0.83/1.04 Following clause subsumed by 1069 during input processing: 0 [copy,1069,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.83/1.04 Following clause subsumed by 1083 during input processing: 0 [copy,1083,flip.1] {-} A=A.
% 0.83/1.04 1083 back subsumes 1024.
% 0.83/1.04 1083 back subsumes 1023.
% 0.83/1.04 1083 back subsumes 1022.
% 0.83/1.04 1083 back subsumes 784.
% 0.83/1.04 1083 back subsumes 783.
% 0.83/1.04 1083 back subsumes 782.
% 0.83/1.04 1083 back subsumes 780.
% 0.83/1.04 1083 back subsumes 779.
% 0.83/1.04 1083 back subsumes 778.
% 0.83/1.04 1083 back subsumes 777.
% 0.83/1.04 1083 back subsumes 776.
% 0.83/1.04 1083 back subsumes 774.
% 0.83/1.04 1083 back subsumes 773.
% 0.83/1.04 1083 back subsumes 772.
% 0.83/1.04 1083 back subsumes 771.
% 0.83/1.04 1083 back subsumes 770.
% 0.83/1.04 1083 back subsumes 769.
% 0.83/1.04 1083 back subsumes 767.
% 0.83/1.04 1083 back subsumes 766.
% 0.83/1.04 1083 back subsumes 765.
% 0.83/1.04 1083 back subsumes 764.
% 0.83/1.04 1083 back subsumes 763.
% 0.83/1.04 1083 back subsumes 762.
% 0.83/1.04 1083 back subsumes 760.
% 0.83/1.04 1083 back subsumes 759.
% 0.83/1.04 1083 back subsumes 758.
% 0.83/1.04 1083 back subsumes 757.
% 0.83/1.04 1083 back subsumes 756.
% 0.83/1.04 1083 back subsumes 755.
% 0.83/1.04 1083 back subsumes 753.
% 0.83/1.04 1083 back subsumes 751.
% 0.83/1.04 1083 back subsumes 749.
% 0.83/1.04 1083 back subsumes 747.
% 0.83/1.04 1083 back subsumes 745.
% 0.83/1.04 1083 back subsumes 743.
% 0.83/1.04 1083 back subsumes 740.
% 0.83/1.04
% 0.83/1.04 ======= end of input processing =======
% 7.03/7.27
% 7.03/7.27 Stopped by limit on insertions
% 7.03/7.27
% 7.03/7.27
% 7.03/7.27
% 7.03/7.27 Aborting on detection of an error:
% 7.03/7.27
% 7.03/7.27 Too many clauses (whew!).
% 7.03/7.27
%------------------------------------------------------------------------------