TSTP Solution File: SET578+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET578+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:19:01 EDT 2022
% Result : Theorem 1.45s 1.68s
% Output : Refutation 1.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET578+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.35 % Computer : n024.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 : Sun Jul 10 05:11:43 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.37 ----- Otter 3.2, August 2001 -----
% 0.21/0.37 The process was started by sandbox2 on n024.cluster.edu,
% 0.21/0.37 Sun Jul 10 05:11:43 2022
% 0.21/0.37 The command was "./sos". The process ID is 17106.
% 0.21/0.37
% 0.21/0.37 set(prolog_style_variables).
% 0.21/0.37 set(auto).
% 0.21/0.37 dependent: set(auto1).
% 0.21/0.37 dependent: set(process_input).
% 0.21/0.37 dependent: clear(print_kept).
% 0.21/0.37 dependent: clear(print_new_demod).
% 0.21/0.37 dependent: clear(print_back_demod).
% 0.21/0.37 dependent: clear(print_back_sub).
% 0.21/0.37 dependent: set(control_memory).
% 0.21/0.37 dependent: assign(max_mem, 12000).
% 0.21/0.37 dependent: assign(pick_given_ratio, 4).
% 0.21/0.37 dependent: assign(stats_level, 1).
% 0.21/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.37 dependent: assign(sos_limit, 5000).
% 0.21/0.37 dependent: assign(max_weight, 60).
% 0.21/0.37 clear(print_given).
% 0.21/0.37
% 0.21/0.37 formula_list(usable).
% 0.21/0.37
% 0.21/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.21/0.37
% 0.21/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.21/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.21/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.21/0.37 clauses in usable.
% 0.21/0.37
% 0.21/0.37 dependent: set(knuth_bendix).
% 0.21/0.37 dependent: set(para_from).
% 0.21/0.37 dependent: set(para_into).
% 0.21/0.37 dependent: clear(para_from_right).
% 0.21/0.37 dependent: clear(para_into_right).
% 0.21/0.37 dependent: set(para_from_vars).
% 0.21/0.37 dependent: set(eq_units_both_ways).
% 0.21/0.37 dependent: set(dynamic_demod_all).
% 0.21/0.37 dependent: set(dynamic_demod).
% 0.21/0.37 dependent: set(order_eq).
% 0.21/0.37 dependent: set(back_demod).
% 0.21/0.37 dependent: set(lrpo).
% 0.21/0.37 dependent: set(hyper_res).
% 0.21/0.37 dependent: set(unit_deletion).
% 0.21/0.37 dependent: set(factor).
% 0.21/0.37
% 0.21/0.37 ------------> process usable:
% 0.21/0.37
% 0.21/0.37 ------------> process sos:
% 0.21/0.37 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} intersection(A,B)=intersection(B,A).
% 0.21/0.37 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] {-} A=A.
% 0.21/0.37 24 back subsumes 19.
% 0.21/0.37 24 back subsumes 18.
% 0.21/0.37
% 0.21/0.37 ======= end of input processing =======
% 0.21/0.39
% 0.21/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.39
% 0.21/0.39 Stopped by limit on number of solutions
% 0.21/0.39
% 0.21/0.39
% 0.21/0.39 -------------- Softie stats --------------
% 0.21/0.39
% 0.21/0.39 UPDATE_STOP: 300
% 0.21/0.39 SFINDER_TIME_LIMIT: 2
% 0.21/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.39 number of clauses in intial UL: 16
% 0.21/0.39 number of clauses initially in problem: 21
% 0.21/0.39 percentage of clauses intially in UL: 76
% 0.21/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.39 percent of all initial clauses that are short: 100
% 0.21/0.39 absolute distinct symbol count: 9
% 0.21/0.39 distinct predicate count: 3
% 0.21/0.39 distinct function count: 3
% 0.21/0.39 distinct constant count: 3
% 0.21/0.39
% 0.21/0.39 ---------- no more Softie stats ----------
% 0.21/0.39
% 0.21/0.39
% 0.21/0.39
% 0.21/0.39 =========== start of search ===========
% 1.45/1.68
% 1.45/1.68 -------- PROOF --------
% 1.45/1.68 % SZS status Theorem
% 1.45/1.68 % SZS output start Refutation
% 1.45/1.68
% 1.45/1.68 Stopped by limit on insertions
% 1.45/1.68
% 1.45/1.68 Stopped by limit on insertions
% 1.45/1.68
% 1.45/1.68 Stopped by limit on insertions
% 1.45/1.68
% 1.45/1.68 Stopped by limit on insertions
% 1.45/1.68
% 1.45/1.68 Stopped by limit on insertions
% 1.45/1.68
% 1.45/1.68 Model 2 [ 5 1 221 ] (0.00 seconds, 250000 Inserts)
% 1.45/1.68
% 1.45/1.68 Stopped by limit on insertions
% 1.45/1.68
% 1.45/1.68 ----> UNIT CONFLICT at 1.29 sec ----> 3859 [binary,3857.1,28.1] {-} $F.
% 1.45/1.68
% 1.45/1.68 Length of proof is 12. Level of proof is 9.
% 1.45/1.68
% 1.45/1.68 ---------------- PROOF ----------------
% 1.45/1.68 % SZS status Theorem
% 1.45/1.68 % SZS output start Refutation
% 1.45/1.68
% 1.45/1.68 2 [] {+} -member(A,intersection(B,C))|member(A,C).
% 1.45/1.68 3 [] {+} member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 1.45/1.68 11 [] {+} A=B| -member($f2(A,B),A)| -member($f2(A,B),B).
% 1.45/1.68 12 [] {+} -member(A,$c3)|member(A,$c2).
% 1.45/1.68 13 [] {+} -member(A,$c3)|member(A,$c1).
% 1.45/1.68 14 [] {+} member(A,$c3)| -member(A,$c2)| -member(A,$c1).
% 1.45/1.68 15 [] {-} $c3!=intersection($c2,$c1).
% 1.45/1.68 16 [copy,15,flip.1] {+} intersection($c2,$c1)!=$c3.
% 1.45/1.68 20 [] {+} intersection(A,B)=intersection(B,A).
% 1.45/1.68 23 [] {-} A=B|member($f2(A,B),A)|member($f2(A,B),B).
% 1.45/1.68 24 [] {+} A=A.
% 1.45/1.68 28 [para_from,20.1.1,16.1.1] {+} intersection($c1,$c2)!=$c3.
% 1.45/1.68 34 [hyper,23,13] {-} $c3=A|member($f2($c3,A),A)|member($f2($c3,A),$c1).
% 1.45/1.68 35 [hyper,23,12] {-} $c3=A|member($f2($c3,A),A)|member($f2($c3,A),$c2).
% 1.45/1.68 2789 [hyper,34,2,flip.1] {-} intersection(A,B)=$c3|member($f2($c3,intersection(A,B)),$c1)|member($f2($c3,intersection(A,B)),B).
% 1.45/1.68 2800 [factor,2789.2.3] {-} intersection(A,$c1)=$c3|member($f2($c3,intersection(A,$c1)),$c1).
% 1.45/1.68 3167 [para_from,2800.1.1,16.1.1,unit_del,24] {-} member($f2($c3,intersection($c2,$c1)),$c1).
% 1.45/1.68 3217 [para_into,3167.1.1.2,20.1.1] {-} member($f2($c3,intersection($c1,$c2)),$c1).
% 1.45/1.68 3415 [hyper,35,3,3217,unit_del,28,factor_simp] {-} member($f2($c3,intersection($c1,$c2)),intersection($c1,$c2)).
% 1.45/1.68 3704 [hyper,3415,2] {-} member($f2($c3,intersection($c1,$c2)),$c2).
% 1.45/1.68 3791 [hyper,3704,14,3217] {-} member($f2($c3,intersection($c1,$c2)),$c3).
% 1.45/1.68 3857 [hyper,3791,11,3415,flip.1] {-} intersection($c1,$c2)=$c3.
% 1.45/1.68 3859 [binary,3857.1,28.1] {-} $F.
% 1.45/1.68
% 1.45/1.68 % SZS output end Refutation
% 1.45/1.68 ------------ end of proof -------------
% 1.45/1.68
% 1.45/1.68
% 1.45/1.68 Search stopped by max_proofs option.
% 1.45/1.68
% 1.45/1.68
% 1.45/1.68 Search stopped by max_proofs option.
% 1.45/1.68
% 1.45/1.68 ============ end of search ============
% 1.45/1.68
% 1.45/1.68 ----------- soft-scott stats ----------
% 1.45/1.68
% 1.45/1.68 true clauses given 11 (20.0%)
% 1.45/1.68 false clauses given 44
% 1.45/1.68
% 1.45/1.68 FALSE TRUE
% 1.45/1.68 7 1 0
% 1.45/1.68 9 4 0
% 1.45/1.68 10 0 1
% 1.45/1.68 11 10 6
% 1.45/1.68 12 9 59
% 1.45/1.68 13 29 32
% 1.45/1.68 14 59 44
% 1.45/1.68 15 43 68
% 1.45/1.68 16 43 110
% 1.45/1.68 17 95 182
% 1.45/1.68 18 133 114
% 1.45/1.68 19 116 138
% 1.45/1.68 20 115 233
% 1.45/1.68 21 130 158
% 1.45/1.68 22 234 239
% 1.45/1.68 23 54 73
% 1.45/1.68 24 130 78
% 1.45/1.68 25 41 20
% 1.45/1.68 26 104 92
% 1.45/1.68 27 39 35
% 1.45/1.68 28 41 71
% 1.45/1.68 29 24 5
% 1.45/1.68 30 116 58
% 1.45/1.68 31 16 22
% 1.45/1.68 32 10 11
% 1.45/1.68 33 6 17
% 1.45/1.68 34 31 14
% 1.45/1.68 35 23 40
% 1.45/1.68 36 17 30
% 1.45/1.68 37 7 0
% 1.45/1.68 38 19 6
% 1.45/1.68 39 8 5
% 1.45/1.68 40 5 4
% 1.45/1.68 42 0 3
% 1.45/1.68 43 3 0
% 1.45/1.68 44 3 6
% 1.45/1.68 45 4 15
% 1.45/1.68 46 0 2
% 1.45/1.68 47 2 9
% 1.45/1.68 48 2 0
% 1.45/1.68 49 1 3
% 1.45/1.68 52 0 2
% 1.45/1.68 56 2 0
% 1.45/1.68 57 0 2
% 1.45/1.68 tot: 1729 2007 (53.7% true)
% 1.45/1.68
% 1.45/1.68
% 1.45/1.68 Model 2 [ 5 -14 221 ] (0.00 seconds, 250000 Inserts)
% 1.45/1.68
% 1.45/1.68 That finishes the proof of the theorem.
% 1.45/1.68
% 1.45/1.68 Process 17106 finished Sun Jul 10 05:11:45 2022
%------------------------------------------------------------------------------