TSTP Solution File: SET183+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET183+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:37 EDT 2022
% Result : Theorem 0.89s 1.11s
% Output : Refutation 0.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET183+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 22:00:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n024.cluster.edu,
% 0.12/0.36 Sun Jul 10 22:00:58 2022
% 0.12/0.36 The command was "./sos". The process ID is 2734.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] {-} intersection(A,B)=intersection(B,A).
% 0.12/0.36 Following clause subsumed by 22 during input processing: 0 [copy,22,flip.1] {-} A=A.
% 0.12/0.36 22 back subsumes 15.
% 0.12/0.36 22 back subsumes 14.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 13
% 0.19/0.38 number of clauses initially in problem: 20
% 0.19/0.38 percentage of clauses intially in UL: 65
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 8
% 0.19/0.38 distinct predicate count: 3
% 0.19/0.38 distinct function count: 3
% 0.19/0.38 distinct constant count: 2
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 0.89/1.11
% 0.89/1.11 -------- PROOF --------
% 0.89/1.11 % SZS status Theorem
% 0.89/1.11 % SZS output start Refutation
% 0.89/1.11
% 0.89/1.11 Model 2 (0.00 seconds, 0 Inserts)
% 0.89/1.11
% 0.89/1.11 Stopped by limit on number of solutions
% 0.89/1.11
% 0.89/1.11 Model 3 (0.00 seconds, 0 Inserts)
% 0.89/1.11
% 0.89/1.11 Stopped by limit on number of solutions
% 0.89/1.11
% 0.89/1.11 Model 4 (0.00 seconds, 0 Inserts)
% 0.89/1.11
% 0.89/1.11 Stopped by limit on number of solutions
% 0.89/1.11
% 0.89/1.11 Model 5 [ 1 1 64 ] (0.00 seconds, 15725 Inserts)
% 0.89/1.11
% 0.89/1.11 Model 6 [ 1 1 89 ] (0.00 seconds, 15485 Inserts)
% 0.89/1.11
% 0.89/1.11 Model 7 [ 4 1 660 ] (0.00 seconds, 134430 Inserts)
% 0.89/1.11
% 0.89/1.11 ----> UNIT CONFLICT at 0.72 sec ----> 3065 [binary,3063.1,12.1] {-} $F.
% 0.89/1.11
% 0.89/1.11 Length of proof is 9. Level of proof is 7.
% 0.89/1.11
% 0.89/1.11 ---------------- PROOF ----------------
% 0.89/1.11 % SZS status Theorem
% 0.89/1.11 % SZS output start Refutation
% 0.89/1.11
% 0.89/1.11 3 [] {+} member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 0.89/1.11 4 [] {+} -subset(A,B)| -member(C,A)|member(C,B).
% 0.89/1.11 5 [] {+} subset(A,B)| -member($f1(A,B),B).
% 0.89/1.11 8 [] {+} A=B| -subset(A,B)| -subset(B,A).
% 0.89/1.11 12 [] {+} intersection($c2,$c1)!=$c2.
% 0.89/1.11 16 [] {+} subset(intersection(A,B),A).
% 0.89/1.11 17 [] {+} subset(A,B)|member($f1(A,B),A).
% 0.89/1.11 18 [] {+} intersection(A,B)=intersection(B,A).
% 0.89/1.11 21 [] {+} subset($c2,$c1).
% 0.89/1.11 22 [] {+} A=A.
% 0.89/1.11 31 [para_into,18.1.1,8.1.1] {+} A=intersection(B,C)| -subset(intersection(C,B),A)| -subset(A,intersection(C,B)).
% 0.89/1.11 32 [para_from,18.1.1,16.1.1] {+} subset(intersection(A,B),B).
% 0.89/1.11 33 [para_from,18.1.1,12.1.1] {+} intersection($c1,$c2)!=$c2.
% 0.89/1.11 36 [hyper,17,8,32] {+} member($f1(A,intersection(B,A)),A)|intersection(B,A)=A.
% 0.89/1.11 2296 [para_from,36.2.1,33.1.1,unit_del,22] {+} member($f1($c2,intersection($c1,$c2)),$c2).
% 0.89/1.11 2320 [hyper,2296,4,21] {-} member($f1($c2,intersection($c1,$c2)),$c1).
% 0.89/1.11 2381 [hyper,2320,3,2296] {-} member($f1($c2,intersection($c1,$c2)),intersection($c1,$c2)).
% 0.89/1.11 2977 [hyper,2381,5] {+} subset($c2,intersection($c1,$c2)).
% 0.89/1.11 3063 [hyper,2977,31,32,flip.1] {-} intersection($c2,$c1)=$c2.
% 0.89/1.11 3065 [binary,3063.1,12.1] {-} $F.
% 0.89/1.11
% 0.89/1.11 % SZS output end Refutation
% 0.89/1.11 ------------ end of proof -------------
% 0.89/1.11
% 0.89/1.11
% 0.89/1.11 Search stopped by max_proofs option.
% 0.89/1.11
% 0.89/1.11
% 0.89/1.11 Search stopped by max_proofs option.
% 0.89/1.11
% 0.89/1.11 ============ end of search ============
% 0.89/1.11
% 0.89/1.11 ----------- soft-scott stats ----------
% 0.89/1.11
% 0.89/1.11 true clauses given 19 (29.7%)
% 0.89/1.11 false clauses given 45
% 0.89/1.11
% 0.89/1.11 FALSE TRUE
% 0.89/1.11 7 0 1
% 0.89/1.11 9 0 4
% 0.89/1.11 11 0 14
% 0.89/1.11 12 12 27
% 0.89/1.11 13 6 50
% 0.89/1.11 14 11 94
% 0.89/1.11 15 10 81
% 0.89/1.11 16 1 118
% 0.89/1.11 17 6 136
% 0.89/1.11 18 5 211
% 0.89/1.11 19 16 176
% 0.89/1.11 20 15 203
% 0.89/1.11 21 18 192
% 0.89/1.11 22 8 359
% 0.89/1.11 23 9 113
% 0.89/1.11 24 14 151
% 0.89/1.11 25 11 101
% 0.89/1.11 26 12 137
% 0.89/1.11 27 26 108
% 0.89/1.11 28 5 58
% 0.89/1.11 29 2 66
% 0.89/1.11 30 2 128
% 0.89/1.11 31 0 20
% 0.89/1.11 32 0 18
% 0.89/1.11 33 0 47
% 0.89/1.11 34 0 30
% 0.89/1.11 35 2 42
% 0.89/1.11 36 0 2
% 0.89/1.11 37 2 22
% 0.89/1.11 38 0 15
% 0.89/1.11 39 2 4
% 0.89/1.11 41 0 6
% 0.89/1.11 43 0 3
% 0.89/1.11 45 0 4
% 0.89/1.11 47 0 2
% 0.89/1.11 49 0 1
% 0.89/1.11 52 0 2
% 0.89/1.11 tot: 195 2746 (93.4% true)
% 0.89/1.11
% 0.89/1.11
% 0.89/1.11 Model 7 [ 4 1 660 ] (0.00 seconds, 134430 Inserts)
% 0.89/1.11
% 0.89/1.11 That finishes the proof of the theorem.
% 0.89/1.11
% 0.89/1.11 Process 2734 finished Sun Jul 10 22:00:59 2022
%------------------------------------------------------------------------------