%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PRO009+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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 : Mon Jul 18 17:53:33 EDT 2022
% Result : Theorem 1.13s 1.32s
% Output : Refutation 1.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PRO009+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n023.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 Jun 13 03:41:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n023.cluster.edu,
% 0.13/0.37 Mon Jun 13 03:41:36 2022
% 0.13/0.37 The command was "./sos". The process ID is 30967.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 92 during input processing: 0 [copy,92,flip.1] {-} A=A.
% 0.13/0.37 92 back subsumes 85.
% 0.13/0.37 92 back subsumes 84.
% 0.13/0.37 92 back subsumes 81.
% 0.13/0.37 92 back subsumes 80.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Failed to model usable list: disabling FINDER
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 -------------- Softie stats --------------
% 0.20/0.44
% 0.20/0.44 UPDATE_STOP: 300
% 0.20/0.44 SFINDER_TIME_LIMIT: 2
% 0.20/0.44 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.44 number of clauses in intial UL: 81
% 0.20/0.44 number of clauses initially in problem: 88
% 0.20/0.44 percentage of clauses intially in UL: 92
% 0.20/0.44 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.44 percent of all initial clauses that are short: 100
% 0.20/0.44 absolute distinct symbol count: 41
% 0.20/0.44 distinct predicate count: 18
% 0.20/0.44 distinct function count: 17
% 0.20/0.44 distinct constant count: 6
% 0.20/0.44
% 0.20/0.44 ---------- no more Softie stats ----------
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 =========== start of search ===========
% 1.13/1.32
% 1.13/1.32 -------- PROOF --------
% 1.13/1.32 % SZS status Theorem
% 1.13/1.32 % SZS output start Refutation
% 1.13/1.32
% 1.13/1.32 -----> EMPTY CLAUSE at 0.93 sec ----> 2392 [hyper,2357,78,697,543,1755,117] {-} $F.
% 1.13/1.32
% 1.13/1.32 Length of proof is 15. Level of proof is 6.
% 1.13/1.32
% 1.13/1.32 ---------------- PROOF ----------------
% 1.13/1.32 % SZS status Theorem
% 1.13/1.32 % SZS output start Refutation
% 1.13/1.32
% 1.13/1.32 1 [] {+} -min_precedes(A,B,C)| -min_precedes(B,D,C)|min_precedes(A,D,C).
% 1.13/1.32 3 [] {+} -occurrence_of(A,B)| -root_occ(C,A)| -root_occ(D,A)|C=D.
% 1.13/1.32 5 [] {+} -next_subocc(A,B,C)|min_precedes(A,B,C).
% 1.13/1.32 20 [] {+} root_occ(A,B)| -occurrence_of(B,C)| -subactivity_occurrence(A,B)| -root(A,C).
% 1.13/1.32 61 [] {+} -occurrence_of(A,B)|atomic(B)|root($f14(B,A),B).
% 1.13/1.32 62 [] {+} -occurrence_of(A,B)|atomic(B)|subactivity_occurrence($f14(B,A),A).
% 1.13/1.32 64 [] {+} -occurrence_of(A,tptp0)|occurrence_of($f17(A),tptp3).
% 1.13/1.32 65 [] {+} -occurrence_of(A,tptp0)|root_occ($f17(A),A).
% 1.13/1.32 67 [] {+} -occurrence_of(A,tptp0)|next_subocc($f17(A),$f16(A),tptp0).
% 1.13/1.32 68 [] {+} -occurrence_of(A,tptp0)|occurrence_of($f15(A),tptp2)|occurrence_of($f15(A),tptp1).
% 1.13/1.32 69 [] {+} -occurrence_of(A,tptp0)|next_subocc($f16(A),$f15(A),tptp0).
% 1.13/1.32 70 [] {+} -occurrence_of(A,tptp0)|leaf_occ($f15(A),A).
% 1.13/1.32 71 [] {+} -atomic(tptp0).
% 1.13/1.32 78 [] {+} -occurrence_of(A,tptp3)| -root_occ(A,$c1)| -occurrence_of(B,tptp2)| -min_precedes(A,B,tptp0)| -leaf_occ(B,$c1).
% 1.13/1.32 79 [] {+} -occurrence_of(A,tptp3)| -root_occ(A,$c1)| -occurrence_of(B,tptp1)| -min_precedes(A,B,tptp0)| -leaf_occ(B,$c1).
% 1.13/1.32 91 [] {-} occurrence_of($c1,tptp0).
% 1.13/1.32 117 [hyper,91,70] {-} leaf_occ($f15($c1),$c1).
% 1.13/1.32 118 [hyper,91,69] {-} next_subocc($f16($c1),$f15($c1),tptp0).
% 1.13/1.32 119 [hyper,91,68] {-} occurrence_of($f15($c1),tptp2)|occurrence_of($f15($c1),tptp1).
% 1.13/1.32 120 [hyper,91,67] {-} next_subocc($f17($c1),$f16($c1),tptp0).
% 1.13/1.32 122 [hyper,91,65] {-} root_occ($f17($c1),$c1).
% 1.13/1.32 123 [hyper,91,64] {-} occurrence_of($f17($c1),tptp3).
% 1.13/1.32 124 [hyper,91,62,unit_del,71] {-} subactivity_occurrence($f14(tptp0,$c1),$c1).
% 1.13/1.32 125 [hyper,91,61,unit_del,71] {-} root($f14(tptp0,$c1),tptp0).
% 1.13/1.32 543 [hyper,125,20,91,124] {-} root_occ($f14(tptp0,$c1),$c1).
% 1.13/1.32 652,651 [hyper,543,3,91,122] {-} $f17($c1)=$f14(tptp0,$c1).
% 1.13/1.32 697 [back_demod,123,demod,652] {-} occurrence_of($f14(tptp0,$c1),tptp3).
% 1.13/1.32 787 [hyper,118,5] {-} min_precedes($f16($c1),$f15($c1),tptp0).
% 1.13/1.32 825 [hyper,120,5,demod,652] {-} min_precedes($f14(tptp0,$c1),$f16($c1),tptp0).
% 1.13/1.32 1755 [hyper,825,1,787] {-} min_precedes($f14(tptp0,$c1),$f15($c1),tptp0).
% 1.13/1.32 2357 [hyper,1755,79,697,543,119,117] {-} occurrence_of($f15($c1),tptp2).
% 1.13/1.32 2392 [hyper,2357,78,697,543,1755,117] {-} $F.
% 1.13/1.32
% 1.13/1.32 % SZS output end Refutation
% 1.13/1.32 ------------ end of proof -------------
% 1.13/1.32
% 1.13/1.32
% 1.13/1.32 Search stopped by max_proofs option.
% 1.13/1.32
% 1.13/1.32
% 1.13/1.32 Search stopped by max_proofs option.
% 1.13/1.32
% 1.13/1.32 ============ end of search ============
% 1.13/1.32
% 1.13/1.32 That finishes the proof of the theorem.
% 1.13/1.32
% 1.13/1.32 Process 30967 finished Mon Jun 13 03:41:37 2022
%------------------------------------------------------------------------------