TSTP Solution File: SET118-7 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET118-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:03 EDT 2022
% Result : Unsatisfiable 0.36s 0.62s
% Output : Refutation 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET118-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 9 23:24:27 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.38 ----- Otter 3.2, August 2001 -----
% 0.20/0.38 The process was started by sandbox2 on n018.cluster.edu,
% 0.20/0.38 Sat Jul 9 23:24:27 2022
% 0.20/0.38 The command was "./sos". The process ID is 8038.
% 0.20/0.38
% 0.20/0.38 set(prolog_style_variables).
% 0.20/0.38 set(auto).
% 0.20/0.38 dependent: set(auto1).
% 0.20/0.38 dependent: set(process_input).
% 0.20/0.38 dependent: clear(print_kept).
% 0.20/0.38 dependent: clear(print_new_demod).
% 0.20/0.38 dependent: clear(print_back_demod).
% 0.20/0.38 dependent: clear(print_back_sub).
% 0.20/0.38 dependent: set(control_memory).
% 0.20/0.38 dependent: assign(max_mem, 12000).
% 0.20/0.38 dependent: assign(pick_given_ratio, 4).
% 0.20/0.38 dependent: assign(stats_level, 1).
% 0.20/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.38 dependent: assign(sos_limit, 5000).
% 0.20/0.38 dependent: assign(max_weight, 60).
% 0.20/0.38 clear(print_given).
% 0.20/0.38
% 0.20/0.38 list(usable).
% 0.20/0.38
% 0.20/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.20/0.38
% 0.20/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.38 clauses in usable.
% 0.20/0.38
% 0.20/0.38 dependent: set(knuth_bendix).
% 0.20/0.38 dependent: set(para_from).
% 0.20/0.38 dependent: set(para_into).
% 0.20/0.38 dependent: clear(para_from_right).
% 0.20/0.38 dependent: clear(para_into_right).
% 0.20/0.38 dependent: set(para_from_vars).
% 0.20/0.38 dependent: set(eq_units_both_ways).
% 0.20/0.38 dependent: set(dynamic_demod_all).
% 0.20/0.38 dependent: set(dynamic_demod).
% 0.20/0.38 dependent: set(order_eq).
% 0.20/0.38 dependent: set(back_demod).
% 0.20/0.38 dependent: set(lrpo).
% 0.20/0.38 dependent: set(hyper_res).
% 0.20/0.38 dependent: set(unit_deletion).
% 0.20/0.38 dependent: set(factor).
% 0.20/0.38
% 0.20/0.38 ------------> process usable:
% 0.20/0.38
% 0.20/0.38 ------------> process sos:
% 0.20/0.38 Following clause subsumed by 111 during input processing: 0 [demod,114] {-} member(unordered_pair(A,A),universal_class).
% 0.20/0.38 Following clause subsumed by 217 during input processing: 0 [] {-} member(ordered_pair(first(A),second(A)),cross_product(universal_class,universal_class))|first(A)=A.
% 0.20/0.38 Following clause subsumed by 218 during input processing: 0 [] {-} member(ordered_pair(first(A),second(A)),cross_product(universal_class,universal_class))|second(A)=A.
% 0.20/0.38 Following clause subsumed by 219 during input processing: 0 [] {-} ordered_pair(first(A),second(A))=A|first(A)=A.
% 0.20/0.38 Following clause subsumed by 220 during input processing: 0 [] {-} ordered_pair(first(A),second(A))=A|second(A)=A.
% 0.20/0.38 Following clause subsumed by 180 during input processing: 0 [copy,180,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.20/0.38 Following clause subsumed by 222 during input processing: 0 [copy,222,flip.1] {-} A=A.
% 0.20/0.38 222 back subsumes 106.
% 0.20/0.38 222 back subsumes 98.
% 0.20/0.38 Following clause subsumed by 207 during input processing: 0 [copy,253,flip.1] {-} unordered_pair(A,B)=union(unordered_pair(A,A),unordered_pair(B,B)).
% 0.20/0.38
% 0.20/0.38 ======= end of input processing =======
% 0.36/0.61
% 0.36/0.61 Stopped by limit on insertions
% 0.36/0.61
% 0.36/0.61
% 0.36/0.61 Failed to model usable list: disabling FINDER
% 0.36/0.61
% 0.36/0.61
% 0.36/0.61
% 0.36/0.61 -------------- Softie stats --------------
% 0.36/0.61
% 0.36/0.61 UPDATE_STOP: 300
% 0.36/0.61 SFINDER_TIME_LIMIT: 2
% 0.36/0.61 SHORT_CLAUSE_CUTOFF: 4
% 0.36/0.61 number of clauses in intial UL: 72
% 0.36/0.61 number of clauses initially in problem: 187
% 0.36/0.61 percentage of clauses intially in UL: 38
% 0.36/0.61 percentage of distinct symbols occuring in initial UL: 60
% 0.36/0.61 percent of all initial clauses that are short: 100
% 0.36/0.61 absolute distinct symbol count: 51
% 0.36/0.61 distinct predicate count: 10
% 0.36/0.61 distinct function count: 32
% 0.36/0.61 distinct constant count: 9
% 0.36/0.61
% 0.36/0.61 ---------- no more Softie stats ----------
% 0.36/0.61
% 0.36/0.61
% 0.36/0.61
% 0.36/0.61 =========== start of search ===========
% 0.36/0.62
% 0.36/0.62 -------- PROOF --------
% 0.36/0.62 % SZS status Unsatisfiable
% 0.36/0.62 % SZS output start Refutation
% 0.36/0.62
% 0.36/0.62 ----> UNIT CONFLICT at 0.23 sec ----> 712 [binary,711.1,97.1] {-} $F.
% 0.36/0.62
% 0.36/0.62 Length of proof is 1. Level of proof is 1.
% 0.36/0.62
% 0.36/0.62 ---------------- PROOF ----------------
% 0.36/0.62 % SZS status Unsatisfiable
% 0.36/0.62 % SZS output start Refutation
% 0.36/0.62
% 0.36/0.62 1 [] {+} -subclass(A,B)| -member(C,A)|member(C,B).
% 0.36/0.62 97 [] {+} -member(x,universal_class).
% 0.36/0.62 110 [] {-} subclass(A,universal_class).
% 0.36/0.62 221 [] {-} member(x,cross_product(universal_class,universal_class)).
% 0.36/0.62 711 [hyper,221,1,110] {-} member(x,universal_class).
% 0.36/0.62 712 [binary,711.1,97.1] {-} $F.
% 0.36/0.62
% 0.36/0.62 % SZS output end Refutation
% 0.36/0.62 ------------ end of proof -------------
% 0.36/0.62
% 0.36/0.62
% 0.36/0.62 Search stopped by max_proofs option.
% 0.36/0.62
% 0.36/0.62
% 0.36/0.62 Search stopped by max_proofs option.
% 0.36/0.62
% 0.36/0.62 ============ end of search ============
% 0.36/0.62
% 0.36/0.62 That finishes the proof of the theorem.
% 0.36/0.62
% 0.36/0.62 Process 8038 finished Sat Jul 9 23:24:27 2022
%------------------------------------------------------------------------------