TSTP Solution File: SET586+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET586+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:19:05 EDT 2022
% Result : Theorem 1.06s 1.27s
% Output : Refutation 1.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET586+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 07:27:23 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox2 on n019.cluster.edu,
% 0.14/0.36 Mon Jul 11 07:27:23 2022
% 0.14/0.36 The command was "./sos". The process ID is 31016.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 formula_list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.14/0.36
% 0.14/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.36 clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: set(unit_deletion).
% 0.14/0.36 dependent: set(factor).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} intersection(A,B)=intersection(B,A).
% 0.14/0.36 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} A=A.
% 0.14/0.36 17 back subsumes 11.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.39
% 0.14/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 -------------- Softie stats --------------
% 0.14/0.39
% 0.14/0.39 UPDATE_STOP: 300
% 0.14/0.39 SFINDER_TIME_LIMIT: 2
% 0.14/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.39 number of clauses in intial UL: 10
% 0.14/0.39 number of clauses initially in problem: 16
% 0.14/0.39 percentage of clauses intially in UL: 62
% 0.14/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.39 percent of all initial clauses that are short: 100
% 0.14/0.39 absolute distinct symbol count: 9
% 0.14/0.39 distinct predicate count: 3
% 0.14/0.39 distinct function count: 3
% 0.14/0.39 distinct constant count: 3
% 0.14/0.39
% 0.14/0.39 ---------- no more Softie stats ----------
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39 =========== start of search ===========
% 1.06/1.27
% 1.06/1.27 -------- PROOF --------
% 1.06/1.27 % SZS status Theorem
% 1.06/1.27 % SZS output start Refutation
% 1.06/1.27
% 1.06/1.27 Stopped by limit on insertions
% 1.06/1.27
% 1.06/1.27 Model 3 [ 1 0 195 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.27
% 1.06/1.27 Stopped by limit on insertions
% 1.06/1.27
% 1.06/1.27 Model 4 [ 2 0 138 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.27
% 1.06/1.27 Stopped by limit on insertions
% 1.06/1.27
% 1.06/1.27 Model 5 [ 1 1 153 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.27
% 1.06/1.27 ----> UNIT CONFLICT at 0.89 sec ----> 4305 [binary,4304.1,9.1] {-} $F.
% 1.06/1.27
% 1.06/1.27 Length of proof is 6. Level of proof is 5.
% 1.06/1.27
% 1.06/1.27 ---------------- PROOF ----------------
% 1.06/1.27 % SZS status Theorem
% 1.06/1.27 % SZS output start Refutation
% 1.06/1.27
% 1.06/1.27 1 [] {+} -member(A,intersection(B,C))|member(A,B).
% 1.06/1.27 2 [] {+} -member(A,intersection(B,C))|member(A,C).
% 1.06/1.27 3 [] {+} member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 1.06/1.27 4 [] {+} -subset(A,B)| -member(C,A)|member(C,B).
% 1.06/1.27 5 [] {+} subset(A,B)| -member($f1(A,B),B).
% 1.06/1.27 9 [] {+} -subset(intersection($c3,$c1),intersection($c2,$c1)).
% 1.06/1.27 12 [] {+} subset(A,B)|member($f1(A,B),A).
% 1.06/1.27 16 [] {+} subset($c3,$c2).
% 1.06/1.27 18 [hyper,12,9] {-} member($f1(intersection($c3,$c1),intersection($c2,$c1)),intersection($c3,$c1)).
% 1.06/1.27 71 [hyper,18,2] {-} member($f1(intersection($c3,$c1),intersection($c2,$c1)),$c1).
% 1.06/1.27 72 [hyper,18,1] {-} member($f1(intersection($c3,$c1),intersection($c2,$c1)),$c3).
% 1.06/1.27 131 [hyper,72,4,16] {+} member($f1(intersection($c3,$c1),intersection($c2,$c1)),$c2).
% 1.06/1.27 3550 [hyper,131,3,71] {-} member($f1(intersection($c3,$c1),intersection($c2,$c1)),intersection($c2,$c1)).
% 1.06/1.27 4304 [hyper,3550,5] {-} subset(intersection($c3,$c1),intersection($c2,$c1)).
% 1.06/1.27 4305 [binary,4304.1,9.1] {-} $F.
% 1.06/1.27
% 1.06/1.27 % SZS output end Refutation
% 1.06/1.27 ------------ end of proof -------------
% 1.06/1.27
% 1.06/1.27
% 1.06/1.27 Search stopped by max_proofs option.
% 1.06/1.27
% 1.06/1.27
% 1.06/1.27 Search stopped by max_proofs option.
% 1.06/1.27
% 1.06/1.27 ============ end of search ============
% 1.06/1.27
% 1.06/1.27 ----------- soft-scott stats ----------
% 1.06/1.27
% 1.06/1.27 true clauses given 22 (37.3%)
% 1.06/1.27 false clauses given 37
% 1.06/1.27
% 1.06/1.27 FALSE TRUE
% 1.06/1.27 9 0 6
% 1.06/1.27 10 0 2
% 1.06/1.27 11 7 4
% 1.06/1.27 12 0 28
% 1.06/1.27 13 94 15
% 1.06/1.27 14 20 42
% 1.06/1.27 15 121 33
% 1.06/1.27 16 38 50
% 1.06/1.27 17 56 113
% 1.06/1.27 18 22 55
% 1.06/1.27 19 64 220
% 1.06/1.27 20 24 51
% 1.06/1.27 21 231 381
% 1.06/1.27 22 61 74
% 1.06/1.27 23 303 295
% 1.06/1.27 24 32 93
% 1.06/1.27 25 152 195
% 1.06/1.27 26 37 102
% 1.06/1.27 27 95 96
% 1.06/1.27 28 10 53
% 1.06/1.27 29 73 41
% 1.06/1.27 30 8 31
% 1.06/1.27 31 24 74
% 1.06/1.27 32 49 42
% 1.06/1.27 33 23 99
% 1.06/1.27 34 46 22
% 1.06/1.27 35 4 39
% 1.06/1.27 36 15 35
% 1.06/1.27 37 4 27
% 1.06/1.27 38 0 7
% 1.06/1.27 39 0 17
% 1.06/1.27 40 6 15
% 1.06/1.27 41 0 22
% 1.06/1.27 42 0 18
% 1.06/1.27 43 0 11
% 1.06/1.27 44 0 19
% 1.06/1.27 45 0 13
% 1.06/1.27 46 0 10
% 1.06/1.27 49 0 5
% 1.06/1.27 50 0 1
% 1.06/1.27 52 0 6
% 1.06/1.27 54 0 4
% 1.06/1.27 56 0 10
% 1.06/1.27 57 0 2
% 1.06/1.27 58 0 19
% 1.06/1.27 60 0 4
% 1.06/1.27 tot: 1619 2501 (60.7% true)
% 1.06/1.27
% 1.06/1.27
% 1.06/1.27 Model 5 [ 1 1 153 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.27
% 1.06/1.27 That finishes the proof of the theorem.
% 1.06/1.27
% 1.06/1.27 Process 31016 finished Mon Jul 11 07:27:24 2022
%------------------------------------------------------------------------------