%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET632+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:19:39 EDT 2022
% Result : Theorem 0.59s 0.76s
% Output : Refutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET632+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 13:17:05 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 n014.cluster.edu,
% 0.12/0.35 Sun Jul 10 13:17:05 2022
% 0.12/0.35 The command was "./sos". The process ID is 28356.
% 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=3.
% 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 24 during input processing: 0 [copy,24,flip.1] {-} A=A.
% 0.12/0.35 24 back subsumes 16.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 14
% 0.19/0.39 number of clauses initially in problem: 22
% 0.19/0.39 percentage of clauses intially in UL: 63
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 76
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 13
% 0.19/0.39 distinct predicate count: 6
% 0.19/0.39 distinct function count: 3
% 0.19/0.39 distinct constant count: 4
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.59/0.76
% 0.59/0.76 -------- PROOF --------
% 0.59/0.76 % SZS status Theorem
% 0.59/0.76 % SZS output start Refutation
% 0.59/0.76
% 0.59/0.76 Model 3 (0.00 seconds, 0 Inserts)
% 0.59/0.76
% 0.59/0.76 Stopped by limit on number of solutions
% 0.59/0.76
% 0.59/0.76 Model 4 (0.00 seconds, 0 Inserts)
% 0.59/0.76
% 0.59/0.76 Stopped by limit on number of solutions
% 0.59/0.76
% 0.59/0.76 Stopped by limit on insertions
% 0.59/0.77
% 0.59/0.77 Model 5 [ 1 1 87 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.77
% 0.59/0.77 Stopped by limit on insertions
% 0.59/0.77
% 0.59/0.77 Model 6 [ 1 0 193 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.77
% 0.59/0.77 Stopped by limit on insertions
% 0.59/0.77
% 0.59/0.77 Model 7 [ 3 0 92 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.77
% 0.59/0.77 Stopped by limit on insertions
% 0.59/0.77
% 0.59/0.77 Model 8 [ 1 0 95 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.77
% 0.59/0.77 Stopped by limit on insertions
% 0.59/0.77
% 0.59/0.77 Model 9 [ 1 0 236 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.77
% 0.59/0.77 Stopped by limit on insertions
% 0.59/0.77
% 0.59/0.77 Model 10 [ 2 1 88 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.77
% 0.59/0.77 Stopped by limit on insertions
% 0.59/0.77
% 0.59/0.77 Model 11 [ 5 0 83 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.77
% 0.59/0.77 -----> EMPTY CLAUSE at 0.39 sec ----> 492 [hyper,380,7,23] {-} $F.
% 0.59/0.77
% 0.59/0.77 Length of proof is 6. Level of proof is 4.
% 0.59/0.77
% 0.59/0.77 ---------------- PROOF ----------------
% 0.59/0.77 % SZS status Theorem
% 0.59/0.77 % SZS output start Refutation
% 0.59/0.77
% 0.59/0.77 1 [] {+} -subset(A,B)| -member(C,A)|member(C,B).
% 0.59/0.77 5 [] {+} intersect(A,B)| -member(C,A)| -member(C,B).
% 0.59/0.77 6 [] {+} -member(A,empty_set).
% 0.59/0.77 7 [] {+} -disjoint(A,B)| -intersect(A,B).
% 0.59/0.77 10 [] {+} A=B| -subset(A,B)| -subset(B,A).
% 0.59/0.77 13 [] {-} $c3!=empty_set.
% 0.59/0.77 14 [copy,13,flip.1] {+} empty_set!=$c3.
% 0.59/0.77 17 [] {+} subset(A,B)|member($f1(A,B),A).
% 0.59/0.77 21 [] {+} subset($c3,$c2).
% 0.59/0.77 22 [] {+} subset($c3,$c1).
% 0.59/0.77 23 [] {+} disjoint($c2,$c1).
% 0.59/0.77 25 [hyper,17,10,17] {+} member($f1(A,B),A)|B=A|member($f1(B,A),B).
% 0.59/0.77 62 [hyper,25,6] {+} A=empty_set|member($f1(A,empty_set),A).
% 0.59/0.77 141 [hyper,62,1,22,unit_del,14] {+} member($f1($c3,empty_set),$c1).
% 0.59/0.77 142 [hyper,62,1,21,unit_del,14] {-} member($f1($c3,empty_set),$c2).
% 0.59/0.77 380 [hyper,141,5,142] {+} intersect($c2,$c1).
% 0.59/0.77 492 [hyper,380,7,23] {-} $F.
% 0.59/0.77
% 0.59/0.77 % SZS output end Refutation
% 0.59/0.77 ------------ end of proof -------------
% 0.59/0.77
% 0.59/0.77
% 0.59/0.77 Search stopped by max_proofs option.
% 0.59/0.77
% 0.59/0.77
% 0.59/0.77 Search stopped by max_proofs option.
% 0.59/0.77
% 0.59/0.77 ============ end of search ============
% 0.59/0.77
% 0.59/0.77 ----------- soft-scott stats ----------
% 0.59/0.77
% 0.59/0.77 true clauses given 16 (32.7%)
% 0.59/0.77 false clauses given 33
% 0.59/0.77
% 0.59/0.77 FALSE TRUE
% 0.59/0.77 3 0 4
% 0.59/0.77 4 0 1
% 0.59/0.77 5 0 8
% 0.59/0.77 6 0 2
% 0.59/0.77 7 0 2
% 0.59/0.77 8 0 18
% 0.59/0.77 9 0 9
% 0.59/0.77 10 0 11
% 0.59/0.77 11 0 9
% 0.59/0.77 12 0 5
% 0.59/0.77 13 0 35
% 0.59/0.77 14 0 24
% 0.59/0.77 15 2 20
% 0.59/0.77 16 0 5
% 0.59/0.77 18 0 29
% 0.59/0.77 19 0 28
% 0.59/0.77 20 2 2
% 0.59/0.77 21 40 2
% 0.59/0.77 22 1 11
% 0.59/0.77 23 0 16
% 0.59/0.77 24 2 0
% 0.59/0.77 25 0 54
% 0.59/0.77 27 0 2
% 0.59/0.77 28 0 2
% 0.59/0.77 30 2 0
% 0.59/0.77 35 2 0
% 0.59/0.77 tot: 51 299 (85.4% true)
% 0.59/0.77
% 0.59/0.77
% 0.59/0.77 Model 11 [ 5 0 83 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.77
% 0.59/0.77 That finishes the proof of the theorem.
% 0.59/0.77
% 0.59/0.77 Process 28356 finished Sun Jul 10 13:17:05 2022
%------------------------------------------------------------------------------