TSTP Solution File: KRS146+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS146+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:53 EDT 2022
% Result : Theorem 1.66s 1.87s
% Output : Refutation 1.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS146+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : sos-script %s
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jun 7 14:40:15 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.35 ----- Otter 3.2, August 2001 -----
% 0.11/0.35 The process was started by sandbox on n028.cluster.edu,
% 0.11/0.35 Tue Jun 7 14:40:15 2022
% 0.11/0.35 The command was "./sos". The process ID is 3007.
% 0.11/0.35
% 0.11/0.35 set(prolog_style_variables).
% 0.11/0.35 set(auto).
% 0.11/0.35 dependent: set(auto1).
% 0.11/0.35 dependent: set(process_input).
% 0.11/0.35 dependent: clear(print_kept).
% 0.11/0.35 dependent: clear(print_new_demod).
% 0.11/0.35 dependent: clear(print_back_demod).
% 0.11/0.35 dependent: clear(print_back_sub).
% 0.11/0.35 dependent: set(control_memory).
% 0.11/0.35 dependent: assign(max_mem, 12000).
% 0.11/0.35 dependent: assign(pick_given_ratio, 4).
% 0.11/0.35 dependent: assign(stats_level, 1).
% 0.11/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.35 dependent: assign(sos_limit, 5000).
% 0.11/0.35 dependent: assign(max_weight, 60).
% 0.11/0.35 clear(print_given).
% 0.11/0.35
% 0.11/0.35 formula_list(usable).
% 0.11/0.35
% 0.11/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=13.
% 0.11/0.35
% 0.11/0.35 This is a non-Horn set without equality. The strategy
% 0.11/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.11/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.11/0.35
% 0.11/0.35 dependent: set(hyper_res).
% 0.11/0.35 dependent: set(factor).
% 0.11/0.35 dependent: set(unit_deletion).
% 0.11/0.35
% 0.11/0.35 ------------> process usable:
% 0.11/0.35
% 0.11/0.35 ------------> process sos:
% 0.11/0.35 Following clause subsumed by 215 during input processing: 0 [] {-} cowlThing(iV822576).
% 0.11/0.35
% 0.11/0.35 ======= end of input processing =======
% 0.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 212
% 0.18/0.39 number of clauses initially in problem: 226
% 0.18/0.39 percentage of clauses intially in UL: 93
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.39 percent of all initial clauses that are short: 100
% 0.18/0.39 absolute distinct symbol count: 92
% 0.18/0.39 distinct predicate count: 76
% 0.18/0.39 distinct function count: 13
% 0.18/0.39 distinct constant count: 3
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39 =========== start of search ===========
% 1.66/1.87
% 1.66/1.87 -------- PROOF --------
% 1.66/1.87 % SZS status Theorem
% 1.66/1.87 % SZS output start Refutation
% 1.66/1.87
% 1.66/1.87 Model 3 (0.00 seconds, 0 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on number of solutions
% 1.66/1.87
% 1.66/1.87 Model 4 (0.00 seconds, 0 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on number of solutions
% 1.66/1.87
% 1.66/1.87 Model 5 (0.00 seconds, 0 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on number of solutions
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 6 [ 1 1 625 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 7 [ 1 1 545 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 8 [ 1 1 540 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Model 9 (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on number of solutions
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 10 [ 3 0 388 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 11 (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on number of solutions
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 12 [ 1 15 216398 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 13 [ 2 1 560 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 14 [ 2 1 10117 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 15 [ 3 0 817 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 16 [ 4 0 1084 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 17 [ 2 1 12647 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 18 [ 4 1 1504 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 19 [ 4 1 465 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 20 [ 7 1 6293 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 Stopped by limit on insertions
% 1.66/1.87
% 1.66/1.87 Model 21 [ 6 0 893 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 -----> EMPTY CLAUSE at 1.51 sec ----> 253 [hyper,252,2,251] {-} $F.
% 1.66/1.87
% 1.66/1.87 Length of proof is 11. Level of proof is 5.
% 1.66/1.87
% 1.66/1.87 ---------------- PROOF ----------------
% 1.66/1.87 % SZS status Theorem
% 1.66/1.87 % SZS output start Refutation
% 1.66/1.87
% 1.66/1.87 1 [] {+} -cowlNothing(A).
% 1.66/1.87 2 [] {+} -xsd_string(A)| -xsd_integer(A).
% 1.66/1.87 22 [] {+} cC112(A)|cC110(A)| -cC4(A).
% 1.66/1.87 27 [] {+} cC116(A)| -cC114(A)| -cC80(A).
% 1.66/1.87 60 [] {+} cC136(A)| -cC116(A)|cC134(A).
% 1.66/1.87 122 [] {+} cC56(A)| -cC4(A)|cC10(A).
% 1.66/1.87 125 [] {+} cC58(A)| -cC34(A)| -cC56(A).
% 1.66/1.87 186 [] {+} cC96(A)|cC94(A)| -cC2(A).
% 1.66/1.87 196 [] {+} -cC134(iV822576).
% 1.66/1.87 198 [] {+} -cC96(iV822576).
% 1.66/1.87 205 [] {+} -cC10(iV822576).
% 1.66/1.87 207 [] {+} -cC76(iV822576).
% 1.66/1.87 208 [] {+} -cC112(iV822576).
% 1.66/1.87 209 [] {+} -cC78(iV822576).
% 1.66/1.87 211 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cC94(iV822576)| -cowlThing(iV822576)| -cC58(iV822576)| -cC116(iV822576)| -cC56(iV822576)| -cC110(iV822576)| -cC114(iV822576)| -cC136(iV822576)| -cC80(iV822576).
% 1.66/1.87 212 [copy,211,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cC94(iV822576)| -cowlThing(iV822576)| -cC58(iV822576)| -cC116(iV822576)| -cC56(iV822576)| -cC110(iV822576)| -cC114(iV822576)| -cC136(iV822576)| -cC80(iV822576).
% 1.66/1.87 213 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cC94(iV822576)| -cowlThing(iV822576)| -cC58(iV822576)| -cC116(iV822576)| -cC56(iV822576)| -cC110(iV822576)| -cC114(iV822576)| -cC136(iV822576)| -cC80(iV822576).
% 1.66/1.87 214 [copy,213,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cC94(iV822576)| -cowlThing(iV822576)| -cC58(iV822576)| -cC116(iV822576)| -cC56(iV822576)| -cC110(iV822576)| -cC114(iV822576)| -cC136(iV822576)| -cC80(iV822576).
% 1.66/1.87 215 [] {+} cowlThing(A).
% 1.66/1.87 216 [] {+} xsd_string(A)|xsd_integer(A).
% 1.66/1.87 218 [] {+} cC114(A)|cC96(A)|cC112(A).
% 1.66/1.87 223 [] {+} cC80(A)|cC78(A)|cC76(A).
% 1.66/1.87 226 [] {+} cC34(iV822576).
% 1.66/1.87 227 [] {+} cC4(iV822576).
% 1.66/1.87 228 [] {+} cC2(iV822576).
% 1.66/1.87 230 [hyper,227,122,unit_del,205] {+} cC56(iV822576).
% 1.66/1.87 235 [hyper,227,22,unit_del,208] {+} cC110(iV822576).
% 1.66/1.87 237 [hyper,228,186,unit_del,198] {+} cC94(iV822576).
% 1.66/1.87 241 [hyper,218,198,unit_del,208] {+} cC114(iV822576).
% 1.66/1.87 245 [hyper,230,125,226] {+} cC58(iV822576).
% 1.66/1.87 246 [hyper,241,27,223,unit_del,209,207] {+} cC116(iV822576).
% 1.66/1.87 247 [hyper,246,60,unit_del,196] {+} cC136(iV822576).
% 1.66/1.87 251 [hyper,247,214,215,216,237,215,245,246,230,235,241,223,unit_del,209,207,factor_simp] {+} xsd_integer($c2).
% 1.66/1.87 252 [hyper,251,212,215,237,215,245,246,230,235,241,247,223,unit_del,209,207] {+} xsd_string($c2).
% 1.66/1.87 253 [hyper,252,2,251] {-} $F.
% 1.66/1.87
% 1.66/1.87 % SZS output end Refutation
% 1.66/1.87 ------------ end of proof -------------
% 1.66/1.87
% 1.66/1.87
% 1.66/1.87 Search stopped by max_proofs option.
% 1.66/1.87
% 1.66/1.87
% 1.66/1.87 Search stopped by max_proofs option.
% 1.66/1.87
% 1.66/1.87 ============ end of search ============
% 1.66/1.87
% 1.66/1.87 ----------- soft-scott stats ----------
% 1.66/1.87
% 1.66/1.87 true clauses given 10 (30.3%)
% 1.66/1.87 false clauses given 23
% 1.66/1.87
% 1.66/1.87 FALSE TRUE
% 1.66/1.87 2 0 1
% 1.66/1.87 4 0 1
% 1.66/1.87 6 0 2
% 1.66/1.87 8 0 1
% 1.66/1.87 tot: 0 5 (100.0% true)
% 1.66/1.87
% 1.66/1.87
% 1.66/1.87 Model 21 [ 6 0 893 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.87
% 1.66/1.87 That finishes the proof of the theorem.
% 1.66/1.87
% 1.66/1.87 Process 3007 finished Tue Jun 7 14:40:16 2022
%------------------------------------------------------------------------------