TSTP Solution File: HWV018-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV018-2 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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:40 EDT 2022
% Result : Unsatisfiable 14.95s 15.19s
% Output : Refutation 14.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : HWV018-2 : TPTP v8.1.0. Released v2.5.0.
% 0.09/0.15 % Command : sos-script %s
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Fri Jun 17 10:09:12 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.23/0.41 ----- Otter 3.2, August 2001 -----
% 0.23/0.41 The process was started by sandbox2 on n015.cluster.edu,
% 0.23/0.41 Fri Jun 17 10:09:12 2022
% 0.23/0.41 The command was "./sos". The process ID is 13358.
% 0.23/0.41
% 0.23/0.41 set(prolog_style_variables).
% 0.23/0.41 set(auto).
% 0.23/0.41 dependent: set(auto1).
% 0.23/0.41 dependent: set(process_input).
% 0.23/0.41 dependent: clear(print_kept).
% 0.23/0.41 dependent: clear(print_new_demod).
% 0.23/0.41 dependent: clear(print_back_demod).
% 0.23/0.41 dependent: clear(print_back_sub).
% 0.23/0.41 dependent: set(control_memory).
% 0.23/0.41 dependent: assign(max_mem, 12000).
% 0.23/0.41 dependent: assign(pick_given_ratio, 4).
% 0.23/0.41 dependent: assign(stats_level, 1).
% 0.23/0.41 dependent: assign(pick_semantic_ratio, 3).
% 0.23/0.41 dependent: assign(sos_limit, 5000).
% 0.23/0.41 dependent: assign(max_weight, 60).
% 0.23/0.41 clear(print_given).
% 0.23/0.41
% 0.23/0.41 list(usable).
% 0.23/0.41
% 0.23/0.41 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.23/0.41
% 0.23/0.41 This ia a non-Horn set with equality. The strategy will be
% 0.23/0.41 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.23/0.41 unit deletion, with positive clauses in sos and nonpositive
% 0.23/0.41 clauses in usable.
% 0.23/0.41
% 0.23/0.41 dependent: set(knuth_bendix).
% 0.23/0.41 dependent: set(para_from).
% 0.23/0.41 dependent: set(para_into).
% 0.23/0.41 dependent: clear(para_from_right).
% 0.23/0.41 dependent: clear(para_into_right).
% 0.23/0.41 dependent: set(para_from_vars).
% 0.23/0.41 dependent: set(eq_units_both_ways).
% 0.23/0.41 dependent: set(dynamic_demod_all).
% 0.23/0.41 dependent: set(dynamic_demod).
% 0.23/0.41 dependent: set(order_eq).
% 0.23/0.41 dependent: set(back_demod).
% 0.23/0.41 dependent: set(lrpo).
% 0.23/0.41 dependent: set(hyper_res).
% 0.23/0.41 dependent: set(unit_deletion).
% 0.23/0.41 dependent: set(factor).
% 0.23/0.41
% 0.23/0.41 ------------> process usable:
% 0.23/0.41
% 0.23/0.41 ------------> process sos:
% 0.23/0.41 Following clause subsumed by 191 during input processing: 0 [copy,145,flip.1] {-} n1=n1.
% 0.23/0.41 Following clause subsumed by 191 during input processing: 0 [copy,191,flip.1] {-} A=A.
% 0.23/0.41 191 back subsumes 145.
% 0.23/0.41 191 back subsumes 120.
% 0.23/0.41
% 0.23/0.41 ======= end of input processing =======
% 0.76/1.00
% 0.76/1.00 Stopped by limit on insertions
% 0.76/1.00
% 0.76/1.00
% 0.76/1.00 Failed to model usable list: disabling FINDER
% 0.76/1.00
% 0.76/1.00
% 0.76/1.00
% 0.76/1.00 -------------- Softie stats --------------
% 0.76/1.00
% 0.76/1.00 UPDATE_STOP: 300
% 0.76/1.00 SFINDER_TIME_LIMIT: 2
% 0.76/1.00 SHORT_CLAUSE_CUTOFF: 4
% 0.76/1.00 number of clauses in intial UL: 123
% 0.76/1.00 number of clauses initially in problem: 181
% 0.76/1.00 percentage of clauses intially in UL: 67
% 0.76/1.00 percentage of distinct symbols occuring in initial UL: 75
% 0.76/1.00 percent of all initial clauses that are short: 100
% 0.76/1.00 absolute distinct symbol count: 58
% 0.76/1.00 distinct predicate count: 4
% 0.76/1.00 distinct function count: 42
% 0.76/1.00 distinct constant count: 12
% 0.76/1.00
% 0.76/1.00 ---------- no more Softie stats ----------
% 0.76/1.00
% 0.76/1.00
% 0.76/1.00
% 0.76/1.00 =========== start of search ===========
% 2.33/2.51
% 2.33/2.51
% 2.33/2.51 Changing weight limit from 60 to 59.
% 2.33/2.51
% 2.33/2.51 Resetting weight limit to 59 after 35 givens.
% 2.33/2.51
% 3.81/4.04
% 3.81/4.04
% 3.81/4.04 Changing weight limit from 59 to 20.
% 3.81/4.04
% 3.81/4.04 Resetting weight limit to 20 after 40 givens.
% 3.81/4.04
% 4.26/4.49
% 4.26/4.49
% 4.26/4.49 Changing weight limit from 20 to 16.
% 4.26/4.49
% 4.26/4.49 Resetting weight limit to 16 after 45 givens.
% 4.26/4.49
% 4.42/4.67
% 4.42/4.67
% 4.42/4.67 Changing weight limit from 16 to 10.
% 4.42/4.67
% 4.42/4.67 Resetting weight limit to 10 after 50 givens.
% 4.42/4.67
% 5.11/5.28
% 5.11/5.28
% 5.11/5.28 Changing weight limit from 10 to 9.
% 5.11/5.28
% 5.11/5.28 Resetting weight limit to 9 after 65 givens.
% 5.11/5.28
% 10.13/10.34
% 10.13/10.34
% 10.13/10.34 Changing weight limit from 9 to 8.
% 10.13/10.34
% 10.13/10.34 Resetting weight limit to 8 after 110 givens.
% 10.13/10.34
% 14.95/15.19
% 14.95/15.19 -- HEY sandbox2, WE HAVE A PROOF!! --
% 14.95/15.19
% 14.95/15.19 ----> UNIT CONFLICT at 14.27 sec ----> 26699 [binary,26698.1,104.1] {-} $F.
% 14.95/15.19
% 14.95/15.19 Length of proof is 3. Level of proof is 3.
% 14.95/15.19
% 14.95/15.19 ---------------- PROOF ----------------
% 14.95/15.19 % SZS status Unsatisfiable
% 14.95/15.19 % SZS output start Refutation
% 14.95/15.19
% 14.95/15.19 1 [] {+} p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(A))|fwork_DOTfifo_DOTrtl_DOTint__level_(A)!=fwork_DOTfifo_DOTrtl_DOTfifo__length_.
% 14.95/15.19 2 [] {+} -p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(A))|fwork_DOTfifo_DOTrtl_DOTint__level_(A)=fwork_DOTfifo_DOTrtl_DOTfifo__length_.
% 14.95/15.19 18 [] {+} fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(A,n1))=fwork_DOTfifo_DOTrtl_DOTint__level_(A)| -p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(A))|p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(A))| -p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(A))|p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(A)).
% 14.95/15.19 102 [] {+} -p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)).
% 14.95/15.19 103 [] {+} -p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)).
% 14.95/15.19 104 [] {+} -p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(f_ADD_(t_206,n1))).
% 14.95/15.19 141 [] {-} p_LES_EQU_(A,A).
% 14.95/15.19 189 [] {-} p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(t_206)).
% 14.95/15.19 190 [] {-} p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)).
% 14.95/15.19 242,241 [hyper,189,2] {-} fwork_DOTfifo_DOTrtl_DOTint__level_(t_206)=fwork_DOTfifo_DOTrtl_DOTfifo__length_.
% 14.95/15.19 834 [para_from,241.1.1,18.2.2,demod,242,unit_del,141,102,190,103] {-} fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,n1))=fwork_DOTfifo_DOTrtl_DOTfifo__length_.
% 14.95/15.19 26698 [hyper,834,1] {-} p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(f_ADD_(t_206,n1))).
% 14.95/15.19 26699 [binary,26698.1,104.1] {-} $F.
% 14.95/15.19
% 14.95/15.19 % SZS output end Refutation
% 14.95/15.19 ------------ end of proof -------------
% 14.95/15.19
% 14.95/15.19
% 14.95/15.19 Search stopped by max_proofs option.
% 14.95/15.19
% 14.95/15.19
% 14.95/15.19 Search stopped by max_proofs option.
% 14.95/15.19
% 14.95/15.19 ============ end of search ============
% 14.95/15.19
% 14.95/15.19 That finishes the proof of the theorem.
% 14.95/15.19
% 14.95/15.19 Process 13358 finished Fri Jun 17 10:09:27 2022
%------------------------------------------------------------------------------