TSTP Solution File: KRS172+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS172+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.19s 0.54s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : KRS172+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 09:06:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n023.cluster.edu,
% 0.13/0.35 Tue Jun 7 09:06:08 2022
% 0.13/0.35 The command was "./sos". The process ID is 8813.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 formula_list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.13/0.35
% 0.13/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35 clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: set(unit_deletion).
% 0.13/0.35 dependent: set(factor).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35 10 back subsumes 2.
% 0.13/0.35 17 back subsumes 15.
% 0.13/0.35 19 back subsumes 13.
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 30 during input processing: 0 [] {-} cowlThing(iv).
% 0.13/0.35 30 back subsumes 3.
% 0.13/0.35 Following clause subsumed by 32 during input processing: 0 [copy,32,flip.1] {-} A=A.
% 0.13/0.35 32 back subsumes 29.
% 0.13/0.35 32 back subsumes 28.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 19
% 0.13/0.40 number of clauses initially in problem: 22
% 0.13/0.40 percentage of clauses intially in UL: 86
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 13
% 0.13/0.40 distinct predicate count: 8
% 0.13/0.40 distinct function count: 0
% 0.13/0.40 distinct constant count: 5
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 0.19/0.54
% 0.19/0.54 -------- PROOF --------
% 0.19/0.54 % SZS status Theorem
% 0.19/0.54 % SZS output start Refutation
% 0.19/0.54
% 0.19/0.54 Model 3 [ 1 1 283 ] (0.00 seconds, 11423 Inserts)
% 0.19/0.54
% 0.19/0.54 Model 4 [ 1 0 101 ] (0.00 seconds, 5765 Inserts)
% 0.19/0.54
% 0.19/0.54 Model 5 [ 1 0 104 ] (0.00 seconds, 6349 Inserts)
% 0.19/0.54
% 0.19/0.54 -----> EMPTY CLAUSE at 0.15 sec ----> 310 [hyper,299,11,298] {-} $F.
% 0.19/0.54
% 0.19/0.54 Length of proof is 19. Level of proof is 15.
% 0.19/0.54
% 0.19/0.54 ---------------- PROOF ----------------
% 0.19/0.54 % SZS status Theorem
% 0.19/0.54 % SZS output start Refutation
% 0.19/0.54
% 0.19/0.54 10 [] {+} -cowlNothing(A).
% 0.19/0.54 11 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.19/0.54 12 [] {+} -cd(A)|rq(A,iv).
% 0.19/0.54 14 [] {+} -cd(A)|rp(A,iv).
% 0.19/0.54 16 [] {+} -rp(A,B)| -rp(A,C)|B=C.
% 0.19/0.54 17 [] {+} -rp(A,B)|cd(A).
% 0.19/0.54 18 [] {+} -rq(A,B)| -rq(A,C)|B=C.
% 0.19/0.54 19 [] {+} -rq(A,B)|cd(A).
% 0.19/0.54 20 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)|rq($c4,$c3)|rp($c4,$c3).
% 0.19/0.54 21 [copy,20,unit_del,10] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)|rq($c4,$c3)|rp($c4,$c3).
% 0.19/0.54 22 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -rq($c4,$c3)| -rp($c4,$c3).
% 0.19/0.54 23 [copy,22,unit_del,10] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -rq($c4,$c3)| -rp($c4,$c3).
% 0.19/0.54 24 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)|rq($c4,$c3)|rp($c4,$c3).
% 0.19/0.54 25 [copy,24,unit_del,10] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)|rq($c4,$c3)|rp($c4,$c3).
% 0.19/0.54 26 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -rq($c4,$c3)| -rp($c4,$c3).
% 0.19/0.54 27 [copy,26,unit_del,10] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -rq($c4,$c3)| -rp($c4,$c3).
% 0.19/0.54 30 [] {+} cowlThing(A).
% 0.19/0.54 31 [] {+} xsd_string(A)|xsd_integer(A).
% 0.19/0.54 33 [hyper,31,25,30,factor_simp] {+} xsd_integer($c2)|rq($c4,$c3)|rp($c4,$c3).
% 0.19/0.54 34 [hyper,33,21,30,factor_simp,factor_simp] {-} rq($c4,$c3)|rp($c4,$c3)|xsd_string($c2).
% 0.19/0.54 45 [hyper,34,11,33,factor_simp,factor_simp] {+} rq($c4,$c3)|rp($c4,$c3).
% 0.19/0.54 70 [hyper,45,19] {+} rp($c4,$c3)|cd($c4).
% 0.19/0.54 79 [hyper,70,14] {+} rp($c4,$c3)|rp($c4,iv).
% 0.19/0.54 87 [hyper,79,17] {+} rp($c4,iv)|cd($c4).
% 0.19/0.54 100 [hyper,87,14,factor_simp] {+} rp($c4,iv).
% 0.19/0.54 263 [hyper,100,17] {+} cd($c4).
% 0.19/0.54 268 [hyper,263,12] {+} rq($c4,iv).
% 0.19/0.54 271 [hyper,268,18,45,flip.1] {+} iv=$c3|rp($c4,$c3).
% 0.19/0.54 277,276 [hyper,271,16,100,factor_simp] {+} iv=$c3.
% 0.19/0.54 282 [back_demod,268,demod,277] {+} rq($c4,$c3).
% 0.19/0.54 287 [back_demod,100,demod,277] {+} rp($c4,$c3).
% 0.19/0.54 298 [hyper,287,27,30,31,282,factor_simp] {-} xsd_integer($c2).
% 0.19/0.54 299 [hyper,298,23,30,282,287] {-} xsd_string($c2).
% 0.19/0.54 310 [hyper,299,11,298] {-} $F.
% 0.19/0.54
% 0.19/0.54 % SZS output end Refutation
% 0.19/0.54 ------------ end of proof -------------
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54 Search stopped by max_proofs option.
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54 Search stopped by max_proofs option.
% 0.19/0.54
% 0.19/0.54 ============ end of search ============
% 0.19/0.54
% 0.19/0.54 ----------- soft-scott stats ----------
% 0.19/0.54
% 0.19/0.54 true clauses given 17 (77.3%)
% 0.19/0.54 false clauses given 5
% 0.19/0.54
% 0.19/0.54 FALSE TRUE
% 0.19/0.54 2 1 0
% 0.19/0.54 3 0 4
% 0.19/0.54 5 0 2
% 0.19/0.54 6 0 1
% 0.19/0.54 8 0 4
% 0.19/0.54 9 0 18
% 0.19/0.54 12 0 6
% 0.19/0.54 15 0 8
% 0.19/0.54 tot: 1 43 (97.7% true)
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54 Model 5 [ 1 0 104 ] (0.00 seconds, 6349 Inserts)
% 0.19/0.54
% 0.19/0.54 That finishes the proof of the theorem.
% 0.19/0.54
% 0.19/0.54 Process 8813 finished Tue Jun 7 09:06:09 2022
%------------------------------------------------------------------------------