TSTP Solution File: KRS175+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS175+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:57 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KRS175+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 7 10:30:22 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n020.cluster.edu,
% 0.13/0.37 Tue Jun 7 10:30:22 2022
% 0.13/0.37 The command was "./sos". The process ID is 5632.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37 8 back subsumes 4.
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 29 during input processing: 0 [] {-} cowlThing(ia).
% 0.13/0.37 Following clause subsumed by 29 during input processing: 0 [] {-} cowlThing(ib).
% 0.13/0.37 29 back subsumes 5.
% 0.13/0.37 Following clause subsumed by 31 during input processing: 0 [copy,31,flip.1] {-} A=A.
% 0.13/0.37
% 0.13/0.37 ======= 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: 20
% 0.20/0.40 number of clauses initially in problem: 23
% 0.20/0.40 percentage of clauses intially in UL: 86
% 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: 13
% 0.20/0.40 distinct predicate count: 8
% 0.20/0.40 distinct function count: 0
% 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.20/0.44
% 0.20/0.44 -------- PROOF --------
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 % SZS output start Refutation
% 0.20/0.44
% 0.20/0.44 Model 3 [ 1 1 83 ] (0.00 seconds, 2300 Inserts)
% 0.20/0.44
% 0.20/0.44 Model 4 [ 1 1 83 ] (0.00 seconds, 2156 Inserts)
% 0.20/0.44
% 0.20/0.44 Model 5 [ 1 1 63 ] (0.00 seconds, 1543 Inserts)
% 0.20/0.44
% 0.20/0.44 -----> EMPTY CLAUSE at 0.06 sec ----> 129 [hyper,126,9,106] {-} $F.
% 0.20/0.44
% 0.20/0.44 Length of proof is 29. Level of proof is 17.
% 0.20/0.44
% 0.20/0.44 ---------------- PROOF ----------------
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 % SZS output start Refutation
% 0.20/0.44
% 0.20/0.44 8 [] {+} -cowlNothing(A).
% 0.20/0.44 9 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.20/0.44 10 [] {+} -cA(A)|A=ia.
% 0.20/0.44 11 [] {+} cA(A)|A!=ia.
% 0.20/0.44 12 [] {+} -cA_and_B(A)|cA(A)|cB(A).
% 0.20/0.44 13 [] {+} cA_and_B(A)| -cA(A).
% 0.20/0.44 14 [] {+} cA_and_B(A)| -cB(A).
% 0.20/0.44 15 [] {+} -cB(A)|A=ib.
% 0.20/0.44 16 [] {+} cB(A)|A!=ib.
% 0.20/0.44 17 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)|cA_and_B($c3)|$c3=ib|$c3=ia| -cowlThing(ia)| -cowlThing(ib).
% 0.20/0.44 18 [copy,17,unit_del,8,flip.5,flip.6] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)|cA_and_B($c3)|ib=$c3|ia=$c3| -cowlThing(ia)| -cowlThing(ib).
% 0.20/0.44 19 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA_and_B($c3)|$c3!=ib| -cowlThing(ia)| -cowlThing(ib).
% 0.20/0.44 20 [copy,19,unit_del,8,flip.5] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA_and_B($c3)|ib!=$c3| -cowlThing(ia)| -cowlThing(ib).
% 0.20/0.44 21 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA_and_B($c3)|$c3!=ia| -cowlThing(ia)| -cowlThing(ib).
% 0.20/0.44 22 [copy,21,unit_del,8,flip.5] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA_and_B($c3)|ia!=$c3| -cowlThing(ia)| -cowlThing(ib).
% 0.20/0.44 23 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)|cA_and_B($c3)|$c3=ib|$c3=ia| -cowlThing(ia)| -cowlThing(ib).
% 0.20/0.44 24 [copy,23,unit_del,8,flip.5,flip.6] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)|cA_and_B($c3)|ib=$c3|ia=$c3| -cowlThing(ia)| -cowlThing(ib).
% 0.20/0.44 25 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA_and_B($c3)|$c3!=ib| -cowlThing(ia)| -cowlThing(ib).
% 0.20/0.44 26 [copy,25,unit_del,8,flip.5] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA_and_B($c3)|ib!=$c3| -cowlThing(ia)| -cowlThing(ib).
% 0.20/0.44 27 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA_and_B($c3)|$c3!=ia| -cowlThing(ia)| -cowlThing(ib).
% 0.20/0.44 28 [copy,27,unit_del,8,flip.5] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA_and_B($c3)|ia!=$c3| -cowlThing(ia)| -cowlThing(ib).
% 0.20/0.44 29 [] {+} cowlThing(A).
% 0.20/0.44 30 [] {+} xsd_string(A)|xsd_integer(A).
% 0.20/0.44 31 [] {+} A=A.
% 0.20/0.44 32 [hyper,30,24,29,29,29,factor_simp] {+} xsd_integer($c2)|cA_and_B($c3)|ib=$c3|ia=$c3.
% 0.20/0.44 33 [hyper,31,16] {+} cB(ib).
% 0.20/0.44 34 [hyper,31,11] {+} cA(ia).
% 0.20/0.44 35 [hyper,33,14] {+} cA_and_B(ib).
% 0.20/0.44 36 [para_into,33.1.1,18.5.1,unit_del,29,29,29] {+} cB($c3)|xsd_string($c2)| -xsd_integer($c2)|cA_and_B($c3)|ia=$c3.
% 0.20/0.44 38 [hyper,34,13] {+} cA_and_B(ia).
% 0.20/0.44 48 [para_into,35.1.1,32.3.1,factor_simp] {+} cA_and_B($c3)|xsd_integer($c2)|ia=$c3.
% 0.20/0.44 54 [para_from,36.5.1,38.1.1,factor_simp] {+} cA_and_B($c3)|cB($c3)|xsd_string($c2)| -xsd_integer($c2).
% 0.20/0.44 57 [para_from,48.3.1,38.1.1,factor_simp] {+} cA_and_B($c3)|xsd_integer($c2).
% 0.20/0.44 63 [hyper,54,57,factor_simp] {+} cA_and_B($c3)|cB($c3)|xsd_string($c2).
% 0.20/0.44 64 [hyper,63,9,57,factor_simp] {+} cA_and_B($c3)|cB($c3).
% 0.20/0.44 66 [hyper,64,14,factor_simp] {+} cA_and_B($c3).
% 0.20/0.44 67 [hyper,66,12] {+} cA($c3)|cB($c3).
% 0.20/0.44 68 [hyper,67,15,flip.2] {+} cA($c3)|ib=$c3.
% 0.20/0.44 69 [hyper,68,10,flip.2] {+} ib=$c3|ia=$c3.
% 0.20/0.44 78 [para_from,68.2.1,20.5.1,unit_del,29,66,31,29,29] {+} xsd_string($c2)| -xsd_integer($c2)|cA($c3).
% 0.20/0.44 82 [hyper,69,28,29,30,66,29,29,factor_simp] {-} ib=$c3|xsd_integer($c2).
% 0.20/0.44 99 [para_from,82.1.1,26.5.1,unit_del,29,66,31,29,29,factor_simp] {+} -xsd_string($c2)|xsd_integer($c2).
% 0.20/0.44 106 [hyper,99,30,factor_simp] {+} xsd_integer($c2).
% 0.20/0.44 115 [hyper,78,106] {+} xsd_string($c2)|cA($c3).
% 0.20/0.44 117 [hyper,115,9,106] {+} cA($c3).
% 0.20/0.44 119,118 [hyper,117,10,flip.1] {-} ia=$c3.
% 0.20/0.44 126 [back_demod,22,demod,119,119,unit_del,29,106,66,31,29,29] {+} xsd_string($c2).
% 0.20/0.44 129 [hyper,126,9,106] {-} $F.
% 0.20/0.44
% 0.20/0.44 % SZS output end Refutation
% 0.20/0.44 ------------ end of proof -------------
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Search stopped by max_proofs option.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Search stopped by max_proofs option.
% 0.20/0.44
% 0.20/0.44 ============ end of search ============
% 0.20/0.44
% 0.20/0.44 ----------- soft-scott stats ----------
% 0.20/0.44
% 0.20/0.44 true clauses given 30 (85.7%)
% 0.20/0.44 false clauses given 5
% 0.20/0.44
% 0.20/0.44 FALSE TRUE
% 0.20/0.44 3 1 0
% 0.20/0.44 4 1 2
% 0.20/0.44 5 2 5
% 0.20/0.44 6 0 4
% 0.20/0.44 7 0 4
% 0.20/0.44 8 0 1
% 0.20/0.44 tot: 4 16 (80.0% true)
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Model 5 [ 1 1 63 ] (0.00 seconds, 1543 Inserts)
% 0.20/0.44
% 0.20/0.44 That finishes the proof of the theorem.
% 0.20/0.44
% 0.20/0.44 Process 5632 finished Tue Jun 7 10:30:22 2022
%------------------------------------------------------------------------------