TSTP Solution File: KRS131+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS131+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:50 EDT 2022
% Result : Theorem 0.60s 0.84s
% Output : Refutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS131+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n017.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 11:58:02 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 n017.cluster.edu,
% 0.12/0.35 Tue Jun 7 11:58:02 2022
% 0.12/0.35 The command was "./sos". The process ID is 1538.
% 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=0, symmetry=0, max_lits=6.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 18 back subsumes 4.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 12
% 0.12/0.39 number of clauses initially in problem: 15
% 0.12/0.39 percentage of clauses intially in UL: 80
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 15
% 0.12/0.39 distinct predicate count: 9
% 0.12/0.39 distinct function count: 3
% 0.12/0.39 distinct constant count: 3
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.60/0.84
% 0.60/0.84 -------- PROOF --------
% 0.60/0.84 % SZS status Theorem
% 0.60/0.84 % SZS output start Refutation
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 3 [ 1 0 220 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 -----> EMPTY CLAUSE at 0.45 sec ----> 38 [hyper,37,6,35] {-} $F.
% 0.60/0.84
% 0.60/0.84 Length of proof is 16. Level of proof is 13.
% 0.60/0.84
% 0.60/0.84 ---------------- PROOF ----------------
% 0.60/0.84 % SZS status Theorem
% 0.60/0.84 % SZS output start Refutation
% 0.60/0.84
% 0.60/0.84 1 [] {+} -cowlNothing(A).
% 0.60/0.84 2 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.60/0.84 3 [] {+} -cA(A)|rq(A,$f1(A)).
% 0.60/0.84 5 [] {+} cA(A)| -rq(A,B)| -cowlThing(B).
% 0.60/0.84 6 [] {+} -cNothing(A)| -rp(A,B).
% 0.60/0.84 7 [] {+} -cNothing(A)|rp(A,$f2(A)).
% 0.60/0.84 8 [] {+} -cnotA(A)| -rq(A,B)|cNothing(B).
% 0.60/0.84 10 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)|cnotA($c3)| -cA($c3).
% 0.60/0.84 11 [copy,10,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)|cnotA($c3)| -cA($c3).
% 0.60/0.84 12 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cnotA($c3)|cA($c3).
% 0.60/0.84 13 [copy,12,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cnotA($c3)|cA($c3).
% 0.60/0.84 14 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)|cnotA($c3)| -cA($c3).
% 0.60/0.84 15 [copy,14,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)|cnotA($c3)| -cA($c3).
% 0.60/0.84 16 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cnotA($c3)|cA($c3).
% 0.60/0.84 17 [copy,16,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cnotA($c3)|cA($c3).
% 0.60/0.84 18 [] {+} cowlThing(A).
% 0.60/0.84 19 [] {-} xsd_string(A)|xsd_integer(A).
% 0.60/0.84 20 [] {-} cnotA(A)|rq(A,$f3(A)).
% 0.60/0.84 21 [hyper,20,17,18,19,factor_simp] {+} rq($c3,$f3($c3))|xsd_integer($c2)|cA($c3).
% 0.60/0.84 22 [hyper,21,13,18,20,factor_simp,factor_simp] {+} rq($c3,$f3($c3))|cA($c3)|xsd_string($c2).
% 0.60/0.84 23 [hyper,22,2,21,factor_simp,factor_simp] {+} rq($c3,$f3($c3))|cA($c3).
% 0.60/0.84 24 [hyper,23,3] {+} rq($c3,$f3($c3))|rq($c3,$f1($c3)).
% 0.60/0.84 25 [hyper,24,5,18] {+} rq($c3,$f1($c3))|cA($c3).
% 0.60/0.84 28 [hyper,25,3,factor_simp] {+} rq($c3,$f1($c3)).
% 0.60/0.84 29 [hyper,28,5,18] {+} cA($c3).
% 0.60/0.84 30 [hyper,29,15,18,19,factor_simp] {+} xsd_integer($c2)|cnotA($c3).
% 0.60/0.84 32 [hyper,30,11,18,29,factor_simp] {+} cnotA($c3)|xsd_string($c2).
% 0.60/0.84 33 [hyper,32,2,30,factor_simp] {+} cnotA($c3).
% 0.60/0.84 35 [hyper,33,8,28] {-} cNothing($f1($c3)).
% 0.60/0.84 37 [hyper,35,7] {-} rp($f1($c3),$f2($f1($c3))).
% 0.60/0.84 38 [hyper,37,6,35] {-} $F.
% 0.60/0.84
% 0.60/0.84 % SZS output end Refutation
% 0.60/0.84 ------------ end of proof -------------
% 0.60/0.84
% 0.60/0.84
% 0.60/0.84 Search stopped by max_proofs option.
% 0.60/0.84
% 0.60/0.84
% 0.60/0.84 Search stopped by max_proofs option.
% 0.60/0.84
% 0.60/0.84 ============ end of search ============
% 0.60/0.84
% 0.60/0.84 ----------- soft-scott stats ----------
% 0.60/0.84
% 0.60/0.84 true clauses given 10 (55.6%)
% 0.60/0.84 false clauses given 8
% 0.60/0.84
% 0.60/0.84 FALSE TRUE
% 0.60/0.84 tot: 0 0 (-nan% true)
% 0.60/0.84
% 0.60/0.84
% 0.60/0.84 Model 3 [ 1 -9 220 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 That finishes the proof of the theorem.
% 0.60/0.84
% 0.60/0.84 Process 1538 finished Tue Jun 7 11:58:03 2022
%------------------------------------------------------------------------------