TSTP Solution File: SET506-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET506-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:18:32 EDT 2022
% Result : Unsatisfiable 0.91s 1.11s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET506-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n025.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 09:55:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n025.cluster.edu,
% 0.12/0.35 Sun Jul 10 09:55:01 2022
% 0.12/0.35 The command was "./sos". The process ID is 12345.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 164 during input processing: 0 [copy,164,flip.1] {-} A=A.
% 0.12/0.35 164 back subsumes 73.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.62/0.81
% 0.62/0.81 Stopped by limit on insertions
% 0.62/0.81
% 0.62/0.81
% 0.62/0.81 Failed to model usable list: disabling FINDER
% 0.62/0.81
% 0.62/0.81
% 0.62/0.81
% 0.62/0.81 -------------- Softie stats --------------
% 0.62/0.81
% 0.62/0.81 UPDATE_STOP: 300
% 0.62/0.81 SFINDER_TIME_LIMIT: 2
% 0.62/0.81 SHORT_CLAUSE_CUTOFF: 4
% 0.62/0.81 number of clauses in intial UL: 44
% 0.62/0.81 number of clauses initially in problem: 145
% 0.62/0.81 percentage of clauses intially in UL: 30
% 0.62/0.81 percentage of distinct symbols occuring in initial UL: 59
% 0.62/0.81 percent of all initial clauses that are short: 100
% 0.62/0.81 absolute distinct symbol count: 57
% 0.62/0.81 distinct predicate count: 11
% 0.62/0.81 distinct function count: 34
% 0.62/0.81 distinct constant count: 12
% 0.62/0.81
% 0.62/0.81 ---------- no more Softie stats ----------
% 0.62/0.81
% 0.62/0.81
% 0.62/0.81
% 0.62/0.81 =========== start of search ===========
% 0.74/0.95
% 0.74/0.95
% 0.74/0.95 Changing weight limit from 60 to 48.
% 0.74/0.95
% 0.74/0.95 Resetting weight limit to 48 after 100 givens.
% 0.74/0.95
% 0.74/0.99
% 0.74/0.99
% 0.74/0.99 Changing weight limit from 48 to 24.
% 0.74/0.99
% 0.74/0.99 Resetting weight limit to 24 after 105 givens.
% 0.74/0.99
% 0.74/1.01
% 0.74/1.01
% 0.74/1.01 Changing weight limit from 24 to 22.
% 0.74/1.01
% 0.74/1.01 Resetting weight limit to 22 after 110 givens.
% 0.74/1.01
% 0.84/1.02
% 0.84/1.02
% 0.84/1.02 Changing weight limit from 22 to 21.
% 0.84/1.02
% 0.84/1.02 Resetting weight limit to 21 after 115 givens.
% 0.84/1.02
% 0.84/1.06
% 0.84/1.06
% 0.84/1.06 Changing weight limit from 21 to 17.
% 0.84/1.06
% 0.84/1.06 Resetting weight limit to 17 after 120 givens.
% 0.84/1.06
% 0.91/1.11
% 0.91/1.11
% 0.91/1.11 Changing weight limit from 17 to 15.
% 0.91/1.11
% 0.91/1.11 Resetting weight limit to 15 after 130 givens.
% 0.91/1.11
% 0.91/1.11
% 0.91/1.11 -------- PROOF --------
% 0.91/1.11 % SZS status Unsatisfiable
% 0.91/1.11 % SZS output start Refutation
% 0.91/1.11
% 0.91/1.11 -----> EMPTY CLAUSE at 0.73 sec ----> 6810 [hyper,6801,5638,6034] {-} $F.
% 0.91/1.11
% 0.91/1.11 Length of proof is 22. Level of proof is 10.
% 0.91/1.11
% 0.91/1.11 ---------------- PROOF ----------------
% 0.91/1.11 % SZS status Unsatisfiable
% 0.91/1.11 % SZS output start Refutation
% 0.91/1.11
% 0.91/1.11 1 [] {+} -subclass(A,B)| -member(C,A)|member(C,B).
% 0.91/1.11 2 [] {+} -member(not_subclass_element(A,B),B)|subclass(A,B).
% 0.91/1.11 4 [] {+} A!=B|subclass(B,A).
% 0.91/1.11 5 [] {+} -subclass(A,B)| -subclass(B,A)|A=B.
% 0.91/1.11 13 [] {+} -member(ordered_pair(A,B),element_relation)|member(A,B).
% 0.91/1.11 15 [] {+} -member(A,intersection(B,C))|member(A,B).
% 0.91/1.11 17 [] {+} -member(A,B)| -member(A,C)|member(A,intersection(B,C)).
% 0.91/1.11 18 [] {+} -member(A,complement(B))| -member(A,B).
% 0.91/1.11 64 [] {+} -member(ordered_pair(A,B),domain_relation)|domain_of(A)=B.
% 0.91/1.11 81 [] {-} member(not_subclass_element(A,B),A)|subclass(A,B).
% 0.91/1.11 82 [] {-} subclass(A,universal_class).
% 0.91/1.11 83 [] {-} member(unordered_pair(A,B),universal_class).
% 0.91/1.11 84 [] {-} unordered_pair(A,A)=singleton(A).
% 0.91/1.11 86,85 [copy,84,flip.1] {-} singleton(A)=unordered_pair(A,A).
% 0.91/1.11 87 [] {-} unordered_pair(singleton(A),unordered_pair(A,singleton(B)))=ordered_pair(A,B).
% 0.91/1.11 88 [copy,87,demod,86,86] {-} unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B)))=ordered_pair(A,B).
% 0.91/1.11 130 [] {-} A=null_class|member(regular(A),A).
% 0.91/1.11 131 [] {-} A=null_class|intersection(A,regular(A))=null_class.
% 0.91/1.11 163,162 [] {-} universal_class=null_class.
% 0.91/1.11 164 [] {-} A=A.
% 0.91/1.11 217 [back_demod,83,demod,163] {-} member(unordered_pair(A,B),null_class).
% 0.91/1.11 218 [back_demod,82,demod,163] {-} subclass(A,null_class).
% 0.91/1.11 253 [para_into,162.1.1,5.3.1,demod,163,163,unit_del,218] {-} A=null_class| -subclass(null_class,A).
% 0.91/1.11 254 [hyper,164,4] {-} subclass(A,A).
% 0.91/1.11 421 [para_into,217.1.1,88.1.1] {-} member(ordered_pair(A,B),null_class).
% 0.91/1.11 757 [para_from,253.1.1,64.1.2,unit_del,421] {-} domain_of(A)=B| -subclass(null_class,domain_relation).
% 0.91/1.11 812 [para_from,253.1.1,13.1.2,unit_del,421] {-} member(A,B)| -subclass(null_class,element_relation).
% 0.91/1.11 1128 [para_from,130.1.1,812.2.2,unit_del,254,factor_simp] {-} member(regular(element_relation),element_relation).
% 0.91/1.11 1174 [hyper,1128,1,218] {-} member(regular(element_relation),null_class).
% 0.91/1.11 1194 [hyper,1174,17,1128] {-} member(regular(element_relation),intersection(null_class,element_relation)).
% 0.91/1.11 5531 [para_into,757.1.1,757.1.1,factor_simp] {-} A=B| -subclass(null_class,domain_relation).
% 0.91/1.11 5544 [para_into,5531.2.2,131.1.1,unit_del,254,factor_simp] {-} intersection(domain_relation,regular(domain_relation))=null_class.
% 0.91/1.11 5638 [para_from,5531.1.1,18.1.2,factor_simp] {-} -member(A,B)| -subclass(null_class,domain_relation).
% 0.91/1.11 5639 [para_from,5531.1.1,812.2.2,factor_simp] {-} member(A,B)| -subclass(null_class,domain_relation).
% 0.91/1.11 5714 [para_from,5544.1.1,15.1.2] {-} -member(A,null_class)|member(A,domain_relation).
% 0.91/1.11 5778 [hyper,5638,1194,81] {-} member(not_subclass_element(null_class,domain_relation),null_class).
% 0.91/1.11 5933 [para_into,5639.2.2,130.1.1,unit_del,254,factor_simp] {-} member(regular(domain_relation),domain_relation).
% 0.91/1.11 6034 [hyper,5933,1,218] {-} member(regular(domain_relation),null_class).
% 0.91/1.11 6243 [hyper,5714,5778] {-} member(not_subclass_element(null_class,domain_relation),domain_relation).
% 0.91/1.11 6801 [hyper,6243,2] {-} subclass(null_class,domain_relation).
% 0.91/1.11 6810 [hyper,6801,5638,6034] {-} $F.
% 0.91/1.11
% 0.91/1.11 % SZS output end Refutation
% 0.91/1.11 ------------ end of proof -------------
% 0.91/1.11
% 0.91/1.11
% 0.91/1.11 Search stopped by max_proofs option.
% 0.91/1.11
% 0.91/1.11
% 0.91/1.11 Search stopped by max_proofs option.
% 0.91/1.11
% 0.91/1.11 ============ end of search ============
% 0.91/1.11
% 0.91/1.11 That finishes the proof of the theorem.
% 0.91/1.11
% 0.91/1.11 Process 12345 finished Sun Jul 10 09:55:02 2022
%------------------------------------------------------------------------------