%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ANA032-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:55 EDT 2022
% Result : Unsatisfiable 0.61s 0.81s
% Output : Refutation 0.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : ANA032-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : sos-script %s
% 0.11/0.33 % Computer : n020.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Fri Jul 8 05:13:58 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox on n020.cluster.edu,
% 0.11/0.34 Fri Jul 8 05:13:58 2022
% 0.11/0.34 The command was "./sos". The process ID is 30903.
% 0.11/0.34
% 0.11/0.34 set(prolog_style_variables).
% 0.11/0.34 set(auto).
% 0.11/0.34 dependent: set(auto1).
% 0.11/0.34 dependent: set(process_input).
% 0.11/0.34 dependent: clear(print_kept).
% 0.11/0.34 dependent: clear(print_new_demod).
% 0.11/0.34 dependent: clear(print_back_demod).
% 0.11/0.34 dependent: clear(print_back_sub).
% 0.11/0.34 dependent: set(control_memory).
% 0.11/0.34 dependent: assign(max_mem, 12000).
% 0.11/0.34 dependent: assign(pick_given_ratio, 4).
% 0.11/0.34 dependent: assign(stats_level, 1).
% 0.11/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34 dependent: assign(sos_limit, 5000).
% 0.11/0.34 dependent: assign(max_weight, 60).
% 0.11/0.34 clear(print_given).
% 0.11/0.34
% 0.11/0.34 list(usable).
% 0.11/0.34
% 0.11/0.34 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.11/0.34
% 0.11/0.34 This is a Horn set with equality. The strategy will be
% 0.11/0.34 Knuth-Bendix and hyper_res, with positive clauses in
% 0.11/0.34 sos and nonpositive clauses in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(knuth_bendix).
% 0.11/0.34 dependent: set(para_from).
% 0.11/0.34 dependent: set(para_into).
% 0.11/0.34 dependent: clear(para_from_right).
% 0.11/0.34 dependent: clear(para_into_right).
% 0.11/0.34 dependent: set(para_from_vars).
% 0.11/0.34 dependent: set(eq_units_both_ways).
% 0.11/0.34 dependent: set(dynamic_demod_all).
% 0.11/0.34 dependent: set(dynamic_demod).
% 0.11/0.34 dependent: set(order_eq).
% 0.11/0.34 dependent: set(back_demod).
% 0.11/0.34 dependent: set(lrpo).
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: clear(order_hyper).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.11/0.34
% 0.11/0.34 ======= end of input processing =======
% 0.11/0.37
% 0.11/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.37
% 0.11/0.37 Stopped by limit on number of solutions
% 0.11/0.37
% 0.11/0.37
% 0.11/0.37 -------------- Softie stats --------------
% 0.11/0.37
% 0.11/0.37 UPDATE_STOP: 300
% 0.11/0.37 SFINDER_TIME_LIMIT: 2
% 0.11/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.11/0.37 number of clauses in intial UL: 9
% 0.11/0.37 number of clauses initially in problem: 12
% 0.11/0.37 percentage of clauses intially in UL: 75
% 0.11/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.11/0.37 percent of all initial clauses that are short: 100
% 0.11/0.37 absolute distinct symbol count: 16
% 0.11/0.37 distinct predicate count: 7
% 0.11/0.37 distinct function count: 5
% 0.11/0.37 distinct constant count: 4
% 0.11/0.37
% 0.11/0.37 ---------- no more Softie stats ----------
% 0.11/0.37
% 0.11/0.37
% 0.11/0.37
% 0.11/0.37 =========== start of search ===========
% 0.61/0.81
% 0.61/0.81 -------- PROOF --------
% 0.61/0.81 % SZS status Unsatisfiable
% 0.61/0.81 % SZS output start Refutation
% 0.61/0.81
% 0.61/0.81 Stopped by limit on insertions
% 0.61/0.81
% 0.61/0.81 Model 2 (0.00 seconds, 0 Inserts)
% 0.61/0.81
% 0.61/0.81 Stopped by limit on number of solutions
% 0.61/0.81
% 0.61/0.81 ----> UNIT CONFLICT at 0.44 sec ----> 45 [binary,44.1,38.1] {+} $F.
% 0.61/0.81
% 0.61/0.81 Length of proof is 12. Level of proof is 4.
% 0.61/0.81
% 0.61/0.81 ---------------- PROOF ----------------
% 0.61/0.81 % SZS status Unsatisfiable
% 0.61/0.81 % SZS output start Refutation
% 0.61/0.81
% 0.61/0.81 1 [] {+} -class_OrderedGroup_Olordered__ab__group__abs(A)|c_lessequals(c_0,c_HOL_Oabs(B,A),A).
% 0.61/0.81 2 [] {+} -class_OrderedGroup_Osemigroup__mult(A)|c_times(c_times(B,C,A),D,A)=c_times(B,c_times(C,D,A),A).
% 0.61/0.81 3 [] {+} -class_OrderedGroup_Oab__semigroup__mult(A)|c_times(B,C,A)=c_times(C,B,A).
% 0.61/0.81 4 [] {+} -class_Ring__and__Field_Opordered__semiring(A)| -c_lessequals(B,C,A)| -c_lessequals(c_0,D,A)|c_lessequals(c_times(D,B,A),c_times(D,C,A),A).
% 0.61/0.81 5 [] {+} -c_lessequals(c_times(c_HOL_Oabs(v_b(v_x),t_b),c_HOL_Oabs(v_f(v_x),t_b),t_b),c_times(v_c,c_times(c_HOL_Oabs(v_f(v_x),t_b),c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b),t_b).
% 0.61/0.81 6 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Oab__semigroup__mult(A).
% 0.61/0.81 7 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Osemigroup__mult(A).
% 0.61/0.81 8 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_Ring__and__Field_Opordered__semiring(A).
% 0.61/0.81 9 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Olordered__ab__group__abs(A).
% 0.61/0.81 10 [] {-} c_lessequals(c_HOL_Oabs(v_b(v_x),t_b),c_times(v_c,c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b).
% 0.61/0.81 11 [] {-} class_Ring__and__Field_Oordered__idom(t_b).
% 0.61/0.81 13 [para_into,10.1.2,3.2.1] {-} c_lessequals(c_HOL_Oabs(v_b(v_x),t_b),c_times(c_HOL_Oabs(v_g(v_x),t_b),v_c,t_b),t_b)| -class_OrderedGroup_Oab__semigroup__mult(t_b).
% 0.61/0.81 14 [hyper,11,9] {+} class_OrderedGroup_Olordered__ab__group__abs(t_b).
% 0.61/0.81 15 [hyper,11,8] {+} class_Ring__and__Field_Opordered__semiring(t_b).
% 0.61/0.81 16 [hyper,11,7] {+} class_OrderedGroup_Osemigroup__mult(t_b).
% 0.61/0.81 17 [hyper,11,6] {+} class_OrderedGroup_Oab__semigroup__mult(t_b).
% 0.61/0.81 19,18 [hyper,16,2] {+} c_times(c_times(A,B,t_b),C,t_b)=c_times(A,c_times(B,C,t_b),t_b).
% 0.61/0.81 20 [hyper,14,1] {+} c_lessequals(c_0,c_HOL_Oabs(A,t_b),t_b).
% 0.61/0.81 21 [hyper,17,13] {-} c_lessequals(c_HOL_Oabs(v_b(v_x),t_b),c_times(c_HOL_Oabs(v_g(v_x),t_b),v_c,t_b),t_b).
% 0.61/0.81 22 [hyper,17,3] {+} c_times(A,B,t_b)=c_times(B,A,t_b).
% 0.61/0.81 25 [hyper,21,4,15,20] {-} c_lessequals(c_times(c_HOL_Oabs(A,t_b),c_HOL_Oabs(v_b(v_x),t_b),t_b),c_times(c_HOL_Oabs(A,t_b),c_times(c_HOL_Oabs(v_g(v_x),t_b),v_c,t_b),t_b),t_b).
% 0.61/0.81 38 [para_from,22.1.1,5.1.2,demod,19] {+} -c_lessequals(c_times(c_HOL_Oabs(v_b(v_x),t_b),c_HOL_Oabs(v_f(v_x),t_b),t_b),c_times(c_HOL_Oabs(v_f(v_x),t_b),c_times(c_HOL_Oabs(v_g(v_x),t_b),v_c,t_b),t_b),t_b).
% 0.61/0.81 44 [para_into,25.1.1,22.1.1] {-} c_lessequals(c_times(c_HOL_Oabs(v_b(v_x),t_b),c_HOL_Oabs(A,t_b),t_b),c_times(c_HOL_Oabs(A,t_b),c_times(c_HOL_Oabs(v_g(v_x),t_b),v_c,t_b),t_b),t_b).
% 0.61/0.81 45 [binary,44.1,38.1] {+} $F.
% 0.61/0.81
% 0.61/0.81 % SZS output end Refutation
% 0.61/0.81 ------------ end of proof -------------
% 0.61/0.81
% 0.61/0.81
% 0.61/0.81 Search stopped by max_proofs option.
% 0.61/0.81
% 0.61/0.81
% 0.61/0.81 Search stopped by max_proofs option.
% 0.61/0.81
% 0.61/0.81 ============ end of search ============
% 0.61/0.81
% 0.61/0.81 ----------- soft-scott stats ----------
% 0.61/0.81
% 0.61/0.81 true clauses given 7 (50.0%)
% 0.61/0.81 false clauses given 7
% 0.61/0.81
% 0.61/0.81 FALSE TRUE
% 0.61/0.81 15 0 3
% 0.61/0.81 16 0 1
% 0.61/0.81 20 0 2
% 0.61/0.81 23 2 0
% 0.61/0.81 25 0 3
% 0.61/0.81 29 0 1
% 0.61/0.81 33 1 0
% 0.61/0.81 tot: 3 10 (76.9% true)
% 0.61/0.81
% 0.61/0.81
% 0.61/0.81 Model 2 (0.00 seconds, 0 Inserts)
% 0.61/0.81
% 0.61/0.81 That finishes the proof of the theorem.
% 0.61/0.81
% 0.61/0.81 Process 30903 finished Fri Jul 8 05:13:59 2022
%------------------------------------------------------------------------------