TSTP Solution File: SET005-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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:14:00 EDT 2022
% Result : Unsatisfiable 2.58s 2.85s
% Output : Refutation 2.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : sos-script %s
% 0.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jul 10 12:31:00 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 ----- Otter 3.2, August 2001 -----
% 0.14/0.38 The process was started by sandbox2 on n010.cluster.edu,
% 0.14/0.38 Sun Jul 10 12:31:00 2022
% 0.14/0.38 The command was "./sos". The process ID is 16379.
% 0.14/0.38
% 0.14/0.38 set(prolog_style_variables).
% 0.14/0.38 set(auto).
% 0.14/0.38 dependent: set(auto1).
% 0.14/0.38 dependent: set(process_input).
% 0.14/0.38 dependent: clear(print_kept).
% 0.14/0.38 dependent: clear(print_new_demod).
% 0.14/0.38 dependent: clear(print_back_demod).
% 0.14/0.38 dependent: clear(print_back_sub).
% 0.14/0.38 dependent: set(control_memory).
% 0.14/0.38 dependent: assign(max_mem, 12000).
% 0.14/0.38 dependent: assign(pick_given_ratio, 4).
% 0.14/0.38 dependent: assign(stats_level, 1).
% 0.14/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38 dependent: assign(sos_limit, 5000).
% 0.14/0.38 dependent: assign(max_weight, 60).
% 0.14/0.38 clear(print_given).
% 0.14/0.38
% 0.14/0.38 list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.14/0.38
% 0.14/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.38 clauses in usable.
% 0.14/0.38
% 0.14/0.38 dependent: set(knuth_bendix).
% 0.14/0.38 dependent: set(para_from).
% 0.14/0.38 dependent: set(para_into).
% 0.14/0.38 dependent: clear(para_from_right).
% 0.14/0.38 dependent: clear(para_into_right).
% 0.14/0.38 dependent: set(para_from_vars).
% 0.14/0.38 dependent: set(eq_units_both_ways).
% 0.14/0.38 dependent: set(dynamic_demod_all).
% 0.14/0.38 dependent: set(dynamic_demod).
% 0.14/0.38 dependent: set(order_eq).
% 0.14/0.38 dependent: set(back_demod).
% 0.14/0.38 dependent: set(lrpo).
% 0.14/0.38 dependent: set(hyper_res).
% 0.14/0.38 dependent: set(unit_deletion).
% 0.14/0.38 dependent: set(factor).
% 0.14/0.38
% 0.14/0.38 ------------> process usable:
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38
% 0.14/0.38 ======= end of input processing =======
% 0.20/0.42
% 0.20/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 -------------- Softie stats --------------
% 0.20/0.42
% 0.20/0.42 UPDATE_STOP: 300
% 0.20/0.42 SFINDER_TIME_LIMIT: 2
% 0.20/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.42 number of clauses in intial UL: 16
% 0.20/0.42 number of clauses initially in problem: 24
% 0.20/0.42 percentage of clauses intially in UL: 66
% 0.20/0.42 percentage of distinct symbols occuring in initial UL: 75
% 0.20/0.42 percent of all initial clauses that are short: 100
% 0.20/0.42 absolute distinct symbol count: 12
% 0.20/0.42 distinct predicate count: 4
% 0.20/0.42 distinct function count: 2
% 0.20/0.42 distinct constant count: 6
% 0.20/0.42
% 0.20/0.42 ---------- no more Softie stats ----------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 =========== start of search ===========
% 2.58/2.85
% 2.58/2.85 -------- PROOF --------
% 2.58/2.85 % SZS status Unsatisfiable
% 2.58/2.85 % SZS output start Refutation
% 2.58/2.85
% 2.58/2.85 Model 3 (0.00 seconds, 0 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on number of solutions
% 2.58/2.85
% 2.58/2.85 Model 4 (0.00 seconds, 0 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on number of solutions
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 5 [ 3 1 154 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 6 [ 1 0 161 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 7 [ 3 1 259 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 8 [ 5 1 126 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 9 [ 2 1 685 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 10 [ 6 0 1059 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 11 [ 6 0 187 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 12 [ 6 1 906 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 13 [ 1 0 145 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 14 [ 3 0 110 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 15 [ 3 1 102 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 16 [ 1 1 646 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 17 [ 2 0 106 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 18 [ 5 4 120956 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 19 [ 9 0 138 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 20 [ 10 0 717 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 Stopped by limit on insertions
% 2.58/2.85
% 2.58/2.85 Model 21 [ 12 1 148 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 ----> UNIT CONFLICT at 2.43 sec ----> 1875 [binary,1874.1,10.1] {+} $F.
% 2.58/2.85
% 2.58/2.85 Length of proof is 41. Level of proof is 11.
% 2.58/2.85
% 2.58/2.85 ---------------- PROOF ----------------
% 2.58/2.85 % SZS status Unsatisfiable
% 2.58/2.85 % SZS output start Refutation
% 2.58/2.85
% 2.58/2.85 6 [] {+} -intersection(A,B,C)| -member(D,C)|member(D,A).
% 2.58/2.85 7 [] {+} -intersection(A,B,C)| -member(D,C)|member(D,B).
% 2.58/2.85 8 [] {+} -intersection(A,B,C)| -member(D,B)| -member(D,A)|member(D,C).
% 2.58/2.85 9 [] {+} -member(h(A,B,C),C)| -member(h(A,B,C),B)| -member(h(A,B,C),A)|intersection(A,B,C).
% 2.58/2.85 10 [] {+} -intersection(aIb,c,aIbIc).
% 2.58/2.85 13 [factor,9.1.2] {+} -member(h(A,B,B),B)| -member(h(A,B,B),A)|intersection(A,B,B).
% 2.58/2.85 14 [factor,9.1.3] {+} -member(h(A,B,A),A)| -member(h(A,B,A),B)|intersection(A,B,A).
% 2.58/2.85 18 [] {+} member(h(A,B,C),C)|intersection(A,B,C)|member(h(A,B,C),A).
% 2.58/2.85 19 [] {+} member(h(A,B,C),C)|intersection(A,B,C)|member(h(A,B,C),B).
% 2.58/2.85 20 [] {+} intersection(a,b,aIb).
% 2.58/2.85 21 [] {+} intersection(b,c,bIc).
% 2.58/2.85 22 [] {+} intersection(a,bIc,aIbIc).
% 2.58/2.85 23 [factor,18.1.3] {+} member(h(A,B,A),A)|intersection(A,B,A).
% 2.58/2.85 24 [factor,19.1.3] {+} member(h(A,B,B),B)|intersection(A,B,B).
% 2.58/2.85 46 [hyper,18,7,22] {+} intersection(A,B,aIbIc)|member(h(A,B,aIbIc),A)|member(h(A,B,aIbIc),bIc).
% 2.58/2.85 47 [hyper,18,7,21] {+} intersection(A,B,bIc)|member(h(A,B,bIc),A)|member(h(A,B,bIc),c).
% 2.58/2.85 48 [hyper,18,7,20] {-} intersection(A,B,aIb)|member(h(A,B,aIb),A)|member(h(A,B,aIb),b).
% 2.58/2.85 49 [hyper,18,6,22] {-} intersection(A,B,aIbIc)|member(h(A,B,aIbIc),A)|member(h(A,B,aIbIc),a).
% 2.58/2.85 50 [hyper,18,6,21] {-} intersection(A,B,bIc)|member(h(A,B,bIc),A)|member(h(A,B,bIc),b).
% 2.58/2.85 55 [hyper,18,7,20] {-} member(h(aIb,A,B),B)|intersection(aIb,A,B)|member(h(aIb,A,B),b).
% 2.58/2.85 61 [factor,47.2.3] {-} intersection(c,A,bIc)|member(h(c,A,bIc),c).
% 2.58/2.85 62 [factor,48.2.3] {+} intersection(b,A,aIb)|member(h(b,A,aIb),b).
% 2.58/2.85 64 [factor,50.2.3] {-} intersection(b,A,bIc)|member(h(b,A,bIc),b).
% 2.58/2.85 78 [hyper,23,7,22] {-} intersection(aIbIc,A,aIbIc)|member(h(aIbIc,A,aIbIc),bIc).
% 2.58/2.85 81 [hyper,23,6,22] {-} intersection(aIbIc,A,aIbIc)|member(h(aIbIc,A,aIbIc),a).
% 2.58/2.85 99 [hyper,19,6,21] {+} intersection(A,B,bIc)|member(h(A,B,bIc),B)|member(h(A,B,bIc),b).
% 2.58/2.85 100 [hyper,19,6,20] {-} intersection(A,B,aIb)|member(h(A,B,aIb),B)|member(h(A,B,aIb),a).
% 2.58/2.85 103 [hyper,19,8,21,18,factor_simp,factor_simp] {+} member(h(c,b,A),A)|intersection(c,b,A)|member(h(c,b,A),bIc).
% 2.58/2.85 104 [hyper,19,8,20,18,factor_simp,factor_simp] {+} member(h(b,a,A),A)|intersection(b,a,A)|member(h(b,a,A),aIb).
% 2.58/2.85 119 [factor,99.2.3] {-} intersection(A,b,bIc)|member(h(A,b,bIc),b).
% 2.58/2.85 120 [factor,100.2.3] {-} intersection(A,a,aIb)|member(h(A,a,aIb),a).
% 2.58/2.85 123 [factor,103.1.3] {-} member(h(c,b,bIc),bIc)|intersection(c,b,bIc).
% 2.58/2.85 124 [factor,104.1.3] {-} member(h(b,a,aIb),aIb)|intersection(b,a,aIb).
% 2.58/2.85 402 [hyper,62,9,124,120,factor_simp,factor_simp,factor_simp] {+} intersection(b,a,aIb).
% 2.58/2.85 421 [hyper,64,13,24,factor_simp,factor_simp] {+} intersection(b,bIc,bIc).
% 2.58/2.85 444 [hyper,46,6,421] {+} intersection(A,B,aIbIc)|member(h(A,B,aIbIc),A)|member(h(A,B,aIbIc),b).
% 2.58/2.85 448 [factor,444.2.3] {-} intersection(b,A,aIbIc)|member(h(b,A,aIbIc),b).
% 2.58/2.85 537 [hyper,119,9,123,61,factor_simp,factor_simp,factor_simp] {+} intersection(c,b,bIc).
% 2.58/2.85 637 [hyper,49,7,402,factor_simp] {-} intersection(aIb,A,aIbIc)|member(h(aIb,A,aIbIc),a).
% 2.58/2.85 660 [hyper,78,14,23,factor_simp,factor_simp] {+} intersection(aIbIc,bIc,aIbIc).
% 2.58/2.85 661 [hyper,78,7,537] {-} intersection(aIbIc,A,aIbIc)|member(h(aIbIc,A,aIbIc),b).
% 2.58/2.85 1089 [hyper,448,13,24,factor_simp,factor_simp] {+} intersection(b,aIbIc,aIbIc).
% 2.58/2.85 1136 [hyper,55,6,1089,factor_simp] {-} intersection(aIb,A,aIbIc)|member(h(aIb,A,aIbIc),b).
% 2.58/2.85 1179 [hyper,661,8,402,81,factor_simp] {-} intersection(aIbIc,A,aIbIc)|member(h(aIbIc,A,aIbIc),aIb).
% 2.58/2.85 1369 [hyper,1136,8,21,19,unit_del,10,10] {-} member(h(aIb,c,aIbIc),bIc)|member(h(aIb,c,aIbIc),aIbIc).
% 2.58/2.85 1398 [hyper,1179,14,23,factor_simp,factor_simp] {+} intersection(aIbIc,aIb,aIbIc).
% 2.58/2.85 1695 [hyper,1369,8,22,637,unit_del,10,factor_simp] {-} member(h(aIb,c,aIbIc),aIbIc).
% 2.58/2.85 1700 [hyper,1369,7,660,factor_simp] {-} member(h(aIb,c,aIbIc),bIc).
% 2.58/2.85 1702 [hyper,1695,7,1398] {-} member(h(aIb,c,aIbIc),aIb).
% 2.58/2.85 1727 [hyper,1700,7,21] {-} member(h(aIb,c,aIbIc),c).
% 2.58/2.85 1874 [hyper,1727,9,1695,1702] {-} intersection(aIb,c,aIbIc).
% 2.58/2.85 1875 [binary,1874.1,10.1] {+} $F.
% 2.58/2.85
% 2.58/2.85 % SZS output end Refutation
% 2.58/2.85 ------------ end of proof -------------
% 2.58/2.85
% 2.58/2.85
% 2.58/2.85 Search stopped by max_proofs option.
% 2.58/2.85
% 2.58/2.85
% 2.58/2.85 Search stopped by max_proofs option.
% 2.58/2.85
% 2.58/2.85 ============ end of search ============
% 2.58/2.85
% 2.58/2.85 ----------- soft-scott stats ----------
% 2.58/2.85
% 2.58/2.85 true clauses given 21 (16.9%)
% 2.58/2.85 false clauses given 103
% 2.58/2.85
% 2.58/2.85 FALSE TRUE
% 2.58/2.85 5 0 4
% 2.58/2.85 9 5 30
% 2.58/2.85 10 43 31
% 2.58/2.85 11 5 6
% 2.58/2.85 12 16 4
% 2.58/2.85 13 1 16
% 2.58/2.85 14 16 57
% 2.58/2.85 15 41 142
% 2.58/2.85 16 172 194
% 2.58/2.85 17 6 0
% 2.58/2.85 18 0 2
% 2.58/2.85 19 27 32
% 2.58/2.85 20 83 197
% 2.58/2.85 21 37 64
% 2.58/2.85 22 32 25
% 2.58/2.85 23 2 1
% 2.58/2.85 24 2 6
% 2.58/2.85 25 20 10
% 2.58/2.85 26 29 73
% 2.58/2.85 27 0 3
% 2.58/2.85 28 0 2
% 2.58/2.85 29 2 2
% 2.58/2.85 30 4 2
% 2.58/2.85 31 0 2
% 2.58/2.85 32 12 22
% 2.58/2.85 35 2 6
% 2.58/2.85 37 2 2
% 2.58/2.85 38 0 3
% 2.58/2.85 tot: 559 938 (62.7% true)
% 2.58/2.85
% 2.58/2.85
% 2.58/2.85 Model 21 [ 12 1 148 ] (0.00 seconds, 250000 Inserts)
% 2.58/2.85
% 2.58/2.85 That finishes the proof of the theorem.
% 2.58/2.85
% 2.58/2.85 Process 16379 finished Sun Jul 10 12:31:03 2022
%------------------------------------------------------------------------------