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

View Problem - Process Solution

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

% Computer : n021.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:37 EDT 2022

% Result   : Timeout 300.03s 300.25s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SEU304+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 20 00:55:03 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.60/2.81  ----- Otter 3.2, August 2001 -----
% 2.60/2.81  The process was started by sandbox on n021.cluster.edu,
% 2.60/2.81  Mon Jun 20 00:55:03 2022
% 2.60/2.81  The command was "./sos".  The process ID is 21909.
% 2.60/2.81  
% 2.60/2.81  set(prolog_style_variables).
% 2.60/2.81  set(auto).
% 2.60/2.81     dependent: set(auto1).
% 2.60/2.81     dependent: set(process_input).
% 2.60/2.81     dependent: clear(print_kept).
% 2.60/2.81     dependent: clear(print_new_demod).
% 2.60/2.81     dependent: clear(print_back_demod).
% 2.60/2.81     dependent: clear(print_back_sub).
% 2.60/2.81     dependent: set(control_memory).
% 2.60/2.81     dependent: assign(max_mem, 12000).
% 2.60/2.81     dependent: assign(pick_given_ratio, 4).
% 2.60/2.81     dependent: assign(stats_level, 1).
% 2.60/2.81     dependent: assign(pick_semantic_ratio, 3).
% 2.60/2.81     dependent: assign(sos_limit, 5000).
% 2.60/2.81     dependent: assign(max_weight, 60).
% 2.60/2.81  clear(print_given).
% 2.60/2.81  
% 2.60/2.81  formula_list(usable).
% 2.60/2.81  
% 2.60/2.81  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=23.
% 2.60/2.81  
% 2.60/2.81  This ia a non-Horn set with equality.  The strategy will be
% 2.60/2.81  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 2.60/2.81  unit deletion, with positive clauses in sos and nonpositive
% 2.60/2.81  clauses in usable.
% 2.60/2.81  
% 2.60/2.81     dependent: set(knuth_bendix).
% 2.60/2.81     dependent: set(para_from).
% 2.60/2.81     dependent: set(para_into).
% 2.60/2.81     dependent: clear(para_from_right).
% 2.60/2.81     dependent: clear(para_into_right).
% 2.60/2.81     dependent: set(para_from_vars).
% 2.60/2.81     dependent: set(eq_units_both_ways).
% 2.60/2.81     dependent: set(dynamic_demod_all).
% 2.60/2.81     dependent: set(dynamic_demod).
% 2.60/2.81     dependent: set(order_eq).
% 2.60/2.81     dependent: set(back_demod).
% 2.60/2.81     dependent: set(lrpo).
% 2.60/2.81     dependent: set(hyper_res).
% 2.60/2.81     dependent: set(unit_deletion).
% 2.60/2.81     dependent: set(factor).
% 2.60/2.81  
% 2.60/2.81  There is a clause for symmetry of equality, so it is
% 2.60/2.81  assumed that equality is fully axiomatized; therefore,
% 2.60/2.81  paramodulation is disabled.
% 2.60/2.81  
% 2.60/2.81     dependent: clear(para_from).
% 2.60/2.81     dependent: clear(para_into).
% 2.60/2.81  
% 2.60/2.81  ------------> process usable:
% 2.60/2.81    Following clause subsumed by 10 during input processing: 0 [] {-} -empty(A)| -ordinal(A)|epsilon_transitive(A).
% 2.60/2.81    Following clause subsumed by 11 during input processing: 0 [] {-} -empty(A)| -ordinal(A)|epsilon_connected(A).
% 2.60/2.81    Following clause subsumed by 10 during input processing: 0 [] {-} -ordinal(A)|epsilon_transitive(A).
% 2.60/2.81    Following clause subsumed by 11 during input processing: 0 [] {-} -ordinal(A)|epsilon_connected(A).
% 2.60/2.81    Following clause subsumed by 18 during input processing: 0 [] {-} ordinal(A)| -epsilon_transitive(A)| -epsilon_connected(A).
% 2.60/2.81    Following clause subsumed by 350 during input processing: 0 [] {-} -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 2.60/2.81    Following clause subsumed by 345 during input processing: 0 [] {-} -relation(A)| -function(A)| -relation(B)| -function(B)|relation(relation_composition(A,B)).
% 2.60/2.81    Following clause subsumed by 374 during input processing: 0 [] {-} -empty(powerset(A)).
% 2.60/2.81    Following clause subsumed by 376 during input processing: 0 [] {-} -ordinal(A)| -natural(A)| -empty(succ(A)).
% 2.60/2.81    Following clause subsumed by 373 during input processing: 0 [] {-} -empty(singleton(A)).
% 2.60/2.81    Following clause subsumed by 343 during input processing: 0 [] {-} -relation(A)| -function(A)| -one_to_one(A)|relation(relation_inverse(A)).
% 2.60/2.81    Following clause subsumed by 376 during input processing: 0 [] {-} -ordinal(A)| -empty(succ(A)).
% 2.60/2.81    Following clause subsumed by 350 during input processing: 0 [] {-} -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 2.60/2.81    Following clause subsumed by 352 during input processing: 0 [] {-} -relation(A)| -function(A)|relation(relation_rng_restriction(B,A)).
% 2.60/2.81    Following clause subsumed by 34 during input processing: 0 [] {-} subset(A,singleton(B))|A!=singleton(B).
% 2.60/2.81    Following clause subsumed by 445 during input processing: 0 [] {-} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.60/2.81    Following clause subsumed by 446 during input processing: 0 [] {-} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.60/2.81    Following clause subsumed by 447 during input processing: 0 [] {-} in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.60/2.81    Following clause subsumed by 367 during input processing: 0 [] {-} -finite(A)|finite(set_intersection2(A,B)).
% 300.03/300.25  Wow, sos-wrapper got a signal XCPU
%------------------------------------------------------------------------------