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