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