%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS158+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:55 EDT 2022
% Result : Theorem 1.27s 1.44s
% Output : Refutation 1.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS158+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n024.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 : Tue Jun 7 14:14:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n024.cluster.edu,
% 0.12/0.35 Tue Jun 7 14:14:34 2022
% 0.12/0.35 The command was "./sos". The process ID is 2812.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=13.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 45 during input processing: 0 [] {-} cowlThing(iV16560).
% 0.12/0.35 Following clause subsumed by 45 during input processing: 0 [] {-} cowlThing(iV16561).
% 0.12/0.35 Following clause subsumed by 45 during input processing: 0 [] {-} cowlThing(iV16562).
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 42
% 0.12/0.39 number of clauses initially in problem: 55
% 0.12/0.39 percentage of clauses intially in UL: 76
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 91
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 37
% 0.12/0.39 distinct predicate count: 22
% 0.12/0.39 distinct function count: 10
% 0.12/0.39 distinct constant count: 5
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 1.27/1.44
% 1.27/1.44 -------- PROOF --------
% 1.27/1.44 % SZS status Theorem
% 1.27/1.44 % SZS output start Refutation
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 3 (0.00 seconds, 0 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on number of solutions
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 4 [ 1 0 366 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Model 5 (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on number of solutions
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 6 [ 1 0 320 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 7 [ 1 0 315 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 8 [ 3 1 167 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 9 [ 1 0 401 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 10 [ 3 1 443 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 11 [ 1 0 573 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 12 [ 5 0 256 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 13 [ 2 1 481 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 14 [ 8 0 326 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 15 [ 3 0 779 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 16 [ 8 0 868 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 17 [ 9 1 676 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 18 [ 8 0 833 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 Stopped by limit on insertions
% 1.27/1.44
% 1.27/1.44 Model 19 [ 13 1 408 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 -----> EMPTY CLAUSE at 1.07 sec ----> 82 [hyper,78,2,72] {-} $F.
% 1.27/1.44
% 1.27/1.44 Length of proof is 10. Level of proof is 5.
% 1.27/1.44
% 1.27/1.44 ---------------- PROOF ----------------
% 1.27/1.44 % SZS status Theorem
% 1.27/1.44 % SZS output start Refutation
% 1.27/1.44
% 1.27/1.44 1 [] {+} -cowlNothing(A).
% 1.27/1.44 2 [] {+} -xsd_string(A)| -xsd_integer(A).
% 1.27/1.44 11 [] {+} cC12(A)| -cC10xcomp(A)| -cC2xcomp(A).
% 1.27/1.44 15 [] {+} -cC16(A)|cC14(A).
% 1.27/1.44 16 [] {+} -cC16(A)|cC8(A).
% 1.27/1.44 19 [] {+} -cC18(A)|cC16(A).
% 1.27/1.44 32 [] {+} cC6(A)| -cC4xcomp(A)| -cC2xcomp(A).
% 1.27/1.44 37 [] {+} -cTEST(A)|cC18(A).
% 1.27/1.44 41 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cC18(iV16560)| -cC14(iV16560)| -cC8(iV16560)| -cC16(iV16560)| -cowlThing(iV16560)| -cC6(iV16561)| -cowlThing(iV16561)| -cC12(iV16562)| -cowlThing(iV16562).
% 1.27/1.44 42 [copy,41,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cC18(iV16560)| -cC14(iV16560)| -cC8(iV16560)| -cC16(iV16560)| -cowlThing(iV16560)| -cC6(iV16561)| -cowlThing(iV16561)| -cC12(iV16562)| -cowlThing(iV16562).
% 1.27/1.44 43 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cC18(iV16560)| -cC14(iV16560)| -cC8(iV16560)| -cC16(iV16560)| -cowlThing(iV16560)| -cC6(iV16561)| -cowlThing(iV16561)| -cC12(iV16562)| -cowlThing(iV16562).
% 1.27/1.44 44 [copy,43,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cC18(iV16560)| -cC14(iV16560)| -cC8(iV16560)| -cC16(iV16560)| -cowlThing(iV16560)| -cC6(iV16561)| -cowlThing(iV16561)| -cC12(iV16562)| -cowlThing(iV16562).
% 1.27/1.44 45 [] {+} cowlThing(A).
% 1.27/1.44 46 [] {+} xsd_string(A)|xsd_integer(A).
% 1.27/1.44 50 [] {-} cTEST(iV16560).
% 1.27/1.44 54 [] {+} cC4xcomp(iV16561).
% 1.27/1.44 55 [] {+} cC2xcomp(iV16561).
% 1.27/1.44 56 [] {+} cC10xcomp(iV16562).
% 1.27/1.44 57 [] {+} cC2xcomp(iV16562).
% 1.27/1.44 58 [hyper,50,37] {-} cC18(iV16560).
% 1.27/1.44 59 [hyper,55,32,54] {+} cC6(iV16561).
% 1.27/1.44 62 [hyper,58,19] {+} cC16(iV16560).
% 1.27/1.44 63 [hyper,62,16] {+} cC8(iV16560).
% 1.27/1.44 64 [hyper,62,15] {-} cC14(iV16560).
% 1.27/1.44 66 [hyper,57,11,56] {+} cC12(iV16562).
% 1.27/1.44 72 [hyper,59,44,45,46,58,64,63,62,45,45,66,45,factor_simp] {+} xsd_integer($c2).
% 1.27/1.44 78 [hyper,72,42,45,58,64,63,62,45,59,45,66,45] {+} xsd_string($c2).
% 1.27/1.44 82 [hyper,78,2,72] {-} $F.
% 1.27/1.44
% 1.27/1.44 % SZS output end Refutation
% 1.27/1.44 ------------ end of proof -------------
% 1.27/1.44
% 1.27/1.44
% 1.27/1.44 Search stopped by max_proofs option.
% 1.27/1.44
% 1.27/1.44
% 1.27/1.44 Search stopped by max_proofs option.
% 1.27/1.44
% 1.27/1.44 ============ end of search ============
% 1.27/1.44
% 1.27/1.44 ----------- soft-scott stats ----------
% 1.27/1.44
% 1.27/1.44 true clauses given 2 (8.7%)
% 1.27/1.44 false clauses given 21
% 1.27/1.44
% 1.27/1.44 FALSE TRUE
% 1.27/1.44 3 4 0
% 1.27/1.44 4 7 1
% 1.27/1.44 6 2 0
% 1.27/1.44 tot: 13 1 (7.1% true)
% 1.27/1.44
% 1.27/1.44
% 1.27/1.44 Model 19 [ 13 1 408 ] (0.00 seconds, 250000 Inserts)
% 1.27/1.44
% 1.27/1.44 That finishes the proof of the theorem.
% 1.27/1.44
% 1.27/1.44 Process 2812 finished Tue Jun 7 14:14:36 2022
%------------------------------------------------------------------------------