TSTP Solution File: SEU119+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU119+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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 14:26:53 EDT 2022
% Result : Theorem 5.04s 5.22s
% Output : Refutation 5.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU119+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n025.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 : Sun Jun 19 00:07:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.34 ----- Otter 3.2, August 2001 -----
% 0.19/0.34 The process was started by sandbox on n025.cluster.edu,
% 0.19/0.34 Sun Jun 19 00:07:13 2022
% 0.19/0.34 The command was "./sos". The process ID is 14839.
% 0.19/0.34
% 0.19/0.34 set(prolog_style_variables).
% 0.19/0.34 set(auto).
% 0.19/0.34 dependent: set(auto1).
% 0.19/0.34 dependent: set(process_input).
% 0.19/0.34 dependent: clear(print_kept).
% 0.19/0.34 dependent: clear(print_new_demod).
% 0.19/0.34 dependent: clear(print_back_demod).
% 0.19/0.34 dependent: clear(print_back_sub).
% 0.19/0.34 dependent: set(control_memory).
% 0.19/0.34 dependent: assign(max_mem, 12000).
% 0.19/0.34 dependent: assign(pick_given_ratio, 4).
% 0.19/0.34 dependent: assign(stats_level, 1).
% 0.19/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.34 dependent: assign(sos_limit, 5000).
% 0.19/0.34 dependent: assign(max_weight, 60).
% 0.19/0.34 clear(print_given).
% 0.19/0.34
% 0.19/0.34 formula_list(usable).
% 0.19/0.34
% 0.19/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.19/0.34
% 0.19/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.34 clauses in usable.
% 0.19/0.34
% 0.19/0.34 dependent: set(knuth_bendix).
% 0.19/0.34 dependent: set(para_from).
% 0.19/0.34 dependent: set(para_into).
% 0.19/0.34 dependent: clear(para_from_right).
% 0.19/0.34 dependent: clear(para_into_right).
% 0.19/0.34 dependent: set(para_from_vars).
% 0.19/0.34 dependent: set(eq_units_both_ways).
% 0.19/0.34 dependent: set(dynamic_demod_all).
% 0.19/0.34 dependent: set(dynamic_demod).
% 0.19/0.34 dependent: set(order_eq).
% 0.19/0.34 dependent: set(back_demod).
% 0.19/0.34 dependent: set(lrpo).
% 0.19/0.34 dependent: set(hyper_res).
% 0.19/0.34 dependent: set(unit_deletion).
% 0.19/0.34 dependent: set(factor).
% 0.19/0.34
% 0.19/0.34 ------------> process usable:
% 0.19/0.34
% 0.19/0.34 ------------> process sos:
% 0.19/0.34 Following clause subsumed by 22 during input processing: 0 [copy,22,flip.1] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 0.19/0.34 Following clause subsumed by 30 during input processing: 0 [copy,30,flip.1] {-} A=A.
% 0.19/0.34
% 0.19/0.34 ======= end of input processing =======
% 0.19/0.37
% 0.19/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.37
% 0.19/0.37 Stopped by limit on number of solutions
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 -------------- Softie stats --------------
% 0.19/0.37
% 0.19/0.37 UPDATE_STOP: 300
% 0.19/0.37 SFINDER_TIME_LIMIT: 2
% 0.19/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.37 number of clauses in intial UL: 18
% 0.19/0.37 number of clauses initially in problem: 31
% 0.19/0.37 percentage of clauses intially in UL: 58
% 0.19/0.37 percentage of distinct symbols occuring in initial UL: 84
% 0.19/0.37 percent of all initial clauses that are short: 100
% 0.19/0.37 absolute distinct symbol count: 13
% 0.19/0.37 distinct predicate count: 4
% 0.19/0.37 distinct function count: 3
% 0.19/0.37 distinct constant count: 6
% 0.19/0.37
% 0.19/0.37 ---------- no more Softie stats ----------
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 =========== start of search ===========
% 3.76/3.93
% 3.76/3.93
% 3.76/3.93 Changing weight limit from 60 to 53.
% 3.76/3.93
% 3.76/3.93 Model 2 (0.00 seconds, 0 Inserts)
% 3.76/3.93
% 3.76/3.93 Stopped by limit on number of solutions
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Model 3 [ 1 1 465 ] (0.00 seconds, 250000 Inserts)
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Model 4 [ 1 0 284 ] (0.00 seconds, 250000 Inserts)
% 3.76/3.93
% 3.76/3.93 Model 5 [ 1 0 776 ] (0.00 seconds, 1983 Inserts)
% 3.76/3.93
% 3.76/3.93 Model 6 [ 2 0 483 ] (0.00 seconds, 3313 Inserts)
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Model 7 [ 4 1 567 ] (0.00 seconds, 250000 Inserts)
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Model 8 [ 7 0 905 ] (0.00 seconds, 250000 Inserts)
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Model 9 [ 10 1 1314 ] (0.00 seconds, 250000 Inserts)
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Model 10 [ 32 0 249 ] (0.00 seconds, 250000 Inserts)
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Model 11 [ 43 1 354 ] (0.00 seconds, 250000 Inserts)
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Model 12 [ 66 1 268 ] (0.00 seconds, 250000 Inserts)
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Model 13 [ 68 1 547 ] (0.00 seconds, 250000 Inserts)
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Model 14 [ 94 1 749 ] (0.00 seconds, 250000 Inserts)
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Stopped by limit on insertions
% 3.76/3.93
% 3.76/3.93 Model 15 [ 71 1 812 ] (0.00 seconds, 250000 Inserts)
% 3.76/3.93
% 3.76/3.93 Resetting weight limit to 53 after 95 givens.
% 3.76/3.93
% 4.86/5.03
% 4.86/5.03
% 4.86/5.03 Changing weight limit from 53 to 54.
% 4.86/5.03
% 4.86/5.03 Stopped by limit on insertions
% 4.86/5.03
% 4.86/5.03 Model 16 [ 54 1 2205 ] (0.00 seconds, 250000 Inserts)
% 4.86/5.03
% 4.86/5.03 Stopped by limit on insertions
% 4.86/5.03
% 4.86/5.03 Model 17 [ 69 1 409 ] (0.00 seconds, 250000 Inserts)
% 4.86/5.03
% 4.86/5.03 Resetting weight limit to 54 after 100 givens.
% 4.86/5.03
% 5.04/5.22
% 5.04/5.22 -------- PROOF --------
% 5.04/5.22 % SZS status Theorem
% 5.04/5.22 % SZS output start Refutation
% 5.04/5.22
% 5.04/5.22 -----> EMPTY CLAUSE at 4.83 sec ----> 4649 [hyper,4606,2,30] {-} $F.
% 5.04/5.22
% 5.04/5.22 Length of proof is 11. Level of proof is 6.
% 5.04/5.22
% 5.04/5.22 ---------------- PROOF ----------------
% 5.04/5.22 % SZS status Theorem
% 5.04/5.22 % SZS output start Refutation
% 5.04/5.22
% 5.04/5.22 2 [] {+} A!=empty_set| -in(B,A).
% 5.04/5.22 4 [] {+} A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 5.04/5.22 5 [] {+} A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 5.04/5.22 7 [] {+} -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 5.04/5.22 8 [] {+} disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 5.04/5.22 11 [] {+} -disjoint($c5,$c4)|in($c3,$c5).
% 5.04/5.22 12 [] {+} -disjoint($c5,$c4)|in($c3,$c4).
% 5.04/5.22 15 [] {+} -in(A,$c5)| -in(A,$c4)|disjoint($c5,$c4).
% 5.04/5.22 22 [] {+} set_intersection2(A,B)=set_intersection2(B,A).
% 5.04/5.22 23 [] {-} A=empty_set|in($f1(A),A).
% 5.04/5.22 30 [] {+} A=A.
% 5.04/5.22 37 [para_into,22.1.1,7.2.1,flip.1] {+} set_intersection2(A,B)=empty_set| -disjoint(B,A).
% 5.04/5.22 42 [para_from,22.1.1,8.2.1] {+} disjoint(A,B)|set_intersection2(B,A)!=empty_set.
% 5.04/5.22 47 [hyper,23,4,22] {-} set_intersection2(A,B)=empty_set|in($f1(set_intersection2(A,B)),A).
% 5.04/5.22 4265 [para_from,47.1.1,42.2.1,unit_del,30] {-} disjoint(A,B)|in($f1(set_intersection2(B,A)),B).
% 5.04/5.22 4284 [para_from,47.1.1,8.2.1,unit_del,30] {-} disjoint(A,B)|in($f1(set_intersection2(A,B)),A).
% 5.04/5.22 4347 [para_into,4265.2.1.1,22.1.1] {-} disjoint(A,B)|in($f1(set_intersection2(A,B)),B).
% 5.04/5.22 4467 [hyper,4347,15,4284,factor_simp,factor_simp] {-} disjoint($c5,$c4).
% 5.04/5.22 4558,4557 [hyper,4467,37] {-} set_intersection2($c4,$c5)=empty_set.
% 5.04/5.22 4559 [hyper,4467,12] {-} in($c3,$c4).
% 5.04/5.22 4560 [hyper,4467,11] {-} in($c3,$c5).
% 5.04/5.22 4606 [hyper,4560,5,30,4559,demod,4558] {-} in($c3,empty_set).
% 5.04/5.22 4649 [hyper,4606,2,30] {-} $F.
% 5.04/5.22
% 5.04/5.22 % SZS output end Refutation
% 5.04/5.22 ------------ end of proof -------------
% 5.04/5.22
% 5.04/5.22
% 5.04/5.22 Search stopped by max_proofs option.
% 5.04/5.22
% 5.04/5.22
% 5.04/5.22 Search stopped by max_proofs option.
% 5.04/5.22
% 5.04/5.22 ============ end of search ============
% 5.04/5.22
% 5.04/5.22 ----------- soft-scott stats ----------
% 5.04/5.22
% 5.04/5.22 true clauses given 30 (29.4%)
% 5.04/5.22 false clauses given 72
% 5.04/5.22
% 5.04/5.22 FALSE TRUE
% 5.04/5.22 5 2 0
% 5.04/5.22 6 1 1
% 5.04/5.22 7 1 7
% 5.04/5.22 8 0 7
% 5.04/5.22 9 3 23
% 5.04/5.22 10 2 12
% 5.04/5.22 11 32 28
% 5.04/5.22 12 45 28
% 5.04/5.22 13 51 31
% 5.04/5.22 14 32 32
% 5.04/5.22 15 80 42
% 5.04/5.22 16 29 47
% 5.04/5.22 17 46 60
% 5.04/5.22 18 96 66
% 5.04/5.22 19 32 33
% 5.04/5.22 20 70 72
% 5.04/5.22 21 29 75
% 5.04/5.22 22 8 40
% 5.04/5.22 23 5 65
% 5.04/5.22 24 49 81
% 5.04/5.22 25 22 53
% 5.04/5.22 26 60 94
% 5.04/5.22 27 27 66
% 5.04/5.22 28 13 39
% 5.04/5.22 29 40 63
% 5.04/5.22 30 14 97
% 5.04/5.22 31 6 66
% 5.04/5.22 32 0 65
% 5.04/5.22 33 3 86
% 5.04/5.22 34 11 65
% 5.04/5.22 35 0 141
% 5.04/5.22 36 0 35
% 5.04/5.22 37 8 83
% 5.04/5.22 38 3 49
% 5.04/5.22 39 9 64
% 5.04/5.22 40 0 45
% 5.04/5.22 41 0 102
% 5.04/5.22 42 3 45
% 5.04/5.22 43 0 58
% 5.04/5.22 44 0 22
% 5.04/5.22 45 0 66
% 5.04/5.22 46 0 31
% 5.04/5.22 47 0 40
% 5.04/5.22 48 0 2
% 5.04/5.22 49 0 58
% 5.04/5.22 50 0 1
% 5.04/5.22 51 0 46
% 5.04/5.22 52 0 2
% 5.04/5.22 53 0 12
% 5.04/5.22 tot: 832 2346 (73.8% true)
% 5.04/5.22
% 5.04/5.22
% 5.04/5.22 Model 17 [ 69 -41 409 ] (0.00 seconds, 250000 Inserts)
% 5.04/5.22
% 5.04/5.22 That finishes the proof of the theorem.
% 5.04/5.22
% 5.04/5.22 Process 14839 finished Sun Jun 19 00:07:18 2022
%------------------------------------------------------------------------------