TSTP Solution File: HWV028-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV028-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:46 EDT 2022
% Result : Unsatisfiable 0.75s 0.97s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : HWV028-1 : TPTP v8.1.0. Released v2.5.0.
% 0.08/0.15 % Command : sos-script %s
% 0.16/0.36 % Computer : n028.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 600
% 0.16/0.36 % DateTime : Fri Jun 17 07:19:27 EDT 2022
% 0.16/0.36 % CPUTime :
% 0.16/0.39 ----- Otter 3.2, August 2001 -----
% 0.16/0.39 The process was started by sandbox2 on n028.cluster.edu,
% 0.16/0.39 Fri Jun 17 07:19:27 2022
% 0.16/0.39 The command was "./sos". The process ID is 26179.
% 0.16/0.39
% 0.16/0.39 set(prolog_style_variables).
% 0.16/0.39 set(auto).
% 0.16/0.39 dependent: set(auto1).
% 0.16/0.39 dependent: set(process_input).
% 0.16/0.39 dependent: clear(print_kept).
% 0.16/0.39 dependent: clear(print_new_demod).
% 0.16/0.39 dependent: clear(print_back_demod).
% 0.16/0.39 dependent: clear(print_back_sub).
% 0.16/0.39 dependent: set(control_memory).
% 0.16/0.39 dependent: assign(max_mem, 12000).
% 0.16/0.39 dependent: assign(pick_given_ratio, 4).
% 0.16/0.39 dependent: assign(stats_level, 1).
% 0.16/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.16/0.39 dependent: assign(sos_limit, 5000).
% 0.16/0.39 dependent: assign(max_weight, 60).
% 0.16/0.39 clear(print_given).
% 0.16/0.39
% 0.16/0.39 list(usable).
% 0.16/0.39
% 0.16/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.16/0.39
% 0.16/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.16/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.16/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.16/0.39 clauses in usable.
% 0.16/0.39
% 0.16/0.39 dependent: set(knuth_bendix).
% 0.16/0.39 dependent: set(para_from).
% 0.16/0.39 dependent: set(para_into).
% 0.16/0.39 dependent: clear(para_from_right).
% 0.16/0.39 dependent: clear(para_into_right).
% 0.16/0.39 dependent: set(para_from_vars).
% 0.16/0.39 dependent: set(eq_units_both_ways).
% 0.16/0.39 dependent: set(dynamic_demod_all).
% 0.16/0.39 dependent: set(dynamic_demod).
% 0.16/0.39 dependent: set(order_eq).
% 0.16/0.39 dependent: set(back_demod).
% 0.16/0.39 dependent: set(lrpo).
% 0.16/0.39 dependent: set(hyper_res).
% 0.16/0.39 dependent: set(unit_deletion).
% 0.16/0.39 dependent: set(factor).
% 0.16/0.39
% 0.16/0.39 ------------> process usable:
% 0.16/0.39
% 0.16/0.39 ------------> process sos:
% 0.16/0.39 Following clause subsumed by 99 during input processing: 0 [copy,89,flip.1] {-} n1=n1.
% 0.16/0.39 Following clause subsumed by 99 during input processing: 0 [copy,99,flip.1] {-} A=A.
% 0.16/0.39 99 back subsumes 89.
% 0.16/0.39
% 0.16/0.39 ======= end of input processing =======
% 0.75/0.97
% 0.75/0.97 Stopped by limit on insertions
% 0.75/0.97
% 0.75/0.97
% 0.75/0.97 Failed to model usable list: disabling FINDER
% 0.75/0.97
% 0.75/0.97
% 0.75/0.97
% 0.75/0.97 -------------- Softie stats --------------
% 0.75/0.97
% 0.75/0.97 UPDATE_STOP: 300
% 0.75/0.97 SFINDER_TIME_LIMIT: 2
% 0.75/0.97 SHORT_CLAUSE_CUTOFF: 4
% 0.75/0.97 number of clauses in intial UL: 80
% 0.75/0.97 number of clauses initially in problem: 95
% 0.75/0.97 percentage of clauses intially in UL: 84
% 0.75/0.97 percentage of distinct symbols occuring in initial UL: 87
% 0.75/0.97 percent of all initial clauses that are short: 100
% 0.75/0.97 absolute distinct symbol count: 24
% 0.75/0.97 distinct predicate count: 13
% 0.75/0.97 distinct function count: 7
% 0.75/0.97 distinct constant count: 4
% 0.75/0.97
% 0.75/0.97 ---------- no more Softie stats ----------
% 0.75/0.97
% 0.75/0.97
% 0.75/0.97
% 0.75/0.97 =========== start of search ===========
% 0.75/0.97
% 0.75/0.97 -------- PROOF --------
% 0.75/0.97 % SZS status Unsatisfiable
% 0.75/0.97 % SZS output start Refutation
% 0.75/0.97
% 0.75/0.97 ----> UNIT CONFLICT at 0.55 sec ----> 162 [binary,161.1,13.1] {-} $F.
% 0.75/0.97
% 0.75/0.97 Length of proof is 4. Level of proof is 3.
% 0.75/0.97
% 0.75/0.97 ---------------- PROOF ----------------
% 0.75/0.97 % SZS status Unsatisfiable
% 0.75/0.97 % SZS output start Refutation
% 0.75/0.97
% 0.75/0.97 11 [] {+} -gt(A,B)|gt(A,C)| -gt(B,C).
% 0.75/0.97 13 [] {+} -gt(A,A).
% 0.75/0.97 19 [] {+} -p_Reset(A)|int_level(plus(A,n1))=n0.
% 0.75/0.97 91,90 [] {-} level(A)=int_level(A).
% 0.75/0.97 95 [] {-} p_Reset(t_139).
% 0.75/0.97 96 [] {-} gt(level(plus(t_139,n1)),fifo_length).
% 0.75/0.97 97 [copy,96,demod,91] {-} gt(int_level(plus(t_139,n1)),fifo_length).
% 0.75/0.97 98 [] {-} gt(fifo_length,n0).
% 0.75/0.97 132,131 [hyper,95,19] {-} int_level(plus(t_139,n1))=n0.
% 0.75/0.97 133 [back_demod,97,demod,132] {-} gt(n0,fifo_length).
% 0.75/0.97 161 [hyper,133,11,98] {-} gt(fifo_length,fifo_length).
% 0.75/0.97 162 [binary,161.1,13.1] {-} $F.
% 0.75/0.97
% 0.75/0.97 % SZS output end Refutation
% 0.75/0.97 ------------ end of proof -------------
% 0.75/0.97
% 0.75/0.97
% 0.75/0.97 Search stopped by max_proofs option.
% 0.75/0.97
% 0.75/0.97
% 0.75/0.97 Search stopped by max_proofs option.
% 0.75/0.97
% 0.75/0.97 ============ end of search ============
% 0.75/0.97
% 0.75/0.97 That finishes the proof of the theorem.
% 0.75/0.97
% 0.75/0.97 Process 26179 finished Fri Jun 17 07:19:28 2022
%------------------------------------------------------------------------------