TSTP Solution File: HWV019-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV019-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:40 EDT 2022
% Result : Unsatisfiable 0.92s 1.12s
% Output : Refutation 0.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV019-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n024.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 Jun 17 01:18:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox2 on n024.cluster.edu,
% 0.20/0.36 Fri Jun 17 01:18:33 2022
% 0.20/0.36 The command was "./sos". The process ID is 18452.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.20/0.36
% 0.20/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.36 clauses in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(knuth_bendix).
% 0.20/0.36 dependent: set(para_from).
% 0.20/0.36 dependent: set(para_into).
% 0.20/0.36 dependent: clear(para_from_right).
% 0.20/0.36 dependent: clear(para_into_right).
% 0.20/0.36 dependent: set(para_from_vars).
% 0.20/0.36 dependent: set(eq_units_both_ways).
% 0.20/0.36 dependent: set(dynamic_demod_all).
% 0.20/0.36 dependent: set(dynamic_demod).
% 0.20/0.36 dependent: set(order_eq).
% 0.20/0.36 dependent: set(back_demod).
% 0.20/0.36 dependent: set(lrpo).
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: set(unit_deletion).
% 0.20/0.36 dependent: set(factor).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36 Following clause subsumed by 100 during input processing: 0 [copy,90,flip.1] {-} n1=n1.
% 0.20/0.36 Following clause subsumed by 100 during input processing: 0 [copy,100,flip.1] {-} A=A.
% 0.20/0.36 100 back subsumes 90.
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.69/0.91
% 0.69/0.91 Stopped by limit on insertions
% 0.69/0.91
% 0.69/0.91
% 0.69/0.91 Failed to model usable list: disabling FINDER
% 0.69/0.91
% 0.69/0.91
% 0.69/0.91
% 0.69/0.91 -------------- Softie stats --------------
% 0.69/0.91
% 0.69/0.91 UPDATE_STOP: 300
% 0.69/0.91 SFINDER_TIME_LIMIT: 2
% 0.69/0.91 SHORT_CLAUSE_CUTOFF: 4
% 0.69/0.91 number of clauses in intial UL: 81
% 0.69/0.91 number of clauses initially in problem: 96
% 0.69/0.91 percentage of clauses intially in UL: 84
% 0.69/0.91 percentage of distinct symbols occuring in initial UL: 91
% 0.69/0.91 percent of all initial clauses that are short: 100
% 0.69/0.91 absolute distinct symbol count: 24
% 0.69/0.91 distinct predicate count: 13
% 0.69/0.91 distinct function count: 7
% 0.69/0.91 distinct constant count: 4
% 0.69/0.91
% 0.69/0.91 ---------- no more Softie stats ----------
% 0.69/0.91
% 0.69/0.91
% 0.69/0.91
% 0.69/0.91 =========== start of search ===========
% 0.92/1.12
% 0.92/1.12 -------- PROOF --------
% 0.92/1.12 % SZS status Unsatisfiable
% 0.92/1.12 % SZS output start Refutation
% 0.92/1.12
% 0.92/1.12 ----> UNIT CONFLICT at 0.73 sec ----> 1198 [binary,1197.1,81.1] {-} $F.
% 0.92/1.12
% 0.92/1.12 Length of proof is 4. Level of proof is 4.
% 0.92/1.12
% 0.92/1.12 ---------------- PROOF ----------------
% 0.92/1.12 % SZS status Unsatisfiable
% 0.92/1.12 % SZS output start Refutation
% 0.92/1.12
% 0.92/1.12 27 [] {+} p_Reset(A)| -p_Wr(A)|p_Rd(A)| -gt(fifo_length,int_level(A))| -p_Wr_error(plus(A,n1)).
% 0.92/1.12 44 [] {+} p_Reset(A)| -p_Wr(A)| -p_Rd(A)| -p_Wr_error(plus(A,n1)).
% 0.92/1.12 81 [] {+} -p_Reset(t_139).
% 0.92/1.12 92,91 [] {-} level(A)=int_level(A).
% 0.92/1.12 96 [] {-} p_Wr_error(plus(t_139,n1)).
% 0.92/1.12 97 [] {-} p_Wr(t_139).
% 0.92/1.12 98 [] {-} gt(fifo_length,level(t_139))|p_Rd(t_139).
% 0.92/1.12 99 [copy,98,demod,92] {-} gt(fifo_length,int_level(t_139))|p_Rd(t_139).
% 0.92/1.12 1101 [hyper,99,44,97,96,unit_del,81] {-} gt(fifo_length,int_level(t_139)).
% 0.92/1.12 1149 [hyper,1101,27,97,96,unit_del,81] {-} p_Rd(t_139).
% 0.92/1.12 1197 [hyper,1149,44,97,96] {-} p_Reset(t_139).
% 0.92/1.12 1198 [binary,1197.1,81.1] {-} $F.
% 0.92/1.12
% 0.92/1.12 % SZS output end Refutation
% 0.92/1.12 ------------ end of proof -------------
% 0.92/1.12
% 0.92/1.12
% 0.92/1.12 Search stopped by max_proofs option.
% 0.92/1.12
% 0.92/1.12
% 0.92/1.12 Search stopped by max_proofs option.
% 0.92/1.12
% 0.92/1.12 ============ end of search ============
% 0.92/1.12
% 0.92/1.12 That finishes the proof of the theorem.
% 0.92/1.12
% 0.92/1.12 Process 18452 finished Fri Jun 17 01:18:33 2022
%------------------------------------------------------------------------------