TSTP Solution File: KRS143+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS143+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:52 EDT 2022
% Result : Theorem 1.20s 1.39s
% Output : Refutation 1.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KRS143+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 05:37:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n026.cluster.edu,
% 0.12/0.35 Tue Jun 7 05:37:16 2022
% 0.12/0.35 The command was "./sos". The process ID is 18913.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 8 back subsumes 2.
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 29 back subsumes 3.
% 0.12/0.35 Following clause subsumed by 31 during input processing: 0 [copy,31,flip.1] {-} A=A.
% 0.12/0.35 31 back subsumes 28.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 17
% 0.19/0.39 number of clauses initially in problem: 20
% 0.19/0.39 percentage of clauses intially in UL: 85
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 13
% 0.19/0.39 distinct predicate count: 7
% 0.19/0.39 distinct function count: 1
% 0.19/0.39 distinct constant count: 5
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 1.20/1.39
% 1.20/1.39 -------- PROOF --------
% 1.20/1.39 % SZS status Theorem
% 1.20/1.39 % SZS output start Refutation
% 1.20/1.39
% 1.20/1.39 Stopped by limit on insertions
% 1.20/1.39
% 1.20/1.39 Model 3 [ 1 1 327 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 Stopped by limit on insertions
% 1.20/1.39
% 1.20/1.39 Model 4 [ 1 0 380 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 Stopped by limit on insertions
% 1.20/1.39
% 1.20/1.39 Model 5 [ 1 1 330 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 Stopped by limit on insertions
% 1.20/1.39
% 1.20/1.39 Model 6 [ 1 1 294 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 Stopped by limit on insertions
% 1.20/1.39
% 1.20/1.39 Model 7 [ 1 0 185 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 -----> EMPTY CLAUSE at 1.01 sec ----> 277 [hyper,275,9,197] {-} $F.
% 1.20/1.39
% 1.20/1.39 Length of proof is 23. Level of proof is 14.
% 1.20/1.39
% 1.20/1.39 ---------------- PROOF ----------------
% 1.20/1.39 % SZS status Theorem
% 1.20/1.39 % SZS output start Refutation
% 1.20/1.39
% 1.20/1.39 8 [] {+} -cowlNothing(A).
% 1.20/1.39 9 [] {+} -xsd_string(A)| -xsd_integer(A).
% 1.20/1.39 10 [] {+} -cc(A)|rp(A,$f1(A)).
% 1.20/1.39 11 [] {+} -cc(A)| -rp(A,B)| -rp(A,C)|B=C.
% 1.20/1.39 12 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)|cc($c5).
% 1.20/1.39 13 [copy,12,unit_del,8] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)|cc($c5).
% 1.20/1.39 14 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -rp($c5,A)|rp($c5,$c4).
% 1.20/1.39 15 [copy,14,unit_del,8] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -rp($c5,A)|rp($c5,$c4).
% 1.20/1.39 16 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -rp($c5,A)|rp($c5,$c3).
% 1.20/1.39 17 [copy,16,unit_del,8] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -rp($c5,A)|rp($c5,$c3).
% 1.20/1.39 18 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -rp($c5,A)|$c4!=$c3.
% 1.20/1.39 19 [copy,18,unit_del,8] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -rp($c5,A)|$c4!=$c3.
% 1.20/1.39 20 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)|cc($c5).
% 1.20/1.39 21 [copy,20,unit_del,8] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)|cc($c5).
% 1.20/1.39 22 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -rp($c5,A)|rp($c5,$c4).
% 1.20/1.39 23 [copy,22,unit_del,8] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -rp($c5,A)|rp($c5,$c4).
% 1.20/1.39 24 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -rp($c5,A)|rp($c5,$c3).
% 1.20/1.39 25 [copy,24,unit_del,8] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -rp($c5,A)|rp($c5,$c3).
% 1.20/1.39 26 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -rp($c5,A)|$c4!=$c3.
% 1.20/1.39 27 [copy,26,unit_del,8] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -rp($c5,A)|$c4!=$c3.
% 1.20/1.39 29 [] {+} cowlThing(A).
% 1.20/1.39 30 [] {+} xsd_string(A)|xsd_integer(A).
% 1.20/1.39 31 [] {+} A=A.
% 1.20/1.39 32 [hyper,30,21,29,factor_simp] {+} xsd_integer($c2)|cc($c5).
% 1.20/1.39 33 [hyper,32,13,29,factor_simp] {+} cc($c5)|xsd_string($c2).
% 1.20/1.39 36 [hyper,33,9,32,factor_simp] {+} cc($c5).
% 1.20/1.39 44 [hyper,36,10] {+} rp($c5,$f1($c5)).
% 1.20/1.39 46 [hyper,44,25,29,30,factor_simp] {+} xsd_integer($c2)|rp($c5,$c3).
% 1.20/1.39 47 [hyper,44,23,29,30,factor_simp] {+} xsd_integer($c2)|rp($c5,$c4).
% 1.20/1.39 51 [hyper,46,17,29,44,factor_simp] {-} rp($c5,$c3)|xsd_string($c2).
% 1.20/1.39 55 [hyper,51,9,46,factor_simp] {+} rp($c5,$c3).
% 1.20/1.39 83 [hyper,47,15,29,55,factor_simp] {-} rp($c5,$c4)|xsd_string($c2).
% 1.20/1.39 88 [hyper,83,9,47,factor_simp] {+} rp($c5,$c4).
% 1.20/1.39 90,89 [hyper,88,11,36,55,flip.1] {+} $c4=$c3.
% 1.20/1.39 91 [back_demod,27,demod,90,unit_del,29,31] {+} -xsd_string($c2)|xsd_integer($c2)| -rp($c5,A).
% 1.20/1.39 92 [back_demod,19,demod,90,unit_del,29,31] {-} xsd_string($c2)| -xsd_integer($c2)| -rp($c5,A).
% 1.20/1.39 197 [hyper,91,30,55,factor_simp] {-} xsd_integer($c2).
% 1.20/1.39 275 [hyper,197,92,55] {-} xsd_string($c2).
% 1.20/1.39 277 [hyper,275,9,197] {-} $F.
% 1.20/1.39
% 1.20/1.39 % SZS output end Refutation
% 1.20/1.39 ------------ end of proof -------------
% 1.20/1.39
% 1.20/1.39
% 1.20/1.39 Search stopped by max_proofs option.
% 1.20/1.39
% 1.20/1.39
% 1.20/1.39 Search stopped by max_proofs option.
% 1.20/1.39
% 1.20/1.39 ============ end of search ============
% 1.20/1.39
% 1.20/1.39 ----------- soft-scott stats ----------
% 1.20/1.39
% 1.20/1.39 true clauses given 16 (47.1%)
% 1.20/1.39 false clauses given 18
% 1.20/1.39
% 1.20/1.39 FALSE TRUE
% 1.20/1.39 2 1 0
% 1.20/1.39 3 0 2
% 1.20/1.39 8 0 1
% 1.20/1.39 10 0 4
% 1.20/1.39 11 0 4
% 1.20/1.39 12 0 4
% 1.20/1.39 13 1 6
% 1.20/1.39 14 0 3
% 1.20/1.39 15 0 8
% 1.20/1.39 16 0 4
% 1.20/1.39 17 0 1
% 1.20/1.39 18 1 34
% 1.20/1.39 19 0 5
% 1.20/1.39 20 0 5
% 1.20/1.39 21 1 25
% 1.20/1.39 23 8 1
% 1.20/1.39 24 0 5
% 1.20/1.39 26 4 0
% 1.20/1.39 tot: 16 112 (87.5% true)
% 1.20/1.39
% 1.20/1.39
% 1.20/1.39 Model 7 [ 1 0 185 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 That finishes the proof of the theorem.
% 1.20/1.39
% 1.20/1.39 Process 18913 finished Tue Jun 7 05:37:17 2022
%------------------------------------------------------------------------------