%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET201+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:47 EDT 2022
% Result : Theorem 2.81s 3.01s
% Output : Refutation 2.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET201+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jul 9 18:50:41 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.37 ----- Otter 3.2, August 2001 -----
% 0.20/0.37 The process was started by sandbox2 on n028.cluster.edu,
% 0.20/0.37 Sat Jul 9 18:50:41 2022
% 0.20/0.37 The command was "./sos". The process ID is 12132.
% 0.20/0.37
% 0.20/0.37 set(prolog_style_variables).
% 0.20/0.37 set(auto).
% 0.20/0.37 dependent: set(auto1).
% 0.20/0.37 dependent: set(process_input).
% 0.20/0.37 dependent: clear(print_kept).
% 0.20/0.37 dependent: clear(print_new_demod).
% 0.20/0.37 dependent: clear(print_back_demod).
% 0.20/0.37 dependent: clear(print_back_sub).
% 0.20/0.37 dependent: set(control_memory).
% 0.20/0.37 dependent: assign(max_mem, 12000).
% 0.20/0.37 dependent: assign(pick_given_ratio, 4).
% 0.20/0.37 dependent: assign(stats_level, 1).
% 0.20/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37 dependent: assign(sos_limit, 5000).
% 0.20/0.37 dependent: assign(max_weight, 60).
% 0.20/0.37 clear(print_given).
% 0.20/0.37
% 0.20/0.37 formula_list(usable).
% 0.20/0.37
% 0.20/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.20/0.37
% 0.20/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.37 clauses in usable.
% 0.20/0.37
% 0.20/0.37 dependent: set(knuth_bendix).
% 0.20/0.37 dependent: set(para_from).
% 0.20/0.37 dependent: set(para_into).
% 0.20/0.37 dependent: clear(para_from_right).
% 0.20/0.37 dependent: clear(para_into_right).
% 0.20/0.37 dependent: set(para_from_vars).
% 0.20/0.37 dependent: set(eq_units_both_ways).
% 0.20/0.37 dependent: set(dynamic_demod_all).
% 0.20/0.37 dependent: set(dynamic_demod).
% 0.20/0.37 dependent: set(order_eq).
% 0.20/0.37 dependent: set(back_demod).
% 0.20/0.37 dependent: set(lrpo).
% 0.20/0.37 dependent: set(hyper_res).
% 0.20/0.37 dependent: set(unit_deletion).
% 0.20/0.37 dependent: set(factor).
% 0.20/0.37
% 0.20/0.37 ------------> process usable:
% 0.20/0.37
% 0.20/0.37 ------------> process sos:
% 0.20/0.37 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} intersection(A,B)=intersection(B,A).
% 0.20/0.37 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] {-} A=A.
% 0.20/0.37 18 back subsumes 11.
% 0.20/0.37
% 0.20/0.37 ======= end of input processing =======
% 0.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 10
% 0.20/0.41 number of clauses initially in problem: 17
% 0.20/0.41 percentage of clauses intially in UL: 58
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 10
% 0.20/0.41 distinct predicate count: 3
% 0.20/0.41 distinct function count: 3
% 0.20/0.41 distinct constant count: 4
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 1.35/1.54
% 1.35/1.54
% 1.35/1.54 Changing weight limit from 60 to 48.
% 1.35/1.54
% 1.35/1.54 Stopped by limit on insertions
% 1.35/1.54
% 1.35/1.54 Model 3 [ 4 0 75 ] (0.00 seconds, 250000 Inserts)
% 1.35/1.54
% 1.35/1.54 Model 4 (0.00 seconds, 250000 Inserts)
% 1.35/1.54
% 1.35/1.54 Stopped by limit on number of solutions
% 1.35/1.54
% 1.35/1.54 Stopped by limit on insertions
% 1.35/1.54
% 1.35/1.54 Model 5 [ 2 1 68 ] (0.00 seconds, 250000 Inserts)
% 1.35/1.54
% 1.35/1.54 Stopped by limit on insertions
% 1.35/1.54
% 1.35/1.54 Model 6 [ 1 0 109 ] (0.00 seconds, 250000 Inserts)
% 1.35/1.54
% 1.35/1.54 Resetting weight limit to 48 after 65 givens.
% 1.35/1.54
% 2.81/3.01
% 2.81/3.01 -------- PROOF --------
% 2.81/3.01 % SZS status Theorem
% 2.81/3.01 % SZS output start Refutation
% 2.81/3.01
% 2.81/3.01 ----> UNIT CONFLICT at 2.61 sec ----> 8917 [binary,8916.1,9.1] {+} $F.
% 2.81/3.01
% 2.81/3.01 Length of proof is 7. Level of proof is 5.
% 2.81/3.01
% 2.81/3.01 ---------------- PROOF ----------------
% 2.81/3.01 % SZS status Theorem
% 2.81/3.01 % SZS output start Refutation
% 2.81/3.01
% 2.81/3.01 1 [] {+} -member(A,intersection(B,C))|member(A,B).
% 2.81/3.01 2 [] {+} -member(A,intersection(B,C))|member(A,C).
% 2.81/3.01 3 [] {+} member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 2.81/3.01 4 [] {+} -subset(A,B)| -member(C,A)|member(C,B).
% 2.81/3.01 5 [] {+} subset(A,B)| -member($f1(A,B),B).
% 2.81/3.01 9 [] {+} -subset(intersection($c4,$c2),intersection($c3,$c1)).
% 2.81/3.01 12 [] {+} subset(A,B)|member($f1(A,B),A).
% 2.81/3.01 16 [] {+} subset($c4,$c3).
% 2.81/3.01 17 [] {+} subset($c2,$c1).
% 2.81/3.01 19 [hyper,12,9] {-} member($f1(intersection($c4,$c2),intersection($c3,$c1)),intersection($c4,$c2)).
% 2.81/3.01 80 [hyper,19,2] {-} member($f1(intersection($c4,$c2),intersection($c3,$c1)),$c2).
% 2.81/3.01 81 [hyper,19,1] {-} member($f1(intersection($c4,$c2),intersection($c3,$c1)),$c4).
% 2.81/3.01 118 [hyper,80,4,17] {+} member($f1(intersection($c4,$c2),intersection($c3,$c1)),$c1).
% 2.81/3.01 154 [hyper,81,4,16] {-} member($f1(intersection($c4,$c2),intersection($c3,$c1)),$c3).
% 2.81/3.01 1881 [hyper,118,3,154] {-} member($f1(intersection($c4,$c2),intersection($c3,$c1)),intersection($c3,$c1)).
% 2.81/3.01 8916 [hyper,1881,5] {-} subset(intersection($c4,$c2),intersection($c3,$c1)).
% 2.81/3.01 8917 [binary,8916.1,9.1] {+} $F.
% 2.81/3.01
% 2.81/3.01 % SZS output end Refutation
% 2.81/3.01 ------------ end of proof -------------
% 2.81/3.01
% 2.81/3.01
% 2.81/3.01 Search stopped by max_proofs option.
% 2.81/3.01
% 2.81/3.01
% 2.81/3.01 Search stopped by max_proofs option.
% 2.81/3.01
% 2.81/3.01 ============ end of search ============
% 2.81/3.01
% 2.81/3.01 ----------- soft-scott stats ----------
% 2.81/3.01
% 2.81/3.01 true clauses given 32 (36.8%)
% 2.81/3.01 false clauses given 55
% 2.81/3.01
% 2.81/3.01 FALSE TRUE
% 2.81/3.01 11 23 4
% 2.81/3.01 12 0 62
% 2.81/3.01 13 288 34
% 2.81/3.01 14 4 191
% 2.81/3.01 15 324 24
% 2.81/3.01 16 0 396
% 2.81/3.01 17 0 85
% 2.81/3.01 18 20 304
% 2.81/3.01 19 60 321
% 2.81/3.01 20 0 243
% 2.81/3.01 21 216 916
% 2.81/3.01 22 0 157
% 2.81/3.01 23 24 75
% 2.81/3.01 24 0 11
% 2.81/3.01 25 108 87
% 2.81/3.01 26 0 8
% 2.81/3.01 27 60 28
% 2.81/3.01 28 0 3
% 2.81/3.01 29 216 17
% 2.81/3.01 30 1 6
% 2.81/3.01 31 36 24
% 2.81/3.01 32 0 8
% 2.81/3.01 33 144 47
% 2.81/3.01 34 0 4
% 2.81/3.01 35 0 15
% 2.81/3.01 36 3 5
% 2.81/3.01 37 0 4
% 2.81/3.01 39 12 6
% 2.81/3.01 40 2 2
% 2.81/3.01 41 36 2
% 2.81/3.01 44 3 1
% 2.81/3.01 45 0 3
% 2.81/3.01 48 2 0
% 2.81/3.01 tot: 1582 3093 (66.2% true)
% 2.81/3.01
% 2.81/3.01
% 2.81/3.01 Model 6 [ 1 0 109 ] (0.00 seconds, 250000 Inserts)
% 2.81/3.01
% 2.81/3.01 That finishes the proof of the theorem.
% 2.81/3.01
% 2.81/3.01 Process 12132 finished Sat Jul 9 18:50:44 2022
%------------------------------------------------------------------------------