%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP130-2.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:47 EDT 2022
% Result : Unsatisfiable 124.53s 124.77s
% Output : Refutation 124.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP130-2.003 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 : Mon Jun 13 06:18:17 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 n027.cluster.edu,
% 0.12/0.36 Mon Jun 13 06:18:17 2022
% 0.12/0.36 The command was "./sos". The process ID is 7509.
% 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 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 Following clause subsumed by 3 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.12/0.36 Following clause subsumed by 5 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.12/0.36 Following clause subsumed by 7 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 14
% 0.12/0.38 number of clauses initially in problem: 22
% 0.12/0.38 percentage of clauses intially in UL: 63
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 8
% 0.12/0.38 distinct predicate count: 5
% 0.12/0.38 distinct function count: 0
% 0.12/0.38 distinct constant count: 3
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 124.53/124.76
% 124.53/124.76 -- HEY sandbox, WE HAVE A PROOF!! --
% 124.53/124.76
% 124.53/124.76 Model 2 (0.00 seconds, 0 Inserts)
% 124.53/124.76
% 124.53/124.76 Stopped by limit on number of solutions
% 124.53/124.76
% 124.53/124.76 Stopped by limit on insertions
% 124.53/124.76
% 124.53/124.76 Model 3 [ 1 1 292 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.76
% 124.53/124.76 Stopped by limit on insertions
% 124.53/124.76
% 124.53/124.76 Model 4 [ 2 0 235 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.76
% 124.53/124.76 Stopped by limit on insertions
% 124.53/124.76
% 124.53/124.76 Model 5 [ 2 0 245 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.76
% 124.53/124.76 Stopped by limit on insertions
% 124.53/124.76
% 124.53/124.76 Model 6 [ 2 0 223 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.76
% 124.53/124.76 Stopped by limit on insertions
% 124.53/124.76
% 124.53/124.76 Model 7 [ 2 0 2147 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.76
% 124.53/124.76 Stopped by limit on insertions
% 124.53/124.76
% 124.53/124.76 Model 8 [ 2 0 191 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.76
% 124.53/124.76 Stopped by limit on insertions
% 124.53/124.76
% 124.53/124.76 Model 9 [ 2 1 2533 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.76
% 124.53/124.76 Stopped by limit on insertions
% 124.53/124.76
% 124.53/124.76 Model 10 [ 5 0 297 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.76
% 124.53/124.76 Stopped by limit on insertions
% 124.53/124.76
% 124.53/124.76 Model 11 [ 3 0 10641 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.76
% 124.53/124.76 Stopped by limit on insertions
% 124.53/124.76
% 124.53/124.76 Model 12 [ 5 0 207 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.76
% 124.53/124.76 Stopped by limit on insertions
% 124.53/124.77
% 124.53/124.77 Model 13 [ 4 3 100342 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.77
% 124.53/124.77 Stopped by limit on insertions
% 124.53/124.77
% 124.53/124.77 Model 14 [ 3 3 95478 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.77
% 124.53/124.77 Stopped by limit on insertions
% 124.53/124.77
% 124.53/124.77 Model 15 [ 7 1 178 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.77
% 124.53/124.77 Stopped by limit on insertions
% 124.53/124.77
% 124.53/124.77 Model 16 [ 7 0 187 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.77
% 124.53/124.77 Stopped by limit on insertions
% 124.53/124.77
% 124.53/124.77 Model 17 [ 4 0 307 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.77
% 124.53/124.77 Stopped by limit on insertions
% 124.53/124.77
% 124.53/124.77 Model 18 [ 5 0 520 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.77
% 124.53/124.77 Stopped by limit on insertions
% 124.53/124.77
% 124.53/124.77 Model 19 [ 7 0 519 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.77
% 124.53/124.77 Stopped by limit on insertions
% 124.53/124.77
% 124.53/124.77 Model 20 [ 6 0 205 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.77
% 124.53/124.77 Stopped by limit on insertions
% 124.53/124.77
% 124.53/124.77 Model 21 [ 5 5 171525 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.77
% 124.53/124.77 Stopped by limit on insertions
% 124.53/124.77
% 124.53/124.77 Model 22 [ 5 1 607 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.77
% 124.53/124.77 Stopped by limit on insertions
% 124.53/124.77
% 124.53/124.77 Model 23 [ 6 1 390 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.77
% 124.53/124.77 ----> UNIT CONFLICT at 124.31 sec ----> 4589 [binary,4587.1,3.1] {-} $F.
% 124.53/124.77
% 124.53/124.77 Length of proof is 27. Level of proof is 12.
% 124.53/124.77
% 124.53/124.77 ---------------- PROOF ----------------
% 124.53/124.77 % SZS status Unsatisfiable
% 124.53/124.77 % SZS output start Refutation
% 124.53/124.77
% 124.53/124.77 1 [] {+} -product(A,e_1,B)| -next(A,C)| -greater(B,C).
% 124.53/124.77 2 [] {-} -equalish(e_1,e_2).
% 124.53/124.77 3 [copy,2,flip.1] {+} -equalish(e_2,e_1).
% 124.53/124.77 4 [] {-} -equalish(e_1,e_3).
% 124.53/124.77 5 [copy,4,flip.1] {+} -equalish(e_3,e_1).
% 124.53/124.77 6 [] {-} -equalish(e_2,e_3).
% 124.53/124.77 7 [copy,6,flip.1] {+} -equalish(e_3,e_2).
% 124.53/124.77 8 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3).
% 124.53/124.77 9 [] {+} -product(A,B,C)| -product(A,B,D)|equalish(C,D).
% 124.53/124.77 10 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 124.53/124.77 11 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 124.53/124.77 12 [] {+} -product(A,B,C)| -product(A,C,D)|product(D,B,A).
% 124.53/124.77 13 [factor,8.1.2] {+} -group_element(A)|product(A,A,e_1)|product(A,A,e_2)|product(A,A,e_3).
% 124.53/124.77 17 [factor,12.1.2] {+} -product(A,B,B)|product(B,B,A).
% 124.53/124.77 18 [] {+} next(e_1,e_2).
% 124.53/124.77 22 [] {+} greater(e_3,e_2).
% 124.53/124.77 23 [] {+} group_element(e_1).
% 124.53/124.77 24 [] {+} group_element(e_2).
% 124.53/124.77 25 [] {+} group_element(e_3).
% 124.53/124.77 32 [hyper,23,13] {-} product(e_1,e_1,e_1)|product(e_1,e_1,e_2)|product(e_1,e_1,e_3).
% 124.53/124.77 37 [hyper,24,8,23] {-} product(e_1,e_2,e_1)|product(e_1,e_2,e_2)|product(e_1,e_2,e_3).
% 124.53/124.77 44 [hyper,25,8,23] {-} product(e_1,e_3,e_1)|product(e_1,e_3,e_2)|product(e_1,e_3,e_3).
% 124.53/124.77 45 [hyper,25,8,24] {-} product(e_3,e_2,e_1)|product(e_3,e_2,e_2)|product(e_3,e_2,e_3).
% 124.53/124.77 46 [hyper,25,8,23] {-} product(e_3,e_1,e_1)|product(e_3,e_1,e_2)|product(e_3,e_1,e_3).
% 124.53/124.77 357 [hyper,32,1,18,22] {+} product(e_1,e_1,e_1)|product(e_1,e_1,e_2).
% 124.53/124.77 630 [hyper,37,10,357,unit_del,3] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_1,e_2).
% 124.53/124.77 637 [hyper,37,17] {-} product(e_1,e_2,e_1)|product(e_1,e_2,e_3)|product(e_2,e_2,e_1).
% 124.53/124.77 1158 [hyper,44,10,357,unit_del,5] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_3)|product(e_1,e_1,e_2).
% 124.53/124.77 1320 [hyper,45,17] {-} product(e_3,e_2,e_1)|product(e_3,e_2,e_3)|product(e_2,e_2,e_3).
% 124.53/124.77 1447 [hyper,46,17] {-} product(e_3,e_1,e_2)|product(e_3,e_1,e_3)|product(e_1,e_1,e_3).
% 124.53/124.77 1813 [hyper,630,17] {-} product(e_1,e_2,e_3)|product(e_1,e_1,e_2)|product(e_2,e_2,e_1).
% 124.53/124.77 2494 [hyper,1158,12,44,factor_simp,factor_simp] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_3)|product(e_2,e_3,e_1).
% 124.53/124.77 3325 [hyper,1447,1,18,22] {-} product(e_3,e_1,e_2)|product(e_3,e_1,e_3).
% 124.53/124.77 3565 [hyper,1813,12,637,factor_simp,factor_simp,factor_simp] {-} product(e_1,e_2,e_3)|product(e_2,e_2,e_1).
% 124.53/124.77 4156 [hyper,2494,11,44,unit_del,3,factor_simp,factor_simp] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_3).
% 124.53/124.77 4178 [hyper,4156,12,3565,factor_simp] {-} product(e_1,e_3,e_3)|product(e_2,e_2,e_1).
% 124.53/124.77 4238 [hyper,4178,10,3565,unit_del,7,factor_simp] {+} product(e_2,e_2,e_1).
% 124.53/124.77 4312 [hyper,4238,11,1320,unit_del,7] {+} product(e_3,e_2,e_3)|product(e_2,e_2,e_3).
% 124.53/124.77 4538 [hyper,4312,9,4238,unit_del,5] {+} product(e_3,e_2,e_3).
% 124.53/124.77 4561 [hyper,4538,12,3325,factor_simp] {+} product(e_3,e_1,e_3).
% 124.53/124.77 4587 [hyper,4561,10,4538] {-} equalish(e_2,e_1).
% 124.53/124.77 4589 [binary,4587.1,3.1] {-} $F.
% 124.53/124.77
% 124.53/124.77 % SZS output end Refutation
% 124.53/124.77 ------------ end of proof -------------
% 124.53/124.77
% 124.53/124.77
% 124.53/124.77 Search stopped by max_proofs option.
% 124.53/124.77
% 124.53/124.77
% 124.53/124.77 Search stopped by max_proofs option.
% 124.53/124.77
% 124.53/124.77 ============ end of search ============
% 124.53/124.77
% 124.53/124.77 ----------- soft-scott stats ----------
% 124.53/124.77
% 124.53/124.77 true clauses given 43 (25.3%)
% 124.53/124.77 false clauses given 127
% 124.53/124.77
% 124.53/124.77 FALSE TRUE
% 124.53/124.77 4 2 1
% 124.53/124.77 8 8 2
% 124.53/124.77 11 1 15
% 124.53/124.77 12 19 20
% 124.53/124.77 14 32 68
% 124.53/124.77 15 144 253
% 124.53/124.77 16 36 67
% 124.53/124.77 18 18 146
% 124.53/124.77 19 78 54
% 124.53/124.77 20 54 39
% 124.53/124.77 22 0 96
% 124.53/124.77 26 0 9
% 124.53/124.77 tot: 392 770 (66.3% true)
% 124.53/124.77
% 124.53/124.77
% 124.53/124.77 Model 23 [ 6 1 390 ] (0.00 seconds, 250000 Inserts)
% 124.53/124.77
% 124.53/124.77 That finishes the proof of the theorem.
% 124.53/124.77
% 124.53/124.77 Process 7509 finished Mon Jun 13 06:20:21 2022
%------------------------------------------------------------------------------