%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS122+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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 2.36s 2.55s
% Output : Refutation 2.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS122+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n021.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:47:06 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 sandbox2 on n021.cluster.edu,
% 0.12/0.35 Tue Jun 7 10:47:06 2022
% 0.12/0.35 The command was "./sos". The process ID is 28911.
% 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=3.
% 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 42 back subsumes 5.
% 0.12/0.35 Following clause subsumed by 46 during input processing: 0 [copy,46,flip.1] {-} A=A.
% 0.12/0.35 46 back subsumes 41.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 38
% 0.19/0.38 number of clauses initially in problem: 43
% 0.19/0.38 percentage of clauses intially in UL: 88
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 85
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 21
% 0.19/0.38 distinct predicate count: 15
% 0.19/0.38 distinct function count: 5
% 0.19/0.38 distinct constant count: 1
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 2.36/2.55
% 2.36/2.55 -------- PROOF --------
% 2.36/2.55 % SZS status Theorem
% 2.36/2.55 % SZS output start Refutation
% 2.36/2.55
% 2.36/2.55 Model 3 [ 1 0 436 ] (0.00 seconds, 2607 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 4 [ 2 0 300 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 5 [ 2 0 255 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 6 [ 3 1 204 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 7 [ 2 0 212 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 8 [ 3 2 69996 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 9 [ 6 0 287 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 10 [ 3 0 403 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 11 [ 5 0 320 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 12 [ 5 1 309 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 13 [ 7 0 310 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 14 [ 6 1 8033 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 15 [ 6 0 228 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 16 [ 7 1 29931 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 17 [ 9 0 217 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 18 [ 9 0 118 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 Stopped by limit on insertions
% 2.36/2.55
% 2.36/2.55 Model 19 [ 9 1 378 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 -----> EMPTY CLAUSE at 2.15 sec ----> 378 [hyper,219,25,97] {-} $F.
% 2.36/2.55
% 2.36/2.55 Length of proof is 13. Level of proof is 7.
% 2.36/2.55
% 2.36/2.55 ---------------- PROOF ----------------
% 2.36/2.55 % SZS status Theorem
% 2.36/2.55 % SZS output start Refutation
% 2.36/2.55
% 2.36/2.55 22 [] {+} -cUnsatisfiable(A)|rf(A,$f1(A)).
% 2.36/2.55 23 [] {+} -cUnsatisfiable(A)|ca_Ax2($f1(A)).
% 2.36/2.55 25 [] {+} -cp1(A)| -ra_Px1(A,B).
% 2.36/2.55 26 [] {+} -cp1xcomp(A)|ra_Px1(A,$f3(A)).
% 2.36/2.55 28 [] {+} -ca_Ax2(A)|cp1(A).
% 2.36/2.55 29 [] {+} -ca_Ax2(A)| -rinvF(A,B)|ca_Vx3(B).
% 2.36/2.55 32 [] {+} -ca_Vx3(A)|rf(A,$f5(A)).
% 2.36/2.55 33 [] {+} -ca_Vx3(A)|cp1xcomp($f5(A)).
% 2.36/2.55 35 [] {+} -rf(A,B)| -rf(A,C)|B=C.
% 2.36/2.55 37 [] {+} rinvF(A,B)| -rf(B,A).
% 2.36/2.55 45 [] {-} cUnsatisfiable(i2003_11_14_17_21_55116).
% 2.36/2.55 47 [hyper,45,23] {+} ca_Ax2($f1(i2003_11_14_17_21_55116)).
% 2.36/2.55 48 [hyper,45,22] {+} rf(i2003_11_14_17_21_55116,$f1(i2003_11_14_17_21_55116)).
% 2.36/2.55 50 [hyper,47,28] {+} cp1($f1(i2003_11_14_17_21_55116)).
% 2.36/2.55 53 [hyper,48,37] {+} rinvF($f1(i2003_11_14_17_21_55116),i2003_11_14_17_21_55116).
% 2.36/2.55 58 [para_into,50.1.1,35.3.1] {-} cp1(A)| -rf(B,$f1(i2003_11_14_17_21_55116))| -rf(B,A).
% 2.36/2.55 77 [hyper,53,29,47] {+} ca_Vx3(i2003_11_14_17_21_55116).
% 2.36/2.55 81 [hyper,77,33] {+} cp1xcomp($f5(i2003_11_14_17_21_55116)).
% 2.36/2.55 82 [hyper,77,32] {+} rf(i2003_11_14_17_21_55116,$f5(i2003_11_14_17_21_55116)).
% 2.36/2.55 85 [para_into,58.2.2,35.3.1] {-} cp1(A)| -rf(B,C)| -rf(B,A)| -rf(D,$f1(i2003_11_14_17_21_55116))| -rf(D,C).
% 2.36/2.55 97 [hyper,81,26] {-} ra_Px1($f5(i2003_11_14_17_21_55116),$f3($f5(i2003_11_14_17_21_55116))).
% 2.36/2.55 101 [para_into,85.4.2,35.3.1] {-} cp1(A)| -rf(B,C)| -rf(B,A)| -rf(D,E)| -rf(D,C)| -rf(F,$f1(i2003_11_14_17_21_55116))| -rf(F,E).
% 2.36/2.55 127 [para_into,101.6.2,35.3.1] {-} cp1(A)| -rf(B,C)| -rf(B,A)| -rf(D,E)| -rf(D,C)| -rf(F,G)| -rf(F,E)| -rf(H,$f1(i2003_11_14_17_21_55116))| -rf(H,G).
% 2.36/2.55 219 [hyper,82,127,82,82,82,82,82,82,48] {+} cp1($f5(i2003_11_14_17_21_55116)).
% 2.36/2.55 378 [hyper,219,25,97] {-} $F.
% 2.36/2.55
% 2.36/2.55 % SZS output end Refutation
% 2.36/2.55 ------------ end of proof -------------
% 2.36/2.55
% 2.36/2.55
% 2.36/2.55 Search stopped by max_proofs option.
% 2.36/2.55
% 2.36/2.55
% 2.36/2.55 Search stopped by max_proofs option.
% 2.36/2.55
% 2.36/2.55 ============ end of search ============
% 2.36/2.55
% 2.36/2.55 ----------- soft-scott stats ----------
% 2.36/2.55
% 2.36/2.55 true clauses given 46 (22.0%)
% 2.36/2.55 false clauses given 163
% 2.36/2.55
% 2.36/2.55 FALSE TRUE
% 2.36/2.55 3 0 2
% 2.36/2.55 4 1 0
% 2.36/2.55 5 0 1
% 2.36/2.55 6 1 2
% 2.36/2.55 7 0 2
% 2.36/2.55 8 0 1
% 2.36/2.55 9 0 6
% 2.36/2.55 10 2 5
% 2.36/2.55 11 0 2
% 2.36/2.55 12 1 12
% 2.36/2.55 13 0 13
% 2.36/2.55 14 0 10
% 2.36/2.55 15 0 3
% 2.36/2.55 16 0 27
% 2.36/2.55 17 0 11
% 2.36/2.55 18 0 26
% 2.36/2.55 19 0 23
% 2.36/2.55 20 0 9
% 2.36/2.55 21 0 21
% 2.36/2.55 22 0 8
% 2.36/2.55 24 0 35
% 2.36/2.55 25 0 2
% 2.36/2.55 27 0 15
% 2.36/2.55 30 0 28
% 2.36/2.55 33 1 10
% 2.36/2.55 36 0 18
% 2.36/2.55 39 1 1
% 2.36/2.55 tot: 7 293 (97.7% true)
% 2.36/2.55
% 2.36/2.55
% 2.36/2.55 Model 19 [ 9 1 378 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.55
% 2.36/2.55 That finishes the proof of the theorem.
% 2.36/2.55
% 2.36/2.55 Process 28911 finished Tue Jun 7 10:47:08 2022
%------------------------------------------------------------------------------