TSTP Solution File: SET853-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET853-2 : TPTP v8.1.0. Released v3.2.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 : Tue Jul 19 05:21:18 EDT 2022
% Result : Unsatisfiable 33.33s 33.56s
% Output : Refutation 33.33s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET853-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % 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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 9 17:57:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.35 ----- Otter 3.2, August 2001 -----
% 0.18/0.35 The process was started by sandbox2 on n005.cluster.edu,
% 0.18/0.35 Sat Jul 9 17:57:52 2022
% 0.18/0.35 The command was "./sos". The process ID is 29432.
% 0.18/0.35
% 0.18/0.35 set(prolog_style_variables).
% 0.18/0.35 set(auto).
% 0.18/0.35 dependent: set(auto1).
% 0.18/0.35 dependent: set(process_input).
% 0.18/0.35 dependent: clear(print_kept).
% 0.18/0.35 dependent: clear(print_new_demod).
% 0.18/0.35 dependent: clear(print_back_demod).
% 0.18/0.35 dependent: clear(print_back_sub).
% 0.18/0.35 dependent: set(control_memory).
% 0.18/0.35 dependent: assign(max_mem, 12000).
% 0.18/0.35 dependent: assign(pick_given_ratio, 4).
% 0.18/0.35 dependent: assign(stats_level, 1).
% 0.18/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35 dependent: assign(sos_limit, 5000).
% 0.18/0.35 dependent: assign(max_weight, 60).
% 0.18/0.35 clear(print_given).
% 0.18/0.35
% 0.18/0.35 list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.18/0.35
% 0.18/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.18/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.35 clauses in usable.
% 0.18/0.35
% 0.18/0.35 dependent: set(knuth_bendix).
% 0.18/0.35 dependent: set(para_from).
% 0.18/0.35 dependent: set(para_into).
% 0.18/0.35 dependent: clear(para_from_right).
% 0.18/0.35 dependent: clear(para_into_right).
% 0.18/0.35 dependent: set(para_from_vars).
% 0.18/0.35 dependent: set(eq_units_both_ways).
% 0.18/0.35 dependent: set(dynamic_demod_all).
% 0.18/0.35 dependent: set(dynamic_demod).
% 0.18/0.35 dependent: set(order_eq).
% 0.18/0.35 dependent: set(back_demod).
% 0.18/0.35 dependent: set(lrpo).
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: set(unit_deletion).
% 0.18/0.35 dependent: set(factor).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35 20 back subsumes 16.
% 0.18/0.35 20 back subsumes 15.
% 0.18/0.35 20 back subsumes 13.
% 0.18/0.35 20 back subsumes 12.
% 0.18/0.35 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} A=A.
% 0.18/0.35 21 back subsumes 11.
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.18/0.38
% 0.18/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 10
% 0.18/0.38 number of clauses initially in problem: 15
% 0.18/0.38 percentage of clauses intially in UL: 66
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.38 percent of all initial clauses that are short: 100
% 0.18/0.38 absolute distinct symbol count: 11
% 0.18/0.38 distinct predicate count: 3
% 0.18/0.38 distinct function count: 4
% 0.18/0.38 distinct constant count: 4
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 2.05/2.25
% 2.05/2.25
% 2.05/2.25 Changing weight limit from 60 to 58.
% 2.05/2.25
% 2.05/2.25 Model 2 (0.00 seconds, 0 Inserts)
% 2.05/2.25
% 2.05/2.25 Stopped by limit on number of solutions
% 2.05/2.25
% 2.05/2.25 Resetting weight limit to 58 after 160 givens.
% 2.05/2.25
% 2.22/2.45
% 2.22/2.45
% 2.22/2.45 Changing weight limit from 58 to 57.
% 2.22/2.45
% 2.22/2.45 Resetting weight limit to 57 after 165 givens.
% 2.22/2.45
% 2.52/2.77
% 2.52/2.77
% 2.52/2.77 Changing weight limit from 57 to 54.
% 2.52/2.77
% 2.52/2.77 Resetting weight limit to 54 after 170 givens.
% 2.52/2.77
% 2.65/2.88
% 2.65/2.88
% 2.65/2.88 Changing weight limit from 54 to 53.
% 2.65/2.88
% 2.65/2.88 Resetting weight limit to 53 after 175 givens.
% 2.65/2.88
% 2.82/3.06
% 2.82/3.06
% 2.82/3.06 Changing weight limit from 53 to 51.
% 2.82/3.06
% 2.82/3.06 Resetting weight limit to 51 after 180 givens.
% 2.82/3.06
% 2.95/3.21
% 2.95/3.21
% 2.95/3.21 Changing weight limit from 51 to 49.
% 2.95/3.21
% 2.95/3.21 Resetting weight limit to 49 after 185 givens.
% 2.95/3.21
% 3.22/3.40
% 3.22/3.40
% 3.22/3.40 Changing weight limit from 49 to 48.
% 3.22/3.40
% 3.22/3.40 Resetting weight limit to 48 after 190 givens.
% 3.22/3.40
% 3.65/3.87
% 3.65/3.87
% 3.65/3.87 Changing weight limit from 48 to 47.
% 3.65/3.87
% 3.65/3.87 Resetting weight limit to 47 after 205 givens.
% 3.65/3.87
% 4.45/4.69
% 4.45/4.69
% 4.45/4.69 Changing weight limit from 47 to 46.
% 4.45/4.69
% 4.45/4.69 Resetting weight limit to 46 after 230 givens.
% 4.45/4.69
% 7.56/7.76
% 7.56/7.76
% 7.56/7.76 Changing weight limit from 46 to 45.
% 7.56/7.76
% 7.56/7.76 Resetting weight limit to 45 after 355 givens.
% 7.56/7.76
% 10.66/10.90
% 10.66/10.90
% 10.66/10.90 Changing weight limit from 45 to 44.
% 10.66/10.90
% 10.66/10.90 Modelling stopped after 300 given clauses and 0.00 seconds
% 10.66/10.90
% 10.66/10.90
% 10.66/10.90 Resetting weight limit to 44 after 460 givens.
% 10.66/10.90
% 14.43/14.67
% 14.43/14.67
% 14.43/14.67 Changing weight limit from 44 to 43.
% 14.43/14.67
% 14.43/14.67 Resetting weight limit to 43 after 620 givens.
% 14.43/14.67
% 16.64/16.88
% 16.64/16.88
% 16.64/16.88 Changing weight limit from 43 to 42.
% 16.64/16.88
% 16.64/16.88 Resetting weight limit to 42 after 690 givens.
% 16.64/16.88
% 19.14/19.40
% 19.14/19.40
% 19.14/19.40 Changing weight limit from 42 to 41.
% 19.14/19.40
% 19.14/19.40 Resetting weight limit to 41 after 760 givens.
% 19.14/19.40
% 22.23/22.48
% 22.23/22.48
% 22.23/22.48 Changing weight limit from 41 to 40.
% 22.23/22.48
% 22.23/22.48 Resetting weight limit to 40 after 835 givens.
% 22.23/22.48
% 22.92/23.17
% 22.92/23.17
% 22.92/23.17 Changing weight limit from 40 to 39.
% 22.92/23.17
% 22.92/23.17 Resetting weight limit to 39 after 855 givens.
% 22.92/23.17
% 23.13/23.33
% 23.13/23.33
% 23.13/23.33 Changing weight limit from 39 to 38.
% 23.13/23.33
% 23.13/23.33 Resetting weight limit to 38 after 860 givens.
% 23.13/23.33
% 23.65/23.90
% 23.65/23.90
% 23.65/23.90 Changing weight limit from 38 to 37.
% 23.65/23.90
% 23.65/23.90 Resetting weight limit to 37 after 890 givens.
% 23.65/23.90
% 23.96/24.18
% 23.96/24.18
% 23.96/24.18 Changing weight limit from 37 to 36.
% 23.96/24.18
% 23.96/24.18 Resetting weight limit to 36 after 920 givens.
% 23.96/24.18
% 24.26/24.44
% 24.26/24.44
% 24.26/24.44 Changing weight limit from 36 to 35.
% 24.26/24.44
% 24.26/24.44 Resetting weight limit to 35 after 950 givens.
% 24.26/24.44
% 33.33/33.56
% 33.33/33.56 -- HEY sandbox2, WE HAVE A PROOF!! --
% 33.33/33.56
% 33.33/33.56 ----> UNIT CONFLICT at 33.17 sec ----> 22600 [binary,22599.1,3.1] {-} $F.
% 33.33/33.56
% 33.33/33.56 Length of proof is 20. Level of proof is 13.
% 33.33/33.56
% 33.33/33.56 ---------------- PROOF ----------------
% 33.33/33.56 % SZS status Unsatisfiable
% 33.33/33.56 % SZS output start Refutation
% 33.33/33.56
% 33.33/33.56 1 [] {-} v_xa!=c_Zorn_Osucc(v_S,v_x,t_a).
% 33.33/33.56 2 [copy,1,flip.1] {+} c_Zorn_Osucc(v_S,v_x,t_a)!=v_xa.
% 33.33/33.56 3 [] {+} -c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))).
% 33.33/33.56 4 [] {+} c_lessequals(c_Zorn_Osucc(v_S,A,t_a),v_x,tc_set(tc_set(t_a)))|A=v_x| -c_lessequals(A,v_x,tc_set(tc_set(t_a)))| -c_in(A,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 33.33/33.56 5 [] {+} -c_lessequals(A,B,tc_set(C))| -c_lessequals(B,A,tc_set(C))|B=A.
% 33.33/33.56 6 [] {+} -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))|c_in(c_Zorn_OTFin__linear__lemma1__1(B,A,C),c_Zorn_OTFin(B,C),tc_set(tc_set(C)))|c_lessequals(D,A,tc_set(tc_set(C)))|c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))).
% 33.33/33.56 7 [] {+} -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))|c_lessequals(D,A,tc_set(tc_set(C)))|c_lessequals(c_Zorn_OTFin__linear__lemma1__1(B,A,C),A,tc_set(tc_set(C)))|c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))).
% 33.33/33.56 8 [] {+} -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))|c_Zorn_OTFin__linear__lemma1__1(B,A,C)!=A|c_lessequals(D,A,tc_set(tc_set(C)))|c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))).
% 33.33/33.56 9 [] {+} -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_lessequals(c_Zorn_Osucc(B,c_Zorn_OTFin__linear__lemma1__1(B,A,C),C),A,tc_set(tc_set(C)))|c_lessequals(D,A,tc_set(tc_set(C)))|c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))).
% 33.33/33.56 10 [] {+} -c_lessequals(A,B,tc_set(tc_set(C)))|c_lessequals(A,c_Zorn_Osucc(D,B,C),tc_set(tc_set(C))).
% 33.33/33.56 17 [] {-} c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 33.33/33.56 18 [] {+} c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 33.33/33.56 19 [] {-} c_lessequals(v_xa,c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))).
% 33.33/33.56 20 [] {+} c_lessequals(A,A,tc_set(B)).
% 33.33/33.56 73 [hyper,18,7,17] {+} c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_xa,tc_set(tc_set(t_a))).
% 33.33/33.56 75 [hyper,18,6,17] {+} c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))|c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_xa,tc_set(tc_set(t_a))).
% 33.33/33.56 3986 [hyper,73,5,19,unit_del,2] {+} c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a))).
% 33.33/33.56 4024 [hyper,3986,4,18] {+} c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),v_x,tc_set(tc_set(t_a)))|v_xa=v_x.
% 33.33/33.56 4299 [hyper,75,5,19,unit_del,2] {-} c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))|c_lessequals(v_xa,v_x,tc_set(tc_set(t_a))).
% 33.33/33.56 4302 [hyper,4299,4,18] {-} c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),v_x,tc_set(tc_set(t_a)))|v_xa=v_x.
% 33.33/33.56 4475 [para_from,4302.3.1,3.1.1.2,unit_del,20] {-} c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),v_x,tc_set(tc_set(t_a))).
% 33.33/33.56 4546 [hyper,4475,10] {-} c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(A,v_x,t_a),tc_set(tc_set(t_a))).
% 33.33/33.56 4641 [hyper,4546,3] {-} c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 33.33/33.56 6602 [para_from,4024.3.1,3.1.1.2,unit_del,20] {+} c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),v_x,tc_set(tc_set(t_a))).
% 33.33/33.56 6664 [hyper,6602,10] {+} c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(A,v_x,t_a),tc_set(tc_set(t_a))).
% 33.33/33.56 7500 [hyper,6664,3] {+} c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a))).
% 33.33/33.56 7554 [hyper,7500,4,4641] {+} c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),t_a),v_x,tc_set(tc_set(t_a)))|c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a)=v_x.
% 33.33/33.56 7838 [hyper,7554,8,17,18] {+} c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),t_a),v_x,tc_set(tc_set(t_a)))|c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_xa,tc_set(tc_set(t_a))).
% 33.33/33.56 21956 [hyper,7838,9,17,18,factor_simp,factor_simp] {+} c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_xa,tc_set(tc_set(t_a))).
% 33.33/33.56 21987 [hyper,21956,5,19,unit_del,2] {-} c_lessequals(v_xa,v_x,tc_set(tc_set(t_a))).
% 33.33/33.56 22014 [hyper,21987,4,18] {-} c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),v_x,tc_set(tc_set(t_a)))|v_xa=v_x.
% 33.33/33.56 22596 [para_from,22014.2.1,3.1.1.2,unit_del,20] {-} c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),v_x,tc_set(tc_set(t_a))).
% 33.33/33.56 22599 [hyper,22596,10] {-} c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(A,v_x,t_a),tc_set(tc_set(t_a))).
% 33.33/33.56 22600 [binary,22599.1,3.1] {-} $F.
% 33.33/33.56
% 33.33/33.56 % SZS output end Refutation
% 33.33/33.56 ------------ end of proof -------------
% 33.33/33.56
% 33.33/33.56
% 33.33/33.56 Search stopped by max_proofs option.
% 33.33/33.56
% 33.33/33.56
% 33.33/33.56 Search stopped by max_proofs option.
% 33.33/33.56
% 33.33/33.56 ============ end of search ============
% 33.33/33.56
% 33.33/33.56 ----------- soft-scott stats ----------
% 33.33/33.56
% 33.33/33.56 true clauses given 718 (29.7%)
% 33.33/33.56 false clauses given 1697
% 33.33/33.56
% 33.33/33.56 FALSE TRUE
% 33.33/33.56 12 1 1
% 33.33/33.56 15 0 1
% 33.33/33.56 16 3 0
% 33.33/33.56 17 1 0
% 33.33/33.56 18 1 0
% 33.33/33.56 19 4 5
% 33.33/33.56 20 1 1
% 33.33/33.56 21 1 2
% 33.33/33.56 22 6 1
% 33.33/33.56 23 1 0
% 33.33/33.56 24 1 0
% 33.33/33.56 25 1 0
% 33.33/33.56 27 0 9
% 33.33/33.56 28 0 82
% 33.33/33.56 29 0 255
% 33.33/33.56 30 0 168
% 33.33/33.56 31 387 186
% 33.33/33.56 32 635 709
% 33.33/33.56 33 383 396
% 33.33/33.56 34 0 487
% 33.33/33.56 35 0 91
% 33.33/33.56 tot: 1426 2394 (62.7% true)
% 33.33/33.56
% 33.33/33.56
% 33.33/33.56 Model 2 (0.00 seconds, 0 Inserts)
% 33.33/33.56
% 33.33/33.56 That finishes the proof of the theorem.
% 33.33/33.56
% 33.33/33.56 Process 29432 finished Sat Jul 9 17:58:25 2022
%------------------------------------------------------------------------------