%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ANA029-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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 : Thu Jul 14 19:27:53 EDT 2022
% Result : Unsatisfiable 0.77s 0.97s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ANA029-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.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 : Fri Jul 8 04:15:54 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 sandbox2 on n026.cluster.edu,
% 0.13/0.36 Fri Jul 8 04:15:54 2022
% 0.13/0.36 The command was "./sos". The process ID is 12797.
% 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 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.56
% 0.20/0.56 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.56
% 0.20/0.56 Stopped by limit on number of solutions
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 -------------- Softie stats --------------
% 0.20/0.56
% 0.20/0.56 UPDATE_STOP: 300
% 0.20/0.56 SFINDER_TIME_LIMIT: 2
% 0.20/0.56 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.56 number of clauses in intial UL: 14
% 0.20/0.56 number of clauses initially in problem: 15
% 0.20/0.56 percentage of clauses intially in UL: 93
% 0.20/0.56 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.56 percent of all initial clauses that are short: 100
% 0.20/0.56 absolute distinct symbol count: 16
% 0.20/0.56 distinct predicate count: 7
% 0.20/0.56 distinct function count: 6
% 0.20/0.56 distinct constant count: 3
% 0.20/0.56
% 0.20/0.56 ---------- no more Softie stats ----------
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 Stopped by limit on insertions
% 0.20/0.56
% 0.20/0.56 =========== start of search ===========
% 0.77/0.97
% 0.77/0.97 -------- PROOF --------
% 0.77/0.97 % SZS status Unsatisfiable
% 0.77/0.97 % SZS output start Refutation
% 0.77/0.97
% 0.77/0.97 Stopped by limit on insertions
% 0.77/0.97
% 0.77/0.97 Stopped by limit on insertions
% 0.77/0.97
% 0.77/0.97 Model 2 [ 2 1 157 ] (0.00 seconds, 250000 Inserts)
% 0.77/0.97
% 0.77/0.97 Stopped by limit on insertions
% 0.77/0.97
% 0.77/0.97 Stopped by limit on insertions
% 0.77/0.97
% 0.77/0.97 Stopped by limit on insertions
% 0.77/0.97
% 0.77/0.97 Model 3 [ 3 0 1280 ] (0.00 seconds, 250000 Inserts)
% 0.77/0.97
% 0.77/0.97 ----> UNIT CONFLICT at 0.59 sec ----> 283 [binary,282.1,2.1] {-} $F.
% 0.77/0.97
% 0.77/0.97 Length of proof is 10. Level of proof is 6.
% 0.77/0.97
% 0.77/0.97 ---------------- PROOF ----------------
% 0.77/0.97 % SZS status Unsatisfiable
% 0.77/0.97 % SZS output start Refutation
% 0.77/0.97
% 0.77/0.97 1 [] {+} -c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b).
% 0.77/0.97 2 [] {+} -c_lessequals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b).
% 0.77/0.97 3 [] {+} -class_OrderedGroup_Olordered__ab__group__abs(A)|c_lessequals(c_0,c_HOL_Oabs(B,A),A).
% 0.77/0.97 6 [] {+} -class_Orderings_Olinorder(A)|c_less(B,C,A)|c_lessequals(C,B,A).
% 0.77/0.97 7 [] {+} -class_Orderings_Olinorder(A)| -c_lessequals(B,C,A)| -c_lessequals(D,C,A)|c_lessequals(c_Orderings_Omax(D,B,A),C,A).
% 0.77/0.97 8 [] {+} -class_Orderings_Oorder(A)| -c_lessequals(B,C,A)| -c_lessequals(D,B,A)|c_lessequals(D,C,A).
% 0.77/0.97 9 [] {+} -class_Orderings_Oorder(A)| -c_less(B,C,A)|c_lessequals(B,C,A).
% 0.77/0.97 10 [] {+} -class_OrderedGroup_Opordered__ab__group__add(A)|class_Orderings_Oorder(A).
% 0.77/0.97 11 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_Orderings_Olinorder(A).
% 0.77/0.97 12 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Olordered__ab__group__abs(A).
% 0.77/0.97 13 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Opordered__ab__group__add(A).
% 0.77/0.97 15 [] {-} class_Ring__and__Field_Oordered__idom(t_b).
% 0.77/0.97 16 [hyper,15,13] {-} class_OrderedGroup_Opordered__ab__group__add(t_b).
% 0.77/0.97 17 [hyper,15,12] {+} class_OrderedGroup_Olordered__ab__group__abs(t_b).
% 0.77/0.97 18 [hyper,15,11] {-} class_Orderings_Olinorder(t_b).
% 0.77/0.97 19 [hyper,16,10] {-} class_Orderings_Oorder(t_b).
% 0.77/0.97 20 [hyper,17,3] {+} c_lessequals(c_0,c_HOL_Oabs(A,t_b),t_b).
% 0.77/0.97 21 [hyper,18,6] {+} c_less(A,B,t_b)|c_lessequals(B,A,t_b).
% 0.77/0.97 34 [hyper,21,1] {+} c_less(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b).
% 0.77/0.97 127 [hyper,34,9,19] {-} c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b).
% 0.77/0.97 131 [hyper,127,8,19,20] {-} c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_HOL_Oabs(A,t_b),t_b).
% 0.77/0.97 282 [hyper,131,7,18,20] {-} c_lessequals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),c_HOL_Oabs(A,t_b),t_b).
% 0.77/0.97 283 [binary,282.1,2.1] {-} $F.
% 0.77/0.97
% 0.77/0.97 % SZS output end Refutation
% 0.77/0.97 ------------ end of proof -------------
% 0.77/0.97
% 0.77/0.97
% 0.77/0.97 Search stopped by max_proofs option.
% 0.77/0.97
% 0.77/0.97
% 0.77/0.97 Search stopped by max_proofs option.
% 0.77/0.97
% 0.77/0.97 ============ end of search ============
% 0.77/0.97
% 0.77/0.97 ----------- soft-scott stats ----------
% 0.77/0.97
% 0.77/0.97 true clauses given 6 (31.6%)
% 0.77/0.97 false clauses given 13
% 0.77/0.97
% 0.77/0.97 FALSE TRUE
% 0.77/0.97 10 0 5
% 0.77/0.97 12 1 5
% 0.77/0.97 13 7 7
% 0.77/0.97 14 7 15
% 0.77/0.97 15 11 9
% 0.77/0.97 16 5 9
% 0.77/0.97 17 13 13
% 0.77/0.97 18 14 28
% 0.77/0.97 19 15 14
% 0.77/0.97 20 5 5
% 0.77/0.97 21 13 9
% 0.77/0.97 22 3 8
% 0.77/0.97 23 4 4
% 0.77/0.97 24 1 1
% 0.77/0.97 tot: 99 132 (57.1% true)
% 0.77/0.97
% 0.77/0.97
% 0.77/0.97 Model 3 [ 3 0 1280 ] (0.00 seconds, 250000 Inserts)
% 0.77/0.97
% 0.77/0.97 That finishes the proof of the theorem.
% 0.77/0.97
% 0.77/0.97 Process 12797 finished Fri Jul 8 04:15:55 2022
%------------------------------------------------------------------------------