%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP127-3.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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 : Sat Jul 16 11:41:41 EDT 2022
% Result : Unsatisfiable 14.92s 15.13s
% Output : Refutation 14.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : GRP127-3.004 : TPTP v8.1.0. Released v1.2.0.
% 0.04/0.14 % Command : sos-script %s
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 13 14:41:18 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.21/0.39 ----- Otter 3.2, August 2001 -----
% 0.21/0.39 The process was started by sandbox on n024.cluster.edu,
% 0.21/0.39 Mon Jun 13 14:41:18 2022
% 0.21/0.39 The command was "./sos". The process ID is 10219.
% 0.21/0.39
% 0.21/0.39 set(prolog_style_variables).
% 0.21/0.39 set(auto).
% 0.21/0.39 dependent: set(auto1).
% 0.21/0.39 dependent: set(process_input).
% 0.21/0.39 dependent: clear(print_kept).
% 0.21/0.39 dependent: clear(print_new_demod).
% 0.21/0.39 dependent: clear(print_back_demod).
% 0.21/0.39 dependent: clear(print_back_sub).
% 0.21/0.39 dependent: set(control_memory).
% 0.21/0.39 dependent: assign(max_mem, 12000).
% 0.21/0.39 dependent: assign(pick_given_ratio, 4).
% 0.21/0.39 dependent: assign(stats_level, 1).
% 0.21/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.39 dependent: assign(sos_limit, 5000).
% 0.21/0.39 dependent: assign(max_weight, 60).
% 0.21/0.39 clear(print_given).
% 0.21/0.39
% 0.21/0.39 list(usable).
% 0.21/0.39
% 0.21/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.21/0.39
% 0.21/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.21/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.21/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.21/0.39 clauses in usable.
% 0.21/0.39
% 0.21/0.39 dependent: set(knuth_bendix).
% 0.21/0.39 dependent: set(para_from).
% 0.21/0.39 dependent: set(para_into).
% 0.21/0.39 dependent: clear(para_from_right).
% 0.21/0.39 dependent: clear(para_into_right).
% 0.21/0.39 dependent: set(para_from_vars).
% 0.21/0.39 dependent: set(eq_units_both_ways).
% 0.21/0.39 dependent: set(dynamic_demod_all).
% 0.21/0.39 dependent: set(dynamic_demod).
% 0.21/0.39 dependent: set(order_eq).
% 0.21/0.39 dependent: set(back_demod).
% 0.21/0.39 dependent: set(lrpo).
% 0.21/0.39 dependent: set(hyper_res).
% 0.21/0.39 dependent: set(unit_deletion).
% 0.21/0.39 dependent: set(factor).
% 0.21/0.39
% 0.21/0.39 ------------> process usable:
% 0.21/0.39 Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.21/0.39 Following clause subsumed by 10 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.21/0.39 Following clause subsumed by 14 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.21/0.39 Following clause subsumed by 12 during input processing: 0 [] {-} -equalish(e_4,e_1).
% 0.21/0.39 Following clause subsumed by 16 during input processing: 0 [] {-} -equalish(e_4,e_2).
% 0.21/0.39 Following clause subsumed by 18 during input processing: 0 [] {-} -equalish(e_4,e_3).
% 0.21/0.39
% 0.21/0.39 ------------> process sos:
% 0.21/0.39
% 0.21/0.39 ======= end of input processing =======
% 0.21/0.41
% 0.21/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 -------------- Softie stats --------------
% 0.21/0.41
% 0.21/0.41 UPDATE_STOP: 300
% 0.21/0.41 SFINDER_TIME_LIMIT: 2
% 0.21/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.41 number of clauses in intial UL: 33
% 0.21/0.41 number of clauses initially in problem: 53
% 0.21/0.41 percentage of clauses intially in UL: 62
% 0.21/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.41 percent of all initial clauses that are short: 100
% 0.21/0.41 absolute distinct symbol count: 11
% 0.21/0.41 distinct predicate count: 6
% 0.21/0.41 distinct function count: 0
% 0.21/0.41 distinct constant count: 5
% 0.21/0.41
% 0.21/0.41 ---------- no more Softie stats ----------
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 =========== start of search ===========
% 8.57/8.77
% 8.57/8.77
% 8.57/8.77 Changing weight limit from 60 to 24.
% 8.57/8.77
% 8.57/8.77 Model 2 (0.00 seconds, 0 Inserts)
% 8.57/8.77
% 8.57/8.77 Stopped by limit on number of solutions
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Model 3 [ 2 1 390 ] (0.00 seconds, 250000 Inserts)
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Model 4 [ 4 0 192 ] (0.00 seconds, 250000 Inserts)
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Model 5 [ 4 1 255 ] (0.00 seconds, 250000 Inserts)
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Model 6 [ 6 1 293 ] (0.00 seconds, 250000 Inserts)
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Model 7 [ 3 0 7115 ] (0.00 seconds, 250000 Inserts)
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Model 8 [ 4 0 224 ] (0.00 seconds, 250000 Inserts)
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Model 9 [ 8 1 2409 ] (0.00 seconds, 250000 Inserts)
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Model 10 [ 6 1 3963 ] (0.00 seconds, 250000 Inserts)
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Model 11 [ 6 1 9547 ] (0.00 seconds, 250000 Inserts)
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Model 12 [ 6 0 592 ] (0.00 seconds, 250000 Inserts)
% 8.57/8.77
% 8.57/8.77 Stopped by limit on insertions
% 8.57/8.77
% 8.57/8.77 Model 13 [ 5 2 84634 ] (0.00 seconds, 250000 Inserts)
% 8.57/8.77
% 8.57/8.77 Resetting weight limit to 24 after 110 givens.
% 8.57/8.77
% 12.66/12.87
% 12.66/12.87
% 12.66/12.87 Changing weight limit from 24 to 21.
% 12.66/12.87
% 12.66/12.87 Stopped by limit on insertions
% 12.66/12.87
% 12.66/12.87 Model 14 [ 7 0 354 ] (0.00 seconds, 250000 Inserts)
% 12.66/12.87
% 12.66/12.87 Resetting weight limit to 21 after 140 givens.
% 12.66/12.87
% 13.48/13.67
% 13.48/13.67
% 13.48/13.67 Changing weight limit from 21 to 20.
% 13.48/13.67
% 13.48/13.67 Stopped by limit on insertions
% 13.48/13.67
% 13.48/13.67 Model 15 [ 8 1 14219 ] (0.00 seconds, 250000 Inserts)
% 13.48/13.67
% 13.48/13.67 Stopped by limit on insertions
% 13.48/13.67
% 13.48/13.67 Model 16 [ 10 1 3394 ] (0.00 seconds, 250000 Inserts)
% 13.48/13.67
% 13.48/13.67 Resetting weight limit to 20 after 150 givens.
% 13.48/13.67
% 13.69/13.90
% 13.69/13.90
% 13.69/13.90 Changing weight limit from 20 to 19.
% 13.69/13.90
% 13.69/13.90 Resetting weight limit to 19 after 160 givens.
% 13.69/13.90
% 14.92/15.12
% 14.92/15.12
% 14.92/15.12 Changing weight limit from 19 to 20.
% 14.92/15.12
% 14.92/15.12 Stopped by limit on insertions
% 14.92/15.12
% 14.92/15.12 Stopped by limit on insertions
% 14.92/15.12
% 14.92/15.12 Resetting weight limit to 20 after 185 givens.
% 14.92/15.12
% 14.92/15.13
% 14.92/15.13 -- HEY sandbox, WE HAVE A PROOF!! --
% 14.92/15.13
% 14.92/15.13 ----> UNIT CONFLICT at 14.70 sec ----> 5772 [binary,5770.1,14.1] {-} $F.
% 14.92/15.13
% 14.92/15.13 Length of proof is 32. Level of proof is 12.
% 14.92/15.13
% 14.92/15.13 ---------------- PROOF ----------------
% 14.92/15.13 % SZS status Unsatisfiable
% 14.92/15.13 % SZS output start Refutation
% 14.92/15.13
% 14.92/15.13 2 [] {+} -group_element(A)|cycle(A,e_0)|cycle(A,e_1)|cycle(A,e_2)|cycle(A,e_3).
% 14.92/15.13 3 [] {+} -cycle(A,B)| -cycle(C,D)| -next(A,C)| -greater(B,e_0)| -next(D,E)|equalish(B,E).
% 14.92/15.13 4 [] {+} -cycle(A,B)| -cycle(C,e_0)| -cycle(D,E)| -next(C,D)| -greater(C,A)| -greater(B,E).
% 14.92/15.13 5 [] {+} -cycle(A,e_0)| -product(A,e_1,B)| -greater(B,A).
% 14.92/15.13 6 [] {+} -cycle(A,B)| -product(A,e_1,C)| -greater(B,e_0)| -next(A,D)|equalish(C,D).
% 14.92/15.13 7 [] {-} -equalish(e_1,e_2).
% 14.92/15.13 8 [copy,7,flip.1] {+} -equalish(e_2,e_1).
% 14.92/15.13 9 [] {-} -equalish(e_1,e_3).
% 14.92/15.13 10 [copy,9,flip.1] {+} -equalish(e_3,e_1).
% 14.92/15.13 13 [] {-} -equalish(e_2,e_3).
% 14.92/15.13 14 [copy,13,flip.1] {+} -equalish(e_3,e_2).
% 14.92/15.13 17 [] {-} -equalish(e_3,e_4).
% 14.92/15.13 18 [copy,17,flip.1] {+} -equalish(e_4,e_3).
% 14.92/15.13 19 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3)|product(A,B,e_4).
% 14.92/15.13 21 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 14.92/15.13 22 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 14.92/15.13 23 [] {+} -product(A,B,C)| -product(C,A,D)|product(D,A,B).
% 14.92/15.13 40 [] {+} next(e_0,e_1).
% 14.92/15.13 41 [] {+} next(e_1,e_2).
% 14.92/15.13 42 [] {+} next(e_2,e_3).
% 14.92/15.13 43 [] {+} next(e_3,e_4).
% 14.92/15.13 44 [] {-} greater(e_1,e_0).
% 14.92/15.13 45 [] {-} greater(e_2,e_0).
% 14.92/15.13 46 [] {+} greater(e_3,e_0).
% 14.92/15.13 51 [] {+} greater(e_3,e_2).
% 14.92/15.13 52 [] {+} greater(e_4,e_2).
% 14.92/15.13 54 [] {-} cycle(e_4,e_0).
% 14.92/15.13 55 [] {+} group_element(e_1).
% 14.92/15.13 56 [] {-} group_element(e_2).
% 14.92/15.13 57 [] {+} group_element(e_3).
% 14.92/15.13 59 [] {-} product(A,A,A).
% 14.92/15.13 85 [hyper,56,19,55] {-} product(e_1,e_2,e_1)|product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 14.92/15.13 86 [hyper,56,19,55] {-} product(e_2,e_1,e_1)|product(e_2,e_1,e_2)|product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 14.92/15.13 87 [hyper,56,2] {-} cycle(e_2,e_0)|cycle(e_2,e_1)|cycle(e_2,e_2)|cycle(e_2,e_3).
% 14.92/15.13 96 [hyper,57,19,56] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_2)|product(e_2,e_3,e_3)|product(e_2,e_3,e_4).
% 14.92/15.13 97 [hyper,57,19,55] {-} product(e_1,e_3,e_1)|product(e_1,e_3,e_2)|product(e_1,e_3,e_3)|product(e_1,e_3,e_4).
% 14.92/15.13 100 [hyper,57,2] {-} cycle(e_3,e_0)|cycle(e_3,e_1)|cycle(e_3,e_2)|cycle(e_3,e_3).
% 14.92/15.13 1309 [hyper,100,3,54,43,45,40,unit_del,8] {-} cycle(e_3,e_0)|cycle(e_3,e_1)|cycle(e_3,e_3).
% 14.92/15.13 1433 [hyper,1309,3,54,43,46,40,unit_del,10] {-} cycle(e_3,e_0)|cycle(e_3,e_1).
% 14.92/15.13 1434 [hyper,1433,4,87,54,43,51,46] {-} cycle(e_3,e_1)|cycle(e_2,e_0)|cycle(e_2,e_1)|cycle(e_2,e_2).
% 14.92/15.13 1672 [hyper,1434,3,87,42,46,41,unit_del,14,factor_simp,factor_simp,factor_simp] {-} cycle(e_2,e_0)|cycle(e_2,e_1)|cycle(e_2,e_2).
% 14.92/15.13 1673 [hyper,1434,4,1433,54,43,51,44,factor_simp] {-} cycle(e_3,e_1)|cycle(e_2,e_0)|cycle(e_2,e_2).
% 14.92/15.13 1771 [hyper,1673,3,1672,42,44,41,unit_del,8,factor_simp,factor_simp] {+} cycle(e_2,e_0)|cycle(e_2,e_2).
% 14.92/15.13 4611 [hyper,85,21,59,unit_del,8] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 14.92/15.13 4617 [hyper,4611,22,59,unit_del,8] {-} product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 14.92/15.13 4786 [hyper,86,22,59,unit_del,8] {-} product(e_2,e_1,e_2)|product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 14.92/15.13 4799 [hyper,4786,21,59,unit_del,8] {-} product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 14.92/15.13 4809 [hyper,4799,5,1771,52] {-} product(e_2,e_1,e_3)|cycle(e_2,e_2).
% 14.92/15.13 5008 [hyper,4809,6,4799,45,42,unit_del,18,factor_simp] {-} product(e_2,e_1,e_3).
% 14.92/15.13 5441 [hyper,96,21,59,unit_del,14] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_3)|product(e_2,e_3,e_4).
% 14.92/15.13 5449 [hyper,5441,22,59,unit_del,14] {-} product(e_2,e_3,e_1)|product(e_2,e_3,e_4).
% 14.92/15.13 5451 [hyper,5449,23,4617] {-} product(e_2,e_3,e_4)|product(e_3,e_2,e_3)|product(e_1,e_2,e_4).
% 14.92/15.13 5517 [hyper,5451,22,4617,unit_del,10,factor_simp] {-} product(e_2,e_3,e_4)|product(e_1,e_2,e_4).
% 14.92/15.13 5524 [hyper,97,21,59,unit_del,10] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_3)|product(e_1,e_3,e_4).
% 14.92/15.13 5609 [hyper,5524,22,59,unit_del,10] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_4).
% 14.92/15.13 5621 [hyper,5609,23,5008] {-} product(e_1,e_3,e_4)|product(e_3,e_1,e_3).
% 14.92/15.13 5710 [hyper,5621,22,5008,unit_del,14] {-} product(e_1,e_3,e_4).
% 14.92/15.13 5718 [hyper,5710,22,5517,unit_del,8] {-} product(e_1,e_2,e_4).
% 14.92/15.13 5770 [hyper,5718,21,5710] {-} equalish(e_3,e_2).
% 14.92/15.13 5772 [binary,5770.1,14.1] {-} $F.
% 14.92/15.13
% 14.92/15.13 % SZS output end Refutation
% 14.92/15.13 ------------ end of proof -------------
% 14.92/15.13
% 14.92/15.13
% 14.92/15.13 Search stopped by max_proofs option.
% 14.92/15.13
% 14.92/15.13
% 14.92/15.13 Search stopped by max_proofs option.
% 14.92/15.13
% 14.92/15.13 ============ end of search ============
% 14.92/15.13
% 14.92/15.13 ----------- soft-scott stats ----------
% 14.92/15.13
% 14.92/15.13 true clauses given 55 (29.7%)
% 14.92/15.13 false clauses given 130
% 14.92/15.13
% 14.92/15.13 FALSE TRUE
% 14.92/15.13 4 3 0
% 14.92/15.13 9 0 29
% 14.92/15.13 10 0 16
% 14.92/15.13 11 0 126
% 14.92/15.13 12 2 128
% 14.92/15.13 13 0 52
% 14.92/15.13 14 0 88
% 14.92/15.13 15 23 817
% 14.92/15.13 16 9 162
% 14.92/15.13 17 10 346
% 14.92/15.13 18 0 403
% 14.92/15.13 19 16 202
% 14.92/15.13 tot: 63 2369 (97.4% true)
% 14.92/15.13
% 14.92/15.13
% 14.92/15.13 Model 16 [ 10 -183 3394 ] (0.00 seconds, 250000 Inserts)
% 14.92/15.13
% 14.92/15.13 That finishes the proof of the theorem.
% 14.92/15.13
% 14.92/15.13 Process 10219 finished Mon Jun 13 14:41:33 2022
%------------------------------------------------------------------------------