TSTP Solution File: KRS104+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS104+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:46 EDT 2022
% Result : Unsatisfiable 0.66s 0.89s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS104+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n018.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 09:15:05 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 n018.cluster.edu,
% 0.12/0.35 Tue Jun 7 09:15:05 2022
% 0.12/0.35 The command was "./sos". The process ID is 29963.
% 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=4.
% 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
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 41
% 0.18/0.38 number of clauses initially in problem: 51
% 0.18/0.38 percentage of clauses intially in UL: 80
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 78
% 0.18/0.38 percent of all initial clauses that are short: 100
% 0.18/0.38 absolute distinct symbol count: 41
% 0.18/0.38 distinct predicate count: 26
% 0.18/0.38 distinct function count: 14
% 0.18/0.38 distinct constant count: 1
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 0.66/0.89
% 0.66/0.89 -------- PROOF --------
% 0.66/0.89 % SZS status Theorem
% 0.66/0.89 % SZS output start Refutation
% 0.66/0.89
% 0.66/0.89 Model 3 (0.00 seconds, 0 Inserts)
% 0.66/0.89
% 0.66/0.89 Stopped by limit on number of solutions
% 0.66/0.89
% 0.66/0.89 Model 4 (0.00 seconds, 0 Inserts)
% 0.66/0.89
% 0.66/0.89 Stopped by limit on number of solutions
% 0.66/0.89
% 0.66/0.89 Model 5 (0.00 seconds, 0 Inserts)
% 0.66/0.89
% 0.66/0.89 Stopped by limit on number of solutions
% 0.66/0.89
% 0.66/0.89 Model 6 (0.00 seconds, 0 Inserts)
% 0.66/0.89
% 0.66/0.89 Stopped by limit on number of solutions
% 0.66/0.89
% 0.66/0.89 Model 7 (0.00 seconds, 0 Inserts)
% 0.66/0.89
% 0.66/0.89 Stopped by limit on number of solutions
% 0.66/0.89
% 0.66/0.89 Model 8 (0.00 seconds, 0 Inserts)
% 0.66/0.89
% 0.66/0.89 Stopped by limit on number of solutions
% 0.66/0.89
% 0.66/0.89 Model 9 (0.00 seconds, 0 Inserts)
% 0.66/0.89
% 0.66/0.89 Stopped by limit on number of solutions
% 0.66/0.89
% 0.66/0.89 Stopped by limit on insertions
% 0.66/0.89
% 0.66/0.89 Model 10 [ 2 1 524 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.89
% 0.66/0.89 Stopped by limit on insertions
% 0.66/0.89
% 0.66/0.89 Model 11 [ 5 1 1392 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.89
% 0.66/0.89 Stopped by limit on insertions
% 0.66/0.89
% 0.66/0.89 Model 12 [ 1 1 789 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.89
% 0.66/0.89 Stopped by limit on insertions
% 0.66/0.89
% 0.66/0.89 Model 13 [ 3 0 413 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.89
% 0.66/0.89 Stopped by limit on insertions
% 0.66/0.89
% 0.66/0.89 Model 14 [ 3 1 204 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.89
% 0.66/0.89 Stopped by limit on insertions
% 0.66/0.89
% 0.66/0.89 Model 15 [ 9 1 206 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.89
% 0.66/0.89 -----> EMPTY CLAUSE at 0.51 sec ----> 133 [hyper,128,17,127] {-} $F.
% 0.66/0.89
% 0.66/0.89 Length of proof is 36. Level of proof is 21.
% 0.66/0.89
% 0.66/0.89 ---------------- PROOF ----------------
% 0.66/0.89 % SZS status Theorem
% 0.66/0.89 % SZS output start Refutation
% 0.66/0.89
% 0.66/0.89 3 [] {+} -cUnsatisfiable(A)| -ra_Px5(A,B).
% 0.66/0.89 7 [] {+} cUnsatisfiablexcomp(A)| -ca_Cx7(A)| -ca_Cx8(A)| -ca_Cx6(A).
% 0.66/0.89 8 [] {+} -cUnsatisfiablexcomp(A)|ra_Px5(A,$f2(A)).
% 0.66/0.89 10 [] {+} -ca(A)|ca_Cx1(A).
% 0.66/0.89 11 [] {+} -cb(A)|ra_Px3(A,$f3(A)).
% 0.66/0.89 13 [] {+} -cb(A)|ccxcomp(A).
% 0.66/0.89 14 [] {+} -cbxcomp(A)| -ra_Px3(A,B).
% 0.66/0.89 15 [] {+} -cc(A)|ra_Px2(A,$f5(A)).
% 0.66/0.89 17 [] {+} -ccxcomp(A)| -ra_Px2(A,B).
% 0.66/0.89 18 [] {+} -ca_Cx1(A)|cbxcomp(A).
% 0.66/0.89 19 [] {+} -ca_Cx1(A)|ccxcomp(A).
% 0.66/0.89 21 [] {+} -ca_Cx1(A)|ra_Px1(A,$f7(A)).
% 0.66/0.89 22 [] {+} ca_Cx1(A)| -ra_Px1(A,B).
% 0.66/0.89 25 [] {+} -ca_Cx6xcomp(A)|ca(A).
% 0.66/0.89 26 [] {+} -ca_Cx6xcomp(A)|cb(A).
% 0.66/0.89 29 [] {+} ca_Cx6xcomp(A)| -ra_Px6(A,B).
% 0.66/0.89 31 [] {+} ca_Cx7(A)| -ra_Px7(A,B).
% 0.66/0.89 32 [] {+} -ca_Cx7xcomp(A)|cc(A).
% 0.66/0.89 33 [] {+} -ca_Cx7xcomp(A)|ca(A).
% 0.66/0.89 38 [] {+} ca_Cx8xcomp(A)| -ra_Px8(A,B).
% 0.66/0.89 39 [] {+} -ca_Cx8xcomp(A)|cc(A).
% 0.66/0.89 40 [] {+} -ca_Cx8xcomp(A)|cb(A).
% 0.66/0.89 48 [] {+} ca_Cx6(A)|ra_Px6(A,$f9(A)).
% 0.66/0.89 49 [] {+} ca_Cx7xcomp(A)|ra_Px7(A,$f12(A)).
% 0.66/0.89 50 [] {+} ca_Cx8(A)|ra_Px8(A,$f13(A)).
% 0.66/0.89 51 [] {+} cUnsatisfiable(i2003_11_14_17_20_50869).
% 0.66/0.89 53 [hyper,49,33] {+} ra_Px7(A,$f12(A))|ca(A).
% 0.66/0.89 54 [hyper,49,32] {+} ra_Px7(A,$f12(A))|cc(A).
% 0.66/0.89 56 [hyper,54,15] {+} ra_Px7(A,$f12(A))|ra_Px2(A,$f5(A)).
% 0.66/0.89 57 [hyper,53,10] {+} ra_Px7(A,$f12(A))|ca_Cx1(A).
% 0.66/0.89 58 [hyper,57,21] {+} ra_Px7(A,$f12(A))|ra_Px1(A,$f7(A)).
% 0.66/0.89 62 [hyper,56,31] {+} ra_Px2(A,$f5(A))|ca_Cx7(A).
% 0.66/0.89 64 [hyper,62,7,50,48] {-} ra_Px2(A,$f5(A))|cUnsatisfiablexcomp(A)|ra_Px8(A,$f13(A))|ra_Px6(A,$f9(A)).
% 0.66/0.89 65 [hyper,64,8] {-} ra_Px2(A,$f5(A))|ra_Px8(A,$f13(A))|ra_Px6(A,$f9(A))|ra_Px5(A,$f2(A)).
% 0.66/0.89 66 [hyper,58,31] {+} ra_Px1(A,$f7(A))|ca_Cx7(A).
% 0.66/0.89 67 [hyper,65,38] {-} ra_Px2(A,$f5(A))|ra_Px6(A,$f9(A))|ra_Px5(A,$f2(A))|ca_Cx8xcomp(A).
% 0.66/0.89 69 [hyper,67,39] {-} ra_Px2(A,$f5(A))|ra_Px6(A,$f9(A))|ra_Px5(A,$f2(A))|cc(A).
% 0.66/0.89 74 [hyper,66,7,50,48] {-} ra_Px1(A,$f7(A))|cUnsatisfiablexcomp(A)|ra_Px8(A,$f13(A))|ra_Px6(A,$f9(A)).
% 0.66/0.89 76 [hyper,69,15,factor_simp] {-} ra_Px2(A,$f5(A))|ra_Px6(A,$f9(A))|ra_Px5(A,$f2(A)).
% 0.66/0.89 77 [hyper,76,29] {-} ra_Px2(A,$f5(A))|ra_Px5(A,$f2(A))|ca_Cx6xcomp(A).
% 0.66/0.89 79 [hyper,77,26] {-} ra_Px2(A,$f5(A))|ra_Px5(A,$f2(A))|cb(A).
% 0.66/0.89 80 [hyper,77,25] {-} ra_Px2(A,$f5(A))|ra_Px5(A,$f2(A))|ca(A).
% 0.66/0.89 82 [hyper,79,11] {-} ra_Px2(A,$f5(A))|ra_Px5(A,$f2(A))|ra_Px3(A,$f3(A)).
% 0.66/0.89 83 [hyper,80,10] {-} ra_Px2(A,$f5(A))|ra_Px5(A,$f2(A))|ca_Cx1(A).
% 0.66/0.89 84 [hyper,83,21] {-} ra_Px2(A,$f5(A))|ra_Px5(A,$f2(A))|ra_Px1(A,$f7(A)).
% 0.66/0.89 85 [hyper,83,18] {-} ra_Px2(A,$f5(A))|ra_Px5(A,$f2(A))|cbxcomp(A).
% 0.66/0.89 86 [hyper,74,8] {-} ra_Px1(A,$f7(A))|ra_Px8(A,$f13(A))|ra_Px6(A,$f9(A))|ra_Px5(A,$f2(A)).
% 0.66/0.89 88 [hyper,82,3,51] {+} ra_Px2(i2003_11_14_17_20_50869,$f5(i2003_11_14_17_20_50869))|ra_Px3(i2003_11_14_17_20_50869,$f3(i2003_11_14_17_20_50869)).
% 0.66/0.89 93 [hyper,84,3,51] {-} ra_Px2(i2003_11_14_17_20_50869,$f5(i2003_11_14_17_20_50869))|ra_Px1(i2003_11_14_17_20_50869,$f7(i2003_11_14_17_20_50869)).
% 0.66/0.89 97 [hyper,86,38] {-} ra_Px1(A,$f7(A))|ra_Px6(A,$f9(A))|ra_Px5(A,$f2(A))|ca_Cx8xcomp(A).
% 0.66/0.89 98 [hyper,97,40] {-} ra_Px1(A,$f7(A))|ra_Px6(A,$f9(A))|ra_Px5(A,$f2(A))|cb(A).
% 0.66/0.89 101 [hyper,98,13] {-} ra_Px1(A,$f7(A))|ra_Px6(A,$f9(A))|ra_Px5(A,$f2(A))|ccxcomp(A).
% 0.66/0.89 103 [hyper,88,14,85,factor_simp] {-} ra_Px2(i2003_11_14_17_20_50869,$f5(i2003_11_14_17_20_50869))|ra_Px5(i2003_11_14_17_20_50869,$f2(i2003_11_14_17_20_50869)).
% 0.66/0.89 107 [hyper,101,17,93,factor_simp] {-} ra_Px1(i2003_11_14_17_20_50869,$f7(i2003_11_14_17_20_50869))|ra_Px6(i2003_11_14_17_20_50869,$f9(i2003_11_14_17_20_50869))|ra_Px5(i2003_11_14_17_20_50869,$f2(i2003_11_14_17_20_50869)).
% 0.66/0.89 108 [hyper,107,29] {-} ra_Px1(i2003_11_14_17_20_50869,$f7(i2003_11_14_17_20_50869))|ra_Px5(i2003_11_14_17_20_50869,$f2(i2003_11_14_17_20_50869))|ca_Cx6xcomp(i2003_11_14_17_20_50869).
% 0.66/0.89 111 [hyper,108,26] {-} ra_Px1(i2003_11_14_17_20_50869,$f7(i2003_11_14_17_20_50869))|ra_Px5(i2003_11_14_17_20_50869,$f2(i2003_11_14_17_20_50869))|cb(i2003_11_14_17_20_50869).
% 0.66/0.89 114 [hyper,111,13] {-} ra_Px1(i2003_11_14_17_20_50869,$f7(i2003_11_14_17_20_50869))|ra_Px5(i2003_11_14_17_20_50869,$f2(i2003_11_14_17_20_50869))|ccxcomp(i2003_11_14_17_20_50869).
% 0.66/0.89 119 [hyper,114,17,93,factor_simp] {-} ra_Px1(i2003_11_14_17_20_50869,$f7(i2003_11_14_17_20_50869))|ra_Px5(i2003_11_14_17_20_50869,$f2(i2003_11_14_17_20_50869)).
% 0.66/0.89 123 [hyper,119,3,51] {+} ra_Px1(i2003_11_14_17_20_50869,$f7(i2003_11_14_17_20_50869)).
% 0.66/0.89 125 [hyper,123,22] {+} ca_Cx1(i2003_11_14_17_20_50869).
% 0.66/0.89 127 [hyper,103,3,51] {+} ra_Px2(i2003_11_14_17_20_50869,$f5(i2003_11_14_17_20_50869)).
% 0.66/0.89 128 [hyper,125,19] {+} ccxcomp(i2003_11_14_17_20_50869).
% 0.66/0.89 133 [hyper,128,17,127] {-} $F.
% 0.66/0.89
% 0.66/0.89 % SZS output end Refutation
% 0.66/0.89 ------------ end of proof -------------
% 0.66/0.89
% 0.66/0.89
% 0.66/0.89 Search stopped by max_proofs option.
% 0.66/0.89
% 0.66/0.89
% 0.66/0.89 Search stopped by max_proofs option.
% 0.66/0.89
% 0.66/0.89 ============ end of search ============
% 0.66/0.89
% 0.66/0.89 ----------- soft-scott stats ----------
% 0.66/0.89
% 0.66/0.89 true clauses given 24 (35.3%)
% 0.66/0.89 false clauses given 44
% 0.66/0.89
% 0.66/0.89 FALSE TRUE
% 0.66/0.89 2 1 1
% 0.66/0.89 4 2 1
% 0.66/0.89 10 1 1
% 0.66/0.89 14 1 0
% 0.66/0.89 16 1 1
% 0.66/0.89 18 1 0
% 0.66/0.89 tot: 7 4 (36.4% true)
% 0.66/0.89
% 0.66/0.89
% 0.66/0.89 Model 15 [ 9 1 206 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.89
% 0.66/0.89 That finishes the proof of the theorem.
% 0.66/0.89
% 0.66/0.89 Process 29963 finished Tue Jun 7 09:15:06 2022
%------------------------------------------------------------------------------