TSTP Solution File: KRS108+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS108+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:47 EDT 2022
% Result : Unsatisfiable 1.32s 1.51s
% Output : Refutation 1.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS108+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 7 12:20:49 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.37 ----- Otter 3.2, August 2001 -----
% 0.20/0.37 The process was started by sandbox on n024.cluster.edu,
% 0.20/0.37 Tue Jun 7 12:20:49 2022
% 0.20/0.37 The command was "./sos". The process ID is 3055.
% 0.20/0.37
% 0.20/0.37 set(prolog_style_variables).
% 0.20/0.37 set(auto).
% 0.20/0.37 dependent: set(auto1).
% 0.20/0.37 dependent: set(process_input).
% 0.20/0.37 dependent: clear(print_kept).
% 0.20/0.37 dependent: clear(print_new_demod).
% 0.20/0.37 dependent: clear(print_back_demod).
% 0.20/0.37 dependent: clear(print_back_sub).
% 0.20/0.37 dependent: set(control_memory).
% 0.20/0.37 dependent: assign(max_mem, 12000).
% 0.20/0.37 dependent: assign(pick_given_ratio, 4).
% 0.20/0.37 dependent: assign(stats_level, 1).
% 0.20/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37 dependent: assign(sos_limit, 5000).
% 0.20/0.37 dependent: assign(max_weight, 60).
% 0.20/0.37 clear(print_given).
% 0.20/0.37
% 0.20/0.37 formula_list(usable).
% 0.20/0.37
% 0.20/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.20/0.37
% 0.20/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.37 clauses in usable.
% 0.20/0.37
% 0.20/0.37 dependent: set(knuth_bendix).
% 0.20/0.37 dependent: set(para_from).
% 0.20/0.37 dependent: set(para_into).
% 0.20/0.37 dependent: clear(para_from_right).
% 0.20/0.37 dependent: clear(para_into_right).
% 0.20/0.37 dependent: set(para_from_vars).
% 0.20/0.37 dependent: set(eq_units_both_ways).
% 0.20/0.37 dependent: set(dynamic_demod_all).
% 0.20/0.37 dependent: set(dynamic_demod).
% 0.20/0.37 dependent: set(order_eq).
% 0.20/0.37 dependent: set(back_demod).
% 0.20/0.37 dependent: set(lrpo).
% 0.20/0.37 dependent: set(hyper_res).
% 0.20/0.37 dependent: set(unit_deletion).
% 0.20/0.37 dependent: set(factor).
% 0.20/0.37
% 0.20/0.37 ------------> process usable:
% 0.20/0.37 40 back subsumes 9.
% 0.20/0.37
% 0.20/0.37 ------------> process sos:
% 0.20/0.37 92 back subsumes 10.
% 0.20/0.37 Following clause subsumed by 102 during input processing: 0 [copy,102,flip.1] {-} A=A.
% 0.20/0.37 102 back subsumes 91.
% 0.20/0.37
% 0.20/0.37 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 88
% 0.20/0.40 number of clauses initially in problem: 99
% 0.20/0.40 percentage of clauses intially in UL: 88
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 82
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 50
% 0.20/0.40 distinct predicate count: 31
% 0.20/0.40 distinct function count: 18
% 0.20/0.40 distinct constant count: 1
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 1.32/1.51
% 1.32/1.51 -------- PROOF --------
% 1.32/1.51 % SZS status Theorem
% 1.32/1.51 % SZS output start Refutation
% 1.32/1.51
% 1.32/1.51 Model 2 [ 1 1 1102 ] (0.00 seconds, 17106 Inserts)
% 1.32/1.51
% 1.32/1.51 Model 3 [ 1 1 898 ] (0.00 seconds, 2179 Inserts)
% 1.32/1.51
% 1.32/1.51 Model 4 [ 1 1 994 ] (0.00 seconds, 2154 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 5 [ 2 1 988 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 6 [ 2 1 734 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 7 [ 2 0 956 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 8 [ 4 1 438 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 9 [ 2 0 770 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 10 [ 4 1 1964 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 11 [ 6 0 903 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 12 [ 8 1 338 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 13 [ 5 0 383 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 14 [ 5 0 279 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 15 [ 10 0 858 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 16 [ 3 1 448 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 17 [ 12 0 1039 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 18 [ 10 0 1202 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 19 [ 9 1 951 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 20 [ 5 0 728 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 21 [ 10 0 265 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 Stopped by limit on insertions
% 1.32/1.51
% 1.32/1.51 Model 22 [ 13 0 923 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 -----> EMPTY CLAUSE at 1.11 sec ----> 183 [hyper,176,50,127] {-} $F.
% 1.32/1.51
% 1.32/1.51 Length of proof is 12. Level of proof is 5.
% 1.32/1.51
% 1.32/1.51 ---------------- PROOF ----------------
% 1.32/1.51 % SZS status Theorem
% 1.32/1.51 % SZS output start Refutation
% 1.32/1.51
% 1.32/1.51 42 [] {+} -cUnsatisfiable(A)|rinvR(A,$f1(A)).
% 1.32/1.51 43 [] {+} -cUnsatisfiable(A)|ca_Ax14($f1(A)).
% 1.32/1.51 44 [] {+} -cUnsatisfiable(A)|cp2(A).
% 1.32/1.51 46 [] {+} -cp1(A)|ca_Cx1(A).
% 1.32/1.51 47 [] {+} -cp2(A)|ra_Px5(A,$f2(A)).
% 1.32/1.51 50 [] {+} -cp2xcomp(A)| -ra_Px5(A,B).
% 1.32/1.51 62 [] {+} -ca_Ax14(A)|rr(A,$f10(A)).
% 1.32/1.51 63 [] {+} -ca_Ax14(A)|cp1($f10(A)).
% 1.32/1.51 64 [] {+} -ca_Ax14(A)| -rr(A,B)| -rr(A,C)|B=C.
% 1.32/1.51 68 [] {+} -ca_Cx1(A)|cp2xcomp(A).
% 1.32/1.51 89 [] {+} -rinvR(A,B)|rr(B,A).
% 1.32/1.51 94 [] {+} cp2xcomp(A)|ra_Px5(A,$f3(A)).
% 1.32/1.51 101 [] {-} cUnsatisfiable(i2003_11_14_17_21_04740).
% 1.32/1.51 103 [hyper,101,44] {+} cp2(i2003_11_14_17_21_04740).
% 1.32/1.51 104 [hyper,101,43] {+} ca_Ax14($f1(i2003_11_14_17_21_04740)).
% 1.32/1.51 105 [hyper,101,42] {+} rinvR(i2003_11_14_17_21_04740,$f1(i2003_11_14_17_21_04740)).
% 1.32/1.51 108 [hyper,103,47] {+} ra_Px5(i2003_11_14_17_21_04740,$f2(i2003_11_14_17_21_04740)).
% 1.32/1.51 110 [hyper,104,63] {+} cp1($f10($f1(i2003_11_14_17_21_04740))).
% 1.32/1.51 111 [hyper,104,62] {+} rr($f1(i2003_11_14_17_21_04740),$f10($f1(i2003_11_14_17_21_04740))).
% 1.32/1.51 118 [hyper,105,89] {+} rr($f1(i2003_11_14_17_21_04740),i2003_11_14_17_21_04740).
% 1.32/1.51 127 [hyper,94,50,108] {+} ra_Px5(i2003_11_14_17_21_04740,$f3(i2003_11_14_17_21_04740)).
% 1.32/1.51 134 [hyper,110,46] {+} ca_Cx1($f10($f1(i2003_11_14_17_21_04740))).
% 1.32/1.51 149 [hyper,134,68] {+} cp2xcomp($f10($f1(i2003_11_14_17_21_04740))).
% 1.32/1.51 173,172 [hyper,111,64,104,118,flip.1] {+} $f10($f1(i2003_11_14_17_21_04740))=i2003_11_14_17_21_04740.
% 1.32/1.51 176 [back_demod,149,demod,173] {+} cp2xcomp(i2003_11_14_17_21_04740).
% 1.32/1.51 183 [hyper,176,50,127] {-} $F.
% 1.32/1.51
% 1.32/1.51 % SZS output end Refutation
% 1.32/1.51 ------------ end of proof -------------
% 1.32/1.51
% 1.32/1.51
% 1.32/1.51 Search stopped by max_proofs option.
% 1.32/1.51
% 1.32/1.51
% 1.32/1.51 Search stopped by max_proofs option.
% 1.32/1.51
% 1.32/1.51 ============ end of search ============
% 1.32/1.51
% 1.32/1.51 ----------- soft-scott stats ----------
% 1.32/1.51
% 1.32/1.51 true clauses given 7 (24.1%)
% 1.32/1.51 false clauses given 22
% 1.32/1.51
% 1.32/1.51 FALSE TRUE
% 1.32/1.51 2 0 2
% 1.32/1.51 4 1 6
% 1.32/1.51 5 0 1
% 1.32/1.51 6 0 6
% 1.32/1.51 7 0 2
% 1.32/1.51 8 1 2
% 1.32/1.51 10 0 10
% 1.32/1.51 11 0 2
% 1.32/1.51 12 0 24
% 1.32/1.51 14 2 6
% 1.32/1.51 tot: 4 61 (93.8% true)
% 1.32/1.51
% 1.32/1.51
% 1.32/1.51 Model 22 [ 13 0 923 ] (0.00 seconds, 250000 Inserts)
% 1.32/1.51
% 1.32/1.51 That finishes the proof of the theorem.
% 1.32/1.51
% 1.32/1.51 Process 3055 finished Tue Jun 7 12:20:51 2022
%------------------------------------------------------------------------------