TSTP Solution File: SET024-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET024-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:27 EDT 2022
% Result : Unsatisfiable 5.17s 5.41s
% Output : Refutation 5.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET024-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 20:32:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.39 ----- Otter 3.2, August 2001 -----
% 0.18/0.39 The process was started by sandbox2 on n029.cluster.edu,
% 0.18/0.39 Sun Jul 10 20:32:16 2022
% 0.18/0.39 The command was "./sos". The process ID is 18505.
% 0.18/0.39
% 0.18/0.39 set(prolog_style_variables).
% 0.18/0.39 set(auto).
% 0.18/0.39 dependent: set(auto1).
% 0.18/0.39 dependent: set(process_input).
% 0.18/0.39 dependent: clear(print_kept).
% 0.18/0.39 dependent: clear(print_new_demod).
% 0.18/0.39 dependent: clear(print_back_demod).
% 0.18/0.39 dependent: clear(print_back_sub).
% 0.18/0.39 dependent: set(control_memory).
% 0.18/0.39 dependent: assign(max_mem, 12000).
% 0.18/0.39 dependent: assign(pick_given_ratio, 4).
% 0.18/0.39 dependent: assign(stats_level, 1).
% 0.18/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.39 dependent: assign(sos_limit, 5000).
% 0.18/0.39 dependent: assign(max_weight, 60).
% 0.18/0.39 clear(print_given).
% 0.18/0.39
% 0.18/0.39 list(usable).
% 0.18/0.39
% 0.18/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.18/0.39
% 0.18/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.18/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.39 clauses in usable.
% 0.18/0.39
% 0.18/0.39 dependent: set(knuth_bendix).
% 0.18/0.39 dependent: set(para_from).
% 0.18/0.39 dependent: set(para_into).
% 0.18/0.39 dependent: clear(para_from_right).
% 0.18/0.39 dependent: clear(para_into_right).
% 0.18/0.39 dependent: set(para_from_vars).
% 0.18/0.39 dependent: set(eq_units_both_ways).
% 0.18/0.39 dependent: set(dynamic_demod_all).
% 0.18/0.39 dependent: set(dynamic_demod).
% 0.18/0.39 dependent: set(order_eq).
% 0.18/0.39 dependent: set(back_demod).
% 0.18/0.39 dependent: set(lrpo).
% 0.18/0.39 dependent: set(hyper_res).
% 0.18/0.39 dependent: set(unit_deletion).
% 0.18/0.39 dependent: set(factor).
% 0.18/0.39
% 0.18/0.39 ------------> process usable:
% 0.18/0.39
% 0.18/0.39 ------------> process sos:
% 0.18/0.39 Following clause subsumed by 254 during input processing: 0 [copy,254,flip.1] {-} A=A.
% 0.18/0.39 254 back subsumes 183.
% 0.18/0.39 254 back subsumes 176.
% 0.18/0.39 254 back subsumes 139.
% 0.18/0.39
% 0.18/0.39 ======= end of input processing =======
% 0.35/0.54
% 0.35/0.54 Model 1 (0.00 seconds, 0 Inserts)
% 0.35/0.54
% 0.35/0.54 Stopped by limit on number of solutions
% 0.35/0.54
% 0.35/0.54
% 0.35/0.54 -------------- Softie stats --------------
% 0.35/0.54
% 0.35/0.54 UPDATE_STOP: 300
% 0.35/0.54 SFINDER_TIME_LIMIT: 2
% 0.35/0.54 SHORT_CLAUSE_CUTOFF: 4
% 0.35/0.54 number of clauses in intial UL: 111
% 0.35/0.54 number of clauses initially in problem: 227
% 0.35/0.54 percentage of clauses intially in UL: 48
% 0.35/0.54 percentage of distinct symbols occuring in initial UL: 85
% 0.35/0.54 percent of all initial clauses that are short: 100
% 0.35/0.54 absolute distinct symbol count: 74
% 0.35/0.54 distinct predicate count: 14
% 0.35/0.54 distinct function count: 53
% 0.35/0.54 distinct constant count: 7
% 0.35/0.54
% 0.35/0.54 ---------- no more Softie stats ----------
% 0.35/0.54
% 0.35/0.54
% 0.35/0.54
% 0.35/0.54 Model 2 (0.00 seconds, 0 Inserts)
% 0.35/0.54
% 0.35/0.54 Stopped by limit on number of solutions
% 0.35/0.54
% 0.35/0.54 =========== start of search ===========
% 5.17/5.41
% 5.17/5.41 -------- PROOF --------
% 5.17/5.41 % SZS status Unsatisfiable
% 5.17/5.41 % SZS output start Refutation
% 5.17/5.41
% 5.17/5.41 Model 3 (0.00 seconds, 0 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on number of solutions
% 5.17/5.41
% 5.17/5.41 Model 4 (0.00 seconds, 0 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on number of solutions
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 5 [ 2 8 21788 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 6 [ 4 1 1364 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 7 [ 4 6 30019 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 8 [ 3 5 21732 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 9 [ 8 8 37147 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 10 [ 8 4 13381 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 11 [ 10 4 11640 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 12 [ 8 4 14364 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 13 [ 8 5 20974 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 14 [ 10 7 30436 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 15 [ 11 3 14988 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 16 [ 9 4 14082 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 17 [ 9 2 4870 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 18 [ 11 7 30224 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 19 [ 12 1 1365 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 Stopped by limit on insertions
% 5.17/5.41
% 5.17/5.41 Model 20 [ 13 4 12715 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 ----> UNIT CONFLICT at 5.02 sec ----> 1220 [binary,1219.1,255.1] {-} $F.
% 5.17/5.41
% 5.17/5.41 Length of proof is 2. Level of proof is 1.
% 5.17/5.41
% 5.17/5.41 ---------------- PROOF ----------------
% 5.17/5.41 % SZS status Unsatisfiable
% 5.17/5.41 % SZS output start Refutation
% 5.17/5.41
% 5.17/5.41 5 [] {+} member(A,non_ordered_pair(B,C))| -little_set(A)|A!=C.
% 5.17/5.41 138 [] {-} -member(a,singleton_set(a)).
% 5.17/5.41 222,221 [] {+} singleton_set(A)=non_ordered_pair(A,A).
% 5.17/5.41 253 [] {+} little_set(a).
% 5.17/5.41 254 [] {+} A=A.
% 5.17/5.41 255 [back_demod,138,demod,222] {-} -member(a,non_ordered_pair(a,a)).
% 5.17/5.41 1219 [hyper,254,5,253] {-} member(a,non_ordered_pair(A,a)).
% 5.17/5.41 1220 [binary,1219.1,255.1] {-} $F.
% 5.17/5.41
% 5.17/5.41 % SZS output end Refutation
% 5.17/5.41 ------------ end of proof -------------
% 5.17/5.41
% 5.17/5.41
% 5.17/5.41 Search stopped by max_proofs option.
% 5.17/5.41
% 5.17/5.41
% 5.17/5.41 Search stopped by max_proofs option.
% 5.17/5.41
% 5.17/5.41 ============ end of search ============
% 5.17/5.41
% 5.17/5.41 ----------- soft-scott stats ----------
% 5.17/5.41
% 5.17/5.41 true clauses given 2 (8.0%)
% 5.17/5.41 false clauses given 23
% 5.17/5.41
% 5.17/5.41 FALSE TRUE
% 5.17/5.41 3 0 3
% 5.17/5.41 4 9 9
% 5.17/5.41 5 17 2
% 5.17/5.41 6 6 5
% 5.17/5.41 7 12 18
% 5.17/5.41 8 22 31
% 5.17/5.41 9 17 34
% 5.17/5.41 10 8 33
% 5.17/5.41 11 6 31
% 5.17/5.41 12 11 81
% 5.17/5.41 13 5 43
% 5.17/5.41 14 9 38
% 5.17/5.41 15 13 26
% 5.17/5.41 16 3 21
% 5.17/5.41 17 22 38
% 5.17/5.41 18 10 15
% 5.17/5.41 19 10 11
% 5.17/5.41 20 6 25
% 5.17/5.41 21 18 27
% 5.17/5.41 22 12 34
% 5.17/5.41 23 12 11
% 5.17/5.41 24 1 21
% 5.17/5.41 25 2 7
% 5.17/5.41 26 8 17
% 5.17/5.41 27 7 13
% 5.17/5.41 28 5 13
% 5.17/5.41 29 0 8
% 5.17/5.41 30 0 6
% 5.17/5.41 31 0 3
% 5.17/5.41 32 0 4
% 5.17/5.41 33 0 4
% 5.17/5.41 34 1 1
% 5.17/5.41 36 9 0
% 5.17/5.41 37 1 1
% 5.17/5.41 38 20 1
% 5.17/5.41 40 13 1
% 5.17/5.41 41 0 2
% 5.17/5.41 42 2 0
% 5.17/5.41 43 0 1
% 5.17/5.41 44 0 3
% 5.17/5.41 45 0 2
% 5.17/5.41 47 0 1
% 5.17/5.41 52 0 4
% 5.17/5.41 55 0 4
% 5.17/5.41 56 0 1
% 5.17/5.41 tot: 297 654 (68.8% true)
% 5.17/5.41
% 5.17/5.41
% 5.17/5.41 Model 20 [ 13 4 12715 ] (0.00 seconds, 250000 Inserts)
% 5.17/5.41
% 5.17/5.41 That finishes the proof of the theorem.
% 5.17/5.41
% 5.17/5.41 Process 18505 finished Sun Jul 10 20:32:21 2022
%------------------------------------------------------------------------------