%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS174+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS174+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : sos-script %s
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jun 7 12:58:38 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 sandbox2 on n023.cluster.edu,
% 0.11/0.35 Tue Jun 7 12:58:38 2022
% 0.11/0.35 The command was "./sos". The process ID is 17668.
% 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=1, symmetry=0, max_lits=7.
% 0.11/0.35
% 0.11/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.11/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.35 clauses in usable.
% 0.11/0.35
% 0.11/0.35 dependent: set(knuth_bendix).
% 0.11/0.35 dependent: set(para_from).
% 0.11/0.35 dependent: set(para_into).
% 0.11/0.35 dependent: clear(para_from_right).
% 0.11/0.35 dependent: clear(para_into_right).
% 0.11/0.35 dependent: set(para_from_vars).
% 0.11/0.35 dependent: set(eq_units_both_ways).
% 0.11/0.35 dependent: set(dynamic_demod_all).
% 0.11/0.35 dependent: set(dynamic_demod).
% 0.11/0.35 dependent: set(order_eq).
% 0.11/0.35 dependent: set(back_demod).
% 0.11/0.35 dependent: set(lrpo).
% 0.11/0.35 dependent: set(hyper_res).
% 0.11/0.35 dependent: set(unit_deletion).
% 0.11/0.35 dependent: set(factor).
% 0.11/0.35
% 0.11/0.35 ------------> process usable:
% 0.11/0.35 8 back subsumes 4.
% 0.11/0.35
% 0.11/0.35 ------------> process sos:
% 0.11/0.35 Following clause subsumed by 29 during input processing: 0 [] {-} cowlThing(ia).
% 0.11/0.35 Following clause subsumed by 29 during input processing: 0 [] {-} cowlThing(ib).
% 0.11/0.35 29 back subsumes 5.
% 0.11/0.35 Following clause subsumed by 31 during input processing: 0 [copy,31,flip.1] {-} A=A.
% 0.11/0.35
% 0.11/0.35 ======= end of input processing =======
% 0.20/0.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 -------------- Softie stats --------------
% 0.20/0.38
% 0.20/0.38 UPDATE_STOP: 300
% 0.20/0.38 SFINDER_TIME_LIMIT: 2
% 0.20/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38 number of clauses in intial UL: 20
% 0.20/0.38 number of clauses initially in problem: 23
% 0.20/0.38 percentage of clauses intially in UL: 86
% 0.20/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 13
% 0.20/0.38 distinct predicate count: 8
% 0.20/0.38 distinct function count: 0
% 0.20/0.38 distinct constant count: 5
% 0.20/0.38
% 0.20/0.38 ---------- no more Softie stats ----------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38 =========== start of search ===========
% 0.20/0.42
% 0.20/0.42 -------- PROOF --------
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 Model 3 [ 1 1 111 ] (0.00 seconds, 2131 Inserts)
% 0.20/0.42
% 0.20/0.42 Model 4 [ 1 0 94 ] (0.00 seconds, 1789 Inserts)
% 0.20/0.42
% 0.20/0.42 Model 5 [ 1 0 99 ] (0.00 seconds, 1563 Inserts)
% 0.20/0.42
% 0.20/0.42 Model 6 [ 2 0 99 ] (0.00 seconds, 3324 Inserts)
% 0.20/0.42
% 0.20/0.42 -----> EMPTY CLAUSE at 0.05 sec ----> 104 [hyper,102,9,101] {-} $F.
% 0.20/0.42
% 0.20/0.42 Length of proof is 27. Level of proof is 14.
% 0.20/0.42
% 0.20/0.42 ---------------- PROOF ----------------
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 2 [] {+} A!=B| -cA_and_B(A)|cA_and_B(B).
% 0.20/0.42 3 [] {+} A!=B| -cB(A)|cB(B).
% 0.20/0.42 8 [] {+} -cowlNothing(A).
% 0.20/0.42 9 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.20/0.42 10 [] {+} -cA(A)|A=ia.
% 0.20/0.42 11 [] {+} cA(A)|A!=ia.
% 0.20/0.42 12 [] {+} -cA_and_B(A)|A=ib|A=ia.
% 0.20/0.42 13 [] {+} cA_and_B(A)|A!=ib.
% 0.20/0.42 14 [] {+} cA_and_B(A)|A!=ia.
% 0.20/0.42 15 [] {+} -cB(A)|A=ib.
% 0.20/0.42 16 [] {+} cB(A)|A!=ib.
% 0.20/0.42 17 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)|cA_and_B($c3)|cB($c3)|cA($c3).
% 0.20/0.42 18 [copy,17,unit_del,8] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)|cA_and_B($c3)|cB($c3)|cA($c3).
% 0.20/0.42 19 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA_and_B($c3)| -cB($c3).
% 0.20/0.42 20 [copy,19,unit_del,8] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA_and_B($c3)| -cB($c3).
% 0.20/0.42 21 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA_and_B($c3)| -cA($c3).
% 0.20/0.42 22 [copy,21,unit_del,8] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA_and_B($c3)| -cA($c3).
% 0.20/0.42 23 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)|cA_and_B($c3)|cB($c3)|cA($c3).
% 0.20/0.42 24 [copy,23,unit_del,8] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)|cA_and_B($c3)|cB($c3)|cA($c3).
% 0.20/0.42 25 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA_and_B($c3)| -cB($c3).
% 0.20/0.42 26 [copy,25,unit_del,8] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA_and_B($c3)| -cB($c3).
% 0.20/0.42 27 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA_and_B($c3)| -cA($c3).
% 0.20/0.42 28 [copy,27,unit_del,8] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA_and_B($c3)| -cA($c3).
% 0.20/0.42 29 [] {+} cowlThing(A).
% 0.20/0.42 30 [] {+} xsd_string(A)|xsd_integer(A).
% 0.20/0.42 31 [] {+} A=A.
% 0.20/0.42 32 [hyper,30,24,29,factor_simp] {+} xsd_integer($c2)|cA_and_B($c3)|cB($c3)|cA($c3).
% 0.20/0.42 33 [hyper,31,16] {+} cB(ib).
% 0.20/0.42 34 [hyper,31,14] {+} cA_and_B(ia).
% 0.20/0.42 35 [hyper,31,13] {+} cA_and_B(ib).
% 0.20/0.42 36 [hyper,31,11] {+} cA(ia).
% 0.20/0.42 38 [hyper,32,18,29,factor_simp,factor_simp,factor_simp] {+} cA_and_B($c3)|cB($c3)|cA($c3)|xsd_string($c2).
% 0.20/0.42 44 [hyper,38,9,32,factor_simp,factor_simp,factor_simp] {+} cA_and_B($c3)|cB($c3)|cA($c3).
% 0.20/0.42 45 [hyper,44,15,flip.3] {+} cA_and_B($c3)|cA($c3)|ib=$c3.
% 0.20/0.42 46 [hyper,45,12,factor_simp] {+} cA($c3)|ib=$c3|ia=$c3.
% 0.20/0.42 50 [para_from,45.3.1,35.1.1,factor_simp] {+} cA_and_B($c3)|cA($c3).
% 0.20/0.42 52 [hyper,46,10,factor_simp] {+} ib=$c3|ia=$c3.
% 0.20/0.42 54 [hyper,52,3,33] {+} ia=$c3|cB($c3).
% 0.20/0.42 55 [hyper,52,2,35] {+} ia=$c3|cA_and_B($c3).
% 0.20/0.42 65 [hyper,54,26,29,30,50,factor_simp] {-} ia=$c3|xsd_integer($c2)|cA($c3).
% 0.20/0.42 67 [para_from,54.1.1,36.1.1] {+} cA($c3)|cB($c3).
% 0.20/0.42 77 [para_from,65.1.1,36.1.1,factor_simp] {+} cA($c3)|xsd_integer($c2).
% 0.20/0.42 87 [hyper,67,20,29,77,50,factor_simp,factor_simp] {+} cA($c3)|xsd_string($c2).
% 0.20/0.42 90 [hyper,87,9,77,factor_simp] {+} cA($c3).
% 0.20/0.42 92 [para_from,55.1.1,34.1.1,factor_simp] {+} cA_and_B($c3).
% 0.20/0.42 101 [hyper,92,28,29,30,90,factor_simp] {+} xsd_integer($c2).
% 0.20/0.42 102 [hyper,101,22,29,92,90] {+} xsd_string($c2).
% 0.20/0.42 104 [hyper,102,9,101] {-} $F.
% 0.20/0.42
% 0.20/0.42 % SZS output end Refutation
% 0.20/0.42 ------------ end of proof -------------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42 ============ end of search ============
% 0.20/0.42
% 0.20/0.42 ----------- soft-scott stats ----------
% 0.20/0.42
% 0.20/0.42 true clauses given 24 (80.0%)
% 0.20/0.42 false clauses given 6
% 0.20/0.42
% 0.20/0.42 FALSE TRUE
% 0.20/0.42 3 0 1
% 0.20/0.42 4 1 1
% 0.20/0.42 5 0 7
% 0.20/0.42 7 0 2
% 0.20/0.42 8 0 1
% 0.20/0.42 9 0 1
% 0.20/0.42 tot: 1 13 (92.9% true)
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Model 6 [ 2 0 99 ] (0.00 seconds, 3324 Inserts)
% 0.20/0.42
% 0.20/0.42 That finishes the proof of the theorem.
% 0.20/0.42
% 0.20/0.42 Process 17668 finished Tue Jun 7 12:58:38 2022
%------------------------------------------------------------------------------