TSTP Solution File: ANA017-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ANA017-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:44 EDT 2022
% Result : Unsatisfiable 0.50s 0.72s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ANA017-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n026.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 04:12:54 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 sandbox on n026.cluster.edu,
% 0.12/0.35 Fri Jul 8 04:12:54 2022
% 0.12/0.35 The command was "./sos". The process ID is 4813.
% 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 11 during input processing: 0 [copy,11,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 8
% 0.19/0.38 number of clauses initially in problem: 11
% 0.19/0.38 percentage of clauses intially in UL: 72
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 93
% 0.19/0.38 percent of all initial clauses that are short: 90
% 0.19/0.38 absolute distinct symbol count: 15
% 0.19/0.38 distinct predicate count: 6
% 0.19/0.38 distinct function count: 5
% 0.19/0.38 distinct constant count: 4
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 0.50/0.72
% 0.50/0.72 -------- PROOF --------
% 0.50/0.72 % SZS status Unsatisfiable
% 0.50/0.72 % SZS output start Refutation
% 0.50/0.72
% 0.50/0.72 Stopped by limit on insertions
% 0.50/0.72
% 0.50/0.72 Stopped by limit on insertions
% 0.50/0.72
% 0.50/0.72 ----> UNIT CONFLICT at 0.34 sec ----> 34 [binary,33.1,23.1] {-} $F.
% 0.50/0.72
% 0.50/0.72 Length of proof is 9. Level of proof is 3.
% 0.50/0.72
% 0.50/0.72 ---------------- PROOF ----------------
% 0.50/0.72 % SZS status Unsatisfiable
% 0.50/0.72 % SZS output start Refutation
% 0.50/0.72
% 0.50/0.72 1 [] {+} -c_lessequals(c_HOL_Oabs(c_times(v_c,v_b(v_x(A)),t_b),t_b),c_times(A,c_HOL_Oabs(v_f(v_x(A)),t_b),t_b),t_b).
% 0.50/0.72 2 [] {+} -class_OrderedGroup_Olordered__ab__group__abs(A)|c_lessequals(c_0,c_HOL_Oabs(B,A),A).
% 0.50/0.72 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.50/0.72 4 [] {+} -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.50/0.72 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.50/0.72 6 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Osemigroup__mult(A).
% 0.50/0.72 7 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_Ring__and__Field_Opordered__semiring(A).
% 0.50/0.72 8 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Olordered__ab__group__abs(A).
% 0.50/0.72 9 [] {-} c_lessequals(c_HOL_Oabs(v_b(A),t_b),c_times(v_ca,c_HOL_Oabs(v_f(A),t_b),t_b),t_b).
% 0.50/0.72 10 [] {-} class_Ring__and__Field_Oordered__idom(t_b).
% 0.50/0.72 12 [hyper,10,8] {+} class_OrderedGroup_Olordered__ab__group__abs(t_b).
% 0.50/0.72 13 [hyper,10,7] {+} class_Ring__and__Field_Opordered__semiring(t_b).
% 0.50/0.72 14 [hyper,10,6] {-} class_OrderedGroup_Osemigroup__mult(t_b).
% 0.50/0.72 16,15 [hyper,10,4] {+} c_HOL_Oabs(c_times(A,B,t_b),t_b)=c_times(c_HOL_Oabs(A,t_b),c_HOL_Oabs(B,t_b),t_b).
% 0.50/0.72 17 [back_demod,1,demod,16] {+} -c_lessequals(c_times(c_HOL_Oabs(v_c,t_b),c_HOL_Oabs(v_b(v_x(A)),t_b),t_b),c_times(A,c_HOL_Oabs(v_f(v_x(A)),t_b),t_b),t_b).
% 0.50/0.72 18 [hyper,14,3] {-} c_times(c_times(A,B,t_b),C,t_b)=c_times(A,c_times(B,C,t_b),t_b).
% 0.50/0.72 21 [hyper,12,2] {+} c_lessequals(c_0,c_HOL_Oabs(A,t_b),t_b).
% 0.50/0.72 23 [hyper,21,5,13,9] {-} 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(v_ca,c_HOL_Oabs(v_f(B),t_b),t_b),t_b),t_b).
% 0.50/0.72 33 [para_into,17.1.2,18.1.1] {-} -c_lessequals(c_times(c_HOL_Oabs(v_c,t_b),c_HOL_Oabs(v_b(v_x(c_times(A,B,t_b))),t_b),t_b),c_times(A,c_times(B,c_HOL_Oabs(v_f(v_x(c_times(A,B,t_b))),t_b),t_b),t_b),t_b).
% 0.50/0.72 34 [binary,33.1,23.1] {-} $F.
% 0.50/0.72
% 0.50/0.72 % SZS output end Refutation
% 0.50/0.72 ------------ end of proof -------------
% 0.50/0.72
% 0.50/0.72
% 0.50/0.72 Search stopped by max_proofs option.
% 0.50/0.72
% 0.50/0.72
% 0.50/0.72 Search stopped by max_proofs option.
% 0.50/0.72
% 0.50/0.72 ============ end of search ============
% 0.50/0.72
% 0.50/0.72 ----------- soft-scott stats ----------
% 0.50/0.72
% 0.50/0.72 true clauses given 8 (50.0%)
% 0.50/0.72 false clauses given 8
% 0.50/0.72
% 0.50/0.72 FALSE TRUE
% 0.50/0.72 16 0 2
% 0.50/0.72 21 0 1
% 0.50/0.72 26 0 1
% 0.50/0.72 29 0 1
% 0.50/0.72 31 0 1
% 0.50/0.72 tot: 0 6 (100.0% true)
% 0.50/0.72
% 0.50/0.72
% 0.50/0.72 Model 1 (0.00 seconds, 0 Inserts)
% 0.50/0.72
% 0.50/0.72 That finishes the proof of the theorem.
% 0.50/0.72
% 0.50/0.72 Process 4813 finished Fri Jul 8 04:12:55 2022
%------------------------------------------------------------------------------