TSTP Solution File: HWV027-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV027-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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:45 EDT 2022
% Result : Unsatisfiable 0.91s 1.09s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV027-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jun 17 08:47:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n005.cluster.edu,
% 0.13/0.36 Fri Jun 17 08:47:08 2022
% 0.13/0.36 The command was "./sos". The process ID is 22839.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 100 during input processing: 0 [copy,94,flip.1] {-} n1=n1.
% 0.13/0.36 Following clause subsumed by 100 during input processing: 0 [copy,100,flip.1] {-} A=A.
% 0.13/0.36 100 back subsumes 94.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.60/0.77
% 0.60/0.77 Stopped by limit on insertions
% 0.60/0.77
% 0.60/0.77
% 0.60/0.77 Failed to model usable list: disabling FINDER
% 0.60/0.77
% 0.60/0.77
% 0.60/0.77
% 0.60/0.77 -------------- Softie stats --------------
% 0.60/0.77
% 0.60/0.77 UPDATE_STOP: 300
% 0.60/0.77 SFINDER_TIME_LIMIT: 2
% 0.60/0.77 SHORT_CLAUSE_CUTOFF: 4
% 0.60/0.77 number of clauses in intial UL: 83
% 0.60/0.77 number of clauses initially in problem: 96
% 0.60/0.77 percentage of clauses intially in UL: 86
% 0.60/0.77 percentage of distinct symbols occuring in initial UL: 91
% 0.60/0.77 percent of all initial clauses that are short: 100
% 0.60/0.77 absolute distinct symbol count: 24
% 0.60/0.77 distinct predicate count: 13
% 0.60/0.77 distinct function count: 7
% 0.60/0.77 distinct constant count: 4
% 0.60/0.77
% 0.60/0.77 ---------- no more Softie stats ----------
% 0.60/0.77
% 0.60/0.77
% 0.60/0.77
% 0.60/0.77 =========== start of search ===========
% 0.91/1.09
% 0.91/1.09 -------- PROOF --------
% 0.91/1.09 % SZS status Unsatisfiable
% 0.91/1.09 % SZS output start Refutation
% 0.91/1.09
% 0.91/1.09 -----> EMPTY CLAUSE at 0.71 sec ----> 1475 [hyper,99,81,unit_del,83,82,101] {-} $F.
% 0.91/1.09
% 0.91/1.09 Length of proof is 2. Level of proof is 2.
% 0.91/1.09
% 0.91/1.09 ---------------- PROOF ----------------
% 0.91/1.09 % SZS status Unsatisfiable
% 0.91/1.09 % SZS output start Refutation
% 0.91/1.09
% 0.91/1.09 81 [] {+} -p_Wr(t_139).
% 0.91/1.09 82 [] {+} -p_Rd(t_139).
% 0.91/1.09 83 [] {+} -p_Reset(t_139).
% 0.91/1.09 84 [] {-} level(t_139)!=level(plus(t_139,n1)).
% 0.91/1.09 85 [copy,84,flip.1] {-} level(plus(t_139,n1))!=level(t_139).
% 0.91/1.09 96,95 [] {-} level(A)=int_level(A).
% 0.91/1.09 99 [] {-} p_Reset(A)|p_Wr(A)|p_Rd(A)|int_level(plus(A,n1))=int_level(A).
% 0.91/1.09 101 [back_demod,85,demod,96,96] {-} int_level(plus(t_139,n1))!=int_level(t_139).
% 0.91/1.09 1475 [hyper,99,81,unit_del,83,82,101] {-} $F.
% 0.91/1.09
% 0.91/1.09 % SZS output end Refutation
% 0.91/1.09 ------------ end of proof -------------
% 0.91/1.09
% 0.91/1.09
% 0.91/1.09 Search stopped by max_proofs option.
% 0.91/1.09
% 0.91/1.09
% 0.91/1.09 Search stopped by max_proofs option.
% 0.91/1.09
% 0.91/1.09 ============ end of search ============
% 0.91/1.09
% 0.91/1.09 That finishes the proof of the theorem.
% 0.91/1.09
% 0.91/1.09 Process 22839 finished Fri Jun 17 08:47:09 2022
%------------------------------------------------------------------------------