TSTP Solution File: KRS150+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS150+1 : TPTP v8.1.0. Released v3.1.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 : Sun Jul 17 03:29:53 EDT 2022
% Result : Theorem 0.37s 0.63s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS150+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 16:00:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n017.cluster.edu,
% 0.13/0.36 Tue Jun 7 16:00:17 2022
% 0.13/0.36 The command was "./sos". The process ID is 1030.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=13.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 38 during input processing: 0 [] {-} cowlThing(iV16560).
% 0.13/0.36 Following clause subsumed by 38 during input processing: 0 [] {-} cowlThing(iV16561).
% 0.13/0.36 Following clause subsumed by 38 during input processing: 0 [] {-} cowlThing(iV16562).
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 35
% 0.20/0.40 number of clauses initially in problem: 43
% 0.20/0.40 percentage of clauses intially in UL: 81
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 25
% 0.20/0.40 distinct predicate count: 16
% 0.20/0.40 distinct function count: 4
% 0.20/0.40 distinct constant count: 5
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.37/0.63
% 0.37/0.63 -------- PROOF --------
% 0.37/0.63 % SZS status Theorem
% 0.47/0.63 % SZS output start Refutation
% 0.47/0.63
% 0.47/0.63 Model 3 (0.00 seconds, 0 Inserts)
% 0.47/0.63
% 0.47/0.63 Stopped by limit on number of solutions
% 0.47/0.63
% 0.47/0.63 Stopped by limit on insertions
% 0.47/0.63
% 0.47/0.63 Model 4 [ 1 1 1243 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.63
% 0.47/0.63 Stopped by limit on insertions
% 0.47/0.63
% 0.47/0.63 Model 5 [ 1 0 163 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.63
% 0.47/0.63 Stopped by limit on insertions
% 0.47/0.63
% 0.47/0.63 Model 6 [ 2 1 174 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.63
% 0.47/0.63 -----> EMPTY CLAUSE at 0.24 sec ----> 65 [hyper,64,2,63] {-} $F.
% 0.47/0.63
% 0.47/0.63 Length of proof is 9. Level of proof is 5.
% 0.47/0.63
% 0.47/0.63 ---------------- PROOF ----------------
% 0.47/0.63 % SZS status Theorem
% 0.47/0.63 % SZS output start Refutation
% 0.47/0.63
% 0.47/0.63 1 [] {+} -cowlNothing(A).
% 0.47/0.63 2 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.47/0.63 11 [] {+} -cC16(A)|cC14(A).
% 0.47/0.63 12 [] {+} -cC16(A)|cC8(A).
% 0.47/0.63 15 [] {+} -cC18(A)|cC16(A).
% 0.47/0.63 25 [] {+} -cTEST(A)|cC18(A).
% 0.47/0.63 28 [] {+} -cC4(iV16561).
% 0.47/0.63 30 [] {+} -cC2(iV16561).
% 0.47/0.63 31 [] {+} -cC10(iV16562).
% 0.47/0.63 32 [] {+} -cC2(iV16562).
% 0.47/0.63 34 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cC18(iV16560)| -cC16(iV16560)| -cowlThing(iV16560)| -cC14(iV16560)| -cC8(iV16560)| -cowlThing(iV16561)| -cC6(iV16561)| -cowlThing(iV16562)| -cC12(iV16562).
% 0.47/0.63 35 [copy,34,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cC18(iV16560)| -cC16(iV16560)| -cowlThing(iV16560)| -cC14(iV16560)| -cC8(iV16560)| -cowlThing(iV16561)| -cC6(iV16561)| -cowlThing(iV16562)| -cC12(iV16562).
% 0.47/0.63 36 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cC18(iV16560)| -cC16(iV16560)| -cowlThing(iV16560)| -cC14(iV16560)| -cC8(iV16560)| -cowlThing(iV16561)| -cC6(iV16561)| -cowlThing(iV16562)| -cC12(iV16562).
% 0.47/0.63 37 [copy,36,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cC18(iV16560)| -cC16(iV16560)| -cowlThing(iV16560)| -cC14(iV16560)| -cC8(iV16560)| -cowlThing(iV16561)| -cC6(iV16561)| -cowlThing(iV16562)| -cC12(iV16562).
% 0.47/0.63 38 [] {+} cowlThing(A).
% 0.47/0.63 39 [] {+} xsd_string(A)|xsd_integer(A).
% 0.47/0.63 40 [] {+} cC12(A)|cC2(A)|cC10(A).
% 0.47/0.63 41 [] {+} cC6(A)|cC2(A)|cC4(A).
% 0.47/0.63 43 [] {+} cTEST(iV16560).
% 0.47/0.63 46 [hyper,43,25] {+} cC18(iV16560).
% 0.47/0.63 47 [hyper,46,15] {+} cC16(iV16560).
% 0.47/0.63 48 [hyper,47,12] {+} cC8(iV16560).
% 0.47/0.63 49 [hyper,47,11] {+} cC14(iV16560).
% 0.47/0.63 57 [hyper,40,32,unit_del,31] {+} cC12(iV16562).
% 0.47/0.63 63 [hyper,41,37,38,39,46,47,38,49,48,38,38,57,unit_del,30,28,factor_simp] {+} xsd_integer($c2).
% 0.47/0.63 64 [hyper,63,35,38,46,47,38,49,48,38,41,38,57,unit_del,30,28] {+} xsd_string($c2).
% 0.47/0.63 65 [hyper,64,2,63] {-} $F.
% 0.47/0.63
% 0.47/0.63 % SZS output end Refutation
% 0.47/0.63 ------------ end of proof -------------
% 0.47/0.63
% 0.47/0.63
% 0.47/0.63 Search stopped by max_proofs option.
% 0.47/0.63
% 0.47/0.63
% 0.47/0.63 Search stopped by max_proofs option.
% 0.47/0.63
% 0.47/0.63 ============ end of search ============
% 0.47/0.63
% 0.47/0.63 ----------- soft-scott stats ----------
% 0.47/0.63
% 0.47/0.63 true clauses given 13 (72.2%)
% 0.47/0.63 false clauses given 5
% 0.47/0.63
% 0.47/0.63 FALSE TRUE
% 0.47/0.63 3 1 0
% 0.47/0.63 4 0 5
% 0.47/0.63 6 1 2
% 0.47/0.63 tot: 2 7 (77.8% true)
% 0.47/0.63
% 0.47/0.63
% 0.47/0.63 Model 6 [ 2 1 174 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.63
% 0.47/0.63 That finishes the proof of the theorem.
% 0.47/0.63
% 0.47/0.63 Process 1030 finished Tue Jun 7 16:00:18 2022
%------------------------------------------------------------------------------