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