%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL674+1.010 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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 14:32:00 EDT 2022
% Result : Theorem 1.44s 1.69s
% Output : Refutation 1.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL674+1.010 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n007.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 : Mon Jul 4 02:17:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n007.cluster.edu,
% 0.12/0.36 Mon Jul 4 02:17:41 2022
% 0.12/0.36 The command was "./sos". The process ID is 7932.
% 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=0, equality=0, symmetry=0, max_lits=6.
% 0.12/0.36
% 0.12/0.36 This is a non-Horn set without equality. The strategy
% 0.12/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 Following clause subsumed by 2 during input processing: 0 [] {-} -r1($c1,A)| -r1(A,B)| -p5(B)| -p104(B)|p5(A)| -p104(A).
% 0.12/0.37
% 0.12/0.37 ------------> process sos:
% 0.12/0.37
% 0.12/0.37 ======= end of input processing =======
% 0.12/0.41
% 0.12/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.41
% 0.12/0.41 Stopped by limit on number of solutions
% 0.12/0.41
% 0.12/0.41
% 0.12/0.41 -------------- Softie stats --------------
% 0.12/0.41
% 0.12/0.41 UPDATE_STOP: 300
% 0.12/0.41 SFINDER_TIME_LIMIT: 2
% 0.12/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.41 number of clauses in intial UL: 115
% 0.12/0.41 number of clauses initially in problem: 117
% 0.12/0.41 percentage of clauses intially in UL: 98
% 0.12/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.41 percent of all initial clauses that are short: 100
% 0.12/0.41 absolute distinct symbol count: 45
% 0.12/0.41 distinct predicate count: 24
% 0.12/0.41 distinct function count: 20
% 0.12/0.41 distinct constant count: 1
% 0.12/0.41
% 0.12/0.41 ---------- no more Softie stats ----------
% 0.12/0.41
% 0.12/0.41
% 0.12/0.41
% 0.12/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.41
% 0.12/0.41 Stopped by limit on number of solutions
% 0.12/0.41
% 0.12/0.41 =========== start of search ===========
% 1.44/1.69
% 1.44/1.69 -------- PROOF --------
% 1.44/1.69 % SZS status Theorem
% 1.44/1.69 % SZS output start Refutation
% 1.44/1.69
% 1.44/1.69 Stopped by limit on insertions
% 1.44/1.69
% 1.44/1.69 Model 3 [ 1 2 12917 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.69
% 1.44/1.69 Stopped by limit on insertions
% 1.44/1.69
% 1.44/1.69 Model 4 [ 1 1 3109 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.69
% 1.44/1.69 Stopped by limit on insertions
% 1.44/1.69
% 1.44/1.69 Model 5 [ 1 1 671 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.69
% 1.44/1.69 Stopped by limit on insertions
% 1.44/1.69
% 1.44/1.69 Model 6 [ 1 0 546 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.69
% 1.44/1.69 Stopped by limit on insertions
% 1.44/1.69
% 1.44/1.69 Model 7 [ 1 0 3496 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.69
% 1.44/1.69 Stopped by limit on insertions
% 1.44/1.69
% 1.44/1.69 Model 8 [ 1 1 610 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.69
% 1.44/1.69 Stopped by limit on insertions
% 1.44/1.69
% 1.44/1.69 Model 9 [ 1 1 477 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.69
% 1.44/1.69 Stopped by limit on insertions
% 1.44/1.69
% 1.44/1.69 Model 10 [ 3 0 453 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.69
% 1.44/1.69 Stopped by limit on insertions
% 1.44/1.69
% 1.44/1.69 Model 11 [ 1 0 609 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.69
% 1.44/1.69 Stopped by limit on insertions
% 1.44/1.69
% 1.44/1.69 Model 12 [ 1 0 621 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.69
% 1.44/1.69 Stopped by limit on insertions
% 1.44/1.69
% 1.44/1.69 Model 13 [ 1 0 404 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.69
% 1.44/1.69 ----> UNIT CONFLICT at 1.31 sec ----> 1213 [binary,1212.1,115.1] {-} $F.
% 1.44/1.69
% 1.44/1.69 Length of proof is 23. Level of proof is 18.
% 1.44/1.69
% 1.44/1.69 ---------------- PROOF ----------------
% 1.44/1.69 % SZS status Theorem
% 1.44/1.69 % SZS output start Refutation
% 1.44/1.69
% 1.44/1.69 1 [] {+} -r1(A,B)| -r1(B,C)|r1(A,C).
% 1.44/1.69 2 [] {+} -r1($c1,A)|p5(A).
% 1.44/1.69 51 [] {+} -r1($c1,A)|r1(A,$f13(A))|p104(A)| -p103(A).
% 1.44/1.69 52 [] {+} -r1($c1,A)| -p5($f13(A))|p104(A)| -p103(A).
% 1.44/1.69 63 [] {+} -r1($c1,A)|r1(A,$f16(A))|p103(A)| -p102(A).
% 1.44/1.69 65 [] {+} -r1($c1,A)| -p104($f16(A))|p103(A)| -p102(A).
% 1.44/1.69 66 [] {+} -r1($c1,A)|p103($f16(A))|p103(A)| -p102(A).
% 1.44/1.69 71 [] {+} -r1($c1,A)|r1(A,$f18(A))|p102(A)| -p101(A).
% 1.44/1.69 73 [] {+} -r1($c1,A)| -p103($f18(A))|p102(A)| -p101(A).
% 1.44/1.69 74 [] {+} -r1($c1,A)|p102($f18(A))|p102(A)| -p101(A).
% 1.44/1.69 79 [] {+} -r1($c1,A)|r1(A,$f20(A))|p101(A)| -p100(A).
% 1.44/1.69 81 [] {+} -r1($c1,A)| -p102($f20(A))|p101(A)| -p100(A).
% 1.44/1.69 82 [] {+} -r1($c1,A)|p101($f20(A))|p101(A)| -p100(A).
% 1.44/1.69 115 [] {+} -p101($c1).
% 1.44/1.69 116 [] {+} r1(A,A).
% 1.44/1.69 117 [] {+} p100($c1).
% 1.44/1.69 119 [hyper,117,82,116,unit_del,115] {+} p101($f20($c1)).
% 1.44/1.69 121 [hyper,117,79,116,unit_del,115] {+} r1($c1,$f20($c1)).
% 1.44/1.69 125 [hyper,121,74,119] {+} p102($f18($f20($c1)))|p102($f20($c1)).
% 1.44/1.69 127 [hyper,121,71,119] {+} r1($f20($c1),$f18($f20($c1)))|p102($f20($c1)).
% 1.44/1.69 138 [hyper,125,81,116,117,unit_del,115] {+} p102($f18($f20($c1))).
% 1.44/1.69 139 [hyper,127,81,116,117,unit_del,115] {+} r1($f20($c1),$f18($f20($c1))).
% 1.44/1.69 140 [hyper,139,1,121] {+} r1($c1,$f18($f20($c1))).
% 1.44/1.69 142 [hyper,140,66,138] {-} p103($f16($f18($f20($c1))))|p103($f18($f20($c1))).
% 1.44/1.69 144 [hyper,140,63,138] {+} r1($f18($f20($c1)),$f16($f18($f20($c1))))|p103($f18($f20($c1))).
% 1.44/1.69 154 [hyper,142,73,121,119] {+} p103($f16($f18($f20($c1))))|p102($f20($c1)).
% 1.44/1.69 183 [hyper,144,73,121,119] {+} r1($f18($f20($c1)),$f16($f18($f20($c1))))|p102($f20($c1)).
% 1.44/1.69 269 [hyper,183,81,116,117,unit_del,115] {+} r1($f18($f20($c1)),$f16($f18($f20($c1)))).
% 1.44/1.69 270 [hyper,269,1,140] {+} r1($c1,$f16($f18($f20($c1)))).
% 1.44/1.69 283 [hyper,270,51,142] {+} r1($f16($f18($f20($c1))),$f13($f16($f18($f20($c1)))))|p104($f16($f18($f20($c1))))|p103($f18($f20($c1))).
% 1.44/1.69 1059 [hyper,283,65,140,138,factor_simp] {+} r1($f16($f18($f20($c1))),$f13($f16($f18($f20($c1)))))|p103($f18($f20($c1))).
% 1.44/1.69 1144 [hyper,1059,73,121,119] {+} r1($f16($f18($f20($c1))),$f13($f16($f18($f20($c1)))))|p102($f20($c1)).
% 1.44/1.69 1177 [hyper,1144,81,116,117,unit_del,115] {-} r1($f16($f18($f20($c1))),$f13($f16($f18($f20($c1))))).
% 1.44/1.69 1179 [hyper,1177,1,270] {-} r1($c1,$f13($f16($f18($f20($c1))))).
% 1.44/1.69 1193 [hyper,1179,2] {+} p5($f13($f16($f18($f20($c1))))).
% 1.44/1.69 1203 [hyper,1193,52,270,154] {+} p104($f16($f18($f20($c1))))|p102($f20($c1)).
% 1.44/1.69 1205 [hyper,1203,65,140,138] {+} p102($f20($c1))|p103($f18($f20($c1))).
% 1.44/1.69 1211 [hyper,1205,73,121,119,factor_simp] {+} p102($f20($c1)).
% 1.44/1.69 1212 [hyper,1211,81,116,117] {-} p101($c1).
% 1.44/1.69 1213 [binary,1212.1,115.1] {-} $F.
% 1.44/1.69
% 1.44/1.69 % SZS output end Refutation
% 1.44/1.69 ------------ end of proof -------------
% 1.44/1.69
% 1.44/1.69
% 1.44/1.69 Search stopped by max_proofs option.
% 1.44/1.69
% 1.44/1.69
% 1.44/1.69 Search stopped by max_proofs option.
% 1.44/1.69
% 1.44/1.69 ============ end of search ============
% 1.44/1.69
% 1.44/1.69 ----------- soft-scott stats ----------
% 1.44/1.69
% 1.44/1.69 true clauses given 333 (86.0%)
% 1.44/1.69 false clauses given 54
% 1.44/1.69
% 1.44/1.69 FALSE TRUE
% 1.44/1.69 9 0 1
% 1.44/1.69 10 0 1
% 1.44/1.69 11 0 2
% 1.44/1.69 15 0 7
% 1.44/1.69 17 0 48
% 1.44/1.69 18 0 12
% 1.44/1.69 19 0 56
% 1.44/1.69 20 0 26
% 1.44/1.69 21 0 64
% 1.44/1.69 22 0 74
% 1.44/1.69 24 0 23
% 1.44/1.69 25 0 56
% 1.44/1.69 27 0 35
% 1.44/1.69 29 0 9
% 1.44/1.69 30 0 26
% 1.44/1.69 32 0 26
% 1.44/1.69 33 0 8
% 1.44/1.69 34 0 12
% 1.44/1.69 35 0 14
% 1.44/1.69 38 0 4
% 1.44/1.69 39 0 8
% 1.44/1.69 tot: 0 512 (100.0% true)
% 1.44/1.69
% 1.44/1.69
% 1.44/1.69 Model 13 [ 1 0 404 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.69
% 1.44/1.69 That finishes the proof of the theorem.
% 1.44/1.69
% 1.44/1.69 Process 7932 finished Mon Jul 4 02:17:43 2022
%------------------------------------------------------------------------------