TSTP Solution File: ANA015-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ANA015-2 : TPTP v8.1.0. Released v3.2.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 : Thu Jul 14 19:27:43 EDT 2022
% Result : Unsatisfiable 0.72s 0.89s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ANA015-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n016.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 06:29: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 sandbox2 on n016.cluster.edu,
% 0.13/0.36 Fri Jul 8 06:29:37 2022
% 0.13/0.36 The command was "./sos". The process ID is 21019.
% 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=1, equality=1, symmetry=0, max_lits=4.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive 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: clear(order_hyper).
% 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 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.68/0.89
% 0.68/0.89 Stopped by limit on insertions
% 0.68/0.89
% 0.68/0.89
% 0.68/0.89 Failed to model usable list: disabling FINDER
% 0.68/0.89
% 0.68/0.89
% 0.68/0.89
% 0.68/0.89 -------------- Softie stats --------------
% 0.68/0.89
% 0.68/0.89 UPDATE_STOP: 300
% 0.68/0.89 SFINDER_TIME_LIMIT: 2
% 0.68/0.89 SHORT_CLAUSE_CUTOFF: 4
% 0.68/0.89 number of clauses in intial UL: 10
% 0.68/0.89 number of clauses initially in problem: 13
% 0.68/0.89 percentage of clauses intially in UL: 76
% 0.68/0.89 percentage of distinct symbols occuring in initial UL: 94
% 0.68/0.89 percent of all initial clauses that are short: 100
% 0.68/0.89 absolute distinct symbol count: 18
% 0.68/0.89 distinct predicate count: 8
% 0.68/0.89 distinct function count: 6
% 0.68/0.89 distinct constant count: 4
% 0.68/0.89
% 0.68/0.89 ---------- no more Softie stats ----------
% 0.68/0.89
% 0.68/0.89
% 0.68/0.89
% 0.68/0.89 =========== start of search ===========
% 0.72/0.89
% 0.72/0.89 -------- PROOF --------
% 0.72/0.89 % SZS status Unsatisfiable
% 0.72/0.89 % SZS output start Refutation
% 0.72/0.89
% 0.72/0.89 ----> UNIT CONFLICT at 0.50 sec ----> 44 [binary,43.1,26.1] {-} $F.
% 0.72/0.89
% 0.72/0.89 Length of proof is 11. Level of proof is 4.
% 0.72/0.89
% 0.72/0.89 ---------------- PROOF ----------------
% 0.72/0.89 % SZS status Unsatisfiable
% 0.72/0.89 % SZS output start Refutation
% 0.72/0.89
% 0.72/0.89 1 [] {+} -class_OrderedGroup_Olordered__ab__group__abs(A)|c_lessequals(c_0,c_HOL_Oabs(B,A),A).
% 0.72/0.89 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.72/0.89 3 [] {+} -class_Ring__and__Field_Oordered__idom(A)|c_HOL_Oabs(c_times(B,C,A),A)=c_times(c_HOL_Oabs(B,A),c_HOL_Oabs(C,A),A).
% 0.72/0.89 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.72/0.89 5 [] {+} -c_lessequals(c_HOL_Oabs(c_times(c_HOL_Oinverse(v_c,t_a),v_g(v_x(A)),t_a),t_a),c_times(A,c_HOL_Oabs(v_f(v_x(A)),t_a),t_a),t_a).
% 0.72/0.89 6 [] {+} -class_Ring__and__Field_Ofield(A)|class_OrderedGroup_Osemigroup__mult(A).
% 0.72/0.89 7 [] {+} -class_Ring__and__Field_Oordered__field(A)|class_Ring__and__Field_Ofield(A).
% 0.72/0.89 8 [] {+} -class_Ring__and__Field_Oordered__field(A)|class_Ring__and__Field_Oordered__idom(A).
% 0.72/0.89 9 [] {+} -class_Ring__and__Field_Oordered__field(A)|class_Ring__and__Field_Opordered__semiring(A).
% 0.72/0.89 10 [] {+} -class_Ring__and__Field_Oordered__field(A)|class_OrderedGroup_Olordered__ab__group__abs(A).
% 0.72/0.89 11 [] {-} c_lessequals(c_HOL_Oabs(v_g(A),t_a),c_times(v_d,c_HOL_Oabs(v_f(A),t_a),t_a),t_a).
% 0.72/0.89 12 [] {-} class_Ring__and__Field_Oordered__field(t_a).
% 0.72/0.89 14 [hyper,12,10] {-} class_OrderedGroup_Olordered__ab__group__abs(t_a).
% 0.72/0.89 15 [hyper,12,9] {-} class_Ring__and__Field_Opordered__semiring(t_a).
% 0.72/0.89 16 [hyper,12,8] {-} class_Ring__and__Field_Oordered__idom(t_a).
% 0.72/0.89 17 [hyper,12,7] {-} class_Ring__and__Field_Ofield(t_a).
% 0.72/0.89 18 [hyper,14,1] {-} c_lessequals(c_0,c_HOL_Oabs(A,t_a),t_a).
% 0.72/0.89 20,19 [hyper,16,3] {-} c_HOL_Oabs(c_times(A,B,t_a),t_a)=c_times(c_HOL_Oabs(A,t_a),c_HOL_Oabs(B,t_a),t_a).
% 0.72/0.89 21 [back_demod,5,demod,20] {-} -c_lessequals(c_times(c_HOL_Oabs(c_HOL_Oinverse(v_c,t_a),t_a),c_HOL_Oabs(v_g(v_x(A)),t_a),t_a),c_times(A,c_HOL_Oabs(v_f(v_x(A)),t_a),t_a),t_a).
% 0.72/0.89 22 [hyper,17,6] {-} class_OrderedGroup_Osemigroup__mult(t_a).
% 0.72/0.89 23 [hyper,22,2] {-} c_times(c_times(A,B,t_a),C,t_a)=c_times(A,c_times(B,C,t_a),t_a).
% 0.72/0.89 26 [hyper,18,4,15,11] {-} c_lessequals(c_times(c_HOL_Oabs(A,t_a),c_HOL_Oabs(v_g(B),t_a),t_a),c_times(c_HOL_Oabs(A,t_a),c_times(v_d,c_HOL_Oabs(v_f(B),t_a),t_a),t_a),t_a).
% 0.72/0.89 43 [para_into,21.1.2,23.1.1] {-} -c_lessequals(c_times(c_HOL_Oabs(c_HOL_Oinverse(v_c,t_a),t_a),c_HOL_Oabs(v_g(v_x(c_times(A,B,t_a))),t_a),t_a),c_times(A,c_times(B,c_HOL_Oabs(v_f(v_x(c_times(A,B,t_a))),t_a),t_a),t_a),t_a).
% 0.72/0.89 44 [binary,43.1,26.1] {-} $F.
% 0.72/0.89
% 0.72/0.89 % SZS output end Refutation
% 0.72/0.89 ------------ end of proof -------------
% 0.72/0.89
% 0.72/0.89
% 0.72/0.89 Search stopped by max_proofs option.
% 0.72/0.89
% 0.72/0.89
% 0.72/0.89 Search stopped by max_proofs option.
% 0.72/0.89
% 0.72/0.89 ============ end of search ============
% 0.72/0.89
% 0.72/0.89 That finishes the proof of the theorem.
% 0.72/0.89
% 0.72/0.89 Process 21019 finished Fri Jul 8 06:29:38 2022
%------------------------------------------------------------------------------