TSTP Solution File: SEU353+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU353+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:01 EDT 2022
% Result : Timeout 300.06s 300.28s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU353+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n004.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 12:50:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.67/0.89 ----- Otter 3.2, August 2001 -----
% 0.67/0.89 The process was started by sandbox2 on n004.cluster.edu,
% 0.67/0.89 Sun Jun 19 12:50:08 2022
% 0.67/0.89 The command was "./sos". The process ID is 10691.
% 0.67/0.89
% 0.67/0.89 set(prolog_style_variables).
% 0.67/0.89 set(auto).
% 0.67/0.89 dependent: set(auto1).
% 0.67/0.89 dependent: set(process_input).
% 0.67/0.89 dependent: clear(print_kept).
% 0.67/0.89 dependent: clear(print_new_demod).
% 0.67/0.89 dependent: clear(print_back_demod).
% 0.67/0.89 dependent: clear(print_back_sub).
% 0.67/0.89 dependent: set(control_memory).
% 0.67/0.89 dependent: assign(max_mem, 12000).
% 0.67/0.89 dependent: assign(pick_given_ratio, 4).
% 0.67/0.89 dependent: assign(stats_level, 1).
% 0.67/0.89 dependent: assign(pick_semantic_ratio, 3).
% 0.67/0.89 dependent: assign(sos_limit, 5000).
% 0.67/0.89 dependent: assign(max_weight, 60).
% 0.67/0.89 clear(print_given).
% 0.67/0.89
% 0.67/0.89 formula_list(usable).
% 0.67/0.89
% 0.67/0.89 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=23.
% 0.67/0.89
% 0.67/0.89 This ia a non-Horn set with equality. The strategy will be
% 0.67/0.89 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.67/0.89 unit deletion, with positive clauses in sos and nonpositive
% 0.67/0.89 clauses in usable.
% 0.67/0.89
% 0.67/0.89 dependent: set(knuth_bendix).
% 0.67/0.89 dependent: set(para_from).
% 0.67/0.89 dependent: set(para_into).
% 0.67/0.89 dependent: clear(para_from_right).
% 0.67/0.89 dependent: clear(para_into_right).
% 0.67/0.89 dependent: set(para_from_vars).
% 0.67/0.89 dependent: set(eq_units_both_ways).
% 0.67/0.89 dependent: set(dynamic_demod_all).
% 0.67/0.89 dependent: set(dynamic_demod).
% 0.67/0.89 dependent: set(order_eq).
% 0.67/0.89 dependent: set(back_demod).
% 0.67/0.89 dependent: set(lrpo).
% 0.67/0.89 dependent: set(hyper_res).
% 0.67/0.89 dependent: set(unit_deletion).
% 0.67/0.89 dependent: set(factor).
% 0.67/0.89
% 0.67/0.89 There is a clause for symmetry of equality, so it is
% 0.67/0.89 assumed that equality is fully axiomatized; therefore,
% 0.67/0.89 paramodulation is disabled.
% 0.67/0.89
% 0.67/0.89 dependent: clear(para_from).
% 0.67/0.89 dependent: clear(para_into).
% 0.67/0.89
% 0.67/0.89 ------------> process usable:
% 0.67/0.89 Following clause subsumed by 52 during input processing: 0 [] {-} -empty(A)| -ordinal(A)|epsilon_transitive(A).
% 0.67/0.89 Following clause subsumed by 53 during input processing: 0 [] {-} -empty(A)| -ordinal(A)|epsilon_connected(A).
% 0.67/0.89 Following clause subsumed by 84 during input processing: 0 [] {-} empty(A)|empty(B)| -relation_of2(C,A,B)| -function(C)| -quasi_total(C,A,B)|v1_partfun1(C,A,B).
% 0.67/0.89 Following clause subsumed by 52 during input processing: 0 [] {-} -ordinal(A)|epsilon_transitive(A).
% 0.67/0.89 Following clause subsumed by 53 during input processing: 0 [] {-} -ordinal(A)|epsilon_connected(A).
% 0.67/0.89 Following clause subsumed by 70 during input processing: 0 [] {-} ordinal(A)| -epsilon_transitive(A)| -epsilon_connected(A).
% 0.67/0.89 Following clause subsumed by 561 during input processing: 0 [] {-} -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 0.67/0.89 Following clause subsumed by 551 during input processing: 0 [] {-} -relation(A)| -function(A)| -relation(B)| -function(B)|relation(relation_composition(A,B)).
% 0.67/0.89 Following clause subsumed by 515 during input processing: 0 [] {-} empty(A)| -relation_of2(B,A,A)|strict_rel_str(rel_str_of(A,B)).
% 0.67/0.89 Following clause subsumed by 252 during input processing: 0 [] {-} empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 0.67/0.89 Following clause subsumed by 595 during input processing: 0 [] {-} -empty(powerset(A)).
% 0.67/0.89 Following clause subsumed by 599 during input processing: 0 [] {-} -ordinal(A)| -natural(A)| -empty(succ(A)).
% 0.67/0.89 Following clause subsumed by 581 during input processing: 0 [] {-} empty_carrier(A)| -join_commutative(A)| -join_semilatt_str(A)|function(the_L_join(A)).
% 0.67/0.89 Following clause subsumed by 582 during input processing: 0 [] {-} empty_carrier(A)| -join_commutative(A)| -join_semilatt_str(A)|quasi_total(the_L_join(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A)).
% 0.67/0.89 Following clause subsumed by 597 during input processing: 0 [] {-} -empty_carrier(boole_lattice(A)).
% 0.67/0.89 Following clause subsumed by 594 during input processing: 0 [] {-} -empty(singleton(A)).
% 0.67/0.89 Following clause subsumed by 546 during input processing: 0 [] {-} -relation(A)| -function(A)| -one_to_one(A)|relation(relation_inverse(A)).
% 3.26/3.46 Following clause subsumed by 581 during input processing: 0 [] {-} empty_carrier(A)| -join_associative(A)| -join_semilatt_str(A)|function(the_L_join(A)).
% 3.26/3.46 Following clause subsumed by 582 during input processing: 0 [] {-} empty_carrier(A)| -join_associative(A)| -join_semilatt_str(A)|quasi_total(the_L_join(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A)).
% 3.26/3.46 Following clause subsumed by 517 during input processing: 0 [] {-} empty(A)| -function(B)| -quasi_total(B,cartesian_product2(A,A),A)| -relation_of2(B,cartesian_product2(A,A),A)| -function(C)| -quasi_total(C,cartesian_product2(A,A),A)| -relation_of2(C,cartesian_product2(A,A),A)|strict_latt_str(latt_str_of(A,B,C)).
% 3.26/3.46 Following clause subsumed by 515 during input processing: 0 [] {-} -reflexive(A)| -antisymmetric(A)| -transitive(A)| -v1_partfun1(A,B,B)| -relation_of2(A,B,B)|strict_rel_str(rel_str_of(B,A)).
% 3.26/3.46 Following clause subsumed by 599 during input processing: 0 [] {-} -ordinal(A)| -empty(succ(A)).
% 3.26/3.46 Following clause subsumed by 561 during input processing: 0 [] {-} -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 3.26/3.46 Following clause subsumed by 576 during input processing: 0 [] {-} empty_carrier(A)| -meet_commutative(A)| -meet_semilatt_str(A)|function(the_L_meet(A)).
% 3.26/3.46 Following clause subsumed by 577 during input processing: 0 [] {-} empty_carrier(A)| -meet_commutative(A)| -meet_semilatt_str(A)|quasi_total(the_L_meet(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A)).
% 3.26/3.46 Following clause subsumed by 537 during input processing: 0 [] {-} empty_carrier(A)| -lattice(A)| -latt_str(A)|strict_rel_str(poset_of_lattice(A)).
% 3.26/3.46 Following clause subsumed by 538 during input processing: 0 [] {-} empty_carrier(A)| -lattice(A)| -latt_str(A)|reflexive_relstr(poset_of_lattice(A)).
% 3.26/3.46 Following clause subsumed by 539 during input processing: 0 [] {-} empty_carrier(A)| -lattice(A)| -latt_str(A)|transitive_relstr(poset_of_lattice(A)).
% 3.26/3.46 Following clause subsumed by 540 during input processing: 0 [] {-} empty_carrier(A)| -lattice(A)| -latt_str(A)|antisymmetric_relstr(poset_of_lattice(A)).
% 3.26/3.46 Following clause subsumed by 566 during input processing: 0 [] {-} -relation(A)| -function(A)|relation(relation_rng_restriction(B,A)).
% 3.26/3.46 Following clause subsumed by 576 during input processing: 0 [] {-} empty_carrier(A)| -meet_associative(A)| -meet_semilatt_str(A)|function(the_L_meet(A)).
% 3.26/3.46 Following clause subsumed by 577 during input processing: 0 [] {-} empty_carrier(A)| -meet_associative(A)| -meet_semilatt_str(A)|quasi_total(the_L_meet(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A)).
% 3.26/3.46 Following clause subsumed by 97 during input processing: 0 [] {-} subset(A,singleton(B))|A!=singleton(B).
% 3.26/3.46 Following clause subsumed by 773 during input processing: 0 [] {-} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 3.26/3.46 Following clause subsumed by 774 during input processing: 0 [] {-} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 3.26/3.46 Following clause subsumed by 775 during input processing: 0 [] {-} in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 3.26/3.46 Following clause subsumed by 349 during input processing: 0 [flip.2] {-} -one_sorted_str(A)|the_carrier(A)=cast_as_carrier_subset(A).
% 3.26/3.46 Following clause subsumed by 588 during input processing: 0 [] {-} -finite(A)|finite(set_intersection2(A,B)).
% 3.26/3.46 Following clause subsumed by 592 during input processing: 0 [] {-} -relation(A)| -function(A)| -finite(B)|finite(relation_image(A,B)).
% 3.26/3.46 Following clause subsumed by 304 during input processing: 0 [] {-} -element(A,B)|empty(B)|in(A,B).
% 3.26/3.46 Following clause subsumed by 754 during input processing: 0 [] {-} set_difference(A,B)!=empty_set|subset(A,B).
% 3.26/3.46 Following clause subsumed by 755 during input processing: 0 [] {-} set_difference(A,B)=empty_set| -subset(A,B).
% 3.26/3.46 Following clause subsumed by 750 during input processing: 0 [] {-} -subset(singleton(A),B)|in(A,B).
% 3.26/3.46 Following clause subsumed by 751 during input processing: 0 [] {-} subset(singleton(A),B)| -in(A,B).
% 3.26/3.46 Following clause subsumed by 770 during input processing: 0 [] {-} -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 300.06/300.28 Wow, sos-wrapper got a signal XCPU
%------------------------------------------------------------------------------