TSTP Solution File: SET102-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET102-6 : TPTP v8.1.0. Bugfixed v2.1.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:15:49 EDT 2022
% Result : Unsatisfiable 2.36s 2.52s
% Output : Refutation 2.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET102-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.04/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 10 00:16:07 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox on n004.cluster.edu,
% 0.20/0.36 Sun Jul 10 00:16:07 2022
% 0.20/0.36 The command was "./sos". The process ID is 22947.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.20/0.36
% 0.20/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.36 clauses in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(knuth_bendix).
% 0.20/0.36 dependent: set(para_from).
% 0.20/0.36 dependent: set(para_into).
% 0.20/0.36 dependent: clear(para_from_right).
% 0.20/0.36 dependent: clear(para_into_right).
% 0.20/0.36 dependent: set(para_from_vars).
% 0.20/0.36 dependent: set(eq_units_both_ways).
% 0.20/0.36 dependent: set(dynamic_demod_all).
% 0.20/0.36 dependent: set(dynamic_demod).
% 0.20/0.36 dependent: set(order_eq).
% 0.20/0.36 dependent: set(back_demod).
% 0.20/0.36 dependent: set(lrpo).
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: set(unit_deletion).
% 0.20/0.36 dependent: set(factor).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36 Following clause subsumed by 135 during input processing: 0 [copy,135,flip.1] {-} A=A.
% 0.20/0.36 135 back subsumes 61.
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.60/0.77
% 0.60/0.77 Model 1 (0.00 seconds, 0 Inserts)
% 0.60/0.77
% 0.60/0.77 Stopped by limit on number of solutions
% 0.60/0.77
% 0.60/0.77
% 0.60/0.77 -------------- Softie stats --------------
% 0.60/0.77
% 0.60/0.77 UPDATE_STOP: 300
% 0.60/0.77 SFINDER_TIME_LIMIT: 2
% 0.60/0.77 SHORT_CLAUSE_CUTOFF: 4
% 0.60/0.77 number of clauses in intial UL: 48
% 0.60/0.77 number of clauses initially in problem: 119
% 0.60/0.77 percentage of clauses intially in UL: 40
% 0.60/0.77 percentage of distinct symbols occuring in initial UL: 60
% 0.60/0.77 percent of all initial clauses that are short: 100
% 0.60/0.77 absolute distinct symbol count: 50
% 0.60/0.77 distinct predicate count: 10
% 0.60/0.77 distinct function count: 30
% 0.60/0.77 distinct constant count: 10
% 0.60/0.77
% 0.60/0.77 ---------- no more Softie stats ----------
% 0.60/0.77
% 0.60/0.77
% 0.60/0.77
% 0.60/0.77 Stopped by limit on insertions
% 0.60/0.77
% 0.60/0.77 =========== start of search ===========
% 2.36/2.52
% 2.36/2.52 -------- PROOF --------
% 2.36/2.52 % SZS status Unsatisfiable
% 2.36/2.52 % SZS output start Refutation
% 2.36/2.52
% 2.36/2.52 Stopped by limit on insertions
% 2.36/2.52
% 2.36/2.52 Model 2 [ 1 2 10806 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.52
% 2.36/2.52 Stopped by limit on insertions
% 2.36/2.52
% 2.36/2.52 Model 3 [ 3 1 8094 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.52
% 2.36/2.52 Stopped by limit on insertions
% 2.36/2.52
% 2.36/2.52 Stopped by limit on insertions
% 2.36/2.52
% 2.36/2.52 Model 4 [ 2 1 5416 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.52
% 2.36/2.52 Stopped by limit on insertions
% 2.36/2.52
% 2.36/2.52 Model 5 [ 14 2 20791 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.52
% 2.36/2.52 Stopped by limit on insertions
% 2.36/2.52
% 2.36/2.52 Model 6 [ 9 2 9911 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.52
% 2.36/2.52 Stopped by limit on insertions
% 2.36/2.52
% 2.36/2.52 Stopped by limit on insertions
% 2.36/2.52
% 2.36/2.52 Stopped by limit on insertions
% 2.36/2.52
% 2.36/2.52 Stopped by limit on insertions
% 2.36/2.52
% 2.36/2.52 ----> UNIT CONFLICT at 2.14 sec ----> 445 [binary,444.1,136.1] {-} $F.
% 2.36/2.52
% 2.36/2.52 Length of proof is 4. Level of proof is 3.
% 2.36/2.52
% 2.36/2.52 ---------------- PROOF ----------------
% 2.36/2.52 % SZS status Unsatisfiable
% 2.36/2.52 % SZS output start Refutation
% 2.36/2.52
% 2.36/2.52 8 [] {+} -member(A,universal_class)|member(A,unordered_pair(B,A)).
% 2.36/2.52 60 [] {-} -member(unordered_pair(x,singleton(y)),ordered_pair(x,y)).
% 2.36/2.52 71 [] {-} member(unordered_pair(A,B),universal_class).
% 2.36/2.52 72 [] {-} unordered_pair(A,A)=singleton(A).
% 2.36/2.52 74,73 [copy,72,flip.1] {-} singleton(A)=unordered_pair(A,A).
% 2.36/2.52 75 [] {-} unordered_pair(singleton(A),unordered_pair(A,singleton(B)))=ordered_pair(A,B).
% 2.36/2.52 76 [copy,75,demod,74,74] {-} unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B)))=ordered_pair(A,B).
% 2.36/2.52 136 [back_demod,60,demod,74] {+} -member(unordered_pair(x,unordered_pair(y,y)),ordered_pair(x,y)).
% 2.36/2.52 444 [para_from,76.1.1,8.2.2,unit_del,71] {-} member(unordered_pair(A,unordered_pair(B,B)),ordered_pair(A,B)).
% 2.36/2.52 445 [binary,444.1,136.1] {-} $F.
% 2.36/2.52
% 2.36/2.52 % SZS output end Refutation
% 2.36/2.52 ------------ end of proof -------------
% 2.36/2.52
% 2.36/2.52
% 2.36/2.52 Search stopped by max_proofs option.
% 2.36/2.52
% 2.36/2.52
% 2.36/2.52 Search stopped by max_proofs option.
% 2.36/2.52
% 2.36/2.52 ============ end of search ============
% 2.36/2.52
% 2.36/2.52 ----------- soft-scott stats ----------
% 2.36/2.52
% 2.36/2.52 true clauses given 2 (12.5%)
% 2.36/2.52 false clauses given 14
% 2.36/2.52
% 2.36/2.52 FALSE TRUE
% 2.36/2.52 3 0 1
% 2.36/2.52 5 0 12
% 2.36/2.52 6 1 2
% 2.36/2.52 7 18 9
% 2.36/2.52 8 10 18
% 2.36/2.52 9 47 4
% 2.36/2.52 10 12 24
% 2.36/2.52 11 35 19
% 2.36/2.52 12 6 4
% 2.36/2.52 13 11 25
% 2.36/2.52 14 5 1
% 2.36/2.52 15 4 7
% 2.36/2.52 16 1 2
% 2.36/2.52 17 0 4
% 2.36/2.52 18 0 2
% 2.36/2.52 19 0 1
% 2.36/2.52 20 0 1
% 2.36/2.52 22 1 0
% 2.36/2.52 23 0 1
% 2.36/2.52 24 1 0
% 2.36/2.52 tot: 152 137 (47.4% true)
% 2.36/2.52
% 2.36/2.52
% 2.36/2.52 Model 6 [ 9 -70 9911 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.52
% 2.36/2.52 That finishes the proof of the theorem.
% 2.36/2.52
% 2.36/2.52 Process 22947 finished Sun Jul 10 00:16:09 2022
%------------------------------------------------------------------------------