TSTP Solution File: SET102-7 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET102-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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 0.74s 0.97s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET102-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n009.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 12:28:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n009.cluster.edu,
% 0.12/0.36 Sun Jul 10 12:28:07 2022
% 0.12/0.36 The command was "./sos". The process ID is 20226.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 105 during input processing: 0 [demod,108] {-} member(unordered_pair(A,A),universal_class).
% 0.12/0.36 Following clause subsumed by 174 during input processing: 0 [copy,174,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.12/0.36 Following clause subsumed by 203 during input processing: 0 [copy,203,flip.1] {-} A=A.
% 0.12/0.36 203 back subsumes 100.
% 0.12/0.36 203 back subsumes 92.
% 0.12/0.36 Following clause subsumed by 201 during input processing: 0 [copy,234,flip.1] {-} unordered_pair(A,B)=union(unordered_pair(A,A),unordered_pair(B,B)).
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.74/0.97
% 0.74/0.97 Stopped by limit on insertions
% 0.74/0.97
% 0.74/0.97
% 0.74/0.97 Failed to model usable list: disabling FINDER
% 0.74/0.97
% 0.74/0.97
% 0.74/0.97
% 0.74/0.97 -------------- Softie stats --------------
% 0.74/0.97
% 0.74/0.97 UPDATE_STOP: 300
% 0.74/0.97 SFINDER_TIME_LIMIT: 2
% 0.74/0.97 SHORT_CLAUSE_CUTOFF: 4
% 0.74/0.97 number of clauses in intial UL: 66
% 0.74/0.97 number of clauses initially in problem: 171
% 0.74/0.97 percentage of clauses intially in UL: 38
% 0.74/0.97 percentage of distinct symbols occuring in initial UL: 57
% 0.74/0.97 percent of all initial clauses that are short: 100
% 0.74/0.97 absolute distinct symbol count: 52
% 0.74/0.97 distinct predicate count: 10
% 0.74/0.97 distinct function count: 32
% 0.74/0.97 distinct constant count: 10
% 0.74/0.97
% 0.74/0.97 ---------- no more Softie stats ----------
% 0.74/0.97
% 0.74/0.97
% 0.74/0.97
% 0.74/0.97 =========== start of search ===========
% 0.74/0.97
% 0.74/0.97 -------- PROOF --------
% 0.74/0.97 % SZS status Unsatisfiable
% 0.74/0.97 % SZS output start Refutation
% 0.74/0.97
% 0.74/0.97 ----> UNIT CONFLICT at 0.59 sec ----> 497 [binary,496.1,205.1] {-} $F.
% 0.74/0.97
% 0.74/0.97 Length of proof is 4. Level of proof is 3.
% 0.74/0.97
% 0.74/0.97 ---------------- PROOF ----------------
% 0.74/0.97 % SZS status Unsatisfiable
% 0.74/0.97 % SZS output start Refutation
% 0.74/0.97
% 0.74/0.97 8 [] {+} -member(A,universal_class)|member(A,unordered_pair(B,A)).
% 0.74/0.97 91 [] {-} -member(unordered_pair(x,singleton(y)),ordered_pair(x,y)).
% 0.74/0.97 105 [] {-} member(unordered_pair(A,B),universal_class).
% 0.74/0.97 106 [] {-} unordered_pair(A,A)=singleton(A).
% 0.74/0.97 108,107 [copy,106,flip.1] {-} singleton(A)=unordered_pair(A,A).
% 0.74/0.97 109 [] {-} unordered_pair(singleton(A),unordered_pair(A,singleton(B)))=ordered_pair(A,B).
% 0.74/0.97 110 [copy,109,demod,108,108] {-} unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B)))=ordered_pair(A,B).
% 0.74/0.97 205 [back_demod,91,demod,108] {-} -member(unordered_pair(x,unordered_pair(y,y)),ordered_pair(x,y)).
% 0.74/0.97 496 [para_from,110.1.1,8.2.2,unit_del,105] {-} member(unordered_pair(A,unordered_pair(B,B)),ordered_pair(A,B)).
% 0.74/0.97 497 [binary,496.1,205.1] {-} $F.
% 0.74/0.97
% 0.74/0.97 % SZS output end Refutation
% 0.74/0.97 ------------ end of proof -------------
% 0.74/0.97
% 0.74/0.97
% 0.74/0.97 Search stopped by max_proofs option.
% 0.74/0.97
% 0.74/0.97
% 0.74/0.97 Search stopped by max_proofs option.
% 0.74/0.97
% 0.74/0.97 ============ end of search ============
% 0.74/0.97
% 0.74/0.97 That finishes the proof of the theorem.
% 0.74/0.97
% 0.74/0.97 Process 20226 finished Sun Jul 10 12:28:07 2022
%------------------------------------------------------------------------------