TSTP Solution File: SET084-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET084-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:15:32 EDT 2022
% Result : Unsatisfiable 5.23s 5.45s
% Output : Refutation 5.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET084-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/0.12 % Command : sos-script %s
% 0.13/0.34 % Computer : n023.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 17:23:40 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 sandbox on n023.cluster.edu,
% 0.13/0.36 Sun Jul 10 17:23:40 2022
% 0.13/0.36 The command was "./sos". The process ID is 2880.
% 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=5.
% 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 Following clause subsumed by 140 during input processing: 0 [copy,140,flip.1] {-} A=A.
% 0.13/0.36 140 back subsumes 62.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.37/0.61
% 0.37/0.61 Model 1 (0.00 seconds, 0 Inserts)
% 0.37/0.61
% 0.37/0.61 Stopped by limit on number of solutions
% 0.37/0.61
% 0.37/0.61
% 0.37/0.61 -------------- Softie stats --------------
% 0.37/0.61
% 0.37/0.61 UPDATE_STOP: 300
% 0.37/0.61 SFINDER_TIME_LIMIT: 2
% 0.37/0.61 SHORT_CLAUSE_CUTOFF: 4
% 0.37/0.61 number of clauses in intial UL: 49
% 0.37/0.61 number of clauses initially in problem: 122
% 0.37/0.61 percentage of clauses intially in UL: 40
% 0.37/0.61 percentage of distinct symbols occuring in initial UL: 64
% 0.37/0.61 percent of all initial clauses that are short: 100
% 0.37/0.61 absolute distinct symbol count: 50
% 0.37/0.61 distinct predicate count: 10
% 0.37/0.61 distinct function count: 30
% 0.37/0.61 distinct constant count: 10
% 0.37/0.61
% 0.37/0.61 ---------- no more Softie stats ----------
% 0.37/0.61
% 0.37/0.61
% 0.37/0.61
% 0.37/0.61 Stopped by limit on insertions
% 0.37/0.61
% 0.37/0.61 =========== start of search ===========
% 5.23/5.45
% 5.23/5.45 -------- PROOF --------
% 5.23/5.45 % SZS status Unsatisfiable
% 5.23/5.45 % SZS output start Refutation
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Model 2 [ 1 1 2442 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Model 3 [ 2 1 6107 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Model 4 [ 1 1 5954 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Model 5 [ 5 1 9651 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Model 6 [ 15 1 2977 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Model 7 [ 16 1 3126 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Model 8 [ 8 2 26646 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Model 9 [ 5 1 9819 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Model 10 [ 27 2 16911 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Model 11 [ 18 2 15390 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Model 12 [ 33 1 713 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 Model 13 [ 16 1 6126 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 Stopped by limit on insertions
% 5.23/5.45
% 5.23/5.45 ----> UNIT CONFLICT at 5.05 sec ----> 922 [binary,920.1,61.1] {-} $F.
% 5.23/5.45
% 5.23/5.45 Length of proof is 6. Level of proof is 4.
% 5.23/5.45
% 5.23/5.45 ---------------- PROOF ----------------
% 5.23/5.45 % SZS status Unsatisfiable
% 5.23/5.45 % SZS output start Refutation
% 5.23/5.45
% 5.23/5.45 6 [] {+} -member(A,unordered_pair(B,C))|A=B|A=C.
% 5.23/5.45 8 [] {+} -member(A,universal_class)|member(A,unordered_pair(B,A)).
% 5.23/5.45 60 [] {-} x!=y.
% 5.23/5.45 61 [copy,60,flip.1] {+} y!=x.
% 5.23/5.45 63 [factor,6.2.3] {+} -member(A,unordered_pair(B,B))|A=B.
% 5.23/5.45 73 [] {-} unordered_pair(A,A)=singleton(A).
% 5.23/5.45 75,74 [copy,73,flip.1] {+} singleton(A)=unordered_pair(A,A).
% 5.23/5.45 136 [] {-} singleton(x)=singleton(y).
% 5.23/5.45 137 [copy,136,demod,75,75,flip.1] {-} unordered_pair(y,y)=unordered_pair(x,x).
% 5.23/5.45 139 [] {+} member(y,universal_class).
% 5.23/5.45 907 [para_from,137.1.1,8.2.2,unit_del,139] {-} member(y,unordered_pair(x,x)).
% 5.23/5.45 920 [hyper,907,63] {-} y=x.
% 5.23/5.45 922 [binary,920.1,61.1] {-} $F.
% 5.23/5.45
% 5.23/5.45 % SZS output end Refutation
% 5.23/5.45 ------------ end of proof -------------
% 5.23/5.45
% 5.23/5.45
% 5.23/5.45 Search stopped by max_proofs option.
% 5.23/5.45
% 5.23/5.45
% 5.23/5.45 Search stopped by max_proofs option.
% 5.23/5.45
% 5.23/5.45 ============ end of search ============
% 5.23/5.45
% 5.23/5.45 ----------- soft-scott stats ----------
% 5.23/5.45
% 5.23/5.45 true clauses given 3 (10.3%)
% 5.23/5.45 false clauses given 26
% 5.23/5.45
% 5.23/5.45 FALSE TRUE
% 5.23/5.45 5 0 14
% 5.23/5.45 6 0 5
% 5.23/5.45 7 11 36
% 5.23/5.45 8 7 33
% 5.23/5.45 9 33 56
% 5.23/5.45 10 6 48
% 5.23/5.45 11 33 61
% 5.23/5.45 12 10 23
% 5.23/5.45 13 26 57
% 5.23/5.45 14 11 22
% 5.23/5.45 15 15 30
% 5.23/5.45 16 10 5
% 5.23/5.45 17 7 25
% 5.23/5.45 18 8 5
% 5.23/5.45 19 7 8
% 5.23/5.45 20 10 1
% 5.23/5.45 21 9 5
% 5.23/5.45 22 7 3
% 5.23/5.45 23 10 3
% 5.23/5.45 24 1 3
% 5.23/5.45 25 2 0
% 5.23/5.45 26 6 0
% 5.23/5.45 27 1 23
% 5.23/5.45 28 0 2
% 5.23/5.45 29 1 10
% 5.23/5.45 30 0 6
% 5.23/5.45 31 2 10
% 5.23/5.45 32 0 11
% 5.23/5.45 33 0 3
% 5.23/5.45 34 0 9
% 5.23/5.45 36 0 1
% 5.23/5.45 37 0 1
% 5.23/5.45 39 0 1
% 5.23/5.45 46 0 2
% 5.23/5.45 48 0 4
% 5.23/5.45 50 0 2
% 5.23/5.45 55 0 1
% 5.23/5.45 57 0 2
% 5.23/5.45 59 0 1
% 5.23/5.45 tot: 233 532 (69.5% true)
% 5.23/5.45
% 5.23/5.45
% 5.23/5.45 Model 13 [ 16 -41 6126 ] (0.00 seconds, 250000 Inserts)
% 5.23/5.45
% 5.23/5.45 That finishes the proof of the theorem.
% 5.23/5.45
% 5.23/5.45 Process 2880 finished Sun Jul 10 17:23:45 2022
%------------------------------------------------------------------------------