TSTP Solution File: CSR045+1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : CSR045+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n026.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 : Fri Jul 15 23:21:29 EDT 2022

% Result   : Theorem 0.84s 1.04s
% Output   : Refutation 0.84s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : CSR045+1 : TPTP v8.1.0. Released v3.4.0.
% 0.08/0.14  % Command  : sos-script %s
% 0.14/0.35  % Computer : n026.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Fri Jun 10 18:58:33 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.38  ----- Otter 3.2, August 2001 -----
% 0.14/0.38  The process was started by sandbox on n026.cluster.edu,
% 0.14/0.38  Fri Jun 10 18:58:33 2022
% 0.14/0.38  The command was "./sos".  The process ID is 15438.
% 0.14/0.38  
% 0.14/0.38  set(prolog_style_variables).
% 0.14/0.38  set(auto).
% 0.14/0.38     dependent: set(auto1).
% 0.14/0.38     dependent: set(process_input).
% 0.14/0.38     dependent: clear(print_kept).
% 0.14/0.38     dependent: clear(print_new_demod).
% 0.14/0.38     dependent: clear(print_back_demod).
% 0.14/0.38     dependent: clear(print_back_sub).
% 0.14/0.38     dependent: set(control_memory).
% 0.14/0.38     dependent: assign(max_mem, 12000).
% 0.14/0.38     dependent: assign(pick_given_ratio, 4).
% 0.14/0.38     dependent: assign(stats_level, 1).
% 0.14/0.38     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38     dependent: assign(sos_limit, 5000).
% 0.14/0.38     dependent: assign(max_weight, 60).
% 0.14/0.38  clear(print_given).
% 0.14/0.38  
% 0.14/0.38  formula_list(usable).
% 0.14/0.38  
% 0.14/0.38  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.38  
% 0.14/0.38  This is a Horn set without equality.  The strategy will
% 0.14/0.38  be hyperresolution, with satellites in sos and nuclei
% 0.14/0.38  in usable.
% 0.14/0.38  
% 0.14/0.38     dependent: set(hyper_res).
% 0.14/0.38     dependent: clear(order_hyper).
% 0.14/0.38  
% 0.14/0.38  ------------> process usable:
% 0.14/0.38    Following clause subsumed by 7 during input processing: 0 [] {-} -isa(A,B)| -isa(A,C)| -disjointwith(B,C).
% 0.14/0.38    Following clause subsumed by 8 during input processing: 0 [] {-} -genlinverse(A,B)| -genlinverse(B,C)|genlpreds(A,C).
% 0.14/0.38    Following clause subsumed by 12 during input processing: 0 [] {-} -arg1isa(A,B)| -genls(B,C)|arg1isa(A,C).
% 0.14/0.38    Following clause subsumed by 13 during input processing: 0 [] {-} -genlpreds(A,B)|predicate(B).
% 0.14/0.38    Following clause subsumed by 14 during input processing: 0 [] {-} -genlpreds(A,B)|predicate(A).
% 0.14/0.38    Following clause subsumed by 16 during input processing: 0 [] {-} -predicate(A)|genlpreds(A,A).
% 0.14/0.38    Following clause subsumed by 37 during input processing: 0 [] {-} -genlmt(A,B)|microtheory(B).
% 0.14/0.38    Following clause subsumed by 38 during input processing: 0 [] {-} -genlmt(A,B)|microtheory(A).
% 0.14/0.38    Following clause subsumed by 40 during input processing: 0 [] {-} -microtheory(A)|genlmt(A,A).
% 0.14/0.38    Following clause subsumed by 45 during input processing: 0 [] {-} -genls(A,B)|collection(B).
% 0.14/0.38    Following clause subsumed by 9 during input processing: 0 [] {-} -genls(A,B)|collection(A).
% 0.14/0.38    Following clause subsumed by 9 during input processing: 0 [] {-} -genls(A,B)|collection(A).
% 0.14/0.38    Following clause subsumed by 47 during input processing: 0 [] {-} -collection(A)|genls(A,A).
% 0.14/0.38    Following clause subsumed by 46 during input processing: 0 [] {-} -genls(A,B)| -genls(C,A)|genls(C,B).
% 0.14/0.38    Following clause subsumed by 46 during input processing: 0 [] {-} -genls(A,B)| -genls(B,C)|genls(A,C).
% 0.14/0.38    Following clause subsumed by 50 during input processing: 0 [] {-} -isa(A,B)|collection(B).
% 0.14/0.38    Following clause subsumed by 51 during input processing: 0 [] {-} -isa(A,B)|thing(A).
% 0.14/0.38  
% 0.14/0.38  ------------> process sos:
% 0.14/0.38  
% 0.14/0.38  ======= end of input processing =======
% 0.14/0.40  
% 0.14/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40  
% 0.14/0.40  Stopped by limit on number of solutions
% 0.14/0.40  
% 0.14/0.40  
% 0.14/0.40  -------------- Softie stats --------------
% 0.14/0.40  
% 0.14/0.40  UPDATE_STOP: 300
% 0.14/0.40  SFINDER_TIME_LIMIT: 2
% 0.14/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40  number of clauses in intial UL: 52
% 0.14/0.40  number of clauses initially in problem: 68
% 0.14/0.40  percentage of clauses intially in UL: 76
% 0.14/0.40  percentage of distinct symbols occuring in initial UL: 77
% 0.14/0.40  percent of all initial clauses that are short: 100
% 0.14/0.40  absolute distinct symbol count: 36
% 0.14/0.40     distinct predicate count: 20
% 0.14/0.40     distinct function count: 0
% 0.14/0.40     distinct constant count: 16
% 0.14/0.40  
% 0.14/0.40  ---------- no more Softie stats ----------
% 0.14/0.40  
% 0.14/0.40  
% 0.14/0.40  
% 0.14/0.40  =========== start of search ===========
% 0.84/1.04  
% 0.84/1.04  -------- PROOF -------- 
% 0.84/1.04  % SZS status Theorem
% 0.84/1.04  % SZS output start Refutation
% 0.84/1.04  
% 0.84/1.04  Model 2 (0.00 seconds, 0 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on number of solutions
% 0.84/1.04  
% 0.84/1.04  Model 3 (0.00 seconds, 0 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on number of solutions
% 0.84/1.04  
% 0.84/1.04  Model 4 (0.00 seconds, 0 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on number of solutions
% 0.84/1.04  
% 0.84/1.04  Model 5 (0.00 seconds, 0 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on number of solutions
% 0.84/1.04  
% 0.84/1.04  Model 6 (0.00 seconds, 0 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on number of solutions
% 0.84/1.04  
% 0.84/1.04  Model 7 (0.00 seconds, 0 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on number of solutions
% 0.84/1.04  
% 0.84/1.04  Model 8 (0.00 seconds, 0 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on number of solutions
% 0.84/1.04  
% 0.84/1.04  Model 9 (0.00 seconds, 0 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on number of solutions
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on insertions
% 0.84/1.04  
% 0.84/1.04  Model 10 [ 4 1 401 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04  
% 0.84/1.04  Model 11 (0.00 seconds, 250000 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on number of solutions
% 0.84/1.04  
% 0.84/1.04  Model 12 (0.00 seconds, 250000 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on number of solutions
% 0.84/1.04  
% 0.84/1.04  Model 13 [ 1 1 363 ] (0.00 seconds, 1154 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on insertions
% 0.84/1.04  
% 0.84/1.04  Model 14 [ 1 0 299 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on insertions
% 0.84/1.04  
% 0.84/1.04  Model 15 [ 2 0 299 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on insertions
% 0.84/1.04  
% 0.84/1.04  Model 16 [ 2 0 378 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04  
% 0.84/1.04  Model 17 [ 2 0 504 ] (0.00 seconds, 989 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on insertions
% 0.84/1.04  
% 0.84/1.04  Model 18 [ 4 1 359 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on insertions
% 0.84/1.04  
% 0.84/1.04  Model 19 [ 2 1 210 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on insertions
% 0.84/1.04  
% 0.84/1.04  Model 20 [ 4 0 221 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on insertions
% 0.84/1.04  
% 0.84/1.04  Model 21 [ 10 1 174 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04  
% 0.84/1.04  -----> EMPTY CLAUSE at   0.64 sec ----> 113 [hyper,110,6,98] {-} $F.
% 0.84/1.04  
% 0.84/1.04  Length of proof is 6.  Level of proof is 5.
% 0.84/1.04  
% 0.84/1.04  ---------------- PROOF ----------------
% 0.84/1.04  % SZS status Theorem
% 0.84/1.04  % SZS output start Refutation
% 0.84/1.04  
% 0.84/1.04  1 [] {+} -microtheory(A)|aspatialinformationstore(A).
% 0.84/1.04  2 [] {+} -intangibleindividual(A)|partiallyintangibleindividual(A).
% 0.84/1.04  3 [] {+} -aspatialinformationstore(A)|intangibleindividual(A).
% 0.84/1.04  4 [] {+} -partiallyintangibleindividual(A)|individual(A).
% 0.84/1.04  5 [] {+} -applicationcontext(A)|microtheory(A).
% 0.84/1.04  6 [] {+} -collection(A)| -individual(A).
% 0.84/1.04  9 [] {+} -genls(A,B)|collection(A).
% 0.84/1.04  53 [] {+} applicationcontext(c_wamt_evalinitial_p14).
% 0.84/1.04  68 [] {+} genls(c_wamt_evalinitial_p14,c_tptpcol_15_80088).
% 0.84/1.04  70 [hyper,53,5] {+} microtheory(c_wamt_evalinitial_p14).
% 0.84/1.04  76 [hyper,70,1] {+} aspatialinformationstore(c_wamt_evalinitial_p14).
% 0.84/1.04  94 [hyper,76,3] {+} intangibleindividual(c_wamt_evalinitial_p14).
% 0.84/1.04  98 [hyper,68,9] {+} collection(c_wamt_evalinitial_p14).
% 0.84/1.04  100 [hyper,94,2] {+} partiallyintangibleindividual(c_wamt_evalinitial_p14).
% 0.84/1.04  110 [hyper,100,4] {+} individual(c_wamt_evalinitial_p14).
% 0.84/1.04  113 [hyper,110,6,98] {-} $F.
% 0.84/1.04  
% 0.84/1.04  % SZS output end Refutation
% 0.84/1.04  ------------ end of proof -------------
% 0.84/1.04  
% 0.84/1.04  
% 0.84/1.04  Search stopped by max_proofs option.
% 0.84/1.04  
% 0.84/1.04  
% 0.84/1.04  Search stopped by max_proofs option.
% 0.84/1.04  
% 0.84/1.04  ============ end of search ============
% 0.84/1.04  
% 0.84/1.04  ----------- soft-scott stats ----------
% 0.84/1.04  
% 0.84/1.04  true clauses given           8      (28.6%)
% 0.84/1.04  false clauses given         20
% 0.84/1.04  
% 0.84/1.04        FALSE     TRUE
% 0.84/1.04     2  3         6
% 0.84/1.04     3  10        12
% 0.84/1.04  tot:  13        18      (58.1% true)
% 0.84/1.04  
% 0.84/1.04  
% 0.84/1.04  Model 21 [ 10 1 174 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04  
% 0.84/1.04  That finishes the proof of the theorem.
% 0.84/1.04  
% 0.84/1.04  Process 15438 finished Fri Jun 10 18:58:34 2022
%------------------------------------------------------------------------------