TSTP Solution File: SWV019-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV019-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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 : Wed Jul 20 21:36:47 EDT 2022
% Result : Unsatisfiable 0.66s 0.93s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWV019-1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n008.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 : Tue Jun 14 22:28:52 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 sandbox2 on n008.cluster.edu,
% 0.12/0.35 Tue Jun 14 22:28:52 2022
% 0.12/0.35 The command was "./sos". The process ID is 13942.
% 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=0, equality=1, symmetry=0, max_lits=7.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 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: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 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 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 7
% 0.12/0.37 number of clauses initially in problem: 11
% 0.12/0.37 percentage of clauses intially in UL: 63
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 11
% 0.12/0.37 distinct predicate count: 3
% 0.12/0.37 distinct function count: 2
% 0.12/0.37 distinct constant count: 6
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 0.66/0.93
% 0.66/0.93 -------- PROOF --------
% 0.66/0.93 % SZS status Unsatisfiable
% 0.66/0.93 % SZS output start Refutation
% 0.66/0.93
% 0.66/0.93 Model 2 (0.00 seconds, 0 Inserts)
% 0.66/0.93
% 0.66/0.93 Stopped by limit on number of solutions
% 0.66/0.93
% 0.66/0.93 Model 3 (0.00 seconds, 0 Inserts)
% 0.66/0.93
% 0.66/0.93 Stopped by limit on number of solutions
% 0.66/0.93
% 0.66/0.93 Stopped by limit on insertions
% 0.66/0.93
% 0.66/0.93 Model 4 [ 2 1 50 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.93
% 0.66/0.93 Stopped by limit on insertions
% 0.66/0.93
% 0.66/0.93 Model 5 [ 3 0 58 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.93
% 0.66/0.93 Stopped by limit on insertions
% 0.66/0.93
% 0.66/0.93 Model 6 [ 3 1 139 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.93
% 0.66/0.93 Stopped by limit on insertions
% 0.66/0.93
% 0.66/0.93 Model 7 [ 2 0 403 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.93
% 0.66/0.93 Stopped by limit on insertions
% 0.66/0.93
% 0.66/0.93 Model 8 [ 6 0 87 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.93
% 0.66/0.93 ----> UNIT CONFLICT at 0.55 sec ----> 49 [binary,48.1,7.1] {+} $F.
% 0.66/0.93
% 0.66/0.93 Length of proof is 9. Level of proof is 5.
% 0.66/0.93
% 0.66/0.93 ---------------- PROOF ----------------
% 0.66/0.93 % SZS status Unsatisfiable
% 0.66/0.93 % SZS output start Refutation
% 0.66/0.93
% 0.66/0.93 1 [] {+} -less_than(successor(A),successor(B))|less_than(A,B).
% 0.66/0.93 2 [] {+} -less_than(A,B)| -less_than(B,C)|less_than(A,C).
% 0.66/0.93 3 [] {-} -in_array_bounds(array,index_of_maximal)|maximal_value=array_value_at(array,index_of_maximal).
% 0.66/0.93 4 [copy,3,flip.2] {+} -in_array_bounds(array,index_of_maximal)|array_value_at(array,index_of_maximal)=maximal_value.
% 0.66/0.93 5 [] {+} -less_than(an_index,lower_bound).
% 0.66/0.93 6 [] {+} -less_than(upper_bound,an_index).
% 0.66/0.93 7 [] {+} -less_than(index_of_maximal,lower_bound).
% 0.66/0.93 8 [] {-} -in_array_bounds(array,an_index)|less_than(successor(an_index),lower_bound)|less_than(successor(upper_bound),successor(an_index))|less_than(index_of_maximal,lower_bound)| -less_than(index_of_maximal,successor(an_index))| -in_array_bounds(array,index_of_maximal)|maximal_value!=array_value_at(array,index_of_maximal).
% 0.66/0.93 9 [copy,8,unit_del,7,flip.6] {+} -in_array_bounds(array,an_index)|less_than(successor(an_index),lower_bound)|less_than(successor(upper_bound),successor(an_index))| -less_than(index_of_maximal,successor(an_index))| -in_array_bounds(array,index_of_maximal)|array_value_at(array,index_of_maximal)!=maximal_value.
% 0.66/0.93 10 [] {+} less_than(A,lower_bound)|less_than(upper_bound,A)|in_array_bounds(array,A).
% 0.66/0.93 11 [] {+} less_than(A,successor(A)).
% 0.66/0.93 12 [] {+} less_than(index_of_maximal,an_index).
% 0.66/0.93 13 [] {+} A=A.
% 0.66/0.93 15 [hyper,10,5,unit_del,6] {+} in_array_bounds(array,an_index).
% 0.66/0.93 16 [hyper,12,2,10,unit_del,6,7] {+} in_array_bounds(array,index_of_maximal).
% 0.66/0.93 17 [hyper,11,2,12] {+} less_than(index_of_maximal,successor(an_index)).
% 0.66/0.93 23,22 [hyper,16,4] {-} array_value_at(array,index_of_maximal)=maximal_value.
% 0.66/0.93 24 [back_demod,9,demod,23,unit_del,15,17,16,13] {-} less_than(successor(an_index),lower_bound)|less_than(successor(upper_bound),successor(an_index)).
% 0.66/0.93 46 [hyper,24,1,unit_del,6] {+} less_than(successor(an_index),lower_bound).
% 0.66/0.93 48 [hyper,46,2,17] {-} less_than(index_of_maximal,lower_bound).
% 0.66/0.93 49 [binary,48.1,7.1] {+} $F.
% 0.66/0.93
% 0.66/0.93 % SZS output end Refutation
% 0.66/0.93 ------------ end of proof -------------
% 0.66/0.93
% 0.66/0.93
% 0.66/0.93 Search stopped by max_proofs option.
% 0.66/0.93
% 0.66/0.93
% 0.66/0.93 Search stopped by max_proofs option.
% 0.66/0.93
% 0.66/0.93 ============ end of search ============
% 0.66/0.93
% 0.66/0.93 ----------- soft-scott stats ----------
% 0.66/0.93
% 0.66/0.93 true clauses given 2 (15.4%)
% 0.66/0.93 false clauses given 11
% 0.66/0.93
% 0.66/0.93 FALSE TRUE
% 0.66/0.93 5 2 0
% 0.66/0.93 6 2 0
% 0.66/0.93 7 1 0
% 0.66/0.93 9 0 1
% 0.66/0.93 10 0 2
% 0.66/0.93 11 0 4
% 0.66/0.93 12 0 3
% 0.66/0.93 13 0 1
% 0.66/0.93 14 0 1
% 0.66/0.93 tot: 5 12 (70.6% true)
% 0.66/0.93
% 0.66/0.93
% 0.66/0.93 Model 8 [ 6 0 87 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.93
% 0.66/0.93 That finishes the proof of the theorem.
% 0.66/0.93
% 0.66/0.93 Process 13942 finished Tue Jun 14 22:28:53 2022
%------------------------------------------------------------------------------