TSTP Solution File: SET173+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET173+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:16:32 EDT 2022
% Result : Theorem 10.67s 10.89s
% Output : Refutation 10.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET173+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n020.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 Jul 11 09:53:13 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 n020.cluster.edu,
% 0.18/0.35 Mon Jul 11 09:53:13 2022
% 0.18/0.35 The command was "./sos". The process ID is 18860.
% 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 formula_list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 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 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} union(A,B)=union(B,A).
% 0.18/0.35 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} intersection(A,B)=intersection(B,A).
% 0.18/0.35 Following clause subsumed by 25 during input processing: 0 [copy,25,flip.1] {-} A=A.
% 0.18/0.35 25 back subsumes 19.
% 0.18/0.35 25 back subsumes 18.
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.18/0.37
% 0.18/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.37
% 0.18/0.37 Stopped by limit on number of solutions
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 -------------- Softie stats --------------
% 0.18/0.37
% 0.18/0.37 UPDATE_STOP: 300
% 0.18/0.37 SFINDER_TIME_LIMIT: 2
% 0.18/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.37 number of clauses in intial UL: 17
% 0.18/0.37 number of clauses initially in problem: 23
% 0.18/0.37 percentage of clauses intially in UL: 73
% 0.18/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.37 percent of all initial clauses that are short: 100
% 0.18/0.37 absolute distinct symbol count: 9
% 0.18/0.37 distinct predicate count: 3
% 0.18/0.37 distinct function count: 4
% 0.18/0.37 distinct constant count: 2
% 0.18/0.37
% 0.18/0.37 ---------- no more Softie stats ----------
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 =========== start of search ===========
% 1.81/2.01
% 1.81/2.01
% 1.81/2.01 Changing weight limit from 60 to 58.
% 1.81/2.01
% 1.81/2.01 Stopped by limit on insertions
% 1.81/2.01
% 1.81/2.01 Model 2 [ 3 0 280 ] (0.00 seconds, 250000 Inserts)
% 1.81/2.01
% 1.81/2.01 Stopped by limit on insertions
% 1.81/2.01
% 1.81/2.01 Model 3 [ 3 1 274 ] (0.00 seconds, 250000 Inserts)
% 1.81/2.01
% 1.81/2.01 Stopped by limit on insertions
% 1.81/2.01
% 1.81/2.01 Model 4 [ 3 0 389 ] (0.00 seconds, 250000 Inserts)
% 1.81/2.01
% 1.81/2.01 Stopped by limit on insertions
% 1.81/2.01
% 1.81/2.01 Model 5 [ 4 0 334 ] (0.00 seconds, 250000 Inserts)
% 1.81/2.01
% 1.81/2.01 Resetting weight limit to 58 after 55 givens.
% 1.81/2.01
% 4.24/4.44
% 4.24/4.44
% 4.24/4.44 Changing weight limit from 58 to 35.
% 4.24/4.44
% 4.24/4.44 Stopped by limit on insertions
% 4.24/4.44
% 4.24/4.44 Model 6 [ 6 0 1220 ] (0.00 seconds, 250000 Inserts)
% 4.24/4.44
% 4.24/4.44 Stopped by limit on insertions
% 4.24/4.44
% 4.24/4.44 Model 7 [ 9 1 126 ] (0.00 seconds, 250000 Inserts)
% 4.24/4.44
% 4.24/4.44 Stopped by limit on insertions
% 4.24/4.44
% 4.24/4.44 Model 8 [ 8 1 216 ] (0.00 seconds, 250000 Inserts)
% 4.24/4.44
% 4.24/4.44 Resetting weight limit to 35 after 70 givens.
% 4.24/4.44
% 5.53/5.77
% 5.53/5.77
% 5.53/5.77 Changing weight limit from 35 to 29.
% 5.53/5.77
% 5.53/5.77 Stopped by limit on insertions
% 5.53/5.77
% 5.53/5.77 Model 9 [ 12 0 521 ] (0.00 seconds, 250000 Inserts)
% 5.53/5.77
% 5.53/5.77 Resetting weight limit to 29 after 75 givens.
% 5.53/5.77
% 6.94/7.12
% 6.94/7.12
% 6.94/7.12 Changing weight limit from 29 to 28.
% 6.94/7.12
% 6.94/7.12 Stopped by limit on insertions
% 6.94/7.12
% 6.94/7.12 Model 10 [ 13 0 3627 ] (0.00 seconds, 250000 Inserts)
% 6.94/7.12
% 6.94/7.12 Stopped by limit on insertions
% 6.94/7.12
% 6.94/7.12 Model 11 [ 13 0 284 ] (0.00 seconds, 250000 Inserts)
% 6.94/7.12
% 6.94/7.12 Stopped by limit on insertions
% 6.94/7.12
% 6.94/7.12 Model 12 [ 14 0 1997 ] (0.00 seconds, 250000 Inserts)
% 6.94/7.12
% 6.94/7.12 Resetting weight limit to 28 after 80 givens.
% 6.94/7.12
% 8.72/8.91
% 8.72/8.91
% 8.72/8.91 Changing weight limit from 28 to 23.
% 8.72/8.91
% 8.72/8.91 Resetting weight limit to 23 after 85 givens.
% 8.72/8.91
% 10.67/10.89
% 10.67/10.89 -- HEY sandbox2, WE HAVE A PROOF!! --
% 10.67/10.89
% 10.67/10.89 Stopped by limit on insertions
% 10.67/10.89
% 10.67/10.89 Model 13 [ 14 1 192 ] (0.00 seconds, 250000 Inserts)
% 10.67/10.89
% 10.67/10.89 Stopped by limit on insertions
% 10.67/10.89
% 10.67/10.89 Model 14 [ 15 1 167 ] (0.00 seconds, 250000 Inserts)
% 10.67/10.89
% 10.67/10.89 ----> UNIT CONFLICT at 10.50 sec ----> 14183 [binary,14181.1,118.1] {-} $F.
% 10.67/10.89
% 10.67/10.89 Length of proof is 7. Level of proof is 6.
% 10.67/10.89
% 10.67/10.89 ---------------- PROOF ----------------
% 10.67/10.89 % SZS status Theorem
% 10.67/10.89 % SZS output start Refutation
% 10.67/10.89
% 10.67/10.89 2 [] {+} member(A,union(B,C))| -member(A,B).
% 10.67/10.89 5 [] {+} -member(A,intersection(B,C))|member(A,C).
% 10.67/10.89 6 [] {+} member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 10.67/10.89 14 [] {+} A=B| -member($f2(A,B),A)| -member($f2(A,B),B).
% 10.67/10.89 15 [] {+} intersection($c2,union($c2,$c1))!=$c2.
% 10.67/10.89 21 [] {+} intersection(A,B)=intersection(B,A).
% 10.67/10.89 24 [] {-} A=B|member($f2(A,B),A)|member($f2(A,B),B).
% 10.67/10.89 25 [] {+} A=A.
% 10.67/10.89 37 [hyper,24,5] {-} intersection(A,B)=C|member($f2(intersection(A,B),C),C)|member($f2(intersection(A,B),C),B).
% 10.67/10.89 54 [factor,37.2.3] {+} intersection(A,B)=B|member($f2(intersection(A,B),B),B).
% 10.67/10.89 118 [para_from,21.1.1,15.1.1] {-} intersection(union($c2,$c1),$c2)!=$c2.
% 10.67/10.89 238 [para_into,118.1.1,54.1.1,unit_del,25] {-} member($f2(intersection(union($c2,$c1),$c2),$c2),$c2).
% 10.67/10.89 267 [hyper,238,2] {-} member($f2(intersection(union($c2,$c1),$c2),$c2),union($c2,A)).
% 10.67/10.89 781 [hyper,267,6,238] {-} member($f2(intersection(union($c2,$c1),$c2),$c2),intersection(union($c2,A),$c2)).
% 10.67/10.89 14181 [hyper,781,14,238] {-} intersection(union($c2,$c1),$c2)=$c2.
% 10.67/10.89 14183 [binary,14181.1,118.1] {-} $F.
% 10.67/10.89
% 10.67/10.89 % SZS output end Refutation
% 10.67/10.89 ------------ end of proof -------------
% 10.67/10.89
% 10.67/10.89
% 10.67/10.89 Search stopped by max_proofs option.
% 10.67/10.89
% 10.67/10.89
% 10.67/10.89 Search stopped by max_proofs option.
% 10.67/10.89
% 10.67/10.89 ============ end of search ============
% 10.67/10.89
% 10.67/10.89 ----------- soft-scott stats ----------
% 10.67/10.89
% 10.67/10.89 true clauses given 12 (10.9%)
% 10.67/10.89 false clauses given 98
% 10.67/10.89
% 10.67/10.89 FALSE TRUE
% 10.67/10.89 11 0 12
% 10.67/10.89 12 0 6
% 10.67/10.89 13 86 13
% 10.67/10.89 14 47 44
% 10.67/10.89 15 167 36
% 10.67/10.89 16 138 116
% 10.67/10.89 17 254 167
% 10.67/10.89 18 679 169
% 10.67/10.89 19 477 294
% 10.67/10.89 20 652 132
% 10.67/10.89 21 0 550
% 10.67/10.89 22 0 195
% 10.67/10.89 23 0 260
% 10.67/10.89 tot: 2500 1994 (44.4% true)
% 10.67/10.89
% 10.67/10.89
% 10.67/10.89 Model 14 [ 15 1 167 ] (0.00 seconds, 250000 Inserts)
% 10.67/10.89
% 10.67/10.89 That finishes the proof of the theorem.
% 10.67/10.89
% 10.67/10.89 Process 18860 finished Mon Jul 11 09:53:23 2022
%------------------------------------------------------------------------------