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