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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : KRS171+1 : TPTP v8.1.0. Released v3.1.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 : Sun Jul 17 03:29:56 EDT 2022

% Result   : Theorem 0.70s 0.93s
% Output   : Refutation 0.70s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KRS171+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.13/0.33  % Computer : n026.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jun  7 17:01:16 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  ----- Otter 3.2, August 2001 -----
% 0.13/0.35  The process was started by sandbox2 on n026.cluster.edu,
% 0.13/0.35  Tue Jun  7 17:01:16 2022
% 0.13/0.35  The command was "./sos".  The process ID is 18409.
% 0.13/0.35  
% 0.13/0.35  set(prolog_style_variables).
% 0.13/0.35  set(auto).
% 0.13/0.35     dependent: set(auto1).
% 0.13/0.35     dependent: set(process_input).
% 0.13/0.35     dependent: clear(print_kept).
% 0.13/0.35     dependent: clear(print_new_demod).
% 0.13/0.35     dependent: clear(print_back_demod).
% 0.13/0.35     dependent: clear(print_back_sub).
% 0.13/0.35     dependent: set(control_memory).
% 0.13/0.35     dependent: assign(max_mem, 12000).
% 0.13/0.35     dependent: assign(pick_given_ratio, 4).
% 0.13/0.35     dependent: assign(stats_level, 1).
% 0.13/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35     dependent: assign(sos_limit, 5000).
% 0.13/0.35     dependent: assign(max_weight, 60).
% 0.13/0.35  clear(print_given).
% 0.13/0.35  
% 0.13/0.35  formula_list(usable).
% 0.13/0.35  
% 0.13/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.13/0.35  
% 0.13/0.35  This is a non-Horn set without equality.  The strategy
% 0.13/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.13/0.35  
% 0.13/0.35     dependent: set(hyper_res).
% 0.13/0.35     dependent: set(factor).
% 0.13/0.35     dependent: set(unit_deletion).
% 0.13/0.35  
% 0.13/0.35  ------------> process usable:
% 0.13/0.35  
% 0.13/0.35  ------------> process sos:
% 0.13/0.35  
% 0.13/0.35  ======= end of input processing =======
% 0.19/0.44  
% 0.19/0.44  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.44  
% 0.19/0.44  Stopped by limit on number of solutions
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  -------------- Softie stats --------------
% 0.19/0.44  
% 0.19/0.44  UPDATE_STOP: 300
% 0.19/0.44  SFINDER_TIME_LIMIT: 2
% 0.19/0.44  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.44  number of clauses in intial UL: 8
% 0.19/0.44  number of clauses initially in problem: 10
% 0.19/0.44  percentage of clauses intially in UL: 80
% 0.19/0.44  percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.44  percent of all initial clauses that are short: 100
% 0.19/0.44  absolute distinct symbol count: 10
% 0.19/0.44     distinct predicate count: 6
% 0.19/0.44     distinct function count: 0
% 0.19/0.44     distinct constant count: 4
% 0.19/0.44  
% 0.19/0.44  ---------- no more Softie stats ----------
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.44  
% 0.19/0.44  Stopped by limit on number of solutions
% 0.19/0.44  
% 0.19/0.44  =========== start of search ===========
% 0.70/0.93  
% 0.70/0.93  -------- PROOF -------- 
% 0.70/0.93  % SZS status Theorem
% 0.70/0.93  % SZS output start Refutation
% 0.70/0.93  
% 0.70/0.93  Model 3 [ 1 1 201 ] (0.00 seconds, 201944 Inserts)
% 0.70/0.93  
% 0.70/0.93  Model 4 [ 1 1 125 ] (0.00 seconds, 117025 Inserts)
% 0.70/0.93  
% 0.70/0.93  Model 5 [ 2 0 89 ] (0.00 seconds, 116206 Inserts)
% 0.70/0.93  
% 0.70/0.93  -----> EMPTY CLAUSE at   0.55 sec ----> 22 [hyper,21,2,20] {-} $F.
% 0.70/0.93  
% 0.70/0.93  Length of proof is 11.  Level of proof is 8.
% 0.70/0.93  
% 0.70/0.93  ---------------- PROOF ----------------
% 0.70/0.93  % SZS status Theorem
% 0.70/0.93  % SZS output start Refutation
% 0.70/0.93  
% 0.70/0.93  1 [] {+} -cowlNothing(A).
% 0.70/0.93  2 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.70/0.93  3 [] {+} -rhasHead(A,B)|rhasLeader(A,B).
% 0.70/0.93  4 [] {+} -rhasLeader(A,B)|rhasHead(A,B).
% 0.70/0.93  5 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)|rhasLeader($c4,$c3)|rhasHead($c4,$c3).
% 0.70/0.93  6 [copy,5,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)|rhasLeader($c4,$c3)|rhasHead($c4,$c3).
% 0.70/0.93  7 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -rhasLeader($c4,$c3)| -rhasHead($c4,$c3).
% 0.70/0.93  8 [copy,7,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -rhasLeader($c4,$c3)| -rhasHead($c4,$c3).
% 0.70/0.93  9 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)|rhasLeader($c4,$c3)|rhasHead($c4,$c3).
% 0.70/0.93  10 [copy,9,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)|rhasLeader($c4,$c3)|rhasHead($c4,$c3).
% 0.70/0.93  11 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -rhasLeader($c4,$c3)| -rhasHead($c4,$c3).
% 0.70/0.93  12 [copy,11,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -rhasLeader($c4,$c3)| -rhasHead($c4,$c3).
% 0.70/0.93  13 [] {+} cowlThing(A).
% 0.70/0.93  14 [] {+} xsd_string(A)|xsd_integer(A).
% 0.70/0.93  15 [hyper,14,10,13,factor_simp] {+} xsd_integer($c2)|rhasLeader($c4,$c3)|rhasHead($c4,$c3).
% 0.70/0.93  16 [hyper,15,6,13,factor_simp,factor_simp] {+} rhasLeader($c4,$c3)|rhasHead($c4,$c3)|xsd_string($c2).
% 0.70/0.93  17 [hyper,16,2,15,factor_simp,factor_simp] {+} rhasLeader($c4,$c3)|rhasHead($c4,$c3).
% 0.70/0.93  18 [hyper,17,4,factor_simp] {+} rhasHead($c4,$c3).
% 0.70/0.93  19 [hyper,18,3] {+} rhasLeader($c4,$c3).
% 0.70/0.93  20 [hyper,19,12,13,14,18,factor_simp] {+} xsd_integer($c2).
% 0.70/0.93  21 [hyper,20,8,13,19,18] {+} xsd_string($c2).
% 0.70/0.93  22 [hyper,21,2,20] {-} $F.
% 0.70/0.93  
% 0.70/0.93  % SZS output end Refutation
% 0.70/0.93  ------------ end of proof -------------
% 0.70/0.93  
% 0.70/0.93  
% 0.70/0.93  Search stopped by max_proofs option.
% 0.70/0.93  
% 0.70/0.93  
% 0.70/0.93  Search stopped by max_proofs option.
% 0.70/0.93  
% 0.70/0.93  ============ end of search ============
% 0.70/0.93  
% 0.70/0.93  ----------- soft-scott stats ----------
% 0.70/0.93  
% 0.70/0.93  true clauses given           5      (55.6%)
% 0.70/0.93  false clauses given          4
% 0.70/0.93  
% 0.70/0.93        FALSE     TRUE
% 0.70/0.93  tot:  0         0      (-nan% true)
% 0.70/0.93  
% 0.70/0.93  
% 0.70/0.93  Model 5 [ 2 0 89 ] (0.00 seconds, 116206 Inserts)
% 0.70/0.93  
% 0.70/0.93  That finishes the proof of the theorem.
% 0.70/0.93  
% 0.70/0.93  Process 18409 finished Tue Jun  7 17:01:17 2022
%------------------------------------------------------------------------------