TSTP Solution File: CSR016+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CSR016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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 : Fri Jul 15 23:21:08 EDT 2022
% Result : Theorem 10.77s 10.96s
% Output : Refutation 10.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n022.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 10 03:28:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n022.cluster.edu,
% 0.12/0.36 Fri Jun 10 03:28:49 2022
% 0.12/0.36 The command was "./sos". The process ID is 30579.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 55 back subsumes 23.
% 0.12/0.36 96 back subsumes 25.
% 0.12/0.36 96 back subsumes 24.
% 0.12/0.36 96 back subsumes 20.
% 0.12/0.36 96 back subsumes 19.
% 0.12/0.36 96 back subsumes 18.
% 0.12/0.36 96 back subsumes 17.
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 119 during input processing: 0 [copy,119,flip.1] {-} plus(A,B)=plus(B,A).
% 0.12/0.36 Following clause subsumed by 121 during input processing: 0 [copy,121,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Failed to model usable list: disabling FINDER
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 -------------- Softie stats --------------
% 0.19/0.45
% 0.19/0.45 UPDATE_STOP: 300
% 0.19/0.45 SFINDER_TIME_LIMIT: 2
% 0.19/0.45 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.45 number of clauses in intial UL: 90
% 0.19/0.45 number of clauses initially in problem: 113
% 0.19/0.45 percentage of clauses intially in UL: 79
% 0.19/0.45 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.45 percent of all initial clauses that are short: 100
% 0.19/0.45 absolute distinct symbol count: 35
% 0.19/0.45 distinct predicate count: 13
% 0.19/0.45 distinct function count: 7
% 0.19/0.45 distinct constant count: 15
% 0.19/0.45
% 0.19/0.45 ---------- no more Softie stats ----------
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 =========== start of search ===========
% 0.86/1.05
% 0.86/1.05
% 0.86/1.05 Changing weight limit from 60 to 16.
% 0.86/1.05
% 0.86/1.05 Resetting weight limit to 16 after 55 givens.
% 0.86/1.05
% 1.31/1.52
% 1.31/1.52
% 1.31/1.52 Changing weight limit from 16 to 15.
% 1.31/1.52
% 1.31/1.52 Resetting weight limit to 15 after 65 givens.
% 1.31/1.52
% 1.67/1.87
% 1.67/1.87
% 1.67/1.87 Changing weight limit from 15 to 13.
% 1.67/1.87
% 1.67/1.87 Resetting weight limit to 13 after 75 givens.
% 1.67/1.87
% 2.88/3.05
% 2.88/3.05
% 2.88/3.05 Changing weight limit from 13 to 12.
% 2.88/3.05
% 2.88/3.05 Resetting weight limit to 12 after 160 givens.
% 2.88/3.05
% 3.27/3.46
% 3.27/3.46
% 3.27/3.46 Changing weight limit from 12 to 11.
% 3.27/3.46
% 3.27/3.46 Resetting weight limit to 11 after 205 givens.
% 3.27/3.46
% 3.69/3.92
% 3.69/3.92
% 3.69/3.92 Changing weight limit from 11 to 10.
% 3.69/3.92
% 3.69/3.92 Modelling stopped after 300 given clauses and 0.00 seconds
% 3.69/3.92
% 3.69/3.92
% 3.69/3.92 Resetting weight limit to 10 after 335 givens.
% 3.69/3.92
% 9.66/9.89
% 9.66/9.89
% 9.66/9.89 Changing weight limit from 10 to 9.
% 9.66/9.89
% 9.66/9.89 Resetting weight limit to 9 after 1535 givens.
% 9.66/9.89
% 10.77/10.96
% 10.77/10.96 -- HEY sandbox2, WE HAVE A PROOF!! --
% 10.77/10.96
% 10.77/10.96 ----> UNIT CONFLICT at 10.50 sec ----> 46046 [binary,46045.1,97.1] {-} $F.
% 10.77/10.96
% 10.77/10.96 WARNING, clause 5835 not found, proof is incomplete.
% 10.77/10.96 Length of proof is 22. Level of proof is 10.
% 10.77/10.96
% 10.77/10.96 ---------------- PROOF ----------------
% 10.77/10.96 % SZS status Theorem
% 10.77/10.96 % SZS output start Refutation
% 10.77/10.96
% 10.77/10.96 3 [] {+} -stoppedIn(A,B,C)|less($f1(A,B,C),C).
% 10.77/10.96 5 [] {+} stoppedIn(A,B,C)| -happens(D,E)| -less(A,E)| -less(E,C)| -terminates(D,B,E).
% 10.77/10.96 21 [] {+} -happens(A,B)| -initiates(A,C,B)|holdsAt(C,plus(B,n1)).
% 10.77/10.96 38 [] {+} initiates(A,B,C)|A!=push|B!=forwards|happens(pull,C).
% 10.77/10.96 54 [] {+} terminates(A,B,C)|A!=pull|B!=spinning|happens(push,C).
% 10.77/10.96 57 [] {+} -happens(A,B)|A=push|B=n1|B=n2.
% 10.77/10.96 58 [] {+} -happens(A,B)|B=n0|A=pull|B=n2.
% 10.77/10.96 60 [] {+} happens(A,B)|A!=push|B!=n0.
% 10.77/10.96 61 [] {+} happens(A,B)|A!=pull|B!=n1.
% 10.77/10.96 64 [] {+} push!=pull.
% 10.77/10.96 71 [] {+} less_or_equal(A,B)|A!=B.
% 10.77/10.96 72 [] {+} -less(A,n0).
% 10.77/10.96 74 [] {+} less(A,n1)| -less_or_equal(A,n0).
% 10.77/10.96 76 [] {+} less(A,n2)| -less_or_equal(A,n1).
% 10.77/10.96 91 [] {+} -less(A,B)| -less(B,A).
% 10.77/10.96 97 [] {+} -holdsAt(forwards,n1).
% 10.77/10.96 98 [factor,91.1.2] {+} -less(A,A).
% 10.77/10.96 101 [] {-} plus(n0,n1)=n1.
% 10.77/10.96 120 [] {-} less(A,B)|less(B,A)|B=A.
% 10.77/10.96 121 [] {-} A=A.
% 10.77/10.96 248 [hyper,121,71] {-} less_or_equal(A,A).
% 10.77/10.96 251 [hyper,121,61,121] {-} happens(pull,n1).
% 10.77/10.96 252 [hyper,121,60,121] {-} happens(push,n0).
% 10.77/10.96 253 [hyper,121,54,121] {-} terminates(pull,spinning,A)|happens(push,A).
% 10.77/10.96 258 [hyper,121,38,121] {-} initiates(push,forwards,A)|happens(pull,A).
% 10.77/10.96 266 [hyper,248,76] {-} less(n1,n2).
% 10.77/10.96 267 [hyper,248,74] {-} less(n0,n1).
% 10.77/10.96 578 [para_from,101.1.1,21.3.2] {-} -happens(A,n0)| -initiates(A,B,n0)|holdsAt(B,n1).
% 10.77/10.96 1794 [para_into,266.1.1,58.4.1,unit_del,98] {-} -happens(A,n1)|n1=n0|A=pull.
% 10.77/10.96 1893 [para_into,267.1.1,57.3.1,unit_del,98,flip.3] {-} -happens(A,n0)|A=push|n2=n0.
% 10.77/10.96 5841 [para_from,120.3.1,252.1.2,unit_del,72] {-} happens(push,A)|less(n0,A).
% 10.77/10.96 5861 [factor,5835.1.3,unit_del,98,98] {-} -less_or_equal(n1,n0).
% 10.77/10.96 37191 [para_from,1794.2.1,5861.1.1,unit_del,248] {-} -happens(A,n1)|A=pull.
% 10.77/10.96 37673 [hyper,37191,253,unit_del,64] {-} terminates(pull,spinning,n1).
% 10.77/10.96 41310 [para_from,37191.2.1,64.1.1,unit_del,121] {-} -happens(push,n1).
% 10.77/10.96 42848 [hyper,37673,5,251,5841,266,unit_del,41310] {-} stoppedIn(n0,spinning,n2).
% 10.77/10.96 43018 [hyper,42848,3] {-} less($f1(n0,spinning,n2),n2).
% 10.77/10.96 43498 [para_from,1893.2.1,251.1.1,unit_del,41310] {-} -happens(pull,n0)|n2=n0.
% 10.77/10.96 45944 [para_from,43498.2.1,43018.1.2,unit_del,72] {-} -happens(pull,n0).
% 10.77/10.96 45945 [hyper,45944,258] {-} initiates(push,forwards,n0).
% 10.77/10.96 46045 [hyper,45945,578,252] {-} holdsAt(forwards,n1).
% 10.77/10.96 46046 [binary,46045.1,97.1] {-} $F.
% 10.77/10.96
% 10.77/10.96 % SZS output end Refutation
% 10.77/10.96 ------------ end of proof -------------
% 10.77/10.96
% 10.77/10.96
% 10.77/10.96 Search stopped by max_proofs option.
% 10.77/10.96
% 10.77/10.96
% 10.77/10.96 Search stopped by max_proofs option.
% 10.77/10.96
% 10.77/10.96 ============ end of search ============
% 10.77/10.96
% 10.77/10.96 That finishes the proof of the theorem.
% 10.77/10.96
% 10.77/10.96 Process 30579 finished Fri Jun 10 03:29:00 2022
%------------------------------------------------------------------------------