TSTP Solution File: ANA009-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ANA009-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:38 EDT 2022
% Result : Unsatisfiable 0.56s 0.74s
% Output : Refutation 0.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : ANA009-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/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:29:39 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:29:39 2022
% 0.12/0.35 The command was "./sos". The process ID is 2210.
% 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=3.
% 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 8 during input processing: 0 [copy,8,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: 5
% 0.12/0.38 number of clauses initially in problem: 8
% 0.12/0.38 percentage of clauses intially in UL: 62
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 12
% 0.12/0.38 distinct predicate count: 5
% 0.12/0.38 distinct function count: 4
% 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 Model 2 (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 =========== start of search ===========
% 0.56/0.74
% 0.56/0.74 -------- PROOF --------
% 0.56/0.74 % SZS status Unsatisfiable
% 0.56/0.74 % SZS output start Refutation
% 0.56/0.74
% 0.56/0.74 Stopped by limit on insertions
% 0.56/0.74
% 0.56/0.74 Stopped by limit on insertions
% 0.56/0.74
% 0.56/0.74 Model 3 [ 1 1 470 ] (0.00 seconds, 250000 Inserts)
% 0.56/0.74
% 0.56/0.74 Stopped by limit on insertions
% 0.56/0.74
% 0.56/0.74 Model 4 [ 1 1 4049 ] (0.00 seconds, 250000 Inserts)
% 0.56/0.74
% 0.56/0.74 ----> UNIT CONFLICT at 0.37 sec ----> 18 [binary,17.1,3.1] {-} $F.
% 0.56/0.74
% 0.56/0.74 Length of proof is 5. Level of proof is 4.
% 0.56/0.74
% 0.56/0.74 ---------------- PROOF ----------------
% 0.56/0.74 % SZS status Unsatisfiable
% 0.56/0.74 % SZS output start Refutation
% 0.56/0.74
% 0.56/0.74 1 [] {+} -class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(A)| -c_lessequals(B,C,A)|c_lessequals(c_plus(B,D,A),c_plus(C,D,A),A).
% 0.56/0.74 2 [] {+} -class_OrderedGroup_Oab__group__add(A)|c_plus(B,c_uminus(B,A),A)=c_0.
% 0.56/0.74 3 [] {+} -c_lessequals(c_0,c_plus(v_f(v_x),c_uminus(v_lb(v_x),t_b),t_b),t_b).
% 0.56/0.74 4 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(A).
% 0.56/0.74 5 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Oab__group__add(A).
% 0.56/0.74 6 [] {+} c_lessequals(v_lb(A),v_f(A),t_b).
% 0.56/0.74 7 [] {-} class_Ring__and__Field_Oordered__idom(t_b).
% 0.56/0.74 9 [hyper,7,5] {+} class_OrderedGroup_Oab__group__add(t_b).
% 0.56/0.74 10 [hyper,7,4] {+} class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(t_b).
% 0.56/0.74 11 [hyper,10,1,6] {-} c_lessequals(c_plus(v_lb(A),B,t_b),c_plus(v_f(A),B,t_b),t_b).
% 0.56/0.74 15 [para_into,11.1.1,2.2.1] {-} c_lessequals(c_0,c_plus(v_f(A),c_uminus(v_lb(A),t_b),t_b),t_b)| -class_OrderedGroup_Oab__group__add(t_b).
% 0.56/0.74 17 [hyper,15,9] {-} c_lessequals(c_0,c_plus(v_f(A),c_uminus(v_lb(A),t_b),t_b),t_b).
% 0.56/0.74 18 [binary,17.1,3.1] {-} $F.
% 0.56/0.74
% 0.56/0.74 % SZS output end Refutation
% 0.56/0.74 ------------ end of proof -------------
% 0.56/0.74
% 0.56/0.74
% 0.56/0.74 Search stopped by max_proofs option.
% 0.56/0.74
% 0.56/0.74
% 0.56/0.74 Search stopped by max_proofs option.
% 0.56/0.74
% 0.56/0.74 ============ end of search ============
% 0.56/0.74
% 0.56/0.74 ----------- soft-scott stats ----------
% 0.56/0.74
% 0.56/0.74 true clauses given 1 (14.3%)
% 0.56/0.74 false clauses given 6
% 0.56/0.74
% 0.56/0.74 FALSE TRUE
% 0.56/0.74 8 0 1
% 0.56/0.74 13 0 1
% 0.56/0.74 18 1 0
% 0.56/0.74 tot: 1 2 (66.7% true)
% 0.56/0.74
% 0.56/0.74
% 0.56/0.74 Model 4 [ 1 1 4049 ] (0.00 seconds, 250000 Inserts)
% 0.56/0.74
% 0.56/0.74 That finishes the proof of the theorem.
% 0.56/0.74
% 0.56/0.74 Process 2210 finished Fri Jul 8 04:29:40 2022
%------------------------------------------------------------------------------