TSTP Solution File: HWV017-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV017-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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 : Sat Jul 16 19:12:39 EDT 2022
% Result : Unsatisfiable 4.49s 4.73s
% Output : Refutation 4.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : HWV017-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 17 05:23:00 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.38 ----- Otter 3.2, August 2001 -----
% 0.20/0.38 The process was started by sandbox2 on n021.cluster.edu,
% 0.20/0.38 Fri Jun 17 05:23:00 2022
% 0.20/0.38 The command was "./sos". The process ID is 15267.
% 0.20/0.38
% 0.20/0.38 set(prolog_style_variables).
% 0.20/0.38 set(auto).
% 0.20/0.38 dependent: set(auto1).
% 0.20/0.38 dependent: set(process_input).
% 0.20/0.38 dependent: clear(print_kept).
% 0.20/0.38 dependent: clear(print_new_demod).
% 0.20/0.38 dependent: clear(print_back_demod).
% 0.20/0.38 dependent: clear(print_back_sub).
% 0.20/0.38 dependent: set(control_memory).
% 0.20/0.38 dependent: assign(max_mem, 12000).
% 0.20/0.38 dependent: assign(pick_given_ratio, 4).
% 0.20/0.38 dependent: assign(stats_level, 1).
% 0.20/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.38 dependent: assign(sos_limit, 5000).
% 0.20/0.38 dependent: assign(max_weight, 60).
% 0.20/0.38 clear(print_given).
% 0.20/0.38
% 0.20/0.38 list(usable).
% 0.20/0.38
% 0.20/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.20/0.38
% 0.20/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.38 clauses in usable.
% 0.20/0.38
% 0.20/0.38 dependent: set(knuth_bendix).
% 0.20/0.38 dependent: set(para_from).
% 0.20/0.38 dependent: set(para_into).
% 0.20/0.38 dependent: clear(para_from_right).
% 0.20/0.38 dependent: clear(para_into_right).
% 0.20/0.38 dependent: set(para_from_vars).
% 0.20/0.38 dependent: set(eq_units_both_ways).
% 0.20/0.38 dependent: set(dynamic_demod_all).
% 0.20/0.38 dependent: set(dynamic_demod).
% 0.20/0.38 dependent: set(order_eq).
% 0.20/0.38 dependent: set(back_demod).
% 0.20/0.38 dependent: set(lrpo).
% 0.20/0.38 dependent: set(hyper_res).
% 0.20/0.38 dependent: set(unit_deletion).
% 0.20/0.38 dependent: set(factor).
% 0.20/0.38
% 0.20/0.38 ------------> process usable:
% 0.20/0.38
% 0.20/0.38 ------------> process sos:
% 0.20/0.38 Following clause subsumed by 101 during input processing: 0 [copy,92,flip.1] {-} n1=n1.
% 0.20/0.38 Following clause subsumed by 101 during input processing: 0 [copy,101,flip.1] {-} A=A.
% 0.20/0.38 101 back subsumes 92.
% 0.20/0.38
% 0.20/0.38 ======= end of input processing =======
% 0.75/0.94
% 0.75/0.94 Stopped by limit on insertions
% 0.75/0.94
% 0.75/0.94
% 0.75/0.94 Failed to model usable list: disabling FINDER
% 0.75/0.94
% 0.75/0.94
% 0.75/0.94
% 0.75/0.94 -------------- Softie stats --------------
% 0.75/0.94
% 0.75/0.94 UPDATE_STOP: 300
% 0.75/0.94 SFINDER_TIME_LIMIT: 2
% 0.75/0.94 SHORT_CLAUSE_CUTOFF: 4
% 0.75/0.94 number of clauses in intial UL: 82
% 0.75/0.94 number of clauses initially in problem: 98
% 0.75/0.94 percentage of clauses intially in UL: 83
% 0.75/0.94 percentage of distinct symbols occuring in initial UL: 91
% 0.75/0.94 percent of all initial clauses that are short: 100
% 0.75/0.94 absolute distinct symbol count: 24
% 0.75/0.94 distinct predicate count: 13
% 0.75/0.94 distinct function count: 7
% 0.75/0.94 distinct constant count: 4
% 0.75/0.94
% 0.75/0.94 ---------- no more Softie stats ----------
% 0.75/0.94
% 0.75/0.94
% 0.75/0.94
% 0.75/0.94 =========== start of search ===========
% 4.49/4.68
% 4.49/4.68
% 4.49/4.68 Changing weight limit from 60 to 55.
% 4.49/4.68
% 4.49/4.68 Resetting weight limit to 55 after 120 givens.
% 4.49/4.68
% 4.49/4.73
% 4.49/4.73 -------- PROOF --------
% 4.49/4.73 % SZS status Unsatisfiable
% 4.49/4.73 % SZS output start Refutation
% 4.49/4.73
% 4.49/4.73 ----> UNIT CONFLICT at 4.33 sec ----> 5466 [binary,5465.1,102.1] {-} $F.
% 4.49/4.73
% 4.49/4.73 Length of proof is 11. Level of proof is 6.
% 4.49/4.73
% 4.49/4.73 ---------------- PROOF ----------------
% 4.49/4.73 % SZS status Unsatisfiable
% 4.49/4.73 % SZS output start Refutation
% 4.49/4.73
% 4.49/4.73 1 [] {+} plus(A,n1)!=n0.
% 4.49/4.73 2 [] {+} -gt(A,n0)|gt(A,minus(A,n1)).
% 4.49/4.73 7 [] {+} -gt(A,B)|gt(plus(A,n1),plus(B,n1)).
% 4.49/4.73 13 [] {+} -gt(A,A).
% 4.49/4.73 16 [] {+} int_level(A)=fifo_length| -p_Full(A).
% 4.49/4.73 63 [] {+} p_Reset(A)|p_Wr(A)| -p_Rd(A)| -gt(int_level(A),n0)|int_level(plus(A,n1))=minus(int_level(A),n1).
% 4.49/4.73 70 [] {+} p_Reset(A)|p_Wr(A)| -p_Rd(A)|gt(int_level(A),n0)|int_level(plus(A,n1))=int_level(A).
% 4.49/4.73 81 [] {-} -gt(level(t_139),fifo_length).
% 4.49/4.73 82 [] {+} -p_Wr(t_139).
% 4.49/4.73 83 [] {+} -p_Reset(t_139).
% 4.49/4.73 86 [] {-} A=n0|gt(A,n0).
% 4.49/4.73 87 [] {-} A=n0|A=plus(y_27(A),n1).
% 4.49/4.73 88 [copy,87,flip.2] {-} A=n0|plus(y_27(A),n1)=A.
% 4.49/4.73 90,89 [] {-} plus(n0,A)=A.
% 4.49/4.73 94,93 [] {-} level(A)=int_level(A).
% 4.49/4.73 98 [] {-} p_Rd(t_139).
% 4.49/4.73 99 [] {-} p_Full(plus(t_139,n1)).
% 4.49/4.73 100 [] {-} gt(fifo_length,n0).
% 4.49/4.73 102 [back_demod,81,demod,94] {-} -gt(int_level(t_139),fifo_length).
% 4.49/4.73 130 [hyper,98,70,unit_del,83,82] {-} gt(int_level(t_139),n0)|int_level(plus(t_139,n1))=int_level(t_139).
% 4.49/4.73 141 [hyper,100,7,demod,90] {-} gt(plus(fifo_length,n1),n1).
% 4.49/4.73 160,159 [hyper,99,16] {-} int_level(plus(t_139,n1))=fifo_length.
% 4.49/4.73 161 [back_demod,130,demod,160,flip.2] {-} gt(int_level(t_139),n0)|int_level(t_139)=fifo_length.
% 4.49/4.73 873 [para_from,88.1.1,141.1.1.1,demod,90,unit_del,13] {-} plus(y_27(fifo_length),n1)=fifo_length.
% 4.49/4.73 2400 [para_from,873.1.1,1.1.1,flip.1] {-} n0!=fifo_length.
% 4.49/4.73 5457 [para_into,161.2.1,86.1.1,unit_del,2400,factor_simp] {-} gt(int_level(t_139),n0).
% 4.49/4.73 5462,5461 [hyper,5457,63,98,demod,160,unit_del,83,82,flip.1] {-} minus(int_level(t_139),n1)=fifo_length.
% 4.49/4.73 5465 [hyper,5457,2,demod,5462] {-} gt(int_level(t_139),fifo_length).
% 4.49/4.73 5466 [binary,5465.1,102.1] {-} $F.
% 4.49/4.73
% 4.49/4.73 % SZS output end Refutation
% 4.49/4.73 ------------ end of proof -------------
% 4.49/4.73
% 4.49/4.73
% 4.49/4.73 Search stopped by max_proofs option.
% 4.49/4.73
% 4.49/4.73
% 4.49/4.73 Search stopped by max_proofs option.
% 4.49/4.73
% 4.49/4.73 ============ end of search ============
% 4.49/4.73
% 4.49/4.73 That finishes the proof of the theorem.
% 4.49/4.73
% 4.49/4.73 Process 15267 finished Fri Jun 17 05:23:04 2022
%------------------------------------------------------------------------------