%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS113+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:48 EDT 2022
% Result : Unsatisfiable 0.45s 0.66s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS113+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/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 10:57:20 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 n018.cluster.edu,
% 0.12/0.35 Tue Jun 7 10:57:20 2022
% 0.12/0.35 The command was "./sos". The process ID is 21456.
% 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=7.
% 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 17 back subsumes 3.
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 37 back subsumes 4.
% 0.12/0.35 Following clause subsumed by 42 during input processing: 0 [copy,42,flip.1] {-} A=A.
% 0.12/0.35 42 back subsumes 36.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 33
% 0.18/0.39 number of clauses initially in problem: 39
% 0.18/0.39 percentage of clauses intially in UL: 84
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 85
% 0.18/0.39 percent of all initial clauses that are short: 100
% 0.18/0.39 absolute distinct symbol count: 21
% 0.18/0.39 distinct predicate count: 13
% 0.18/0.39 distinct function count: 7
% 0.18/0.39 distinct constant count: 1
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39 =========== start of search ===========
% 0.45/0.66
% 0.45/0.66 -------- PROOF --------
% 0.45/0.66 % SZS status Theorem
% 0.45/0.66 % SZS output start Refutation
% 0.45/0.66
% 0.45/0.66 Model 3 [ 1 0 194 ] (0.00 seconds, 5531 Inserts)
% 0.45/0.66
% 0.45/0.66 Model 4 [ 1 0 211 ] (0.00 seconds, 3247 Inserts)
% 0.45/0.66
% 0.45/0.66 Model 5 [ 1 0 361 ] (0.00 seconds, 2967 Inserts)
% 0.45/0.66
% 0.45/0.66 Model 6 [ 1 0 210 ] (0.00 seconds, 376 Inserts)
% 0.45/0.66
% 0.45/0.66 Stopped by limit on insertions
% 0.45/0.66
% 0.45/0.66 Model 7 [ 3 1 189 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.66
% 0.45/0.66 Stopped by limit on insertions
% 0.45/0.66
% 0.45/0.66 Model 8 [ 2 0 221 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.66
% 0.45/0.66 Stopped by limit on insertions
% 0.45/0.66
% 0.45/0.66 Model 9 [ 6 0 210 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.66
% 0.45/0.66 Stopped by limit on insertions
% 0.45/0.66
% 0.45/0.66 Model 10 [ 2 0 480 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.66
% 0.45/0.66 -----> EMPTY CLAUSE at 0.29 sec ----> 88 [hyper,84,28,66] {-} $F.
% 0.45/0.66
% 0.45/0.66 Length of proof is 11. Level of proof is 5.
% 0.45/0.66
% 0.45/0.66 ---------------- PROOF ----------------
% 0.45/0.66 % SZS status Theorem
% 0.45/0.66 % SZS output start Refutation
% 0.45/0.66
% 0.45/0.66 19 [] {+} -cUnsatisfiable(A)| -rr(A,B)| -rr(A,C)|B=C.
% 0.45/0.66 20 [] {+} -cUnsatisfiable(A)|rr(A,$f1(A)).
% 0.45/0.66 21 [] {+} -cUnsatisfiable(A)|ca_Vx2($f1(A)).
% 0.45/0.66 22 [] {+} -cUnsatisfiable(A)|rs(A,$f2(A)).
% 0.45/0.66 24 [] {+} -cUnsatisfiable(A)|cpxcomp(A).
% 0.45/0.66 28 [] {+} -cp(A)| -ra_Px1(A,B).
% 0.45/0.66 29 [] {+} -cpxcomp(A)|ra_Px1(A,$f6(A)).
% 0.45/0.66 31 [] {+} -ca_Vx2(A)| -rinvS(A,B)|cp(B).
% 0.45/0.66 34 [] {+} rinvS(A,B)| -rs(B,A).
% 0.45/0.66 35 [] {+} -rs(A,B)|rr(A,B).
% 0.45/0.66 39 [] {+} cp(A)|ra_Px1(A,$f5(A)).
% 0.45/0.66 41 [] {-} cUnsatisfiable(i2003_11_14_17_21_22376).
% 0.45/0.66 43 [hyper,41,24] {+} cpxcomp(i2003_11_14_17_21_22376).
% 0.45/0.66 45 [hyper,41,22] {+} rs(i2003_11_14_17_21_22376,$f2(i2003_11_14_17_21_22376)).
% 0.45/0.66 46 [hyper,41,21] {+} ca_Vx2($f1(i2003_11_14_17_21_22376)).
% 0.45/0.66 47 [hyper,41,20] {+} rr(i2003_11_14_17_21_22376,$f1(i2003_11_14_17_21_22376)).
% 0.45/0.66 49 [hyper,43,29] {+} ra_Px1(i2003_11_14_17_21_22376,$f6(i2003_11_14_17_21_22376)).
% 0.45/0.66 53 [hyper,45,35] {+} rr(i2003_11_14_17_21_22376,$f2(i2003_11_14_17_21_22376)).
% 0.45/0.66 54 [hyper,45,34] {+} rinvS($f2(i2003_11_14_17_21_22376),i2003_11_14_17_21_22376).
% 0.45/0.66 66 [hyper,49,28,39] {+} ra_Px1(i2003_11_14_17_21_22376,$f5(i2003_11_14_17_21_22376)).
% 0.45/0.66 71,70 [hyper,53,19,41,47,flip.1] {-} $f2(i2003_11_14_17_21_22376)=$f1(i2003_11_14_17_21_22376).
% 0.45/0.66 75 [back_demod,54,demod,71] {+} rinvS($f1(i2003_11_14_17_21_22376),i2003_11_14_17_21_22376).
% 0.45/0.66 84 [hyper,75,31,46] {-} cp(i2003_11_14_17_21_22376).
% 0.45/0.66 88 [hyper,84,28,66] {-} $F.
% 0.45/0.66
% 0.45/0.66 % SZS output end Refutation
% 0.45/0.66 ------------ end of proof -------------
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 Search stopped by max_proofs option.
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 Search stopped by max_proofs option.
% 0.45/0.66
% 0.45/0.66 ============ end of search ============
% 0.45/0.66
% 0.45/0.66 ----------- soft-scott stats ----------
% 0.45/0.66
% 0.45/0.66 true clauses given 8 (42.1%)
% 0.45/0.66 false clauses given 11
% 0.45/0.66
% 0.45/0.66 FALSE TRUE
% 0.45/0.66 4 0 2
% 0.45/0.66 7 0 2
% 0.45/0.66 8 0 2
% 0.45/0.66 10 0 1
% 0.45/0.66 11 0 6
% 0.45/0.66 12 0 17
% 0.45/0.66 13 0 1
% 0.45/0.66 14 0 2
% 0.45/0.66 18 0 1
% 0.45/0.66 tot: 0 34 (100.0% true)
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 Model 10 [ 2 0 480 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.66
% 0.45/0.66 That finishes the proof of the theorem.
% 0.45/0.66
% 0.45/0.66 Process 21456 finished Tue Jun 7 10:57:21 2022
%------------------------------------------------------------------------------