TSTP Solution File: CSR018+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CSR018+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:09 EDT 2022
% Result : Theorem 9.56s 9.79s
% Output : Refutation 9.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : CSR018+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.13/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 11 05:34:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 ----- Otter 3.2, August 2001 -----
% 0.13/0.38 The process was started by sandbox2 on n025.cluster.edu,
% 0.13/0.38 Sat Jun 11 05:34:52 2022
% 0.13/0.38 The command was "./sos". The process ID is 9671.
% 0.13/0.38
% 0.13/0.38 set(prolog_style_variables).
% 0.13/0.38 set(auto).
% 0.13/0.38 dependent: set(auto1).
% 0.13/0.38 dependent: set(process_input).
% 0.13/0.38 dependent: clear(print_kept).
% 0.13/0.38 dependent: clear(print_new_demod).
% 0.13/0.38 dependent: clear(print_back_demod).
% 0.13/0.38 dependent: clear(print_back_sub).
% 0.13/0.38 dependent: set(control_memory).
% 0.13/0.38 dependent: assign(max_mem, 12000).
% 0.13/0.38 dependent: assign(pick_given_ratio, 4).
% 0.13/0.38 dependent: assign(stats_level, 1).
% 0.13/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.38 dependent: assign(sos_limit, 5000).
% 0.13/0.38 dependent: assign(max_weight, 60).
% 0.13/0.38 clear(print_given).
% 0.13/0.38
% 0.13/0.38 formula_list(usable).
% 0.13/0.38
% 0.13/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.13/0.38
% 0.13/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.38 clauses in usable.
% 0.13/0.38
% 0.13/0.38 dependent: set(knuth_bendix).
% 0.13/0.38 dependent: set(para_from).
% 0.13/0.38 dependent: set(para_into).
% 0.13/0.38 dependent: clear(para_from_right).
% 0.13/0.38 dependent: clear(para_into_right).
% 0.13/0.38 dependent: set(para_from_vars).
% 0.13/0.38 dependent: set(eq_units_both_ways).
% 0.13/0.38 dependent: set(dynamic_demod_all).
% 0.13/0.38 dependent: set(dynamic_demod).
% 0.13/0.38 dependent: set(order_eq).
% 0.13/0.38 dependent: set(back_demod).
% 0.13/0.38 dependent: set(lrpo).
% 0.13/0.38 dependent: set(hyper_res).
% 0.13/0.38 dependent: set(unit_deletion).
% 0.13/0.38 dependent: set(factor).
% 0.13/0.38
% 0.13/0.38 ------------> process usable:
% 0.13/0.38 55 back subsumes 23.
% 0.13/0.38 96 back subsumes 25.
% 0.13/0.38 96 back subsumes 24.
% 0.13/0.38 96 back subsumes 20.
% 0.13/0.38 96 back subsumes 19.
% 0.13/0.38 96 back subsumes 18.
% 0.13/0.38 96 back subsumes 17.
% 0.13/0.38
% 0.13/0.38 ------------> process sos:
% 0.13/0.38 Following clause subsumed by 119 during input processing: 0 [copy,119,flip.1] {-} plus(A,B)=plus(B,A).
% 0.13/0.38 Following clause subsumed by 121 during input processing: 0 [copy,121,flip.1] {-} A=A.
% 0.13/0.38
% 0.13/0.38 ======= end of input processing =======
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 Failed to model usable list: disabling FINDER
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 -------------- Softie stats --------------
% 0.21/0.46
% 0.21/0.46 UPDATE_STOP: 300
% 0.21/0.46 SFINDER_TIME_LIMIT: 2
% 0.21/0.46 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.46 number of clauses in intial UL: 90
% 0.21/0.46 number of clauses initially in problem: 113
% 0.21/0.46 percentage of clauses intially in UL: 79
% 0.21/0.46 percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.46 percent of all initial clauses that are short: 100
% 0.21/0.46 absolute distinct symbol count: 35
% 0.21/0.46 distinct predicate count: 13
% 0.21/0.46 distinct function count: 7
% 0.21/0.46 distinct constant count: 15
% 0.21/0.46
% 0.21/0.46 ---------- no more Softie stats ----------
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 =========== start of search ===========
% 0.84/1.04
% 0.84/1.04
% 0.84/1.04 Changing weight limit from 60 to 16.
% 0.84/1.04
% 0.84/1.04 Resetting weight limit to 16 after 55 givens.
% 0.84/1.04
% 1.36/1.54
% 1.36/1.54
% 1.36/1.54 Changing weight limit from 16 to 15.
% 1.36/1.54
% 1.36/1.54 Resetting weight limit to 15 after 65 givens.
% 1.36/1.54
% 1.73/1.91
% 1.73/1.91
% 1.73/1.91 Changing weight limit from 15 to 13.
% 1.73/1.91
% 1.73/1.91 Resetting weight limit to 13 after 75 givens.
% 1.73/1.91
% 2.96/3.19
% 2.96/3.19
% 2.96/3.19 Changing weight limit from 13 to 12.
% 2.96/3.19
% 2.96/3.19 Resetting weight limit to 12 after 160 givens.
% 2.96/3.19
% 3.44/3.65
% 3.44/3.65
% 3.44/3.65 Changing weight limit from 12 to 11.
% 3.44/3.65
% 3.44/3.65 Resetting weight limit to 11 after 205 givens.
% 3.44/3.65
% 3.97/4.16
% 3.97/4.16
% 3.97/4.16 Changing weight limit from 11 to 10.
% 3.97/4.16
% 3.97/4.16 Modelling stopped after 300 given clauses and 0.00 seconds
% 3.97/4.16
% 3.97/4.16
% 3.97/4.16 Resetting weight limit to 10 after 335 givens.
% 3.97/4.16
% 9.56/9.79
% 9.56/9.79 -------- PROOF --------
% 9.56/9.79 % SZS status Theorem
% 9.56/9.79 % SZS output start Refutation
% 9.56/9.79
% 9.56/9.79 ----> UNIT CONFLICT at 9.31 sec ----> 42573 [binary,42572.1,97.1] {-} $F.
% 9.56/9.79
% 9.56/9.79 WARNING, clause 5835 not found, proof is incomplete.
% 9.56/9.79 Length of proof is 10. Level of proof is 6.
% 9.56/9.79
% 9.56/9.79 ---------------- PROOF ----------------
% 9.56/9.79 % SZS status Theorem
% 9.56/9.79 % SZS output start Refutation
% 9.56/9.79
% 9.56/9.79 21 [] {+} -happens(A,B)| -initiates(A,C,B)|holdsAt(C,plus(B,n1)).
% 9.56/9.79 39 [] {+} initiates(A,B,C)|A!=pull|B!=backwards|happens(push,C).
% 9.56/9.79 58 [] {+} -happens(A,B)|B=n0|A=pull|B=n2.
% 9.56/9.79 61 [] {+} happens(A,B)|A!=pull|B!=n1.
% 9.56/9.79 64 [] {+} push!=pull.
% 9.56/9.79 71 [] {+} less_or_equal(A,B)|A!=B.
% 9.56/9.79 76 [] {+} less(A,n2)| -less_or_equal(A,n1).
% 9.56/9.79 91 [] {+} -less(A,B)| -less(B,A).
% 9.56/9.79 97 [] {+} -holdsAt(backwards,n2).
% 9.56/9.79 98 [factor,91.1.2] {+} -less(A,A).
% 9.56/9.79 108,107 [] {-} plus(n1,n1)=n2.
% 9.56/9.79 121 [] {-} A=A.
% 9.56/9.79 248 [hyper,121,71] {-} less_or_equal(A,A).
% 9.56/9.79 251 [hyper,121,61,121] {-} happens(pull,n1).
% 9.56/9.79 257 [hyper,121,39,121] {-} initiates(pull,backwards,A)|happens(push,A).
% 9.56/9.79 266 [hyper,248,76] {-} less(n1,n2).
% 9.56/9.79 1794 [para_into,266.1.1,58.4.1,unit_del,98] {-} -happens(A,n1)|n1=n0|A=pull.
% 9.56/9.79 5861 [factor,5835.1.3,unit_del,98,98] {-} -less_or_equal(n1,n0).
% 9.56/9.79 37193 [para_from,1794.2.1,5861.1.1,unit_del,248] {-} -happens(A,n1)|A=pull.
% 9.56/9.79 37674 [hyper,37193,257,unit_del,64] {-} initiates(pull,backwards,n1).
% 9.56/9.79 42572 [hyper,37674,21,251,demod,108] {-} holdsAt(backwards,n2).
% 9.56/9.79 42573 [binary,42572.1,97.1] {-} $F.
% 9.56/9.79
% 9.56/9.79 % SZS output end Refutation
% 9.56/9.79 ------------ end of proof -------------
% 9.56/9.79
% 9.56/9.79
% 9.56/9.79 Search stopped by max_proofs option.
% 9.56/9.79
% 9.56/9.79
% 9.56/9.79 Search stopped by max_proofs option.
% 9.56/9.79
% 9.56/9.79 ============ end of search ============
% 9.56/9.79
% 9.56/9.79 That finishes the proof of the theorem.
% 9.56/9.79
% 9.56/9.79 Process 9671 finished Sat Jun 11 05:35:01 2022
%------------------------------------------------------------------------------