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