%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS072+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:41 EDT 2022
% Result : Unsatisfiable 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS072+1 : TPTP v8.1.0. Released v3.1.0.
% 0.13/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 7 20:45:08 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n023.cluster.edu,
% 0.14/0.36 Tue Jun 7 20:45:08 2022
% 0.14/0.36 The command was "./sos". The process ID is 16294.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 formula_list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.14/0.36
% 0.14/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.36 clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: set(unit_deletion).
% 0.14/0.36 dependent: set(factor).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36 15 back subsumes 2.
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 38 back subsumes 3.
% 0.14/0.36 Following clause subsumed by 41 during input processing: 0 [copy,41,flip.1] {-} A=A.
% 0.14/0.36 41 back subsumes 37.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.39
% 0.14/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 -------------- Softie stats --------------
% 0.14/0.39
% 0.14/0.39 UPDATE_STOP: 300
% 0.14/0.39 SFINDER_TIME_LIMIT: 2
% 0.14/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.39 number of clauses in intial UL: 34
% 0.14/0.39 number of clauses initially in problem: 38
% 0.14/0.39 percentage of clauses intially in UL: 89
% 0.14/0.39 percentage of distinct symbols occuring in initial UL: 88
% 0.14/0.39 percent of all initial clauses that are short: 100
% 0.14/0.39 absolute distinct symbol count: 18
% 0.14/0.39 distinct predicate count: 13
% 0.14/0.39 distinct function count: 4
% 0.14/0.39 distinct constant count: 1
% 0.14/0.39
% 0.14/0.39 ---------- no more Softie stats ----------
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39 =========== start of search ===========
% 0.20/0.55
% 0.20/0.55 -------- PROOF --------
% 0.20/0.55 % SZS status Theorem
% 0.20/0.55 % SZS output start Refutation
% 0.20/0.55
% 0.20/0.55 Model 3 [ 1 1 432 ] (0.00 seconds, 1508 Inserts)
% 0.20/0.55
% 0.20/0.55 Model 4 [ 1 1 746 ] (0.00 seconds, 1530 Inserts)
% 0.20/0.55
% 0.20/0.55 Stopped by limit on insertions
% 0.20/0.55
% 0.20/0.55 Model 5 [ 2 0 485 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.55
% 0.20/0.55 Model 6 [ 2 0 445 ] (0.00 seconds, 223212 Inserts)
% 0.20/0.55
% 0.20/0.55 -----> EMPTY CLAUSE at 0.16 sec ----> 62 [hyper,61,26,42] {-} $F.
% 0.20/0.55
% 0.20/0.55 Length of proof is 7. Level of proof is 4.
% 0.20/0.55
% 0.20/0.55 ---------------- PROOF ----------------
% 0.20/0.55 % SZS status Theorem
% 0.20/0.55 % SZS output start Refutation
% 0.20/0.55
% 0.20/0.55 17 [] {+} -cUnsatisfiable(A)|rinvR(A,$f2(A)).
% 0.20/0.55 18 [] {+} -cUnsatisfiable(A)| -rr($f2(A),B)| -rr($f2(A),C)|B=C.
% 0.20/0.55 19 [] {+} -cUnsatisfiable(A)|rr($f2(A),$f1(A)).
% 0.20/0.55 20 [] {+} -cUnsatisfiable(A)|cp1($f1(A)).
% 0.20/0.55 21 [] {+} -cUnsatisfiable(A)|cp2(A).
% 0.20/0.55 26 [] {+} -cp1(A)| -cp2(A).
% 0.20/0.55 35 [] {+} -rinvR(A,B)|rr(B,A).
% 0.20/0.55 40 [] {-} cUnsatisfiable(i2003_11_14_17_18_50190).
% 0.20/0.55 42 [hyper,40,21] {+} cp2(i2003_11_14_17_18_50190).
% 0.20/0.55 43 [hyper,40,20] {+} cp1($f1(i2003_11_14_17_18_50190)).
% 0.20/0.55 44 [hyper,40,19] {+} rr($f2(i2003_11_14_17_18_50190),$f1(i2003_11_14_17_18_50190)).
% 0.20/0.55 45 [hyper,40,17] {+} rinvR(i2003_11_14_17_18_50190,$f2(i2003_11_14_17_18_50190)).
% 0.20/0.55 50 [hyper,45,35] {+} rr($f2(i2003_11_14_17_18_50190),i2003_11_14_17_18_50190).
% 0.20/0.55 59,58 [hyper,44,18,40,50,flip.1] {-} $f1(i2003_11_14_17_18_50190)=i2003_11_14_17_18_50190.
% 0.20/0.55 61 [back_demod,43,demod,59] {-} cp1(i2003_11_14_17_18_50190).
% 0.20/0.55 62 [hyper,61,26,42] {-} $F.
% 0.20/0.55
% 0.20/0.55 % SZS output end Refutation
% 0.20/0.55 ------------ end of proof -------------
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Search stopped by max_proofs option.
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Search stopped by max_proofs option.
% 0.20/0.55
% 0.20/0.55 ============ end of search ============
% 0.20/0.55
% 0.20/0.55 ----------- soft-scott stats ----------
% 0.20/0.55
% 0.20/0.55 true clauses given 4 (40.0%)
% 0.20/0.55 false clauses given 6
% 0.20/0.55
% 0.20/0.55 FALSE TRUE
% 0.20/0.55 4 1 0
% 0.20/0.55 5 1 0
% 0.20/0.55 7 0 2
% 0.20/0.55 9 0 1
% 0.20/0.55 12 0 3
% 0.20/0.55 13 0 2
% 0.20/0.55 14 0 6
% 0.20/0.55 tot: 2 14 (87.5% true)
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Model 6 [ 2 0 445 ] (0.00 seconds, 223212 Inserts)
% 0.20/0.55
% 0.20/0.55 That finishes the proof of the theorem.
% 0.20/0.55
% 0.20/0.55 Process 16294 finished Tue Jun 7 20:45:08 2022
%------------------------------------------------------------------------------