TSTP Solution File: HWV014-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV014-2 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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.47s 0.64s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV014-2 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jun 17 10:13:35 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.38 ----- Otter 3.2, August 2001 -----
% 0.21/0.38 The process was started by sandbox2 on n016.cluster.edu,
% 0.21/0.38 Fri Jun 17 10:13:35 2022
% 0.21/0.38 The command was "./sos". The process ID is 1273.
% 0.21/0.38
% 0.21/0.38 set(prolog_style_variables).
% 0.21/0.38 set(auto).
% 0.21/0.38 dependent: set(auto1).
% 0.21/0.38 dependent: set(process_input).
% 0.21/0.38 dependent: clear(print_kept).
% 0.21/0.38 dependent: clear(print_new_demod).
% 0.21/0.38 dependent: clear(print_back_demod).
% 0.21/0.38 dependent: clear(print_back_sub).
% 0.21/0.38 dependent: set(control_memory).
% 0.21/0.38 dependent: assign(max_mem, 12000).
% 0.21/0.38 dependent: assign(pick_given_ratio, 4).
% 0.21/0.38 dependent: assign(stats_level, 1).
% 0.21/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.38 dependent: assign(sos_limit, 5000).
% 0.21/0.38 dependent: assign(max_weight, 60).
% 0.21/0.38 clear(print_given).
% 0.21/0.38
% 0.21/0.38 list(usable).
% 0.21/0.38
% 0.21/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.21/0.38
% 0.21/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.21/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.21/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.21/0.38 clauses in usable.
% 0.21/0.38
% 0.21/0.38 dependent: set(knuth_bendix).
% 0.21/0.38 dependent: set(para_from).
% 0.21/0.38 dependent: set(para_into).
% 0.21/0.38 dependent: clear(para_from_right).
% 0.21/0.38 dependent: clear(para_into_right).
% 0.21/0.38 dependent: set(para_from_vars).
% 0.21/0.38 dependent: set(eq_units_both_ways).
% 0.21/0.38 dependent: set(dynamic_demod_all).
% 0.21/0.38 dependent: set(dynamic_demod).
% 0.21/0.38 dependent: set(order_eq).
% 0.21/0.38 dependent: set(back_demod).
% 0.21/0.38 dependent: set(lrpo).
% 0.21/0.38 dependent: set(hyper_res).
% 0.21/0.38 dependent: set(unit_deletion).
% 0.21/0.38 dependent: set(factor).
% 0.21/0.38
% 0.21/0.38 ------------> process usable:
% 0.21/0.38
% 0.21/0.38 ------------> process sos:
% 0.21/0.38 Following clause subsumed by 191 during input processing: 0 [copy,146,flip.1] {-} n1=n1.
% 0.21/0.38 Following clause subsumed by 191 during input processing: 0 [copy,191,flip.1] {-} A=A.
% 0.21/0.38 191 back subsumes 146.
% 0.21/0.38 191 back subsumes 121.
% 0.21/0.38
% 0.21/0.38 ======= end of input processing =======
% 0.47/0.64
% 0.47/0.64 Stopped by limit on insertions
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64 Failed to model usable list: disabling FINDER
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64 -------------- Softie stats --------------
% 0.47/0.64
% 0.47/0.64 UPDATE_STOP: 300
% 0.47/0.64 SFINDER_TIME_LIMIT: 2
% 0.47/0.64 SHORT_CLAUSE_CUTOFF: 4
% 0.47/0.64 number of clauses in intial UL: 122
% 0.47/0.64 number of clauses initially in problem: 181
% 0.47/0.64 percentage of clauses intially in UL: 67
% 0.47/0.64 percentage of distinct symbols occuring in initial UL: 74
% 0.47/0.64 percent of all initial clauses that are short: 100
% 0.47/0.64 absolute distinct symbol count: 59
% 0.47/0.64 distinct predicate count: 4
% 0.47/0.64 distinct function count: 42
% 0.47/0.64 distinct constant count: 13
% 0.47/0.64
% 0.47/0.64 ---------- no more Softie stats ----------
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64 =========== start of search ===========
% 0.47/0.64
% 0.47/0.64 -------- PROOF --------
% 0.47/0.64 % SZS status Unsatisfiable
% 0.47/0.64 % SZS output start Refutation
% 0.47/0.64
% 0.47/0.64 -----> EMPTY CLAUSE at 0.24 sec ----> 245 [hyper,190,38,unit_del,192,193,103,104] {-} $F.
% 0.47/0.64
% 0.47/0.64 Length of proof is 2. Level of proof is 1.
% 0.47/0.64
% 0.47/0.64 ---------------- PROOF ----------------
% 0.47/0.64 % SZS status Unsatisfiable
% 0.47/0.64 % SZS output start Refutation
% 0.47/0.64
% 0.47/0.64 38 [] {+} fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(A,n1))=f_SUB_(fwork_DOTfifo_DOTrtl_DOTint__level_(A),n1)|p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(A),n0)| -p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(A))|p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(A))|p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(A)).
% 0.47/0.64 102 [] {-} -p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),n0).
% 0.47/0.64 103 [] {+} -p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)).
% 0.47/0.64 104 [] {+} -p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)).
% 0.47/0.64 105 [] {-} fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(t_206,n1))!=f_SUB_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),n1).
% 0.47/0.64 136,135 [] {-} fwork_DOTfifo_DOTrtl_DOTlevel_(A)=fwork_DOTfifo_DOTrtl_DOTint__level_(A).
% 0.47/0.64 190 [] {-} p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)).
% 0.47/0.64 192 [back_demod,105,demod,136,136] {-} fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,n1))!=f_SUB_(fwork_DOTfifo_DOTrtl_DOTint__level_(t_206),n1).
% 0.47/0.64 193 [back_demod,102,demod,136] {-} -p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(t_206),n0).
% 0.47/0.64 245 [hyper,190,38,unit_del,192,193,103,104] {-} $F.
% 0.47/0.64
% 0.47/0.64 % SZS output end Refutation
% 0.47/0.64 ------------ end of proof -------------
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64 Search stopped by max_proofs option.
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64 Search stopped by max_proofs option.
% 0.47/0.64
% 0.47/0.64 ============ end of search ============
% 0.47/0.64
% 0.47/0.64 That finishes the proof of the theorem.
% 0.47/0.64
% 0.47/0.64 Process 1273 finished Fri Jun 17 10:13:35 2022
%------------------------------------------------------------------------------