TSTP Solution File: HWV023-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV023-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:43 EDT 2022
% Result : Unsatisfiable 7.45s 7.89s
% Output : Refutation 7.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.31 % Problem : HWV023-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.32 % Command : sos-script %s
% 0.13/0.53 % Computer : n007.cluster.edu
% 0.13/0.53 % Model : x86_64 x86_64
% 0.13/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.53 % Memory : 8042.1875MB
% 0.13/0.53 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.53 % CPULimit : 300
% 0.13/0.53 % WCLimit : 600
% 0.13/0.53 % DateTime : Thu Jun 16 23:11:57 EDT 2022
% 0.13/0.53 % CPUTime :
% 0.13/0.56 ----- Otter 3.2, August 2001 -----
% 0.13/0.56 The process was started by sandbox on n007.cluster.edu,
% 0.13/0.56 Thu Jun 16 23:11:57 2022
% 0.13/0.56 The command was "./sos". The process ID is 21605.
% 0.13/0.56
% 0.13/0.56 set(prolog_style_variables).
% 0.13/0.56 set(auto).
% 0.13/0.56 dependent: set(auto1).
% 0.13/0.56 dependent: set(process_input).
% 0.13/0.56 dependent: clear(print_kept).
% 0.13/0.56 dependent: clear(print_new_demod).
% 0.13/0.56 dependent: clear(print_back_demod).
% 0.13/0.56 dependent: clear(print_back_sub).
% 0.13/0.56 dependent: set(control_memory).
% 0.13/0.56 dependent: assign(max_mem, 12000).
% 0.13/0.56 dependent: assign(pick_given_ratio, 4).
% 0.13/0.56 dependent: assign(stats_level, 1).
% 0.13/0.56 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.56 dependent: assign(sos_limit, 5000).
% 0.13/0.56 dependent: assign(max_weight, 60).
% 0.13/0.56 clear(print_given).
% 0.13/0.56
% 0.13/0.56 list(usable).
% 0.13/0.56
% 0.13/0.56 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.13/0.56
% 0.13/0.56 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.56 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.56 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.56 clauses in usable.
% 0.13/0.56
% 0.13/0.56 dependent: set(knuth_bendix).
% 0.13/0.56 dependent: set(para_from).
% 0.13/0.56 dependent: set(para_into).
% 0.13/0.56 dependent: clear(para_from_right).
% 0.13/0.56 dependent: clear(para_into_right).
% 0.13/0.56 dependent: set(para_from_vars).
% 0.13/0.56 dependent: set(eq_units_both_ways).
% 0.13/0.56 dependent: set(dynamic_demod_all).
% 0.13/0.56 dependent: set(dynamic_demod).
% 0.13/0.56 dependent: set(order_eq).
% 0.13/0.56 dependent: set(back_demod).
% 0.13/0.56 dependent: set(lrpo).
% 0.13/0.56 dependent: set(hyper_res).
% 0.13/0.56 dependent: set(unit_deletion).
% 0.13/0.56 dependent: set(factor).
% 0.13/0.56
% 0.13/0.56 ------------> process usable:
% 0.13/0.56
% 0.13/0.56 ------------> process sos:
% 0.13/0.56 Following clause subsumed by 102 during input processing: 0 [copy,92,flip.1] {-} n1=n1.
% 0.13/0.56 Following clause subsumed by 102 during input processing: 0 [copy,102,flip.1] {-} A=A.
% 0.13/0.56 102 back subsumes 92.
% 0.13/0.56
% 0.13/0.56 ======= end of input processing =======
% 2.44/2.84
% 2.44/2.84 Stopped by limit on insertions
% 2.44/2.84
% 2.44/2.84
% 2.44/2.84 Failed to model usable list: disabling FINDER
% 2.44/2.84
% 2.44/2.84
% 2.44/2.84
% 2.44/2.84 -------------- Softie stats --------------
% 2.44/2.84
% 2.44/2.84 UPDATE_STOP: 300
% 2.44/2.84 SFINDER_TIME_LIMIT: 2
% 2.44/2.84 SHORT_CLAUSE_CUTOFF: 4
% 2.44/2.84 number of clauses in intial UL: 83
% 2.44/2.84 number of clauses initially in problem: 98
% 2.44/2.84 percentage of clauses intially in UL: 84
% 2.44/2.84 percentage of distinct symbols occuring in initial UL: 91
% 2.44/2.84 percent of all initial clauses that are short: 100
% 2.44/2.84 absolute distinct symbol count: 24
% 2.44/2.84 distinct predicate count: 13
% 2.44/2.84 distinct function count: 7
% 2.44/2.84 distinct constant count: 4
% 2.44/2.84
% 2.44/2.84 ---------- no more Softie stats ----------
% 2.44/2.84
% 2.44/2.84
% 2.44/2.84
% 2.44/2.84 =========== start of search ===========
% 6.42/6.82
% 6.42/6.82
% 6.42/6.82 Changing weight limit from 60 to 50.
% 6.42/6.82
% 6.42/6.82 Resetting weight limit to 50 after 130 givens.
% 6.42/6.82
% 6.84/7.27
% 6.84/7.27
% 6.84/7.27 Changing weight limit from 50 to 44.
% 6.84/7.27
% 6.84/7.27 Resetting weight limit to 44 after 135 givens.
% 6.84/7.27
% 7.30/7.70
% 7.30/7.70
% 7.30/7.70 Changing weight limit from 44 to 38.
% 7.30/7.70
% 7.30/7.70 Resetting weight limit to 38 after 140 givens.
% 7.30/7.70
% 7.45/7.89
% 7.45/7.89 -------- PROOF --------
% 7.45/7.89 % SZS status Unsatisfiable
% 7.45/7.89 % SZS output start Refutation
% 7.45/7.89
% 7.45/7.89 ----> UNIT CONFLICT at 7.31 sec ----> 6073 [binary,6072.1,13.1] {-} $F.
% 7.45/7.89
% 7.45/7.89 Length of proof is 10. Level of proof is 6.
% 7.45/7.89
% 7.45/7.89 ---------------- PROOF ----------------
% 7.45/7.89 % SZS status Unsatisfiable
% 7.45/7.89 % SZS output start Refutation
% 7.45/7.89
% 7.45/7.89 1 [] {+} plus(A,n1)!=n0.
% 7.45/7.89 4 [] {+} minus(A,B)=C|plus(C,B)!=A|def_10(B,A).
% 7.45/7.89 6 [] {+} -def_10(A,B)|B!=A.
% 7.45/7.89 7 [] {+} -gt(A,B)|gt(plus(A,n1),plus(B,n1)).
% 7.45/7.89 13 [] {+} -gt(A,A).
% 7.45/7.89 17 [] {+} int_level(A)!=n0|p_Empty(A).
% 7.45/7.89 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).
% 7.45/7.89 81 [] {+} -p_Wr(t_139).
% 7.45/7.89 82 [] {+} -p_Reset(t_139).
% 7.45/7.89 83 [] {+} -p_Empty(plus(t_139,n1)).
% 7.45/7.89 86 [] {-} A=n0|gt(A,n0).
% 7.45/7.89 90,89 [] {-} plus(n0,A)=A.
% 7.45/7.89 94,93 [] {-} level(A)=int_level(A).
% 7.45/7.89 98 [] {-} level(t_139)=n1.
% 7.45/7.89 100,99 [copy,98,demod,94] {-} int_level(t_139)=n1.
% 7.45/7.89 101 [] {-} p_Rd(t_139).
% 7.45/7.89 102 [] {-} A=A.
% 7.45/7.89 166 [hyper,89,4] {-} minus(A,A)=n0|def_10(A,A).
% 7.45/7.89 254 [para_from,89.1.1,1.1.1] {-} n1!=n0.
% 7.45/7.89 634,633 [hyper,86,63,101,demod,100,100,unit_del,254,82,81] {-} int_level(plus(t_139,n1))=minus(n1,n1).
% 7.45/7.89 725 [para_from,86.1.1,17.1.1,unit_del,102] {-} p_Empty(A)|gt(int_level(A),n0).
% 7.45/7.89 1861 [hyper,725,83,demod,634] {-} gt(minus(n1,n1),n0).
% 7.45/7.89 1939 [hyper,1861,7,demod,90] {-} gt(plus(minus(n1,n1),n1),n1).
% 7.45/7.89 4196 [hyper,1939,7] {-} gt(plus(plus(minus(n1,n1),n1),n1),plus(n1,n1)).
% 7.45/7.89 6027,6026 [hyper,166,6,102] {-} minus(A,A)=n0.
% 7.45/7.89 6072 [back_demod,4196,demod,6027,90] {-} gt(plus(n1,n1),plus(n1,n1)).
% 7.45/7.89 6073 [binary,6072.1,13.1] {-} $F.
% 7.45/7.89
% 7.45/7.89 % SZS output end Refutation
% 7.45/7.89 ------------ end of proof -------------
% 7.45/7.89
% 7.45/7.89
% 7.45/7.89 Search stopped by max_proofs option.
% 7.45/7.89
% 7.45/7.89
% 7.45/7.89 Search stopped by max_proofs option.
% 7.45/7.89
% 7.45/7.89 ============ end of search ============
% 7.45/7.89
% 7.45/7.89 That finishes the proof of the theorem.
% 7.45/7.89
% 7.45/7.89 Process 21605 finished Thu Jun 16 23:12:04 2022
%------------------------------------------------------------------------------