%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS121+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:49 EDT 2022
% Result : Unsatisfiable 1.11s 1.31s
% Output : Refutation 1.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS121+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n023.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 07:34:23 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 n023.cluster.edu,
% 0.12/0.35 Tue Jun 7 07:34:23 2022
% 0.12/0.35 The command was "./sos". The process ID is 5644.
% 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=1, symmetry=0, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 20 back subsumes 4.
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 43 back subsumes 5.
% 0.12/0.35 Following clause subsumed by 47 during input processing: 0 [copy,47,flip.1] {-} A=A.
% 0.12/0.35 47 back subsumes 42.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 39
% 0.19/0.39 number of clauses initially in problem: 44
% 0.19/0.39 percentage of clauses intially in UL: 88
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 85
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 21
% 0.19/0.39 distinct predicate count: 15
% 0.19/0.39 distinct function count: 5
% 0.19/0.39 distinct constant count: 1
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 1.11/1.31
% 1.11/1.31 -------- PROOF --------
% 1.11/1.31 % SZS status Theorem
% 1.11/1.31 % SZS output start Refutation
% 1.11/1.31
% 1.11/1.31 Model 3 [ 1 1 427 ] (0.00 seconds, 1661 Inserts)
% 1.11/1.31
% 1.11/1.31 Model 4 [ 1 1 468 ] (0.00 seconds, 86671 Inserts)
% 1.11/1.31
% 1.11/1.31 Stopped by limit on insertions
% 1.11/1.31
% 1.11/1.31 Model 5 [ 3 1 323 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 Stopped by limit on insertions
% 1.11/1.31
% 1.11/1.31 Model 6 [ 3 0 567 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 Stopped by limit on insertions
% 1.11/1.31
% 1.11/1.31 Model 7 [ 2 1 120 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 Stopped by limit on insertions
% 1.11/1.31
% 1.11/1.31 Model 8 [ 3 1 722 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 Stopped by limit on insertions
% 1.11/1.31
% 1.11/1.31 Model 9 [ 2 0 516 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 Stopped by limit on insertions
% 1.11/1.31
% 1.11/1.31 Model 10 [ 6 1 10380 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 Stopped by limit on insertions
% 1.11/1.31
% 1.11/1.31 Model 11 [ 4 2 100593 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 Stopped by limit on insertions
% 1.11/1.31
% 1.11/1.31 Model 12 [ 4 1 172 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 Stopped by limit on insertions
% 1.11/1.31
% 1.11/1.31 Model 13 [ 2 1 596 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 Stopped by limit on insertions
% 1.11/1.31
% 1.11/1.31 Model 14 [ 4 1 747 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 Stopped by limit on insertions
% 1.11/1.31
% 1.11/1.31 Model 15 [ 5 0 840 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 Stopped by limit on insertions
% 1.11/1.31
% 1.11/1.31 Model 16 [ 6 1 148 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 -----> EMPTY CLAUSE at 0.93 sec ----> 138 [hyper,136,26,48] {-} $F.
% 1.11/1.31
% 1.11/1.31 Length of proof is 12. Level of proof is 8.
% 1.11/1.31
% 1.11/1.31 ---------------- PROOF ----------------
% 1.11/1.31 % SZS status Theorem
% 1.11/1.31 % SZS output start Refutation
% 1.11/1.31
% 1.11/1.31 22 [] {+} -cUnsatisfiable(A)|rr(A,$f1(A)).
% 1.11/1.31 23 [] {+} -cUnsatisfiable(A)|ca_Vx3($f1(A)).
% 1.11/1.31 24 [] {+} -cUnsatisfiable(A)|cp1(A).
% 1.11/1.31 26 [] {+} -cp1(A)| -ra_Px1(A,B).
% 1.11/1.31 27 [] {+} -cp1xcomp(A)|ra_Px1(A,$f3(A)).
% 1.11/1.31 30 [] {+} -ca_Ax2(A)| -rinvR(A,B)|cp1xcomp(B).
% 1.11/1.31 33 [] {+} -ca_Vx3(A)|rr(A,$f5(A)).
% 1.11/1.31 34 [] {+} -ca_Vx3(A)|ca_Ax2($f5(A)).
% 1.11/1.31 35 [] {+} ca_Vx3(A)| -rr(A,B)| -ca_Ax2(B).
% 1.11/1.31 40 [] {+} rinvR(A,B)| -rr(B,A).
% 1.11/1.31 41 [] {+} -rr(A,B)| -rr(B,C)|rr(A,C).
% 1.11/1.31 46 [] {-} cUnsatisfiable(i2003_11_14_17_21_5199).
% 1.11/1.31 48 [hyper,46,24] {+} cp1(i2003_11_14_17_21_5199).
% 1.11/1.31 49 [hyper,46,23] {+} ca_Vx3($f1(i2003_11_14_17_21_5199)).
% 1.11/1.31 50 [hyper,46,22] {+} rr(i2003_11_14_17_21_5199,$f1(i2003_11_14_17_21_5199)).
% 1.11/1.31 54 [hyper,49,34] {+} ca_Ax2($f5($f1(i2003_11_14_17_21_5199))).
% 1.11/1.31 55 [hyper,49,33] {+} rr($f1(i2003_11_14_17_21_5199),$f5($f1(i2003_11_14_17_21_5199))).
% 1.11/1.31 72 [hyper,55,41,50] {+} rr(i2003_11_14_17_21_5199,$f5($f1(i2003_11_14_17_21_5199))).
% 1.11/1.31 92 [hyper,72,35,54] {+} ca_Vx3(i2003_11_14_17_21_5199).
% 1.11/1.31 97 [hyper,92,34] {+} ca_Ax2($f5(i2003_11_14_17_21_5199)).
% 1.11/1.31 98 [hyper,92,33] {+} rr(i2003_11_14_17_21_5199,$f5(i2003_11_14_17_21_5199)).
% 1.11/1.31 124 [hyper,98,40] {+} rinvR($f5(i2003_11_14_17_21_5199),i2003_11_14_17_21_5199).
% 1.11/1.31 132 [hyper,124,30,97] {+} cp1xcomp(i2003_11_14_17_21_5199).
% 1.11/1.31 136 [hyper,132,27] {+} ra_Px1(i2003_11_14_17_21_5199,$f3(i2003_11_14_17_21_5199)).
% 1.11/1.31 138 [hyper,136,26,48] {-} $F.
% 1.11/1.31
% 1.11/1.31 % SZS output end Refutation
% 1.11/1.31 ------------ end of proof -------------
% 1.11/1.31
% 1.11/1.31
% 1.11/1.31 Search stopped by max_proofs option.
% 1.11/1.31
% 1.11/1.31
% 1.11/1.31 Search stopped by max_proofs option.
% 1.11/1.31
% 1.11/1.31 ============ end of search ============
% 1.11/1.31
% 1.11/1.31 ----------- soft-scott stats ----------
% 1.11/1.31
% 1.11/1.31 true clauses given 11 (37.9%)
% 1.11/1.31 false clauses given 18
% 1.11/1.31
% 1.11/1.31 FALSE TRUE
% 1.11/1.31 5 0 1
% 1.11/1.31 6 0 1
% 1.11/1.31 8 0 2
% 1.11/1.31 9 0 6
% 1.11/1.31 10 0 18
% 1.11/1.31 11 0 5
% 1.11/1.31 12 0 15
% 1.11/1.31 13 0 5
% 1.11/1.31 14 0 3
% 1.11/1.31 15 0 3
% 1.11/1.31 16 0 5
% 1.11/1.31 tot: 0 64 (100.0% true)
% 1.11/1.31
% 1.11/1.31
% 1.11/1.31 Model 16 [ 6 1 148 ] (0.00 seconds, 250000 Inserts)
% 1.11/1.31
% 1.11/1.31 That finishes the proof of the theorem.
% 1.11/1.31
% 1.11/1.31 Process 5644 finished Tue Jun 7 07:34:24 2022
%------------------------------------------------------------------------------