TSTP Solution File: SET117-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET117-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:16:02 EDT 2022
% Result : Unsatisfiable 9.52s 9.77s
% Output : Refutation 9.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SET117-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.08/0.09 % Command : sos-script %s
% 0.08/0.28 % Computer : n026.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Mon Jul 11 10:54:42 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.08/0.30 ----- Otter 3.2, August 2001 -----
% 0.08/0.30 The process was started by sandbox on n026.cluster.edu,
% 0.08/0.30 Mon Jul 11 10:54:42 2022
% 0.08/0.30 The command was "./sos". The process ID is 1145.
% 0.08/0.30
% 0.08/0.30 set(prolog_style_variables).
% 0.08/0.30 set(auto).
% 0.08/0.30 dependent: set(auto1).
% 0.08/0.30 dependent: set(process_input).
% 0.08/0.30 dependent: clear(print_kept).
% 0.08/0.30 dependent: clear(print_new_demod).
% 0.08/0.30 dependent: clear(print_back_demod).
% 0.08/0.30 dependent: clear(print_back_sub).
% 0.08/0.30 dependent: set(control_memory).
% 0.08/0.30 dependent: assign(max_mem, 12000).
% 0.08/0.30 dependent: assign(pick_given_ratio, 4).
% 0.08/0.30 dependent: assign(stats_level, 1).
% 0.08/0.30 dependent: assign(pick_semantic_ratio, 3).
% 0.08/0.30 dependent: assign(sos_limit, 5000).
% 0.08/0.30 dependent: assign(max_weight, 60).
% 0.08/0.30 clear(print_given).
% 0.08/0.30
% 0.08/0.30 list(usable).
% 0.08/0.30
% 0.08/0.30 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.08/0.30
% 0.08/0.30 This ia a non-Horn set with equality. The strategy will be
% 0.08/0.30 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.08/0.30 unit deletion, with positive clauses in sos and nonpositive
% 0.08/0.30 clauses in usable.
% 0.08/0.30
% 0.08/0.30 dependent: set(knuth_bendix).
% 0.08/0.30 dependent: set(para_from).
% 0.08/0.30 dependent: set(para_into).
% 0.08/0.30 dependent: clear(para_from_right).
% 0.08/0.30 dependent: clear(para_into_right).
% 0.08/0.30 dependent: set(para_from_vars).
% 0.08/0.30 dependent: set(eq_units_both_ways).
% 0.08/0.30 dependent: set(dynamic_demod_all).
% 0.08/0.30 dependent: set(dynamic_demod).
% 0.08/0.30 dependent: set(order_eq).
% 0.08/0.30 dependent: set(back_demod).
% 0.08/0.30 dependent: set(lrpo).
% 0.08/0.30 dependent: set(hyper_res).
% 0.08/0.30 dependent: set(unit_deletion).
% 0.08/0.30 dependent: set(factor).
% 0.08/0.30
% 0.08/0.30 ------------> process usable:
% 0.08/0.30
% 0.08/0.30 ------------> process sos:
% 0.08/0.30 Following clause subsumed by 137 during input processing: 0 [copy,137,flip.1] {-} A=A.
% 0.08/0.30 137 back subsumes 61.
% 0.08/0.30
% 0.08/0.30 ======= end of input processing =======
% 0.59/0.80
% 0.59/0.80 Model 1 (0.00 seconds, 0 Inserts)
% 0.59/0.80
% 0.59/0.80 Stopped by limit on number of solutions
% 0.59/0.80
% 0.59/0.80
% 0.59/0.80 -------------- Softie stats --------------
% 0.59/0.80
% 0.59/0.80 UPDATE_STOP: 300
% 0.59/0.80 SFINDER_TIME_LIMIT: 2
% 0.59/0.80 SHORT_CLAUSE_CUTOFF: 4
% 0.59/0.80 number of clauses in intial UL: 49
% 0.59/0.80 number of clauses initially in problem: 121
% 0.59/0.80 percentage of clauses intially in UL: 40
% 0.59/0.80 percentage of distinct symbols occuring in initial UL: 63
% 0.59/0.80 percent of all initial clauses that are short: 100
% 0.59/0.80 absolute distinct symbol count: 49
% 0.59/0.80 distinct predicate count: 10
% 0.59/0.80 distinct function count: 30
% 0.59/0.80 distinct constant count: 9
% 0.59/0.80
% 0.59/0.80 ---------- no more Softie stats ----------
% 0.59/0.80
% 0.59/0.80
% 0.59/0.80
% 0.59/0.80 Stopped by limit on insertions
% 0.59/0.80
% 0.59/0.80 =========== start of search ===========
% 9.52/9.77
% 9.52/9.77 -------- PROOF --------
% 9.52/9.77 % SZS status Unsatisfiable
% 9.52/9.77 % SZS output start Refutation
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Model 2 [ 1 2 5610 ] (0.00 seconds, 250000 Inserts)
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Model 3 [ 14 3 13168 ] (0.00 seconds, 250000 Inserts)
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Model 4 [ 14 2 7569 ] (0.00 seconds, 250000 Inserts)
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Model 5 [ 14 2 7807 ] (0.00 seconds, 250000 Inserts)
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Model 6 [ 36 3 8433 ] (0.00 seconds, 250000 Inserts)
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Model 7 [ 38 1 9858 ] (0.00 seconds, 250000 Inserts)
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Model 8 [ 24 1 5265 ] (0.00 seconds, 250000 Inserts)
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Stopped by limit on insertions
% 9.52/9.77
% 9.52/9.77 Model 9 [ 28 2 8328 ] (0.00 seconds, 250000 Inserts)
% 9.52/9.77
% 9.52/9.77 ----> UNIT CONFLICT at 9.43 sec ----> 1398 [binary,1397.1,60.1] {+} $F.
% 9.52/9.77
% 9.52/9.77 Length of proof is 4. Level of proof is 4.
% 9.52/9.77
% 9.52/9.77 ---------------- PROOF ----------------
% 9.52/9.77 % SZS status Unsatisfiable
% 9.52/9.77 % SZS output start Refutation
% 9.52/9.77
% 9.52/9.77 60 [] {+} -member(x,universal_class).
% 9.52/9.77 71 [] {-} member(unordered_pair(A,B),universal_class).
% 9.52/9.77 72 [] {-} unordered_pair(A,A)=singleton(A).
% 9.52/9.77 74,73 [copy,72,flip.1] {+} singleton(A)=unordered_pair(A,A).
% 9.52/9.77 75 [] {-} unordered_pair(singleton(A),unordered_pair(A,singleton(B)))=ordered_pair(A,B).
% 9.52/9.77 76 [copy,75,demod,74,74] {-} unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B)))=ordered_pair(A,B).
% 9.52/9.77 135 [] {-} ordered_pair(first(x),second(x))=x.
% 9.52/9.77 397 [para_from,76.1.1,71.1.1] {-} member(ordered_pair(A,B),universal_class).
% 9.52/9.77 1397 [para_from,135.1.1,397.1.1] {-} member(x,universal_class).
% 9.52/9.77 1398 [binary,1397.1,60.1] {+} $F.
% 9.52/9.77
% 9.52/9.77 % SZS output end Refutation
% 9.52/9.77 ------------ end of proof -------------
% 9.52/9.77
% 9.52/9.77
% 9.52/9.77 Search stopped by max_proofs option.
% 9.52/9.77
% 9.52/9.77
% 9.52/9.77 Search stopped by max_proofs option.
% 9.52/9.77
% 9.52/9.77 ============ end of search ============
% 9.52/9.77
% 9.52/9.77 ----------- soft-scott stats ----------
% 9.52/9.77
% 9.52/9.77 true clauses given 3 (7.5%)
% 9.52/9.77 false clauses given 37
% 9.52/9.77
% 9.52/9.77 FALSE TRUE
% 9.52/9.77 4 0 1
% 9.52/9.77 6 0 5
% 9.52/9.77 7 43 18
% 9.52/9.77 8 21 22
% 9.52/9.77 9 120 63
% 9.52/9.77 10 29 66
% 9.52/9.77 11 185 70
% 9.52/9.77 12 10 28
% 9.52/9.77 13 53 113
% 9.52/9.77 14 8 33
% 9.52/9.77 15 17 44
% 9.52/9.77 16 2 15
% 9.52/9.77 17 6 33
% 9.52/9.77 18 8 7
% 9.52/9.77 19 9 12
% 9.52/9.77 20 5 12
% 9.52/9.77 21 5 9
% 9.52/9.77 22 4 8
% 9.52/9.77 23 6 7
% 9.52/9.77 24 1 3
% 9.52/9.77 25 2 0
% 9.52/9.77 26 0 6
% 9.52/9.77 27 1 23
% 9.52/9.77 28 0 2
% 9.52/9.77 29 0 11
% 9.52/9.77 30 0 6
% 9.52/9.77 31 0 12
% 9.52/9.77 32 0 11
% 9.52/9.77 33 0 3
% 9.52/9.77 34 0 9
% 9.52/9.77 36 0 1
% 9.52/9.77 37 0 1
% 9.52/9.77 39 0 1
% 9.52/9.77 46 0 2
% 9.52/9.77 48 0 4
% 9.52/9.77 50 0 2
% 9.52/9.77 55 0 1
% 9.52/9.77 57 0 2
% 9.52/9.77 59 0 1
% 9.52/9.77 tot: 535 667 (55.5% true)
% 9.52/9.77
% 9.52/9.77
% 9.52/9.77 Model 9 [ 28 2 8328 ] (0.00 seconds, 250000 Inserts)
% 9.52/9.77
% 9.52/9.77 That finishes the proof of the theorem.
% 9.52/9.77
% 9.52/9.77 Process 1145 finished Mon Jul 11 10:54:51 2022
%------------------------------------------------------------------------------