%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CSR052+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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 : Fri Jul 15 23:21:35 EDT 2022
% Result : Theorem 2.58s 2.80s
% Output : Refutation 2.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR052+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n005.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 11 01:10:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n005.cluster.edu,
% 0.12/0.36 Sat Jun 11 01:10:09 2022
% 0.12/0.36 The command was "./sos". The process ID is 19423.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This is a Horn set without equality. The strategy will
% 0.12/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.36 in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 Following clause subsumed by 11 during input processing: 0 [] {-} -genlpreds(A,B)|predicate(B).
% 0.12/0.36 Following clause subsumed by 12 during input processing: 0 [] {-} -genlpreds(A,B)|predicate(A).
% 0.12/0.36 Following clause subsumed by 14 during input processing: 0 [] {-} -predicate(A)|genlpreds(A,A).
% 0.12/0.36 Following clause subsumed by 43 during input processing: 0 [] {-} -genlmt(A,B)|microtheory(B).
% 0.12/0.36 Following clause subsumed by 44 during input processing: 0 [] {-} -genlmt(A,B)|microtheory(A).
% 0.12/0.36 Following clause subsumed by 46 during input processing: 0 [] {-} -microtheory(A)|genlmt(A,A).
% 0.12/0.36 Following clause subsumed by 49 during input processing: 0 [] {-} -genls(A,B)|collection(B).
% 0.12/0.36 Following clause subsumed by 50 during input processing: 0 [] {-} -genls(A,B)|collection(A).
% 0.12/0.36 Following clause subsumed by 52 during input processing: 0 [] {-} -collection(A)|genls(A,A).
% 0.12/0.36 Following clause subsumed by 51 during input processing: 0 [] {-} -genls(A,B)| -genls(C,A)|genls(C,B).
% 0.12/0.36 Following clause subsumed by 51 during input processing: 0 [] {-} -genls(A,B)| -genls(B,C)|genls(A,C).
% 0.12/0.36 Following clause subsumed by 53 during input processing: 0 [] {-} -isa(A,B)|collection(B).
% 0.12/0.36 Following clause subsumed by 54 during input processing: 0 [] {-} -isa(A,B)|thing(A).
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 56
% 0.20/0.40 number of clauses initially in problem: 84
% 0.20/0.40 percentage of clauses intially in UL: 66
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 60
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 53
% 0.20/0.40 distinct predicate count: 26
% 0.20/0.40 distinct function count: 3
% 0.20/0.40 distinct constant count: 24
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 2.58/2.80
% 2.58/2.80 -------- PROOF --------
% 2.58/2.80 % SZS status Theorem
% 2.58/2.80 % SZS output start Refutation
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 3 (0.00 seconds, 0 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on number of solutions
% 2.58/2.80
% 2.58/2.80 Model 4 (0.00 seconds, 0 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on number of solutions
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 5 [ 1 1 233 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Model 6 (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on number of solutions
% 2.58/2.80
% 2.58/2.80 Model 7 (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on number of solutions
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 8 [ 1 0 762 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 9 [ 1 1 413 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Model 10 (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on number of solutions
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 11 [ 8 1 221 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 12 [ 6 1 279 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Model 13 (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on number of solutions
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 14 [ 10 0 217 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 15 [ 7 0 212 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 16 [ 1 0 279 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 17 [ 5 0 779 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 18 [ 5 1 444 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 19 [ 3 0 338 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Model 20 (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on number of solutions
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 21 [ 13 1 212 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Model 22 (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on number of solutions
% 2.58/2.80
% 2.58/2.80 Model 23 (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on number of solutions
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 24 [ 7 0 917 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 25 [ 6 0 752 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 26 [ 4 0 299 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 27 [ 4 1 258 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 28 [ 16 1 495 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 29 [ 6 1 921 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 30 [ 9 0 1341 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 Stopped by limit on insertions
% 2.58/2.80
% 2.58/2.80 Model 31 [ 5 0 239 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 ----> UNIT CONFLICT at 2.42 sec ----> 142 [binary,141.1,56.1] {+} $F.
% 2.58/2.80
% 2.58/2.80 Length of proof is 7. Level of proof is 4.
% 2.58/2.80
% 2.58/2.80 ---------------- PROOF ----------------
% 2.58/2.80 % SZS status Theorem
% 2.58/2.80 % SZS output start Refutation
% 2.58/2.80
% 2.58/2.80 51 [] {+} -genls(A,B)| -genls(B,C)|genls(A,C).
% 2.58/2.80 56 [] {+} -genls(c_tptpcol_15_40430,c_tptpcol_7_39939).
% 2.58/2.80 64 [] {+} genls(c_tptpcol_8_39940,c_tptpcol_7_39939).
% 2.58/2.80 65 [] {+} genls(c_tptpcol_9_40196,c_tptpcol_8_39940).
% 2.58/2.80 66 [] {+} genls(c_tptpcol_10_40324,c_tptpcol_9_40196).
% 2.58/2.80 67 [] {+} genls(c_tptpcol_11_40388,c_tptpcol_10_40324).
% 2.58/2.80 68 [] {+} genls(c_tptpcol_12_40420,c_tptpcol_11_40388).
% 2.58/2.80 69 [] {-} genls(c_tptpcol_13_40421,c_tptpcol_12_40420).
% 2.58/2.80 70 [] {+} genls(c_tptpcol_14_40429,c_tptpcol_13_40421).
% 2.58/2.80 71 [] {+} genls(c_tptpcol_15_40430,c_tptpcol_14_40429).
% 2.58/2.80 96 [hyper,65,51,64] {+} genls(c_tptpcol_9_40196,c_tptpcol_7_39939).
% 2.58/2.80 117 [hyper,68,51,67] {+} genls(c_tptpcol_12_40420,c_tptpcol_10_40324).
% 2.58/2.80 118 [hyper,96,51,66] {+} genls(c_tptpcol_10_40324,c_tptpcol_7_39939).
% 2.58/2.80 123 [hyper,71,51,70] {+} genls(c_tptpcol_15_40430,c_tptpcol_13_40421).
% 2.58/2.80 128 [hyper,123,51,69] {+} genls(c_tptpcol_15_40430,c_tptpcol_12_40420).
% 2.58/2.80 135 [hyper,117,51,118] {+} genls(c_tptpcol_12_40420,c_tptpcol_7_39939).
% 2.58/2.80 141 [hyper,128,51,135] {-} genls(c_tptpcol_15_40430,c_tptpcol_7_39939).
% 2.58/2.80 142 [binary,141.1,56.1] {+} $F.
% 2.58/2.80
% 2.58/2.80 % SZS output end Refutation
% 2.58/2.80 ------------ end of proof -------------
% 2.58/2.80
% 2.58/2.80
% 2.58/2.80 Search stopped by max_proofs option.
% 2.58/2.80
% 2.58/2.80
% 2.58/2.80 Search stopped by max_proofs option.
% 2.58/2.80
% 2.58/2.80 ============ end of search ============
% 2.58/2.80
% 2.58/2.80 ----------- soft-scott stats ----------
% 2.58/2.80
% 2.58/2.80 true clauses given 12 (25.0%)
% 2.58/2.80 false clauses given 36
% 2.58/2.80
% 2.58/2.80 FALSE TRUE
% 2.58/2.80 2 0 7
% 2.58/2.80 3 8 14
% 2.58/2.80 4 1 0
% 2.58/2.80 5 1 0
% 2.58/2.80 6 2 1
% 2.58/2.80 7 2 0
% 2.58/2.80 tot: 14 22 (61.1% true)
% 2.58/2.80
% 2.58/2.80
% 2.58/2.80 Model 31 [ 5 0 239 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.80
% 2.58/2.80 That finishes the proof of the theorem.
% 2.58/2.80
% 2.58/2.80 Process 19423 finished Sat Jun 11 01:10:11 2022
%------------------------------------------------------------------------------