%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS013-1 : TPTP v8.1.0. Released v2.0.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:28 EDT 2022
% Result : Unsatisfiable 1.66s 1.81s
% Output : Refutation 1.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS013-1 : TPTP v8.1.0. Released v2.0.0.
% 0.13/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n023.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 17:37:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.35 ----- Otter 3.2, August 2001 -----
% 0.20/0.35 The process was started by sandbox2 on n023.cluster.edu,
% 0.20/0.35 Tue Jun 7 17:37:23 2022
% 0.20/0.35 The command was "./sos". The process ID is 16458.
% 0.20/0.35
% 0.20/0.35 set(prolog_style_variables).
% 0.20/0.35 set(auto).
% 0.20/0.35 dependent: set(auto1).
% 0.20/0.35 dependent: set(process_input).
% 0.20/0.35 dependent: clear(print_kept).
% 0.20/0.35 dependent: clear(print_new_demod).
% 0.20/0.35 dependent: clear(print_back_demod).
% 0.20/0.35 dependent: clear(print_back_sub).
% 0.20/0.35 dependent: set(control_memory).
% 0.20/0.35 dependent: assign(max_mem, 12000).
% 0.20/0.35 dependent: assign(pick_given_ratio, 4).
% 0.20/0.35 dependent: assign(stats_level, 1).
% 0.20/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.35 dependent: assign(sos_limit, 5000).
% 0.20/0.35 dependent: assign(max_weight, 60).
% 0.20/0.35 clear(print_given).
% 0.20/0.35
% 0.20/0.35 list(usable).
% 0.20/0.35
% 0.20/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.20/0.35
% 0.20/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.35 clauses in usable.
% 0.20/0.35
% 0.20/0.35 dependent: set(knuth_bendix).
% 0.20/0.35 dependent: set(para_from).
% 0.20/0.35 dependent: set(para_into).
% 0.20/0.35 dependent: clear(para_from_right).
% 0.20/0.35 dependent: clear(para_into_right).
% 0.20/0.35 dependent: set(para_from_vars).
% 0.20/0.35 dependent: set(eq_units_both_ways).
% 0.20/0.35 dependent: set(dynamic_demod_all).
% 0.20/0.35 dependent: set(dynamic_demod).
% 0.20/0.35 dependent: set(order_eq).
% 0.20/0.35 dependent: set(back_demod).
% 0.20/0.35 dependent: set(lrpo).
% 0.20/0.35 dependent: set(hyper_res).
% 0.20/0.35 dependent: set(unit_deletion).
% 0.20/0.35 dependent: set(factor).
% 0.20/0.35
% 0.20/0.35 ------------> process usable:
% 0.20/0.35
% 0.20/0.35 ------------> process sos:
% 0.20/0.35
% 0.20/0.35 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 29
% 0.20/0.39 number of clauses initially in problem: 37
% 0.20/0.39 percentage of clauses intially in UL: 78
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 24
% 0.20/0.39 distinct predicate count: 12
% 0.20/0.39 distinct function count: 11
% 0.20/0.39 distinct constant count: 1
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 1.66/1.81
% 1.66/1.81 -------- PROOF --------
% 1.66/1.81 % SZS status Unsatisfiable
% 1.66/1.81 % SZS output start Refutation
% 1.66/1.81
% 1.66/1.81 Model 3 (0.00 seconds, 0 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on number of solutions
% 1.66/1.81
% 1.66/1.81 Model 4 (0.00 seconds, 0 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on number of solutions
% 1.66/1.81
% 1.66/1.81 Stopped by limit on insertions
% 1.66/1.81
% 1.66/1.81 Model 5 [ 1 1 313 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on insertions
% 1.66/1.81
% 1.66/1.81 Model 6 [ 3 0 541 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 Model 7 (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on number of solutions
% 1.66/1.81
% 1.66/1.81 Stopped by limit on insertions
% 1.66/1.81
% 1.66/1.81 Model 8 [ 1 0 606 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on insertions
% 1.66/1.81
% 1.66/1.81 Model 9 [ 2 1 445 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on insertions
% 1.66/1.81
% 1.66/1.81 Model 10 [ 2 1 219 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on insertions
% 1.66/1.81
% 1.66/1.81 Model 11 [ 3 1 343 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on insertions
% 1.66/1.81
% 1.66/1.81 Model 12 [ 2 0 117 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on insertions
% 1.66/1.81
% 1.66/1.81 Model 13 [ 6 1 5085 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on insertions
% 1.66/1.81
% 1.66/1.81 Model 14 [ 5 0 315 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on insertions
% 1.66/1.81
% 1.66/1.81 Model 15 [ 14 0 117 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on insertions
% 1.66/1.81
% 1.66/1.81 Model 16 [ 2 0 4135 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 Stopped by limit on insertions
% 1.66/1.81
% 1.66/1.81 Model 17 [ 10 1 467 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.81
% 1.66/1.81 -----> EMPTY CLAUSE at 1.43 sec ----> 1680 [hyper,1653,4,1511] {-} $F.
% 1.66/1.81
% 1.66/1.81 Length of proof is 24. Level of proof is 14.
% 1.66/1.81
% 1.66/1.81 ---------------- PROOF ----------------
% 1.66/1.81 % SZS status Unsatisfiable
% 1.66/1.81 % SZS output start Refutation
% 1.66/1.81
% 1.66/1.81 1 [] {+} -f(exist).
% 1.66/1.81 2 [] {+} t2least(A)| -c(A).
% 1.66/1.81 4 [] {+} -t2least(A)| -equalish(u1r2(A),u1r1(A)).
% 1.66/1.81 5 [] {+} t(A,u1r1(A))| -t2least(A).
% 1.66/1.81 6 [] {+} t(A,u1r2(A))| -t2least(A).
% 1.66/1.81 8 [] {+} t1most(A)| -d(A).
% 1.66/1.81 10 [] {+} equalish(A,B)| -t1most(C)| -t(C,A)| -t(C,B).
% 1.66/1.81 12 [] {+} d(A)| -e(B)| -r(B,A).
% 1.66/1.81 13 [] {+} c(A)| -e(B)| -r(B,A)| -s2least(A).
% 1.66/1.81 21 [] {+} s2least(A)|equalish(B,C)| -s(A,B)| -s(A,C).
% 1.66/1.81 23 [] {+} f(A)| -s1most(u6r1(A)).
% 1.66/1.81 25 [] {+} s1most(A)| -equalish(u7r2(A),u7r1(A)).
% 1.66/1.81 28 [factor,21.3.4] {+} s2least(A)|equalish(B,B)| -s(A,B).
% 1.66/1.81 30 [] {+} e(exist).
% 1.66/1.81 35 [] {+} f(A)|r(A,u6r1(A)).
% 1.66/1.81 36 [] {+} s1most(A)|s(A,u7r1(A)).
% 1.66/1.81 37 [] {+} s1most(A)|s(A,u7r2(A)).
% 1.66/1.81 52 [hyper,35,1] {+} r(exist,u6r1(exist)).
% 1.66/1.81 57 [hyper,52,12,30] {+} d(u6r1(exist)).
% 1.66/1.81 82 [hyper,36,23] {+} s(u6r1(A),u7r1(u6r1(A)))|f(A).
% 1.66/1.81 87 [hyper,57,8] {+} t1most(u6r1(exist)).
% 1.66/1.81 104 [hyper,37,23] {+} s(u6r1(A),u7r2(u6r1(A)))|f(A).
% 1.66/1.81 137 [hyper,82,1] {+} s(u6r1(exist),u7r1(u6r1(exist))).
% 1.66/1.81 151 [hyper,137,28] {+} s2least(u6r1(exist))|equalish(u7r1(u6r1(exist)),u7r1(u6r1(exist))).
% 1.66/1.81 176 [hyper,104,1] {+} s(u6r1(exist),u7r2(u6r1(exist))).
% 1.66/1.81 190 [hyper,176,21,137,flip.2] {+} s2least(u6r1(exist))|equalish(u7r2(u6r1(exist)),u7r1(u6r1(exist))).
% 1.66/1.81 226 [hyper,151,13,30,52] {-} equalish(u7r1(u6r1(exist)),u7r1(u6r1(exist)))|c(u6r1(exist)).
% 1.66/1.81 237 [hyper,226,2] {-} equalish(u7r1(u6r1(exist)),u7r1(u6r1(exist)))|t2least(u6r1(exist)).
% 1.66/1.81 246 [hyper,237,6] {-} equalish(u7r1(u6r1(exist)),u7r1(u6r1(exist)))|t(u6r1(exist),u1r2(u6r1(exist))).
% 1.66/1.81 247 [hyper,237,5] {-} equalish(u7r1(u6r1(exist)),u7r1(u6r1(exist)))|t(u6r1(exist),u1r1(u6r1(exist))).
% 1.66/1.82 326 [para_from,190.2.1,25.2.1] {-} s1most(u6r1(exist))| -equalish(u7r1(u6r1(exist)),u7r1(u6r1(exist)))|s2least(u6r1(exist)).
% 1.66/1.82 414 [hyper,247,10,87,246,factor_simp] {-} equalish(u7r1(u6r1(exist)),u7r1(u6r1(exist)))|equalish(u1r2(u6r1(exist)),u1r1(u6r1(exist))).
% 1.66/1.82 568 [hyper,414,4,237,factor_simp] {+} equalish(u7r1(u6r1(exist)),u7r1(u6r1(exist))).
% 1.66/1.82 1438 [hyper,326,568] {+} s1most(u6r1(exist))|s2least(u6r1(exist)).
% 1.66/1.82 1441 [hyper,1438,13,30,52] {+} s1most(u6r1(exist))|c(u6r1(exist)).
% 1.66/1.82 1464 [hyper,1441,23,unit_del,1] {+} c(u6r1(exist)).
% 1.66/1.82 1511 [hyper,1464,2] {+} t2least(u6r1(exist)).
% 1.66/1.82 1540 [hyper,1511,6] {+} t(u6r1(exist),u1r2(u6r1(exist))).
% 1.66/1.82 1541 [hyper,1511,5] {+} t(u6r1(exist),u1r1(u6r1(exist))).
% 1.66/1.82 1653 [hyper,1541,10,87,1540] {-} equalish(u1r2(u6r1(exist)),u1r1(u6r1(exist))).
% 1.66/1.82 1680 [hyper,1653,4,1511] {-} $F.
% 1.66/1.82
% 1.66/1.82 % SZS output end Refutation
% 1.66/1.82 ------------ end of proof -------------
% 1.66/1.82
% 1.66/1.82
% 1.66/1.82 Search stopped by max_proofs option.
% 1.66/1.82
% 1.66/1.82
% 1.66/1.82 Search stopped by max_proofs option.
% 1.66/1.82
% 1.66/1.82 ============ end of search ============
% 1.66/1.82
% 1.66/1.82 ----------- soft-scott stats ----------
% 1.66/1.82
% 1.66/1.82 true clauses given 41 (36.0%)
% 1.66/1.82 false clauses given 73
% 1.66/1.82
% 1.66/1.82 FALSE TRUE
% 1.66/1.82 9 0 1
% 1.66/1.82 10 0 2
% 1.66/1.82 11 2 30
% 1.66/1.82 12 1 15
% 1.66/1.82 13 0 7
% 1.66/1.82 14 48 119
% 1.66/1.82 15 0 67
% 1.66/1.82 16 6 50
% 1.66/1.82 17 0 28
% 1.66/1.82 18 45 128
% 1.66/1.82 19 15 38
% 1.66/1.82 20 0 194
% 1.66/1.82 21 0 60
% 1.66/1.82 22 12 41
% 1.66/1.82 23 0 28
% 1.66/1.82 24 0 2
% 1.66/1.82 25 0 21
% 1.66/1.82 26 0 5
% 1.66/1.82 tot: 129 836 (86.6% true)
% 1.66/1.82
% 1.66/1.82
% 1.66/1.82 Model 17 [ 10 1 467 ] (0.00 seconds, 250000 Inserts)
% 1.66/1.82
% 1.66/1.82 That finishes the proof of the theorem.
% 1.66/1.82
% 1.66/1.82 Process 16458 finished Tue Jun 7 17:37:25 2022
%------------------------------------------------------------------------------