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