TSTP Solution File: SET914+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET914+1 : TPTP v8.1.0. Released v3.2.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:21:46 EDT 2022
% Result : Theorem 0.40s 0.58s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET914+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n018.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 15:26:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox2 on n018.cluster.edu,
% 0.19/0.35 Sun Jul 10 15:26:42 2022
% 0.19/0.35 The command was "./sos". The process ID is 29871.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 formula_list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.19/0.35
% 0.19/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.35 clauses in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(knuth_bendix).
% 0.19/0.35 dependent: set(para_from).
% 0.19/0.35 dependent: set(para_into).
% 0.19/0.35 dependent: clear(para_from_right).
% 0.19/0.35 dependent: clear(para_into_right).
% 0.19/0.35 dependent: set(para_from_vars).
% 0.19/0.35 dependent: set(eq_units_both_ways).
% 0.19/0.35 dependent: set(dynamic_demod_all).
% 0.19/0.35 dependent: set(dynamic_demod).
% 0.19/0.35 dependent: set(order_eq).
% 0.19/0.35 dependent: set(back_demod).
% 0.19/0.35 dependent: set(lrpo).
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: set(unit_deletion).
% 0.19/0.35 dependent: set(factor).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35 Following clause subsumed by 23 during input processing: 0 [copy,23,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.19/0.35 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 0.19/0.35 Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] {-} A=A.
% 0.19/0.35
% 0.19/0.35 ======= end of input processing =======
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Failed to model usable list: disabling FINDER
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 -------------- Softie stats --------------
% 0.19/0.41
% 0.19/0.41 UPDATE_STOP: 300
% 0.19/0.41 SFINDER_TIME_LIMIT: 2
% 0.19/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.41 number of clauses in intial UL: 19
% 0.19/0.41 number of clauses initially in problem: 37
% 0.19/0.41 percentage of clauses intially in UL: 51
% 0.19/0.41 percentage of distinct symbols occuring in initial UL: 66
% 0.19/0.41 percent of all initial clauses that are short: 100
% 0.19/0.41 absolute distinct symbol count: 15
% 0.19/0.41 distinct predicate count: 4
% 0.19/0.41 distinct function count: 5
% 0.19/0.41 distinct constant count: 6
% 0.19/0.41
% 0.19/0.41 ---------- no more Softie stats ----------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 =========== start of search ===========
% 0.40/0.58
% 0.40/0.58 -------- PROOF --------
% 0.40/0.58 % SZS status Theorem
% 0.40/0.58 % SZS output start Refutation
% 0.40/0.58
% 0.40/0.58 -----> EMPTY CLAUSE at 0.20 sec ----> 2017 [hyper,265,2,135] {-} $F.
% 0.40/0.58
% 0.40/0.58 Length of proof is 3. Level of proof is 2.
% 0.40/0.58
% 0.40/0.58 ---------------- PROOF ----------------
% 0.40/0.58 % SZS status Theorem
% 0.40/0.58 % SZS output start Refutation
% 0.40/0.58
% 0.40/0.58 2 [] {+} A!=empty_set| -in(B,A).
% 0.40/0.58 5 [] {+} A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 0.40/0.58 10 [] {+} A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 0.40/0.58 12 [] {+} -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 0.40/0.58 23 [] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.40/0.58 24 [] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 0.40/0.58 33 [] {-} disjoint(unordered_pair($c5,$c4),$c3).
% 0.40/0.58 34 [] {-} in($c5,$c3).
% 0.40/0.58 35 [] {-} A=A.
% 0.40/0.58 89 [hyper,35,5,23] {-} in(A,unordered_pair(A,B)).
% 0.40/0.58 135 [hyper,33,12] {-} set_intersection2(unordered_pair($c5,$c4),$c3)=empty_set.
% 0.40/0.58 265 [hyper,89,10,24,34] {-} in($c5,set_intersection2(unordered_pair($c5,A),$c3)).
% 0.40/0.58 2017 [hyper,265,2,135] {-} $F.
% 0.40/0.58
% 0.40/0.58 % SZS output end Refutation
% 0.40/0.58 ------------ end of proof -------------
% 0.40/0.58
% 0.40/0.58
% 0.40/0.58 Search stopped by max_proofs option.
% 0.40/0.58
% 0.40/0.58
% 0.40/0.58 Search stopped by max_proofs option.
% 0.40/0.58
% 0.40/0.58 ============ end of search ============
% 0.40/0.58
% 0.40/0.58 That finishes the proof of the theorem.
% 0.40/0.58
% 0.40/0.58 Process 29871 finished Sun Jul 10 15:26:43 2022
%------------------------------------------------------------------------------