TSTP Solution File: KRS168+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS168+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:56 EDT 2022
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS168+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 20:03:11 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n027.cluster.edu,
% 0.12/0.36 Tue Jun 7 20:03:11 2022
% 0.12/0.36 The command was "./sos". The process ID is 16734.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.12/0.36
% 0.12/0.36 This is a non-Horn set without equality. The strategy
% 0.12/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/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: 8
% 0.20/0.39 number of clauses initially in problem: 10
% 0.20/0.39 percentage of clauses intially in UL: 80
% 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: 9
% 0.20/0.39 distinct predicate count: 6
% 0.20/0.39 distinct function count: 0
% 0.20/0.39 distinct constant count: 3
% 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.46
% 0.20/0.46 -------- PROOF --------
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 % SZS output start Refutation
% 0.20/0.46
% 0.20/0.46 Model 3 [ 1 0 610 ] (0.00 seconds, 4415 Inserts)
% 0.20/0.46
% 0.20/0.46 Model 4 [ 1 1 475 ] (0.00 seconds, 3916 Inserts)
% 0.20/0.46
% 0.20/0.46 Model 5 [ 1 1 238 ] (0.00 seconds, 2980 Inserts)
% 0.20/0.46
% 0.20/0.46 Model 6 [ 2 1 239 ] (0.00 seconds, 3427 Inserts)
% 0.20/0.46
% 0.20/0.46 -----> EMPTY CLAUSE at 0.08 sec ----> 25 [hyper,24,2,23] {-} $F.
% 0.20/0.46
% 0.20/0.46 Length of proof is 14. Level of proof is 9.
% 0.20/0.46
% 0.20/0.46 ---------------- PROOF ----------------
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 % SZS output start Refutation
% 0.20/0.46
% 0.20/0.46 1 [] {+} -cowlNothing(A).
% 0.20/0.46 2 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.20/0.46 3 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cB($c3).
% 0.20/0.46 4 [copy,3,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cB($c3).
% 0.20/0.46 5 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA($c3).
% 0.20/0.46 6 [copy,5,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA($c3).
% 0.20/0.46 7 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)|cB($c3)|cA($c3).
% 0.20/0.46 8 [copy,7,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)|cB($c3)|cA($c3).
% 0.20/0.46 9 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cB($c3).
% 0.20/0.46 10 [copy,9,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cB($c3).
% 0.20/0.46 11 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA($c3).
% 0.20/0.46 12 [copy,11,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA($c3).
% 0.20/0.46 13 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)|cB($c3)|cA($c3).
% 0.20/0.46 14 [copy,13,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)|cB($c3)|cA($c3).
% 0.20/0.46 15 [] {+} cowlThing(A).
% 0.20/0.46 16 [] {+} xsd_string(A)|xsd_integer(A).
% 0.20/0.46 17 [hyper,16,14,15,factor_simp] {+} xsd_integer($c2)|cB($c3)|cA($c3).
% 0.20/0.46 18 [hyper,17,8,15,factor_simp,factor_simp] {+} cB($c3)|cA($c3)|xsd_string($c2).
% 0.20/0.46 19 [hyper,18,2,17,factor_simp,factor_simp] {+} cB($c3)|cA($c3).
% 0.20/0.46 20 [hyper,19,10,15,16,factor_simp] {+} cA($c3)|xsd_integer($c2).
% 0.20/0.46 21 [hyper,20,4,15,19,factor_simp] {+} cA($c3)|xsd_string($c2).
% 0.20/0.46 22 [hyper,21,2,20,factor_simp] {+} cA($c3).
% 0.20/0.46 23 [hyper,22,12,15,16,factor_simp] {+} xsd_integer($c2).
% 0.20/0.46 24 [hyper,23,6,15,22] {+} xsd_string($c2).
% 0.20/0.46 25 [hyper,24,2,23] {-} $F.
% 0.20/0.46
% 0.20/0.46 % SZS output end Refutation
% 0.20/0.46 ------------ end of proof -------------
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Search stopped by max_proofs option.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Search stopped by max_proofs option.
% 0.20/0.46
% 0.20/0.46 ============ end of search ============
% 0.20/0.46
% 0.20/0.46 ----------- soft-scott stats ----------
% 0.20/0.46
% 0.20/0.46 true clauses given 5 (50.0%)
% 0.20/0.46 false clauses given 5
% 0.20/0.46
% 0.20/0.46 FALSE TRUE
% 0.20/0.46 tot: 0 0 (-nan% true)
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Model 6 [ 2 1 239 ] (0.00 seconds, 3427 Inserts)
% 0.20/0.46
% 0.20/0.46 That finishes the proof of the theorem.
% 0.20/0.46
% 0.20/0.46 Process 16734 finished Tue Jun 7 20:03:11 2022
%------------------------------------------------------------------------------