TSTP Solution File: SET024-4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET024-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:28 EDT 2022
% Result : Unsatisfiable 4.73s 4.93s
% Output : Refutation 4.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET024-4 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n004.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 : Sat Jul 9 20:14:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.38 ----- Otter 3.2, August 2001 -----
% 0.12/0.38 The process was started by sandbox2 on n004.cluster.edu,
% 0.12/0.38 Sat Jul 9 20:14:22 2022
% 0.12/0.38 The command was "./sos". The process ID is 27850.
% 0.12/0.38
% 0.12/0.38 set(prolog_style_variables).
% 0.12/0.38 set(auto).
% 0.12/0.38 dependent: set(auto1).
% 0.12/0.38 dependent: set(process_input).
% 0.12/0.38 dependent: clear(print_kept).
% 0.12/0.38 dependent: clear(print_new_demod).
% 0.12/0.38 dependent: clear(print_back_demod).
% 0.12/0.38 dependent: clear(print_back_sub).
% 0.12/0.38 dependent: set(control_memory).
% 0.12/0.38 dependent: assign(max_mem, 12000).
% 0.12/0.38 dependent: assign(pick_given_ratio, 4).
% 0.12/0.38 dependent: assign(stats_level, 1).
% 0.12/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.38 dependent: assign(sos_limit, 5000).
% 0.12/0.38 dependent: assign(max_weight, 60).
% 0.12/0.38 clear(print_given).
% 0.12/0.38
% 0.12/0.38 list(usable).
% 0.12/0.38
% 0.12/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.12/0.38
% 0.12/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.38 clauses in usable.
% 0.12/0.38
% 0.12/0.38 dependent: set(knuth_bendix).
% 0.12/0.38 dependent: set(para_from).
% 0.12/0.38 dependent: set(para_into).
% 0.12/0.38 dependent: clear(para_from_right).
% 0.12/0.38 dependent: clear(para_into_right).
% 0.12/0.38 dependent: set(para_from_vars).
% 0.12/0.38 dependent: set(eq_units_both_ways).
% 0.12/0.38 dependent: set(dynamic_demod_all).
% 0.12/0.38 dependent: set(dynamic_demod).
% 0.12/0.38 dependent: set(order_eq).
% 0.12/0.38 dependent: set(back_demod).
% 0.12/0.38 dependent: set(lrpo).
% 0.12/0.38 dependent: set(hyper_res).
% 0.12/0.38 dependent: set(unit_deletion).
% 0.12/0.38 dependent: set(factor).
% 0.12/0.38
% 0.12/0.38 ------------> process usable:
% 0.12/0.38
% 0.12/0.38 ------------> process sos:
% 0.12/0.38 Following clause subsumed by 229 during input processing: 0 [copy,229,flip.1] {-} A=A.
% 0.12/0.38 229 back subsumes 131.
% 0.12/0.38
% 0.12/0.38 ======= end of input processing =======
% 0.19/0.52
% 0.19/0.52 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 -------------- Softie stats --------------
% 0.19/0.52
% 0.19/0.52 UPDATE_STOP: 300
% 0.19/0.52 SFINDER_TIME_LIMIT: 2
% 0.19/0.52 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.52 number of clauses in intial UL: 107
% 0.19/0.52 number of clauses initially in problem: 209
% 0.19/0.52 percentage of clauses intially in UL: 51
% 0.19/0.52 percentage of distinct symbols occuring in initial UL: 85
% 0.19/0.52 percent of all initial clauses that are short: 100
% 0.19/0.52 absolute distinct symbol count: 74
% 0.19/0.52 distinct predicate count: 14
% 0.19/0.52 distinct function count: 53
% 0.19/0.52 distinct constant count: 7
% 0.19/0.52
% 0.19/0.52 ---------- no more Softie stats ----------
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52 =========== start of search ===========
% 4.73/4.93
% 4.73/4.93 -------- PROOF --------
% 4.73/4.93 % SZS status Unsatisfiable
% 4.73/4.93 % SZS output start Refutation
% 4.73/4.93
% 4.73/4.93 Model 3 (0.00 seconds, 0 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on number of solutions
% 4.73/4.93
% 4.73/4.93 Model 4 (0.00 seconds, 0 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on number of solutions
% 4.73/4.93
% 4.73/4.93 Model 5 (0.00 seconds, 0 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on number of solutions
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Model 6 [ 3 2 6086 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Model 7 [ 3 1 1370 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Model 8 [ 4 3 8719 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Model 9 [ 8 5 14201 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Model 10 [ 10 3 12467 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Model 11 [ 9 3 8718 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Model 12 [ 11 1 1368 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Model 13 [ 9 3 8759 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Model 14 [ 12 3 6377 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Model 15 [ 13 1 4301 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Model 16 [ 13 1 1364 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 Stopped by limit on insertions
% 4.73/4.93
% 4.73/4.93 Model 17 [ 12 4 15938 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 ----> UNIT CONFLICT at 4.53 sec ----> 1146 [binary,1145.1,230.1] {-} $F.
% 4.73/4.93
% 4.73/4.93 Length of proof is 2. Level of proof is 1.
% 4.73/4.93
% 4.73/4.93 ---------------- PROOF ----------------
% 4.73/4.93 % SZS status Unsatisfiable
% 4.73/4.93 % SZS output start Refutation
% 4.73/4.93
% 4.73/4.93 5 [] {+} member(A,non_ordered_pair(B,C))| -little_set(A)|A!=C.
% 4.73/4.93 130 [] {-} -member(a,singleton_set(a)).
% 4.73/4.93 197,196 [] {+} singleton_set(A)=non_ordered_pair(A,A).
% 4.73/4.93 228 [] {+} little_set(a).
% 4.73/4.93 229 [] {+} A=A.
% 4.73/4.93 230 [back_demod,130,demod,197] {+} -member(a,non_ordered_pair(a,a)).
% 4.73/4.93 1145 [hyper,229,5,228] {-} member(a,non_ordered_pair(A,a)).
% 4.73/4.93 1146 [binary,1145.1,230.1] {-} $F.
% 4.73/4.93
% 4.73/4.93 % SZS output end Refutation
% 4.73/4.93 ------------ end of proof -------------
% 4.73/4.93
% 4.73/4.93
% 4.73/4.93 Search stopped by max_proofs option.
% 4.73/4.93
% 4.73/4.93
% 4.73/4.93 Search stopped by max_proofs option.
% 4.73/4.93
% 4.73/4.93 ============ end of search ============
% 4.73/4.93
% 4.73/4.93 ----------- soft-scott stats ----------
% 4.73/4.93
% 4.73/4.93 true clauses given 5 (20.0%)
% 4.73/4.93 false clauses given 20
% 4.73/4.93
% 4.73/4.93 FALSE TRUE
% 4.73/4.93 3 0 5
% 4.73/4.93 4 2 7
% 4.73/4.93 5 7 16
% 4.73/4.93 6 3 12
% 4.73/4.93 7 6 21
% 4.73/4.93 8 15 35
% 4.73/4.93 9 14 36
% 4.73/4.93 10 7 29
% 4.73/4.93 11 8 33
% 4.73/4.93 12 15 71
% 4.73/4.93 13 17 39
% 4.73/4.93 14 12 39
% 4.73/4.93 15 11 24
% 4.73/4.93 16 5 24
% 4.73/4.93 17 31 19
% 4.73/4.93 18 13 13
% 4.73/4.93 19 8 11
% 4.73/4.93 20 6 22
% 4.73/4.93 21 17 24
% 4.73/4.93 22 5 29
% 4.73/4.93 23 16 7
% 4.73/4.93 24 1 14
% 4.73/4.93 25 1 7
% 4.73/4.93 26 6 12
% 4.73/4.93 27 8 12
% 4.73/4.93 28 5 10
% 4.73/4.93 29 0 8
% 4.73/4.93 30 2 4
% 4.73/4.93 31 0 3
% 4.73/4.93 32 0 4
% 4.73/4.93 33 0 4
% 4.73/4.93 34 1 1
% 4.73/4.93 36 9 0
% 4.73/4.93 37 1 1
% 4.73/4.93 38 20 1
% 4.73/4.93 40 13 1
% 4.73/4.93 41 0 2
% 4.73/4.93 42 2 0
% 4.73/4.93 43 0 1
% 4.73/4.93 44 0 3
% 4.73/4.93 45 0 2
% 4.73/4.93 47 0 1
% 4.73/4.93 52 0 4
% 4.73/4.93 55 0 4
% 4.73/4.93 56 0 1
% 4.73/4.93 tot: 287 616 (68.2% true)
% 4.73/4.93
% 4.73/4.93
% 4.73/4.93 Model 17 [ 12 4 15938 ] (0.00 seconds, 250000 Inserts)
% 4.73/4.93
% 4.73/4.93 That finishes the proof of the theorem.
% 4.73/4.93
% 4.73/4.93 Process 27850 finished Sat Jul 9 20:14:27 2022
%------------------------------------------------------------------------------