TSTP Solution File: KRS129+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS129+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS129+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n024.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 15:45:34 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox2 on n024.cluster.edu,
% 0.19/0.35 Tue Jun 7 15:45:34 2022
% 0.19/0.35 The command was "./sos". The process ID is 28997.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 formula_list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.19/0.35
% 0.19/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.35 clauses in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(knuth_bendix).
% 0.19/0.35 dependent: set(para_from).
% 0.19/0.35 dependent: set(para_into).
% 0.19/0.35 dependent: clear(para_from_right).
% 0.19/0.35 dependent: clear(para_into_right).
% 0.19/0.35 dependent: set(para_from_vars).
% 0.19/0.35 dependent: set(eq_units_both_ways).
% 0.19/0.35 dependent: set(dynamic_demod_all).
% 0.19/0.35 dependent: set(dynamic_demod).
% 0.19/0.35 dependent: set(order_eq).
% 0.19/0.35 dependent: set(back_demod).
% 0.19/0.35 dependent: set(lrpo).
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: set(unit_deletion).
% 0.19/0.35 dependent: set(factor).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35 13 back subsumes 5.
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35 32 back subsumes 23.
% 0.19/0.35 32 back subsumes 6.
% 0.19/0.35 Following clause subsumed by 42 during input processing: 0 [copy,42,flip.1] {-} A=A.
% 0.19/0.35
% 0.19/0.35 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 26
% 0.19/0.38 number of clauses initially in problem: 37
% 0.19/0.38 percentage of clauses intially in UL: 70
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 21
% 0.19/0.38 distinct predicate count: 11
% 0.19/0.38 distinct function count: 1
% 0.19/0.38 distinct constant count: 9
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 0.60/0.81
% 0.60/0.81 -------- PROOF --------
% 0.60/0.81 % SZS status Theorem
% 0.60/0.81 % SZS output start Refutation
% 0.60/0.81
% 0.60/0.81 Model 3 (0.00 seconds, 0 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 Model 4 (0.00 seconds, 0 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 Model 5 (0.00 seconds, 0 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 Model 6 (0.00 seconds, 0 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 Model 7 (0.00 seconds, 0 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 Stopped by limit on insertions
% 0.60/0.81
% 0.60/0.81 Model 8 [ 1 1 9841 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 Model 9 (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 Stopped by limit on insertions
% 0.60/0.81
% 0.60/0.81 Model 10 [ 1 6 111595 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on insertions
% 0.60/0.81
% 0.60/0.81 Model 11 [ 6 0 116 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on insertions
% 0.60/0.81
% 0.60/0.81 Model 12 [ 2 4 181060 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 -----> EMPTY CLAUSE at 0.43 sec ----> 125 [hyper,118,14,88] {-} $F.
% 0.60/0.81
% 0.60/0.81 Length of proof is 6. Level of proof is 4.
% 0.60/0.81
% 0.60/0.81 ---------------- PROOF ----------------
% 0.60/0.81 % SZS status Theorem
% 0.60/0.81 % SZS output start Refutation
% 0.60/0.81
% 0.60/0.81 13 [] {+} -cowlNothing(A).
% 0.60/0.81 14 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.60/0.81 24 [] {+} cEuroMP(A)| -risEuroMPFrom(A,B)| -cowlThing(B).
% 0.60/0.81 27 [] {+} risEuroMPFrom(A,B)| -rhasEuroMP(B,A).
% 0.60/0.81 28 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cEuroMP(iKinnock).
% 0.60/0.81 29 [copy,28,unit_del,13] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cEuroMP(iKinnock).
% 0.60/0.81 30 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cEuroMP(iKinnock).
% 0.60/0.81 31 [copy,30,unit_del,13] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cEuroMP(iKinnock).
% 0.60/0.81 32 [] {+} cowlThing(A).
% 0.60/0.81 33 [] {+} xsd_string(A)|xsd_integer(A).
% 0.60/0.81 41 [] {+} rhasEuroMP(iUK,iKinnock).
% 0.60/0.81 49 [hyper,41,27] {+} risEuroMPFrom(iKinnock,iUK).
% 0.60/0.81 77 [hyper,49,24,32] {+} cEuroMP(iKinnock).
% 0.60/0.81 88 [hyper,77,31,32,33,factor_simp] {+} xsd_integer($c2).
% 0.60/0.81 118 [hyper,88,29,32,77] {+} xsd_string($c2).
% 0.60/0.81 125 [hyper,118,14,88] {-} $F.
% 0.60/0.81
% 0.60/0.81 % SZS output end Refutation
% 0.60/0.81 ------------ end of proof -------------
% 0.60/0.81
% 0.60/0.81
% 0.60/0.81 Search stopped by max_proofs option.
% 0.60/0.81
% 0.60/0.81
% 0.60/0.81 Search stopped by max_proofs option.
% 0.60/0.81
% 0.60/0.81 ============ end of search ============
% 0.60/0.81
% 0.60/0.81 ----------- soft-scott stats ----------
% 0.60/0.81
% 0.60/0.81 true clauses given 12 (52.2%)
% 0.60/0.81 false clauses given 11
% 0.60/0.81
% 0.60/0.81 FALSE TRUE
% 0.60/0.81 4 0 1
% 0.60/0.81 18 0 16
% 0.60/0.81 19 0 32
% 0.60/0.81 20 0 12
% 0.60/0.81 tot: 0 61 (100.0% true)
% 0.60/0.81
% 0.60/0.81
% 0.60/0.81 Model 12 [ 2 4 181060 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 That finishes the proof of the theorem.
% 0.60/0.81
% 0.60/0.81 Process 28997 finished Tue Jun 7 15:45:35 2022
%------------------------------------------------------------------------------