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