%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS163+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS163+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.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:43:16 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 sandbox2 on n026.cluster.edu,
% 0.13/0.36 Tue Jun 7 16:43:16 2022
% 0.13/0.36 The command was "./sos". The process ID is 31545.
% 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=1, symmetry=0, max_lits=7.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36 7 back subsumes 3.
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 14 during input processing: 0 [] {-} cowlThing(ia).
% 0.13/0.36 Following clause subsumed by 14 during input processing: 0 [] {-} cowlThing(ib).
% 0.13/0.36 14 back subsumes 4.
% 0.13/0.36 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 9
% 0.20/0.39 number of clauses initially in problem: 14
% 0.20/0.39 percentage of clauses intially in UL: 64
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 11
% 0.20/0.39 distinct predicate count: 7
% 0.20/0.39 distinct function count: 0
% 0.20/0.39 distinct constant count: 4
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39 =========== 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 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 Model 5 [ 1 0 54 ] (0.00 seconds, 5445 Inserts)
% 0.20/0.42
% 0.20/0.42 -----> EMPTY CLAUSE at 0.03 sec ----> 29 [hyper,28,9,16] {-} $F.
% 0.20/0.42
% 0.20/0.42 Length of proof is 6. Level of proof is 5.
% 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 7 [] {+} -cowlNothing(A).
% 0.20/0.42 8 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.20/0.42 9 [] {+} -cB(A)| -cA(A).
% 0.20/0.42 10 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cowlThing(ia)| -cowlThing(ib)|ia=ib.
% 0.20/0.42 11 [copy,10,unit_del,7,flip.6] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cowlThing(ia)| -cowlThing(ib)|ib=ia.
% 0.20/0.42 12 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cowlThing(ia)| -cowlThing(ib)|ia=ib.
% 0.20/0.42 13 [copy,12,unit_del,7,flip.6] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cowlThing(ia)| -cowlThing(ib)|ib=ia.
% 0.20/0.42 14 [] {+} cowlThing(A).
% 0.20/0.42 15 [] {+} xsd_string(A)|xsd_integer(A).
% 0.20/0.42 16 [] {+} cA(ia).
% 0.20/0.42 17 [] {+} cB(ib).
% 0.20/0.42 21 [hyper,15,13,14,14,14,factor_simp] {+} xsd_integer($c2)|ib=ia.
% 0.20/0.42 24 [hyper,21,11,14,14,14,factor_simp] {+} ib=ia|xsd_string($c2).
% 0.20/0.42 27,26 [hyper,24,8,21,factor_simp] {+} ib=ia.
% 0.20/0.42 28 [back_demod,17,demod,27] {+} cB(ia).
% 0.20/0.42 29 [hyper,28,9,16] {-} $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 6 (60.0%)
% 0.20/0.42 false clauses given 4
% 0.20/0.42
% 0.20/0.42 FALSE TRUE
% 0.20/0.42 3 0 1
% 0.20/0.42 5 0 1
% 0.20/0.42 tot: 0 2 (100.0% true)
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Model 5 [ 1 0 54 ] (0.00 seconds, 5445 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 31545 finished Tue Jun 7 16:43:16 2022
%------------------------------------------------------------------------------