TSTP Solution File: SEU402+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU402+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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:25 EDT 2022
% Result : Unknown 1.13s 1.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU402+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n016.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 22:35:22 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.86/1.03 ----- Otter 3.2, August 2001 -----
% 0.86/1.03 The process was started by sandbox on n016.cluster.edu,
% 0.86/1.03 Sat Jun 18 22:35:23 2022
% 0.86/1.03 The command was "./sos". The process ID is 29547.
% 0.86/1.03
% 0.86/1.03 set(prolog_style_variables).
% 0.86/1.03 set(auto).
% 0.86/1.03 dependent: set(auto1).
% 0.86/1.03 dependent: set(process_input).
% 0.86/1.03 dependent: clear(print_kept).
% 0.86/1.03 dependent: clear(print_new_demod).
% 0.86/1.03 dependent: clear(print_back_demod).
% 0.86/1.03 dependent: clear(print_back_sub).
% 0.86/1.03 dependent: set(control_memory).
% 0.86/1.03 dependent: assign(max_mem, 12000).
% 0.86/1.03 dependent: assign(pick_given_ratio, 4).
% 0.86/1.03 dependent: assign(stats_level, 1).
% 0.86/1.03 dependent: assign(pick_semantic_ratio, 3).
% 0.86/1.03 dependent: assign(sos_limit, 5000).
% 0.86/1.03 dependent: assign(max_weight, 60).
% 0.86/1.03 clear(print_given).
% 0.86/1.03
% 0.86/1.03 formula_list(usable).
% 0.86/1.03
% 0.86/1.03 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=24.
% 0.86/1.03
% 0.86/1.03 This ia a non-Horn set with equality. The strategy will be
% 0.86/1.03 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.86/1.03 unit deletion, with positive clauses in sos and nonpositive
% 0.86/1.03 clauses in usable.
% 0.86/1.03
% 0.86/1.03 dependent: set(knuth_bendix).
% 0.86/1.03 dependent: set(para_from).
% 0.86/1.03 dependent: set(para_into).
% 0.86/1.03 dependent: clear(para_from_right).
% 0.86/1.03 dependent: clear(para_into_right).
% 0.86/1.03 dependent: set(para_from_vars).
% 0.86/1.03 dependent: set(eq_units_both_ways).
% 0.86/1.03 dependent: set(dynamic_demod_all).
% 0.86/1.03 dependent: set(dynamic_demod).
% 0.86/1.03 dependent: set(order_eq).
% 0.86/1.03 dependent: set(back_demod).
% 0.86/1.03 dependent: set(lrpo).
% 0.86/1.03 dependent: set(hyper_res).
% 0.86/1.03 dependent: set(unit_deletion).
% 0.86/1.03 dependent: set(factor).
% 0.86/1.03
% 0.86/1.03 ------------> process usable:
% 0.86/1.03 Following clause subsumed by 129 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.86/1.03 Following clause subsumed by 146 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.86/1.03 Following clause subsumed by 174 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.86/1.03 Following clause subsumed by 188 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.86/1.03 Following clause subsumed by 174 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.86/1.03 210 back subsumes 198.
% 0.86/1.03 211 back subsumes 199.
% 0.86/1.03
% 0.86/1.03 ------------> process sos:
% 0.86/1.03 Following clause subsumed by 1039 during input processing: 0 [] {-} empty(empty_set).
% 0.86/1.03 Following clause subsumed by 1039 during input processing: 0 [] {-} empty(empty_set).
% 0.86/1.03 Following clause subsumed by 1040 during input processing: 0 [] {-} relation(empty_set).
% 0.86/1.03 Following clause subsumed by 1031 during input processing: 0 [copy,1031,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.86/1.03 Following clause subsumed by 1047 during input processing: 0 [copy,1047,flip.1] {-} A=A.
% 0.86/1.03 1047 back subsumes 986.
% 0.86/1.03 1047 back subsumes 985.
% 0.86/1.03 1047 back subsumes 983.
% 0.86/1.03 1047 back subsumes 756.
% 0.86/1.03 1047 back subsumes 755.
% 0.86/1.03 1047 back subsumes 754.
% 0.86/1.03 1047 back subsumes 752.
% 0.86/1.03 1047 back subsumes 751.
% 0.86/1.03 1047 back subsumes 750.
% 0.86/1.03 1047 back subsumes 749.
% 0.86/1.03 1047 back subsumes 748.
% 0.86/1.03 1047 back subsumes 746.
% 0.86/1.03 1047 back subsumes 745.
% 0.86/1.03 1047 back subsumes 744.
% 0.86/1.03 1047 back subsumes 743.
% 0.86/1.03 1047 back subsumes 742.
% 0.86/1.03 1047 back subsumes 741.
% 0.86/1.03 1047 back subsumes 739.
% 0.86/1.03 1047 back subsumes 738.
% 0.86/1.03 1047 back subsumes 737.
% 0.86/1.03 1047 back subsumes 736.
% 0.86/1.03 1047 back subsumes 735.
% 0.86/1.03 1047 back subsumes 734.
% 0.86/1.03 1047 back subsumes 732.
% 0.86/1.03 1047 back subsumes 731.
% 0.86/1.03 1047 back subsumes 730.
% 0.86/1.03 1047 back subsumes 729.
% 0.86/1.03 1047 back subsumes 728.
% 0.86/1.03 1047 back subsumes 727.
% 0.86/1.03 1047 back subsumes 725.
% 0.86/1.03 1047 back subsumes 723.
% 0.86/1.03 1047 back subsumes 721.
% 0.86/1.03 1047 back subsumes 719.
% 0.86/1.03 1047 back subsumes 717.
% 0.86/1.03 1047 back subsumes 715.
% 0.86/1.03 1047 back subsumes 712.
% 0.86/1.03
% 0.86/1.03 ======= end of input processing =======
% 1.13/1.33
% 1.13/1.33
% 1.13/1.33
% 1.13/1.33 Aborting on detection of an error:
% 1.13/1.33
% 1.13/1.33 Too many clauses (whew!).
% 1.13/1.33
%------------------------------------------------------------------------------