%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ANA012-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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:40 EDT 2022
% Result : Unsatisfiable 1.09s 1.31s
% Output : Refutation 1.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ANA012-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n005.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 03:40:37 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 sandbox on n005.cluster.edu,
% 0.13/0.36 Fri Jul 8 03:40:37 2022
% 0.13/0.36 The command was "./sos". The process ID is 27203.
% 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=1, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.63/0.83
% 0.63/0.83 Model 1 (0.00 seconds, 0 Inserts)
% 0.63/0.83
% 0.63/0.83 Stopped by limit on number of solutions
% 0.63/0.83
% 0.63/0.83
% 0.63/0.83 -------------- Softie stats --------------
% 0.63/0.83
% 0.63/0.83 UPDATE_STOP: 300
% 0.63/0.83 SFINDER_TIME_LIMIT: 2
% 0.63/0.83 SHORT_CLAUSE_CUTOFF: 4
% 0.63/0.83 number of clauses in intial UL: 8
% 0.63/0.83 number of clauses initially in problem: 10
% 0.63/0.83 percentage of clauses intially in UL: 80
% 0.63/0.83 percentage of distinct symbols occuring in initial UL: 100
% 0.63/0.83 percent of all initial clauses that are short: 100
% 0.63/0.83 absolute distinct symbol count: 13
% 0.63/0.83 distinct predicate count: 6
% 0.63/0.83 distinct function count: 3
% 0.63/0.83 distinct constant count: 4
% 0.63/0.83
% 0.63/0.83 ---------- no more Softie stats ----------
% 0.63/0.83
% 0.63/0.83
% 0.63/0.83
% 0.63/0.83 Stopped by limit on insertions
% 0.63/0.83
% 0.63/0.83 =========== start of search ===========
% 1.09/1.31
% 1.09/1.31 -------- PROOF --------
% 1.09/1.31 % SZS status Unsatisfiable
% 1.09/1.31 % SZS output start Refutation
% 1.09/1.31
% 1.09/1.31 Stopped by limit on insertions
% 1.09/1.31
% 1.09/1.31 Stopped by limit on insertions
% 1.09/1.31
% 1.09/1.31 Model 2 [ 2 0 168 ] (0.00 seconds, 250000 Inserts)
% 1.09/1.31
% 1.09/1.31 Stopped by limit on insertions
% 1.09/1.31
% 1.09/1.31 Stopped by limit on insertions
% 1.09/1.31
% 1.09/1.31 ----> UNIT CONFLICT at 0.92 sec ----> 156 [binary,154.1,1.1] {+} $F.
% 1.09/1.31
% 1.09/1.31 Length of proof is 7. Level of proof is 4.
% 1.09/1.31
% 1.09/1.31 ---------------- PROOF ----------------
% 1.09/1.31 % SZS status Unsatisfiable
% 1.09/1.31 % SZS output start Refutation
% 1.09/1.31
% 1.09/1.31 1 [] {+} v_c!=c_0.
% 1.09/1.31 2 [] {+} -c_lessequals(c_1,c_times(A,c_HOL_Oabs(v_c,t_a),t_a),t_a).
% 1.09/1.31 3 [] {+} -class_OrderedGroup_Olordered__ab__group__abs(A)|c_HOL_Oabs(B,A)!=c_0|B=c_0.
% 1.09/1.31 4 [] {+} -class_Orderings_Oorder(A)|c_lessequals(B,B,A).
% 1.09/1.31 5 [] {+} -class_Ring__and__Field_Ofield(A)|B=c_0|c_times(c_HOL_Oinverse(B,A),B,A)=c_1.
% 1.09/1.31 6 [] {+} -class_Ring__and__Field_Oordered__field(A)|class_Ring__and__Field_Ofield(A).
% 1.09/1.31 7 [] {+} -class_Ring__and__Field_Oordered__field(A)|class_OrderedGroup_Olordered__ab__group__abs(A).
% 1.09/1.31 8 [] {+} -class_Ring__and__Field_Oordered__field(A)|class_Orderings_Oorder(A).
% 1.09/1.31 9 [] {-} class_Ring__and__Field_Oordered__field(t_a).
% 1.09/1.31 11 [hyper,9,8] {-} class_Orderings_Oorder(t_a).
% 1.09/1.31 12 [hyper,9,7] {+} class_OrderedGroup_Olordered__ab__group__abs(t_a).
% 1.09/1.31 13 [hyper,9,6] {-} class_Ring__and__Field_Ofield(t_a).
% 1.09/1.31 16 [hyper,11,4] {-} c_lessequals(A,A,t_a).
% 1.09/1.31 21 [hyper,13,5] {+} A=c_0|c_times(c_HOL_Oinverse(A,t_a),A,t_a)=c_1.
% 1.09/1.31 145 [para_from,21.2.1,2.1.2,unit_del,16] {-} c_HOL_Oabs(v_c,t_a)=c_0.
% 1.09/1.31 154 [hyper,145,3,12] {-} v_c=c_0.
% 1.09/1.31 156 [binary,154.1,1.1] {+} $F.
% 1.09/1.31
% 1.09/1.31 % SZS output end Refutation
% 1.09/1.31 ------------ end of proof -------------
% 1.09/1.31
% 1.09/1.31
% 1.09/1.31 Search stopped by max_proofs option.
% 1.09/1.31
% 1.09/1.31
% 1.09/1.31 Search stopped by max_proofs option.
% 1.09/1.31
% 1.09/1.31 ============ end of search ============
% 1.09/1.31
% 1.09/1.31 ----------- soft-scott stats ----------
% 1.09/1.31
% 1.09/1.31 true clauses given 7 (31.8%)
% 1.09/1.31 false clauses given 15
% 1.09/1.31
% 1.09/1.31 FALSE TRUE
% 1.09/1.31 7 1 0
% 1.09/1.31 8 0 1
% 1.09/1.31 11 1 1
% 1.09/1.31 12 1 1
% 1.09/1.31 13 6 1
% 1.09/1.31 14 3 2
% 1.09/1.31 15 6 2
% 1.09/1.31 16 4 1
% 1.09/1.31 17 0 13
% 1.09/1.31 18 3 9
% 1.09/1.31 19 0 10
% 1.09/1.31 20 2 5
% 1.09/1.31 21 0 4
% 1.09/1.31 22 0 13
% 1.09/1.31 23 0 9
% 1.09/1.31 24 0 4
% 1.09/1.31 25 0 10
% 1.09/1.31 26 0 2
% 1.09/1.31 27 0 3
% 1.09/1.31 tot: 27 91 (77.1% true)
% 1.09/1.31
% 1.09/1.31
% 1.09/1.31 Model 2 [ 2 -13 168 ] (0.00 seconds, 250000 Inserts)
% 1.09/1.31
% 1.09/1.31 That finishes the proof of the theorem.
% 1.09/1.31
% 1.09/1.31 Process 27203 finished Fri Jul 8 03:40:38 2022
%------------------------------------------------------------------------------