%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET901+1 : TPTP v8.1.0. Released v3.2.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:21:40 EDT 2022
% Result : Theorem 1.18s 1.43s
% Output : Refutation 1.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET901+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % 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 13:49:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n009.cluster.edu,
% 0.12/0.35 Sun Jul 10 13:49:07 2022
% 0.12/0.35 The command was "./sos". The process ID is 27456.
% 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 formula_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 16 during input processing: 0 [copy,16,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.12/0.35 Following clause subsumed by 22 during input processing: 0 [copy,22,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.38
% 0.18/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 11
% 0.18/0.38 number of clauses initially in problem: 17
% 0.18/0.38 percentage of clauses intially in UL: 64
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 90
% 0.18/0.38 percent of all initial clauses that are short: 100
% 0.18/0.38 absolute distinct symbol count: 11
% 0.18/0.38 distinct predicate count: 3
% 0.18/0.38 distinct function count: 2
% 0.18/0.38 distinct constant count: 6
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 1.18/1.43
% 1.18/1.43 -------- PROOF --------
% 1.18/1.43 % SZS status Theorem
% 1.18/1.43 % SZS output start Refutation
% 1.18/1.43
% 1.18/1.43 Model 2 (0.00 seconds, 0 Inserts)
% 1.18/1.43
% 1.18/1.43 Stopped by limit on number of solutions
% 1.18/1.43
% 1.18/1.43 Model 3 (0.00 seconds, 0 Inserts)
% 1.18/1.43
% 1.18/1.43 Stopped by limit on number of solutions
% 1.18/1.43
% 1.18/1.43 Model 4 (0.00 seconds, 0 Inserts)
% 1.18/1.43
% 1.18/1.43 Stopped by limit on number of solutions
% 1.18/1.43
% 1.18/1.43 -----> EMPTY CLAUSE at 1.05 sec ----> 2007 [back_demod,35,demod,1987,unit_del,1670,22] {-} $F.
% 1.18/1.43
% 1.18/1.43 Length of proof is 19. Level of proof is 10.
% 1.18/1.43
% 1.18/1.43 ---------------- PROOF ----------------
% 1.18/1.43 % SZS status Theorem
% 1.18/1.43 % SZS output start Refutation
% 1.18/1.43
% 1.18/1.43 2 [] {-} -subset($c5,unordered_pair($c4,$c3))|$c5!=empty_set.
% 1.18/1.43 3 [copy,2,flip.2] {+} -subset($c5,unordered_pair($c4,$c3))|empty_set!=$c5.
% 1.18/1.43 4 [] {-} -subset($c5,unordered_pair($c4,$c3))|$c5!=singleton($c4).
% 1.18/1.43 5 [copy,4,flip.2] {+} -subset($c5,unordered_pair($c4,$c3))|singleton($c4)!=$c5.
% 1.18/1.43 6 [] {-} -subset($c5,unordered_pair($c4,$c3))|$c5!=singleton($c3).
% 1.18/1.43 7 [copy,6,flip.2] {+} -subset($c5,unordered_pair($c4,$c3))|singleton($c3)!=$c5.
% 1.18/1.43 8 [] {-} -subset($c5,unordered_pair($c4,$c3))|$c5!=unordered_pair($c4,$c3).
% 1.18/1.43 9 [copy,8,flip.2] {+} -subset($c5,unordered_pair($c4,$c3))|unordered_pair($c4,$c3)!=$c5.
% 1.18/1.43 10 [] {+} -subset(A,unordered_pair(B,C))|A=empty_set|A=singleton(B)|A=singleton(C)|A=unordered_pair(B,C).
% 1.18/1.43 11 [] {+} subset(A,unordered_pair(B,C))|A!=empty_set.
% 1.18/1.43 12 [] {+} subset(A,unordered_pair(B,C))|A!=singleton(B).
% 1.18/1.43 13 [] {+} subset(A,unordered_pair(B,C))|A!=singleton(C).
% 1.18/1.43 14 [] {+} subset(A,unordered_pair(B,C))|A!=unordered_pair(B,C).
% 1.18/1.43 16 [] {+} unordered_pair(A,B)=unordered_pair(B,A).
% 1.18/1.43 20 [] {-} subset($c5,unordered_pair($c4,$c3))|$c5=empty_set|$c5=singleton($c4)|$c5=singleton($c3)|$c5=unordered_pair($c4,$c3).
% 1.18/1.43 21 [copy,20,flip.2,flip.3,flip.4,flip.5] {-} subset($c5,unordered_pair($c4,$c3))|empty_set=$c5|singleton($c4)=$c5|singleton($c3)=$c5|unordered_pair($c4,$c3)=$c5.
% 1.18/1.43 22 [] {+} A=A.
% 1.18/1.43 23 [hyper,16,14] {+} subset(unordered_pair(A,B),unordered_pair(B,A)).
% 1.18/1.43 35 [para_from,16.1.1,7.1.2] {+} -subset($c5,unordered_pair($c3,$c4))|singleton($c3)!=$c5.
% 1.18/1.43 57 [hyper,21,10,factor_simp,factor_simp,factor_simp,factor_simp] {-} empty_set=$c5|singleton($c4)=$c5|singleton($c3)=$c5|unordered_pair($c4,$c3)=$c5.
% 1.18/1.43 125 [para_from,57.4.1,23.1.1] {-} subset($c5,unordered_pair($c3,$c4))|empty_set=$c5|singleton($c4)=$c5|singleton($c3)=$c5.
% 1.18/1.43 201 [hyper,22,13] {+} subset(singleton(A),unordered_pair(B,A)).
% 1.18/1.43 202 [hyper,22,12] {+} subset(singleton(A),unordered_pair(A,B)).
% 1.18/1.43 203 [hyper,22,11] {+} subset(empty_set,unordered_pair(A,B)).
% 1.18/1.43 1230 [para_from,125.3.1,201.1.1,factor_simp] {-} subset($c5,unordered_pair($c3,$c4))|empty_set=$c5|singleton($c3)=$c5.
% 1.18/1.43 1631 [para_from,1230.3.1,202.1.1,factor_simp] {-} subset($c5,unordered_pair($c3,$c4))|empty_set=$c5.
% 1.18/1.43 1670 [para_from,1631.2.1,203.1.1,factor_simp] {-} subset($c5,unordered_pair($c3,$c4)).
% 1.18/1.43 1696 [para_into,1670.1.2,16.1.1] {-} subset($c5,unordered_pair($c4,$c3)).
% 1.18/1.43 1704 [hyper,1696,9,57] {-} empty_set=$c5|singleton($c4)=$c5|singleton($c3)=$c5.
% 1.18/1.43 1984 [hyper,1704,5,1696] {-} empty_set=$c5|singleton($c3)=$c5.
% 1.18/1.43 1987,1986 [hyper,1984,3,1696] {-} singleton($c3)=$c5.
% 1.18/1.43 2007 [back_demod,35,demod,1987,unit_del,1670,22] {-} $F.
% 1.18/1.43
% 1.18/1.43 % SZS output end Refutation
% 1.18/1.43 ------------ end of proof -------------
% 1.18/1.43
% 1.18/1.43
% 1.18/1.43 Search stopped by max_proofs option.
% 1.18/1.43
% 1.18/1.43
% 1.18/1.43 Search stopped by max_proofs option.
% 1.18/1.43
% 1.18/1.43 ============ end of search ============
% 1.18/1.43
% 1.18/1.43 ----------- soft-scott stats ----------
% 1.18/1.43
% 1.18/1.43 true clauses given 11 (33.3%)
% 1.18/1.43 false clauses given 22
% 1.18/1.43
% 1.18/1.43 FALSE TRUE
% 1.18/1.43 7 1 0
% 1.18/1.43 8 1 1
% 1.18/1.43 9 0 2
% 1.18/1.43 10 0 3
% 1.18/1.43 16 8 6
% 1.18/1.43 19 10 6
% 1.18/1.43 20 0 3
% 1.18/1.43 21 0 1
% 1.18/1.43 22 0 4
% 1.18/1.43 23 20 23
% 1.18/1.43 24 0 19
% 1.18/1.43 25 0 27
% 1.18/1.43 26 0 14
% 1.18/1.43 27 0 40
% 1.18/1.43 28 0 19
% 1.18/1.43 29 12 32
% 1.18/1.43 30 0 28
% 1.18/1.43 31 0 45
% 1.18/1.43 32 0 21
% 1.18/1.43 33 8 38
% 1.18/1.43 34 0 17
% 1.18/1.43 35 0 12
% 1.18/1.43 36 0 20
% 1.18/1.43 37 0 2
% 1.18/1.43 38 0 65
% 1.18/1.43 39 0 9
% 1.18/1.43 41 0 10
% 1.18/1.43 42 0 19
% 1.18/1.43 43 0 66
% 1.18/1.43 44 0 130
% 1.18/1.43 45 0 8
% 1.18/1.43 46 0 4
% 1.18/1.43 47 0 4
% 1.18/1.43 48 0 5
% 1.18/1.43 49 0 110
% 1.18/1.43 50 0 46
% 1.18/1.43 51 0 2
% 1.18/1.43 52 0 4
% 1.18/1.43 55 0 39
% 1.18/1.43 57 0 1
% 1.18/1.43 tot: 60 905 (93.8% true)
% 1.18/1.43
% 1.18/1.43
% 1.18/1.43 Model 4 (0.00 seconds, 0 Inserts)
% 1.18/1.43
% 1.18/1.43 That finishes the proof of the theorem.
% 1.18/1.43
% 1.18/1.43 Process 27456 finished Sun Jul 10 13:49:08 2022
%------------------------------------------------------------------------------