%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET932+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:57 EDT 2022
% Result : Theorem 0.79s 1.00s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET932+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 05:10:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n004.cluster.edu,
% 0.13/0.36 Mon Jul 11 05:10:52 2022
% 0.13/0.36 The command was "./sos". The process ID is 27575.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 10
% 0.20/0.39 number of clauses initially in problem: 16
% 0.20/0.39 percentage of clauses intially in UL: 62
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 90
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 11
% 0.20/0.39 distinct predicate count: 4
% 0.20/0.39 distinct function count: 3
% 0.20/0.39 distinct constant count: 4
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 0.79/1.00
% 0.79/1.00 -------- PROOF --------
% 0.79/1.00 % SZS status Theorem
% 0.79/1.00 % SZS output start Refutation
% 0.79/1.00
% 0.79/1.00 Model 2 (0.00 seconds, 0 Inserts)
% 0.79/1.00
% 0.79/1.00 Stopped by limit on number of solutions
% 0.79/1.00
% 0.79/1.00 Model 3 (0.00 seconds, 0 Inserts)
% 0.79/1.00
% 0.79/1.00 Stopped by limit on number of solutions
% 0.79/1.00
% 0.79/1.00 Model 4 [ 1 0 114 ] (0.00 seconds, 1146 Inserts)
% 0.79/1.00
% 0.79/1.00 Stopped by limit on insertions
% 0.79/1.00
% 0.79/1.00 Model 5 [ 1 0 294 ] (0.00 seconds, 250000 Inserts)
% 0.79/1.00
% 0.79/1.00 Model 6 [ 2 0 327 ] (0.00 seconds, 662 Inserts)
% 0.79/1.00
% 0.79/1.00 Stopped by limit on insertions
% 0.79/1.00
% 0.79/1.00 Model 7 [ 2 0 265 ] (0.00 seconds, 250000 Inserts)
% 0.79/1.00
% 0.79/1.00 ----> UNIT CONFLICT at 0.60 sec ----> 1946 [binary,1945.1,9.1] {-} $F.
% 0.79/1.00
% 0.79/1.00 Length of proof is 5. Level of proof is 5.
% 0.79/1.00
% 0.79/1.00 ---------------- PROOF ----------------
% 0.79/1.00 % SZS status Theorem
% 0.79/1.00 % SZS output start Refutation
% 0.79/1.00
% 0.79/1.00 2 [] {+} A!=powerset(B)| -in(C,A)|subset(C,B).
% 0.79/1.00 3 [] {+} A!=powerset(B)|in(C,A)| -subset(C,B).
% 0.79/1.00 6 [] {+} subset(A,B)| -in($f2(A,B),B).
% 0.79/1.00 8 [] {+} -subset(A,B)| -subset(B,C)|subset(A,C).
% 0.79/1.00 9 [] {+} -subset(powerset($c4),powerset($c3)).
% 0.79/1.00 12 [] {+} subset(A,B)|in($f2(A,B),A).
% 0.79/1.00 15 [] {+} subset($c4,$c3).
% 0.79/1.00 16 [] {+} A=A.
% 0.79/1.00 40 [hyper,12,9] {+} in($f2(powerset($c4),powerset($c3)),powerset($c4)).
% 0.79/1.00 975 [hyper,40,2,16] {+} subset($f2(powerset($c4),powerset($c3)),$c4).
% 0.79/1.00 1821 [hyper,975,8,15] {-} subset($f2(powerset($c4),powerset($c3)),$c3).
% 0.79/1.00 1891 [hyper,1821,3,16] {-} in($f2(powerset($c4),powerset($c3)),powerset($c3)).
% 0.79/1.00 1945 [hyper,1891,6] {-} subset(powerset($c4),powerset($c3)).
% 0.79/1.00 1946 [binary,1945.1,9.1] {-} $F.
% 0.79/1.00
% 0.79/1.00 % SZS output end Refutation
% 0.79/1.00 ------------ end of proof -------------
% 0.79/1.00
% 0.79/1.00
% 0.79/1.00 Search stopped by max_proofs option.
% 0.79/1.00
% 0.79/1.00
% 0.79/1.00 Search stopped by max_proofs option.
% 0.79/1.00
% 0.79/1.00 ============ end of search ============
% 0.79/1.00
% 0.79/1.00 ----------- soft-scott stats ----------
% 0.79/1.00
% 0.79/1.00 true clauses given 5 (14.3%)
% 0.79/1.00 false clauses given 30
% 0.79/1.00
% 0.79/1.00 FALSE TRUE
% 0.79/1.00 8 0 1
% 0.79/1.00 9 0 2
% 0.79/1.00 10 0 3
% 0.79/1.00 11 0 5
% 0.79/1.00 12 2 3
% 0.79/1.00 13 2 8
% 0.79/1.00 14 9 8
% 0.79/1.00 15 8 9
% 0.79/1.00 16 6 8
% 0.79/1.00 17 13 21
% 0.79/1.00 18 20 30
% 0.79/1.00 19 16 28
% 0.79/1.00 20 18 33
% 0.79/1.00 21 11 13
% 0.79/1.00 22 17 15
% 0.79/1.00 23 21 21
% 0.79/1.00 24 27 30
% 0.79/1.00 25 9 10
% 0.79/1.00 26 10 7
% 0.79/1.00 27 5 7
% 0.79/1.00 28 21 18
% 0.79/1.00 29 16 13
% 0.79/1.00 30 14 7
% 0.79/1.00 31 9 10
% 0.79/1.00 32 27 19
% 0.79/1.00 33 43 41
% 0.79/1.00 34 45 34
% 0.79/1.00 35 44 35
% 0.79/1.00 36 21 19
% 0.79/1.00 37 46 38
% 0.79/1.00 38 37 28
% 0.79/1.00 39 65 38
% 0.79/1.00 40 26 20
% 0.79/1.00 41 20 16
% 0.79/1.00 42 36 26
% 0.79/1.00 43 27 25
% 0.79/1.00 44 60 34
% 0.79/1.00 45 13 9
% 0.79/1.00 46 4 8
% 0.79/1.00 47 26 18
% 0.79/1.00 48 53 18
% 0.79/1.00 49 25 13
% 0.79/1.00 50 22 10
% 0.79/1.00 51 4 7
% 0.79/1.00 52 0 4
% 0.79/1.00 53 1 3
% 0.79/1.00 54 0 8
% 0.79/1.00 55 8 11
% 0.79/1.00 56 0 5
% 0.79/1.00 57 10 2
% 0.79/1.00 58 7 0
% 0.79/1.00 59 36 11
% 0.79/1.00 60 1 8
% 0.79/1.00 tot: 961 818 (46.0% true)
% 0.79/1.00
% 0.79/1.00
% 0.79/1.00 Model 7 [ 2 0 265 ] (0.00 seconds, 250000 Inserts)
% 0.79/1.00
% 0.79/1.00 That finishes the proof of the theorem.
% 0.79/1.00
% 0.79/1.00 Process 27575 finished Mon Jul 11 05:10:53 2022
%------------------------------------------------------------------------------