TSTP Solution File: SET009-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:02 EDT 2022
% Result : Unsatisfiable 0.60s 0.78s
% Output : Refutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 08:08:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n014.cluster.edu,
% 0.13/0.36 Sun Jul 10 08:08:20 2022
% 0.13/0.36 The command was "./sos". The process ID is 11166.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 15
% 0.20/0.40 number of clauses initially in problem: 21
% 0.20/0.40 percentage of clauses intially in UL: 71
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 72
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 11
% 0.20/0.40 distinct predicate count: 4
% 0.20/0.40 distinct function count: 2
% 0.20/0.40 distinct constant count: 5
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.60/0.78
% 0.60/0.78 -------- PROOF --------
% 0.60/0.78 % SZS status Unsatisfiable
% 0.60/0.78 % SZS output start Refutation
% 0.60/0.78
% 0.60/0.78 Model 3 (0.00 seconds, 0 Inserts)
% 0.60/0.78
% 0.60/0.78 Stopped by limit on number of solutions
% 0.60/0.78
% 0.60/0.78 Model 4 (0.00 seconds, 0 Inserts)
% 0.60/0.78
% 0.60/0.78 Stopped by limit on number of solutions
% 0.60/0.78
% 0.60/0.78 Stopped by limit on insertions
% 0.60/0.78
% 0.60/0.78 Model 5 [ 2 0 157 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.78
% 0.60/0.78 Stopped by limit on insertions
% 0.60/0.78
% 0.60/0.78 Model 6 [ 3 1 110 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.78
% 0.60/0.78 Stopped by limit on insertions
% 0.60/0.78
% 0.60/0.78 Model 7 [ 5 1 1251 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.78
% 0.60/0.78 Stopped by limit on insertions
% 0.60/0.78
% 0.60/0.78 Model 8 [ 3 0 118 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.78
% 0.60/0.78 -----> EMPTY CLAUSE at 0.39 sec ----> 308 [hyper,297,7,23,19] {-} $F.
% 0.60/0.78
% 0.60/0.78 Length of proof is 5. Level of proof is 5.
% 0.60/0.78
% 0.60/0.78 ---------------- PROOF ----------------
% 0.60/0.78 % SZS status Unsatisfiable
% 0.60/0.78 % SZS output start Refutation
% 0.60/0.78
% 0.60/0.78 1 [] {+} -member(A,B)| -subset(B,C)|member(A,C).
% 0.60/0.78 2 [] {+} -member(member_of_1_not_of_2(A,B),B)|subset(A,B).
% 0.60/0.78 6 [] {+} -difference(A,B,C)| -member(D,C)|member(D,A).
% 0.60/0.78 7 [] {+} -member(A,B)| -member(A,C)| -difference(D,B,C).
% 0.60/0.78 8 [] {+} -member(A,B)| -difference(B,C,D)|member(A,D)|member(A,C).
% 0.60/0.78 11 [] {+} -subset(bDa,bDd).
% 0.60/0.78 16 [] {+} subset(A,B)|member(member_of_1_not_of_2(A,B),A).
% 0.60/0.78 18 [] {+} subset(d,a).
% 0.60/0.78 19 [] {+} difference(b,a,bDa).
% 0.60/0.78 20 [] {+} difference(b,d,bDd).
% 0.60/0.78 23 [hyper,16,11] {+} member(member_of_1_not_of_2(bDa,bDd),bDa).
% 0.60/0.78 35 [hyper,23,6,19] {-} member(member_of_1_not_of_2(bDa,bDd),b).
% 0.60/0.78 72 [hyper,35,8,20] {-} member(member_of_1_not_of_2(bDa,bDd),bDd)|member(member_of_1_not_of_2(bDa,bDd),d).
% 0.60/0.78 293 [hyper,72,2,unit_del,11] {-} member(member_of_1_not_of_2(bDa,bDd),d).
% 0.60/0.78 297 [hyper,293,1,18] {-} member(member_of_1_not_of_2(bDa,bDd),a).
% 0.60/0.78 308 [hyper,297,7,23,19] {-} $F.
% 0.60/0.78
% 0.60/0.78 % SZS output end Refutation
% 0.60/0.78 ------------ end of proof -------------
% 0.60/0.78
% 0.60/0.78
% 0.60/0.78 Search stopped by max_proofs option.
% 0.60/0.78
% 0.60/0.78
% 0.60/0.78 Search stopped by max_proofs option.
% 0.60/0.78
% 0.60/0.78 ============ end of search ============
% 0.60/0.78
% 0.60/0.78 ----------- soft-scott stats ----------
% 0.60/0.78
% 0.60/0.78 true clauses given 6 (20.0%)
% 0.60/0.78 false clauses given 24
% 0.60/0.78
% 0.60/0.78 FALSE TRUE
% 0.60/0.78 5 0 1
% 0.60/0.78 9 0 2
% 0.60/0.78 10 3 17
% 0.60/0.78 11 3 9
% 0.60/0.78 13 1 14
% 0.60/0.78 14 5 7
% 0.60/0.78 15 16 15
% 0.60/0.78 16 24 27
% 0.60/0.78 17 2 0
% 0.60/0.78 18 2 9
% 0.60/0.78 19 8 9
% 0.60/0.78 20 12 23
% 0.60/0.78 21 0 5
% 0.60/0.78 22 3 4
% 0.60/0.78 23 2 0
% 0.60/0.78 24 2 2
% 0.60/0.78 25 0 2
% 0.60/0.78 26 0 3
% 0.60/0.78 27 0 2
% 0.60/0.78 30 2 0
% 0.60/0.78 32 0 5
% 0.60/0.78 35 0 2
% 0.60/0.78 38 0 3
% 0.60/0.78 tot: 85 161 (65.4% true)
% 0.60/0.78
% 0.60/0.78
% 0.60/0.78 Model 8 [ 3 0 118 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.78
% 0.60/0.78 That finishes the proof of the theorem.
% 0.60/0.78
% 0.60/0.78 Process 11166 finished Sun Jul 10 08:08:20 2022
%------------------------------------------------------------------------------