TSTP Solution File: TOP009-1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : TOP009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n017.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 : Thu Jul 21 21:34:50 EDT 2022

% Result   : Unsatisfiable 10.87s 11.05s
% Output   : Refutation 10.87s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : TOP009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n017.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 : Sun May 29 05:48:54 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.36  ----- Otter 3.2, August 2001 -----
% 0.19/0.36  The process was started by sandbox2 on n017.cluster.edu,
% 0.19/0.36  Sun May 29 05:48:54 2022
% 0.19/0.36  The command was "./sos".  The process ID is 3550.
% 0.19/0.36  
% 0.19/0.36  set(prolog_style_variables).
% 0.19/0.36  set(auto).
% 0.19/0.36     dependent: set(auto1).
% 0.19/0.36     dependent: set(process_input).
% 0.19/0.36     dependent: clear(print_kept).
% 0.19/0.36     dependent: clear(print_new_demod).
% 0.19/0.36     dependent: clear(print_back_demod).
% 0.19/0.36     dependent: clear(print_back_sub).
% 0.19/0.36     dependent: set(control_memory).
% 0.19/0.36     dependent: assign(max_mem, 12000).
% 0.19/0.36     dependent: assign(pick_given_ratio, 4).
% 0.19/0.36     dependent: assign(stats_level, 1).
% 0.19/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36     dependent: assign(sos_limit, 5000).
% 0.19/0.36     dependent: assign(max_weight, 60).
% 0.19/0.36  clear(print_given).
% 0.19/0.36  
% 0.19/0.36  list(usable).
% 0.19/0.36  
% 0.19/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.19/0.36  
% 0.19/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.19/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.36  clauses in usable.
% 0.19/0.36  
% 0.19/0.36     dependent: set(knuth_bendix).
% 0.19/0.36     dependent: set(para_from).
% 0.19/0.36     dependent: set(para_into).
% 0.19/0.36     dependent: clear(para_from_right).
% 0.19/0.36     dependent: clear(para_into_right).
% 0.19/0.36     dependent: set(para_from_vars).
% 0.19/0.36     dependent: set(eq_units_both_ways).
% 0.19/0.36     dependent: set(dynamic_demod_all).
% 0.19/0.36     dependent: set(dynamic_demod).
% 0.19/0.36     dependent: set(order_eq).
% 0.19/0.36     dependent: set(back_demod).
% 0.19/0.36     dependent: set(lrpo).
% 0.19/0.36     dependent: set(hyper_res).
% 0.19/0.36     dependent: set(unit_deletion).
% 0.19/0.36     dependent: set(factor).
% 0.19/0.36  
% 0.19/0.36  ------------> process usable:
% 0.19/0.36  
% 0.19/0.36  ------------> process sos:
% 0.19/0.36  
% 0.19/0.36  ======= end of input processing =======
% 0.69/0.90  
% 0.69/0.90  Stopped by limit on insertions
% 0.69/0.90  
% 0.69/0.90  
% 0.69/0.90  Failed to model usable list: disabling FINDER
% 0.69/0.90  
% 0.69/0.90  
% 0.69/0.90  
% 0.69/0.90  -------------- Softie stats --------------
% 0.69/0.90  
% 0.69/0.90  UPDATE_STOP: 300
% 0.69/0.90  SFINDER_TIME_LIMIT: 2
% 0.69/0.90  SHORT_CLAUSE_CUTOFF: 4
% 0.69/0.90  number of clauses in intial UL: 130
% 0.69/0.90  number of clauses initially in problem: 134
% 0.69/0.90  percentage of clauses intially in UL: 97
% 0.69/0.90  percentage of distinct symbols occuring in initial UL: 98
% 0.69/0.90  percent of all initial clauses that are short: 100
% 0.69/0.90  absolute distinct symbol count: 61
% 0.69/0.90     distinct predicate count: 22
% 0.69/0.90     distinct function count: 34
% 0.69/0.90     distinct constant count: 5
% 0.69/0.90  
% 0.69/0.90  ---------- no more Softie stats ----------
% 0.69/0.90  
% 0.69/0.90  
% 0.69/0.90  
% 0.69/0.90  =========== start of search ===========
% 5.56/5.74  
% 5.56/5.74  
% 5.56/5.74  Changing weight limit from 60 to 56.
% 5.56/5.74  
% 5.56/5.74  Resetting weight limit to 56 after 85 givens.
% 5.56/5.74  
% 6.44/6.63  
% 6.44/6.63  
% 6.44/6.63  Changing weight limit from 56 to 51.
% 6.44/6.63  
% 6.44/6.63  Resetting weight limit to 51 after 90 givens.
% 6.44/6.63  
% 7.15/7.34  
% 7.15/7.34  
% 7.15/7.34  Changing weight limit from 51 to 44.
% 7.15/7.34  
% 7.15/7.34  Resetting weight limit to 44 after 95 givens.
% 7.15/7.34  
% 7.74/7.94  
% 7.74/7.94  
% 7.74/7.94  Changing weight limit from 44 to 41.
% 7.74/7.94  
% 7.74/7.94  Resetting weight limit to 41 after 100 givens.
% 7.74/7.94  
% 8.10/8.35  
% 8.10/8.35  
% 8.10/8.35  Changing weight limit from 41 to 40.
% 8.10/8.35  
% 8.10/8.35  Resetting weight limit to 40 after 105 givens.
% 8.10/8.35  
% 8.65/8.85  
% 8.65/8.85  
% 8.65/8.85  Changing weight limit from 40 to 36.
% 8.65/8.85  
% 8.65/8.85  Resetting weight limit to 36 after 110 givens.
% 8.65/8.85  
% 9.17/9.41  
% 9.17/9.41  
% 9.17/9.41  Changing weight limit from 36 to 31.
% 9.17/9.41  
% 9.17/9.41  Resetting weight limit to 31 after 115 givens.
% 9.17/9.41  
% 9.69/9.90  
% 9.69/9.90  
% 9.69/9.90  Changing weight limit from 31 to 28.
% 9.69/9.90  
% 9.69/9.90  Resetting weight limit to 28 after 120 givens.
% 9.69/9.90  
% 9.96/10.13  
% 9.96/10.13  
% 9.96/10.13  Changing weight limit from 28 to 27.
% 9.96/10.13  
% 9.96/10.13  Resetting weight limit to 27 after 125 givens.
% 9.96/10.13  
% 10.16/10.36  
% 10.16/10.36  
% 10.16/10.36  Changing weight limit from 27 to 26.
% 10.16/10.36  
% 10.16/10.36  Resetting weight limit to 26 after 130 givens.
% 10.16/10.36  
% 10.35/10.55  
% 10.35/10.55  
% 10.35/10.55  Changing weight limit from 26 to 25.
% 10.35/10.55  
% 10.35/10.55  Resetting weight limit to 25 after 135 givens.
% 10.35/10.55  
% 10.55/10.74  
% 10.55/10.74  
% 10.55/10.74  Changing weight limit from 25 to 24.
% 10.55/10.74  
% 10.55/10.74  Resetting weight limit to 24 after 140 givens.
% 10.55/10.74  
% 10.68/10.88  
% 10.68/10.88  
% 10.68/10.88  Changing weight limit from 24 to 23.
% 10.68/10.88  
% 10.68/10.88  Resetting weight limit to 23 after 145 givens.
% 10.68/10.88  
% 10.79/11.01  
% 10.79/11.01  
% 10.79/11.01  Changing weight limit from 23 to 14.
% 10.79/11.01  
% 10.79/11.01  Resetting weight limit to 14 after 150 givens.
% 10.79/11.01  
% 10.79/11.02  
% 10.79/11.02  
% 10.79/11.02  Changing weight limit from 14 to 13.
% 10.79/11.02  
% 10.79/11.02  Resetting weight limit to 13 after 155 givens.
% 10.79/11.02  
% 10.87/11.05  
% 10.87/11.05  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 10.87/11.05  
% 10.87/11.05  ----> UNIT CONFLICT at  10.66 sec ----> 12383 [binary,12382.1,110.1] {-} $F.
% 10.87/11.05  
% 10.87/11.05  Length of proof is 8.  Level of proof is 4.
% 10.87/11.05  
% 10.87/11.05  ---------------- PROOF ----------------
% 10.87/11.05  % SZS status Unsatisfiable
% 10.87/11.05  % SZS output start Refutation
% 10.87/11.05  
% 10.87/11.05  9 [] {+} -topological_space(A,B)| -element_of_collection(C,B)| -element_of_collection(D,B)|element_of_collection(intersection_of_sets(C,D),B).
% 10.87/11.05  17 [] {+} -open(A,B,C)|topological_space(B,C).
% 10.87/11.05  18 [] {+} -open(A,B,C)|element_of_collection(A,C).
% 10.87/11.05  19 [] {+} open(A,B,C)| -topological_space(B,C)| -element_of_collection(A,C).
% 10.87/11.05  42 [] {+} -element_of_collection(A,subspace_topology(B,C,D))|element_of_collection(f12(B,C,D,A),C).
% 10.87/11.05  43 [] {-} -element_of_collection(A,subspace_topology(B,C,D))|equal_sets(A,intersection_of_sets(D,f12(B,C,D,A))).
% 10.87/11.05  44 [copy,43,flip.2] {+} -element_of_collection(A,subspace_topology(B,C,D))|equal_sets(intersection_of_sets(D,f12(B,C,D,A)),A).
% 10.87/11.05  110 [] {+} -open(a,cx,ct).
% 10.87/11.05  135 [] {-} open(cy,cx,ct).
% 10.87/11.05  136 [] {-} open(a,cy,subspace_topology(cx,ct,cy)).
% 10.87/11.05  151 [hyper,135,18] {-} element_of_collection(cy,ct).
% 10.87/11.05  152 [hyper,135,17] {-} topological_space(cx,ct).
% 10.87/11.05  344 [hyper,136,18] {-} element_of_collection(a,subspace_topology(cx,ct,cy)).
% 10.87/11.05  2133,2132 [hyper,344,44] {-} equal_sets(intersection_of_sets(cy,f12(cx,ct,cy,a)),a).
% 10.87/11.05  2134 [hyper,344,42] {-} element_of_collection(f12(cx,ct,cy,a),ct).
% 10.87/11.05  12301 [hyper,2134,9,152,151,demod,2133] {-} element_of_collection(a,ct).
% 10.87/11.05  12382 [hyper,12301,19,152] {-} open(a,cx,ct).
% 10.87/11.05  12383 [binary,12382.1,110.1] {-} $F.
% 10.87/11.05  
% 10.87/11.05  % SZS output end Refutation
% 10.87/11.05  ------------ end of proof -------------
% 10.87/11.05  
% 10.87/11.05  
% 10.87/11.05  Search stopped by max_proofs option.
% 10.87/11.05  
% 10.87/11.05  
% 10.87/11.05  Search stopped by max_proofs option.
% 10.87/11.05  
% 10.87/11.05  ============ end of search ============
% 10.87/11.05  
% 10.87/11.05  That finishes the proof of the theorem.
% 10.87/11.05  
% 10.87/11.05  Process 3550 finished Sun May 29 05:49:04 2022
%------------------------------------------------------------------------------