TSTP Solution File: KRS152+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS152+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:54 EDT 2022
% Result : Theorem 0.61s 0.85s
% Output : Refutation 0.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS152+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/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 08:29:17 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 sandbox on n017.cluster.edu,
% 0.12/0.35 Tue Jun 7 08:29:17 2022
% 0.12/0.35 The command was "./sos". The process ID is 30621.
% 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=8.
% 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 Following clause subsumed by 25 during input processing: 0 [] {-} cowlThing(iV21080).
% 0.12/0.35 Following clause subsumed by 25 during input processing: 0 [] {-} cowlThing(iV21081).
% 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: 22
% 0.12/0.39 number of clauses initially in problem: 28
% 0.12/0.39 percentage of clauses intially in UL: 78
% 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: 18
% 0.12/0.39 distinct predicate count: 12
% 0.12/0.39 distinct function count: 2
% 0.12/0.39 distinct constant count: 4
% 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.61/0.85
% 0.61/0.85 -------- PROOF --------
% 0.61/0.85 % SZS status Theorem
% 0.61/0.85 % SZS output start Refutation
% 0.61/0.85
% 0.61/0.85 Model 3 (0.00 seconds, 0 Inserts)
% 0.61/0.85
% 0.61/0.85 Stopped by limit on number of solutions
% 0.61/0.85
% 0.61/0.85 Stopped by limit on insertions
% 0.61/0.85
% 0.61/0.85 Model 4 [ 1 1 66 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.85
% 0.61/0.85 Model 5 (0.00 seconds, 250000 Inserts)
% 0.61/0.85
% 0.61/0.85 Stopped by limit on number of solutions
% 0.61/0.85
% 0.61/0.85 Stopped by limit on insertions
% 0.61/0.85
% 0.61/0.85 Model 6 [ 1 0 287 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.85
% 0.61/0.85 Stopped by limit on insertions
% 0.61/0.85
% 0.61/0.85 Model 7 [ 1 1 485 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.85
% 0.61/0.85 Stopped by limit on insertions
% 0.61/0.85
% 0.61/0.85 Model 8 [ 1 0 1918 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.85
% 0.61/0.85 -----> EMPTY CLAUSE at 0.47 sec ----> 37 [hyper,36,2,35] {-} $F.
% 0.61/0.85
% 0.61/0.85 Length of proof is 6. Level of proof is 3.
% 0.61/0.85
% 0.61/0.85 ---------------- PROOF ----------------
% 0.61/0.85 % SZS status Theorem
% 0.61/0.85 % SZS output start Refutation
% 0.61/0.85
% 0.61/0.85 1 [] {+} -cowlNothing(A).
% 0.61/0.85 2 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.61/0.85 5 [] {+} cC10(A)| -cC2(A)| -cC4(A).
% 0.61/0.85 15 [] {+} -cTEST(A)|cC12(A).
% 0.61/0.85 21 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cowlThing(iV21080)| -cC12(iV21080)| -cC10(iV21081)| -cowlThing(iV21081).
% 0.61/0.85 22 [copy,21,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cowlThing(iV21080)| -cC12(iV21080)| -cC10(iV21081)| -cowlThing(iV21081).
% 0.61/0.85 23 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cowlThing(iV21080)| -cC12(iV21080)| -cC10(iV21081)| -cowlThing(iV21081).
% 0.61/0.85 24 [copy,23,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cowlThing(iV21080)| -cC12(iV21080)| -cC10(iV21081)| -cowlThing(iV21081).
% 0.61/0.85 25 [] {+} cowlThing(A).
% 0.61/0.85 26 [] {+} xsd_string(A)|xsd_integer(A).
% 0.61/0.85 27 [] {+} cTEST(iV21080).
% 0.61/0.85 29 [] {+} cC2(iV21081).
% 0.61/0.85 30 [] {+} cC4(iV21081).
% 0.61/0.85 31 [hyper,27,15] {+} cC12(iV21080).
% 0.61/0.85 34 [hyper,29,5,30] {+} cC10(iV21081).
% 0.61/0.85 35 [hyper,34,24,25,26,25,31,25,factor_simp] {+} xsd_integer($c2).
% 0.61/0.85 36 [hyper,35,22,25,25,31,34,25] {+} xsd_string($c2).
% 0.61/0.85 37 [hyper,36,2,35] {-} $F.
% 0.61/0.85
% 0.61/0.85 % SZS output end Refutation
% 0.61/0.85 ------------ end of proof -------------
% 0.61/0.85
% 0.61/0.85
% 0.61/0.85 Search stopped by max_proofs option.
% 0.61/0.85
% 0.61/0.85
% 0.61/0.85 Search stopped by max_proofs option.
% 0.61/0.85
% 0.61/0.85 ============ end of search ============
% 0.61/0.85
% 0.61/0.85 ----------- soft-scott stats ----------
% 0.61/0.85
% 0.61/0.85 true clauses given 2 (22.2%)
% 0.61/0.85 false clauses given 7
% 0.61/0.85
% 0.61/0.85 FALSE TRUE
% 0.61/0.85 3 1 1
% 0.61/0.85 4 0 1
% 0.61/0.85 tot: 1 2 (66.7% true)
% 0.61/0.85
% 0.61/0.85
% 0.61/0.85 Model 8 [ 1 0 1918 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.85
% 0.61/0.85 That finishes the proof of the theorem.
% 0.61/0.85
% 0.61/0.85 Process 30621 finished Tue Jun 7 08:29:17 2022
%------------------------------------------------------------------------------