TSTP Solution File: GRP126-3.004 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP126-3.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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:38 EDT 2022
% Result : Unsatisfiable 33.91s 34.09s
% Output : Refutation 33.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP126-3.004 : TPTP v8.1.0. Released v1.2.0.
% 0.08/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 13:26:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n008.cluster.edu,
% 0.13/0.36 Mon Jun 13 13:26:07 2022
% 0.13/0.36 The command was "./sos". The process ID is 20240.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36 Following clause subsumed by 8 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.13/0.36 Following clause subsumed by 10 during input processing: 0 [] {-} -equalish(e_3,e_1).
% 0.13/0.36 Following clause subsumed by 14 during input processing: 0 [] {-} -equalish(e_3,e_2).
% 0.13/0.36 Following clause subsumed by 12 during input processing: 0 [] {-} -equalish(e_4,e_1).
% 0.13/0.36 Following clause subsumed by 16 during input processing: 0 [] {-} -equalish(e_4,e_2).
% 0.13/0.36 Following clause subsumed by 18 during input processing: 0 [] {-} -equalish(e_4,e_3).
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.36/0.59
% 0.36/0.59 Stopped by limit on insertions
% 0.36/0.59
% 0.36/0.59
% 0.36/0.59 Failed to model usable list: disabling FINDER
% 0.36/0.59
% 0.36/0.59
% 0.36/0.59
% 0.36/0.59 -------------- Softie stats --------------
% 0.36/0.59
% 0.36/0.59 UPDATE_STOP: 300
% 0.36/0.59 SFINDER_TIME_LIMIT: 2
% 0.36/0.59 SHORT_CLAUSE_CUTOFF: 4
% 0.36/0.59 number of clauses in intial UL: 34
% 0.36/0.59 number of clauses initially in problem: 54
% 0.36/0.59 percentage of clauses intially in UL: 62
% 0.36/0.59 percentage of distinct symbols occuring in initial UL: 100
% 0.36/0.59 percent of all initial clauses that are short: 100
% 0.36/0.59 absolute distinct symbol count: 11
% 0.36/0.59 distinct predicate count: 6
% 0.36/0.59 distinct function count: 0
% 0.36/0.59 distinct constant count: 5
% 0.36/0.59
% 0.36/0.59 ---------- no more Softie stats ----------
% 0.36/0.59
% 0.36/0.59
% 0.36/0.59
% 0.36/0.59 =========== start of search ===========
% 9.94/10.15
% 9.94/10.15
% 9.94/10.15 Changing weight limit from 60 to 28.
% 9.94/10.15
% 9.94/10.15 Resetting weight limit to 28 after 165 givens.
% 9.94/10.15
% 11.70/11.88
% 11.70/11.88
% 11.70/11.88 Changing weight limit from 28 to 25.
% 11.70/11.88
% 11.70/11.88 Resetting weight limit to 25 after 170 givens.
% 11.70/11.88
% 12.73/12.91
% 12.73/12.91
% 12.73/12.91 Changing weight limit from 25 to 24.
% 12.73/12.91
% 12.73/12.91 Resetting weight limit to 24 after 175 givens.
% 12.73/12.91
% 13.12/13.37
% 13.12/13.37
% 13.12/13.37 Changing weight limit from 24 to 23.
% 13.12/13.37
% 13.12/13.37 Resetting weight limit to 23 after 180 givens.
% 13.12/13.37
% 14.70/14.92
% 14.70/14.92
% 14.70/14.92 Changing weight limit from 23 to 22.
% 14.70/14.92
% 14.70/14.92 Resetting weight limit to 22 after 195 givens.
% 14.70/14.92
% 16.63/16.82
% 16.63/16.82
% 16.63/16.82 Changing weight limit from 22 to 21.
% 16.63/16.82
% 16.63/16.82 Resetting weight limit to 21 after 210 givens.
% 16.63/16.82
% 17.85/18.04
% 17.85/18.04
% 17.85/18.04 Changing weight limit from 21 to 20.
% 17.85/18.04
% 17.85/18.04 Resetting weight limit to 20 after 230 givens.
% 17.85/18.04
% 19.55/19.76
% 19.55/19.76
% 19.55/19.76 Changing weight limit from 20 to 19.
% 19.55/19.76
% 19.55/19.76 Resetting weight limit to 19 after 260 givens.
% 19.55/19.76
% 21.60/21.81
% 21.60/21.81
% 21.60/21.81 Changing weight limit from 19 to 18.
% 21.60/21.81
% 21.60/21.81 Resetting weight limit to 18 after 295 givens.
% 21.60/21.81
% 27.81/27.99
% 27.81/27.99
% 27.81/27.99 Changing weight limit from 18 to 17.
% 27.81/27.99
% 27.81/27.99 Modelling stopped after 300 given clauses and 0.00 seconds
% 27.81/27.99
% 27.81/27.99
% 27.81/27.99 Resetting weight limit to 17 after 530 givens.
% 27.81/27.99
% 33.91/34.09
% 33.91/34.09 -- HEY sandbox2, WE HAVE A PROOF!! --
% 33.91/34.09
% 33.91/34.09 ----> UNIT CONFLICT at 33.69 sec ----> 11719 [binary,11717.1,18.1] {-} $F.
% 33.91/34.09
% 33.91/34.09 Length of proof is 40. Level of proof is 12.
% 33.91/34.09
% 33.91/34.09 ---------------- PROOF ----------------
% 33.91/34.09 % SZS status Unsatisfiable
% 33.91/34.09 % SZS output start Refutation
% 33.91/34.09
% 33.91/34.09 2 [] {+} -group_element(A)|cycle(A,e_0)|cycle(A,e_1)|cycle(A,e_2)|cycle(A,e_3).
% 33.91/34.09 3 [] {+} -cycle(A,B)| -cycle(C,D)| -next(A,C)| -greater(B,e_0)| -next(D,E)|equalish(B,E).
% 33.91/34.09 4 [] {+} -cycle(A,B)| -cycle(C,e_0)| -cycle(D,E)| -next(C,D)| -greater(C,A)| -greater(B,E).
% 33.91/34.09 5 [] {+} -cycle(A,e_0)| -product(A,e_1,B)| -greater(B,A).
% 33.91/34.09 6 [] {+} -cycle(A,B)| -product(A,e_1,C)| -greater(B,e_0)| -next(A,D)|equalish(C,D).
% 33.91/34.09 7 [] {-} -equalish(e_1,e_2).
% 33.91/34.09 8 [copy,7,flip.1] {+} -equalish(e_2,e_1).
% 33.91/34.09 9 [] {-} -equalish(e_1,e_3).
% 33.91/34.09 10 [copy,9,flip.1] {+} -equalish(e_3,e_1).
% 33.91/34.09 13 [] {-} -equalish(e_2,e_3).
% 33.91/34.09 14 [copy,13,flip.1] {+} -equalish(e_3,e_2).
% 33.91/34.09 15 [] {-} -equalish(e_2,e_4).
% 33.91/34.09 16 [copy,15,flip.1] {+} -equalish(e_4,e_2).
% 33.91/34.09 17 [] {-} -equalish(e_3,e_4).
% 33.91/34.09 18 [copy,17,flip.1] {+} -equalish(e_4,e_3).
% 33.91/34.09 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).
% 33.91/34.09 20 [] {+} -product(A,B,C)| -product(A,B,D)|equalish(C,D).
% 33.91/34.09 21 [] {+} -product(A,B,C)| -product(A,D,C)|equalish(B,D).
% 33.91/34.09 22 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 33.91/34.09 23 [] {+} -product(A,B,C)| -product(B,A,D)|product(C,D,B).
% 33.91/34.09 41 [] {-} next(e_0,e_1).
% 33.91/34.09 42 [] {-} next(e_1,e_2).
% 33.91/34.09 43 [] {-} next(e_2,e_3).
% 33.91/34.09 44 [] {-} next(e_3,e_4).
% 33.91/34.09 45 [] {-} greater(e_1,e_0).
% 33.91/34.09 46 [] {-} greater(e_2,e_0).
% 33.91/34.09 47 [] {-} greater(e_3,e_0).
% 33.91/34.09 52 [] {-} greater(e_3,e_2).
% 33.91/34.09 53 [] {-} greater(e_4,e_2).
% 33.91/34.09 55 [] {-} cycle(e_4,e_0).
% 33.91/34.09 56 [] {-} group_element(e_1).
% 33.91/34.09 57 [] {-} group_element(e_2).
% 33.91/34.09 58 [] {-} group_element(e_3).
% 33.91/34.09 60 [] {-} product(A,A,A).
% 33.91/34.09 86 [hyper,57,19,56] {-} 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).
% 33.91/34.09 87 [hyper,57,19,56] {-} 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).
% 33.91/34.09 88 [hyper,57,2] {-} cycle(e_2,e_0)|cycle(e_2,e_1)|cycle(e_2,e_2)|cycle(e_2,e_3).
% 33.91/34.09 98 [hyper,58,19,56] {-} 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).
% 33.91/34.09 99 [hyper,58,19,57] {-} product(e_3,e_2,e_1)|product(e_3,e_2,e_2)|product(e_3,e_2,e_3)|product(e_3,e_2,e_4).
% 33.91/34.09 100 [hyper,58,19,56] {-} product(e_3,e_1,e_1)|product(e_3,e_1,e_2)|product(e_3,e_1,e_3)|product(e_3,e_1,e_4).
% 33.91/34.09 101 [hyper,58,2] {-} cycle(e_3,e_0)|cycle(e_3,e_1)|cycle(e_3,e_2)|cycle(e_3,e_3).
% 33.91/34.09 4187 [hyper,86,21,60,unit_del,8] {-} product(e_1,e_2,e_2)|product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 33.91/34.09 4313 [hyper,87,22,60,unit_del,8] {-} product(e_2,e_1,e_2)|product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 33.91/34.09 5170 [hyper,98,21,60,unit_del,10] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_3)|product(e_1,e_3,e_4).
% 33.91/34.09 5298 [hyper,99,22,60,unit_del,14] {-} product(e_3,e_2,e_1)|product(e_3,e_2,e_3)|product(e_3,e_2,e_4).
% 33.91/34.09 5409 [hyper,100,22,60,unit_del,10] {-} product(e_3,e_1,e_2)|product(e_3,e_1,e_3)|product(e_3,e_1,e_4).
% 33.91/34.09 5558 [hyper,101,3,55,44,46,41,unit_del,8] {-} cycle(e_3,e_0)|cycle(e_3,e_1)|cycle(e_3,e_3).
% 33.91/34.09 5574 [hyper,5558,3,55,44,47,41,unit_del,10] {-} cycle(e_3,e_0)|cycle(e_3,e_1).
% 33.91/34.09 5575 [hyper,5574,4,88,55,44,52,47] {-} cycle(e_3,e_1)|cycle(e_2,e_0)|cycle(e_2,e_1)|cycle(e_2,e_2).
% 33.91/34.09 9947 [hyper,4187,22,60,unit_del,8] {-} product(e_1,e_2,e_3)|product(e_1,e_2,e_4).
% 33.91/34.09 10074 [hyper,4313,21,60,unit_del,8] {-} product(e_2,e_1,e_3)|product(e_2,e_1,e_4).
% 33.91/34.09 10412 [hyper,5170,22,60,unit_del,10] {-} product(e_1,e_3,e_2)|product(e_1,e_3,e_4).
% 33.91/34.09 10450 [hyper,10412,21,9947,unit_del,14] {-} product(e_1,e_3,e_2)|product(e_1,e_2,e_3).
% 33.91/34.09 10656 [hyper,5298,21,60,unit_del,14] {-} product(e_3,e_2,e_1)|product(e_3,e_2,e_4).
% 33.91/34.09 10860 [hyper,5409,21,60,unit_del,10] {-} product(e_3,e_1,e_2)|product(e_3,e_1,e_4).
% 33.91/34.09 10927 [hyper,10860,21,10656,unit_del,8] {-} product(e_3,e_1,e_2)|product(e_3,e_2,e_1).
% 33.91/34.09 11238 [hyper,5575,3,88,43,47,42,unit_del,14,factor_simp,factor_simp,factor_simp] {-} cycle(e_2,e_0)|cycle(e_2,e_1)|cycle(e_2,e_2).
% 33.91/34.09 11246 [hyper,5575,4,5574,55,44,52,45,factor_simp] {-} cycle(e_3,e_1)|cycle(e_2,e_0)|cycle(e_2,e_2).
% 33.91/34.09 11336 [hyper,11246,3,11238,43,45,42,unit_del,8,factor_simp,factor_simp] {-} cycle(e_2,e_0)|cycle(e_2,e_2).
% 33.91/34.09 11356 [hyper,11246,4,5574,55,44,52,46,factor_simp] {-} cycle(e_3,e_1)|cycle(e_2,e_0).
% 33.91/34.09 11359 [hyper,11336,5,10074,53] {-} cycle(e_2,e_2)|product(e_2,e_1,e_3).
% 33.91/34.09 11506 [hyper,11359,6,10074,46,43,unit_del,18,factor_simp] {-} product(e_2,e_1,e_3).
% 33.91/34.09 11508 [hyper,11506,23,10450] {-} product(e_3,e_3,e_2)|product(e_1,e_3,e_2).
% 33.91/34.09 11515 [hyper,11506,5,11356,52] {-} cycle(e_3,e_1).
% 33.91/34.09 11573 [hyper,11515,6,10927,45,44,unit_del,16] {-} product(e_3,e_2,e_1).
% 33.91/34.09 11574 [hyper,11515,6,10860,45,44,unit_del,16] {-} product(e_3,e_1,e_4).
% 33.91/34.09 11680 [hyper,11508,20,60,unit_del,14] {-} product(e_1,e_3,e_2).
% 33.91/34.09 11683 [hyper,11680,23,11574] {-} product(e_4,e_2,e_1).
% 33.91/34.09 11717 [hyper,11683,22,11573,flip.1] {-} equalish(e_4,e_3).
% 33.91/34.09 11719 [binary,11717.1,18.1] {-} $F.
% 33.91/34.09
% 33.91/34.09 % SZS output end Refutation
% 33.91/34.09 ------------ end of proof -------------
% 33.91/34.09
% 33.91/34.09
% 33.91/34.09 Search stopped by max_proofs option.
% 33.91/34.09
% 33.91/34.09
% 33.91/34.09 Search stopped by max_proofs option.
% 33.91/34.09
% 33.91/34.09 ============ end of search ============
% 33.91/34.09
% 33.91/34.09 That finishes the proof of the theorem.
% 33.91/34.09
% 33.91/34.09 Process 20240 finished Mon Jun 13 13:26:41 2022
%------------------------------------------------------------------------------