%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU319+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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 14:28:44 EDT 2022
% Result : Theorem 0.56s 0.79s
% Output : Refutation 0.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU319+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n021.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 : Mon Jun 20 10:42:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n021.cluster.edu,
% 0.12/0.35 Mon Jun 20 10:42:18 2022
% 0.12/0.35 The command was "./sos". The process ID is 30280.
% 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=4.
% 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 22 during input processing: 0 [copy,22,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 14
% 0.12/0.37 number of clauses initially in problem: 22
% 0.12/0.37 percentage of clauses intially in UL: 63
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 83
% 0.12/0.37 percent of all initial clauses that are short: 95
% 0.12/0.37 absolute distinct symbol count: 18
% 0.12/0.37 distinct predicate count: 7
% 0.12/0.37 distinct function count: 7
% 0.12/0.37 distinct constant count: 4
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 0.56/0.79
% 0.56/0.79 -------- PROOF --------
% 0.56/0.79 % SZS status Theorem
% 0.56/0.79 % SZS output start Refutation
% 0.56/0.79
% 0.56/0.79 Model 2 (0.00 seconds, 0 Inserts)
% 0.56/0.79
% 0.56/0.79 Stopped by limit on number of solutions
% 0.56/0.79
% 0.56/0.79 Model 3 (0.00 seconds, 0 Inserts)
% 0.56/0.79
% 0.56/0.79 Stopped by limit on number of solutions
% 0.56/0.79
% 0.56/0.79 Stopped by limit on insertions
% 0.56/0.79
% 0.56/0.79 Model 4 (0.00 seconds, 0 Inserts)
% 0.56/0.79
% 0.56/0.79 Stopped by limit on number of solutions
% 0.56/0.79
% 0.56/0.79 Stopped by limit on insertions
% 0.56/0.79
% 0.56/0.79 ----> UNIT CONFLICT at 0.41 sec ----> 62 [binary,61.1,60.1] {+} $F.
% 0.56/0.79
% 0.56/0.79 Length of proof is 6. Level of proof is 4.
% 0.56/0.79
% 0.56/0.79 ---------------- PROOF ----------------
% 0.56/0.79 % SZS status Theorem
% 0.56/0.79 % SZS output start Refutation
% 0.56/0.79
% 0.56/0.79 1 [] {+} -top_str(A)| -element(B,powerset(the_carrier(A)))| -closed_subset(B,A)|open_subset(subset_difference(the_carrier(A),cast_as_carrier_subset(A),B),A).
% 0.56/0.79 2 [] {+} -top_str(A)| -element(B,powerset(the_carrier(A)))|closed_subset(B,A)| -open_subset(subset_difference(the_carrier(A),cast_as_carrier_subset(A),B),A).
% 0.56/0.79 6 [] {+} -top_str(A)|one_sorted_str(A).
% 0.56/0.79 9 [] {+} -one_sorted_str(A)| -element(B,powerset(the_carrier(A)))|subset_complement(the_carrier(A),B)=subset_difference(the_carrier(A),cast_as_carrier_subset(A),B).
% 0.56/0.79 10 [] {+} -closed_subset($c3,$c4)| -open_subset(subset_complement(the_carrier($c4),$c3),$c4).
% 0.56/0.79 19 [] {+} top_str($c4).
% 0.56/0.79 20 [] {+} element($c3,powerset(the_carrier($c4))).
% 0.56/0.79 21 [] {-} closed_subset($c3,$c4)|open_subset(subset_complement(the_carrier($c4),$c3),$c4).
% 0.56/0.79 24 [hyper,19,6] {+} one_sorted_str($c4).
% 0.56/0.79 39 [para_into,21.2.1,9.3.1,unit_del,24,20] {-} closed_subset($c3,$c4)|open_subset(subset_difference(the_carrier($c4),cast_as_carrier_subset($c4),$c3),$c4).
% 0.56/0.79 49,48 [hyper,20,9,24] {+} subset_complement(the_carrier($c4),$c3)=subset_difference(the_carrier($c4),cast_as_carrier_subset($c4),$c3).
% 0.56/0.79 59 [hyper,20,2,19,39,factor_simp] {-} closed_subset($c3,$c4).
% 0.56/0.79 60 [back_demod,10,demod,49,unit_del,59] {+} -open_subset(subset_difference(the_carrier($c4),cast_as_carrier_subset($c4),$c3),$c4).
% 0.56/0.79 61 [hyper,59,1,19,20] {-} open_subset(subset_difference(the_carrier($c4),cast_as_carrier_subset($c4),$c3),$c4).
% 0.56/0.79 62 [binary,61.1,60.1] {+} $F.
% 0.56/0.79
% 0.56/0.79 % SZS output end Refutation
% 0.56/0.79 ------------ end of proof -------------
% 0.56/0.79
% 0.56/0.79
% 0.56/0.79 Search stopped by max_proofs option.
% 0.56/0.79
% 0.56/0.79
% 0.56/0.79 Search stopped by max_proofs option.
% 0.56/0.79
% 0.56/0.79 ============ end of search ============
% 0.56/0.79
% 0.56/0.79 ----------- soft-scott stats ----------
% 0.56/0.79
% 0.56/0.79 true clauses given 4 (33.3%)
% 0.56/0.79 false clauses given 8
% 0.56/0.79
% 0.56/0.79 FALSE TRUE
% 0.56/0.79 3 0 1
% 0.56/0.79 4 0 2
% 0.56/0.79 5 0 1
% 0.56/0.79 6 0 3
% 0.56/0.79 7 0 1
% 0.56/0.79 8 0 2
% 0.56/0.79 9 0 1
% 0.56/0.79 10 0 1
% 0.56/0.79 11 0 4
% 0.56/0.79 12 0 2
% 0.56/0.79 15 0 2
% 0.56/0.79 16 0 1
% 0.56/0.79 17 0 3
% 0.56/0.79 tot: 0 24 (100.0% true)
% 0.56/0.79
% 0.56/0.79
% 0.56/0.79 Model 4 (0.00 seconds, 0 Inserts)
% 0.56/0.79
% 0.56/0.79 That finishes the proof of the theorem.
% 0.56/0.79
% 0.56/0.79 Process 30280 finished Mon Jun 20 10:42:19 2022
%------------------------------------------------------------------------------