%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU374+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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:29:11 EDT 2022
% Result : Theorem 0.59s 0.77s
% Output : Refutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU374+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14 % Command : sos-script %s
% 0.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jun 19 00:46:38 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.39 ----- Otter 3.2, August 2001 -----
% 0.22/0.39 The process was started by sandbox on n016.cluster.edu,
% 0.22/0.39 Sun Jun 19 00:46:38 2022
% 0.22/0.39 The command was "./sos". The process ID is 8351.
% 0.22/0.39
% 0.22/0.39 set(prolog_style_variables).
% 0.22/0.39 set(auto).
% 0.22/0.39 dependent: set(auto1).
% 0.22/0.39 dependent: set(process_input).
% 0.22/0.39 dependent: clear(print_kept).
% 0.22/0.39 dependent: clear(print_new_demod).
% 0.22/0.39 dependent: clear(print_back_demod).
% 0.22/0.39 dependent: clear(print_back_sub).
% 0.22/0.39 dependent: set(control_memory).
% 0.22/0.39 dependent: assign(max_mem, 12000).
% 0.22/0.39 dependent: assign(pick_given_ratio, 4).
% 0.22/0.39 dependent: assign(stats_level, 1).
% 0.22/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.22/0.39 dependent: assign(sos_limit, 5000).
% 0.22/0.39 dependent: assign(max_weight, 60).
% 0.22/0.39 clear(print_given).
% 0.22/0.39
% 0.22/0.39 formula_list(usable).
% 0.22/0.39
% 0.22/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.22/0.39
% 0.22/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.22/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.22/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.22/0.39 clauses in usable.
% 0.22/0.39
% 0.22/0.39 dependent: set(knuth_bendix).
% 0.22/0.39 dependent: set(para_from).
% 0.22/0.39 dependent: set(para_into).
% 0.22/0.39 dependent: clear(para_from_right).
% 0.22/0.39 dependent: clear(para_into_right).
% 0.22/0.39 dependent: set(para_from_vars).
% 0.22/0.39 dependent: set(eq_units_both_ways).
% 0.22/0.39 dependent: set(dynamic_demod_all).
% 0.22/0.39 dependent: set(dynamic_demod).
% 0.22/0.39 dependent: set(order_eq).
% 0.22/0.39 dependent: set(back_demod).
% 0.22/0.39 dependent: set(lrpo).
% 0.22/0.39 dependent: set(hyper_res).
% 0.22/0.39 dependent: set(unit_deletion).
% 0.22/0.39 dependent: set(factor).
% 0.22/0.39
% 0.22/0.39 ------------> process usable:
% 0.22/0.39 Following clause subsumed by 9 during input processing: 0 [] {-} -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 0.22/0.39 Following clause subsumed by 9 during input processing: 0 [] {-} -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 0.22/0.39
% 0.22/0.39 ------------> process sos:
% 0.22/0.39 Following clause subsumed by 65 during input processing: 0 [] {-} empty(empty_set).
% 0.22/0.39 Following clause subsumed by 66 during input processing: 0 [] {-} relation(empty_set).
% 0.22/0.39 Following clause subsumed by 103 during input processing: 0 [copy,103,flip.1] {-} A=A.
% 0.22/0.39 103 back subsumes 54.
% 0.22/0.39
% 0.22/0.39 ======= end of input processing =======
% 0.56/0.75
% 0.56/0.75 Stopped by limit on insertions
% 0.56/0.75
% 0.56/0.75
% 0.56/0.75 Failed to model usable list: disabling FINDER
% 0.56/0.75
% 0.56/0.75
% 0.56/0.75
% 0.56/0.75 -------------- Softie stats --------------
% 0.56/0.75
% 0.56/0.75 UPDATE_STOP: 300
% 0.56/0.75 SFINDER_TIME_LIMIT: 2
% 0.56/0.75 SHORT_CLAUSE_CUTOFF: 4
% 0.56/0.75 number of clauses in intial UL: 57
% 0.56/0.75 number of clauses initially in problem: 102
% 0.56/0.75 percentage of clauses intially in UL: 55
% 0.56/0.75 percentage of distinct symbols occuring in initial UL: 60
% 0.56/0.75 percent of all initial clauses that are short: 100
% 0.56/0.75 absolute distinct symbol count: 50
% 0.56/0.75 distinct predicate count: 18
% 0.56/0.75 distinct function count: 14
% 0.56/0.75 distinct constant count: 18
% 0.56/0.75
% 0.56/0.75 ---------- no more Softie stats ----------
% 0.56/0.75
% 0.56/0.75
% 0.56/0.75
% 0.56/0.75 =========== start of search ===========
% 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 ----> UNIT CONFLICT at 0.36 sec ----> 336 [binary,335.1,105.1] {-} $F.
% 0.59/0.77
% 0.59/0.77 Length of proof is 7. Level of proof is 3.
% 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 6 [] {+} -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)| -subnetstr(C,A,B)|subrelstr(C,B).
% 0.59/0.77 12 [] {+} -one_sorted_str(A)| -net_str(B,A)|rel_str(B).
% 0.59/0.77 14 [] {+} -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)|net_str(C,A).
% 0.59/0.77 32 [] {-} -related($c16,$c14,$c13).
% 0.59/0.77 38 [] {+} -rel_str(A)| -subrelstr(B,A)| -element(C,the_carrier(A))| -element(D,the_carrier(A))| -element(E,the_carrier(B))| -element(F,the_carrier(B))|E!=C|F!=D| -related(B,E,F)|related(A,C,D).
% 0.59/0.77 91 [] {-} one_sorted_str($c17).
% 0.59/0.77 92 [] {-} net_str($c16,$c17).
% 0.59/0.77 93 [] {-} subnetstr($c15,$c17,$c16).
% 0.59/0.77 94 [] {-} element($c14,the_carrier($c16)).
% 0.59/0.77 95 [] {-} element($c13,the_carrier($c16)).
% 0.59/0.77 96 [] {-} element($c12,the_carrier($c15)).
% 0.59/0.77 97 [] {-} element($c11,the_carrier($c15)).
% 0.59/0.77 99,98 [] {-} $c14=$c12.
% 0.59/0.77 101,100 [] {-} $c13=$c11.
% 0.59/0.77 102 [] {-} related($c15,$c12,$c11).
% 0.59/0.77 103 [] {-} A=A.
% 0.59/0.77 104 [back_demod,94,demod,99] {-} element($c12,the_carrier($c16)).
% 0.59/0.77 105 [back_demod,32,demod,99,101] {-} -related($c16,$c12,$c11).
% 0.59/0.77 106 [back_demod,95,demod,101] {-} element($c11,the_carrier($c16)).
% 0.59/0.77 258 [hyper,92,12,91] {-} rel_str($c16).
% 0.59/0.77 272 [hyper,93,14,91,92] {-} net_str($c15,$c17).
% 0.59/0.77 286 [hyper,272,6,91,92,93] {-} subrelstr($c15,$c16).
% 0.59/0.77 335 [hyper,106,38,258,286,104,96,97,103,103,102] {-} related($c16,$c12,$c11).
% 0.59/0.77 336 [binary,335.1,105.1] {-} $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 That finishes the proof of the theorem.
% 0.59/0.77
% 0.59/0.77 Process 8351 finished Sun Jun 19 00:46:38 2022
%------------------------------------------------------------------------------