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