TSTP Solution File: CSR017+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CSR017+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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 7.88s 8.06s
% Output : Refutation 7.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR017+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n027.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 05:16:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n027.cluster.edu,
% 0.12/0.35 Fri Jun 10 05:16:58 2022
% 0.12/0.35 The command was "./sos". The process ID is 32212.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 55 back subsumes 23.
% 0.12/0.35 96 back subsumes 25.
% 0.12/0.35 96 back subsumes 24.
% 0.12/0.35 96 back subsumes 20.
% 0.12/0.35 96 back subsumes 19.
% 0.12/0.35 96 back subsumes 18.
% 0.12/0.35 96 back subsumes 17.
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 118 during input processing: 0 [copy,118,flip.1] {-} plus(A,B)=plus(B,A).
% 0.12/0.35 Following clause subsumed by 121 during input processing: 0 [copy,121,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Failed to model usable list: disabling FINDER
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 -------------- Softie stats --------------
% 0.18/0.43
% 0.18/0.43 UPDATE_STOP: 300
% 0.18/0.43 SFINDER_TIME_LIMIT: 2
% 0.18/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.43 number of clauses in intial UL: 89
% 0.18/0.43 number of clauses initially in problem: 113
% 0.18/0.43 percentage of clauses intially in UL: 78
% 0.18/0.43 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.43 percent of all initial clauses that are short: 100
% 0.18/0.43 absolute distinct symbol count: 35
% 0.18/0.43 distinct predicate count: 13
% 0.18/0.43 distinct function count: 7
% 0.18/0.43 distinct constant count: 15
% 0.18/0.43
% 0.18/0.43 ---------- no more Softie stats ----------
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 =========== start of search ===========
% 0.81/1.02
% 0.81/1.02
% 0.81/1.02 Changing weight limit from 60 to 16.
% 0.81/1.02
% 0.81/1.02 Resetting weight limit to 16 after 55 givens.
% 0.81/1.02
% 1.28/1.51
% 1.28/1.51
% 1.28/1.51 Changing weight limit from 16 to 15.
% 1.28/1.51
% 1.28/1.51 Resetting weight limit to 15 after 65 givens.
% 1.28/1.51
% 1.68/1.87
% 1.68/1.87
% 1.68/1.87 Changing weight limit from 15 to 13.
% 1.68/1.87
% 1.68/1.87 Resetting weight limit to 13 after 75 givens.
% 1.68/1.87
% 2.89/3.09
% 2.89/3.09
% 2.89/3.09 Changing weight limit from 13 to 12.
% 2.89/3.09
% 2.89/3.09 Resetting weight limit to 12 after 160 givens.
% 2.89/3.09
% 3.33/3.51
% 3.33/3.51
% 3.33/3.51 Changing weight limit from 12 to 11.
% 3.33/3.51
% 3.33/3.51 Resetting weight limit to 11 after 205 givens.
% 3.33/3.51
% 3.67/3.85
% 3.67/3.85
% 3.67/3.85 Changing weight limit from 11 to 10.
% 3.67/3.85
% 3.67/3.85 Modelling stopped after 300 given clauses and 0.00 seconds
% 3.67/3.85
% 3.67/3.85
% 3.67/3.85 Resetting weight limit to 10 after 335 givens.
% 3.67/3.85
% 6.97/7.19
% 6.97/7.19
% 6.97/7.19 Changing weight limit from 10 to 9.
% 6.97/7.19
% 6.97/7.19 Resetting weight limit to 9 after 1160 givens.
% 6.97/7.19
% 7.88/8.06
% 7.88/8.06 -------- PROOF --------
% 7.88/8.06 % SZS status Theorem
% 7.88/8.06 % SZS output start Refutation
% 7.88/8.06
% 7.88/8.06 -----> EMPTY CLAUSE at 7.64 sec ----> 42236 [hyper,42128,575,336,120] {-} $F.
% 7.88/8.06
% 7.88/8.06 WARNING, clause 5782 not found, proof is incomplete.
% 7.88/8.06 WARNING, clause 5813 not found, proof is incomplete.
% 7.88/8.06 Length of proof is 20. Level of proof is 6.
% 7.88/8.06
% 7.88/8.06 ---------------- PROOF ----------------
% 7.88/8.06 % SZS status Theorem
% 7.88/8.06 % SZS output start Refutation
% 7.88/8.06
% 7.88/8.06 22 [] {+} -happens(A,B)| -terminates(A,C,B)| -holdsAt(C,plus(B,n1)).
% 7.88/8.06 53 [] {+} terminates(A,B,C)|A!=push|B!=spinning|happens(pull,C).
% 7.88/8.06 57 [] {+} -happens(A,B)|A=push|B=n1|B=n2.
% 7.88/8.06 58 [] {+} -happens(A,B)|B=n0|A=pull|B=n2.
% 7.88/8.06 60 [] {+} happens(A,B)|A!=push|B!=n0.
% 7.88/8.06 61 [] {+} happens(A,B)|A!=pull|B!=n1.
% 7.88/8.06 64 [] {+} push!=pull.
% 7.88/8.06 69 [] {+} -less_or_equal(A,B)|less(A,B)|A=B.
% 7.88/8.06 70 [] {+} less_or_equal(A,B)| -less(A,B).
% 7.88/8.06 71 [] {+} less_or_equal(A,B)|A!=B.
% 7.88/8.06 72 [] {+} -less(A,n0).
% 7.88/8.06 74 [] {+} less(A,n1)| -less_or_equal(A,n0).
% 7.88/8.06 76 [] {+} less(A,n2)| -less_or_equal(A,n1).
% 7.88/8.06 91 [] {+} -less(A,B)| -less(B,A).
% 7.88/8.06 95 [] {+} -holdsAt(spinning,n0).
% 7.88/8.06 97 [factor,91.1.2] {+} -less(A,A).
% 7.88/8.06 100 [] {-} plus(n0,n1)=n1.
% 7.88/8.06 103,102 [] {-} plus(n0,n2)=n2.
% 7.88/8.06 120 [] {-} holdsAt(spinning,n1).
% 7.88/8.06 121 [] {-} A=A.
% 7.88/8.06 286 [para_into,120.1.2,58.2.1,unit_del,95,flip.3] {-} -happens(A,n1)|A=pull|n2=n1.
% 7.88/8.06 332 [hyper,121,71] {-} less_or_equal(A,A).
% 7.88/8.06 335 [hyper,121,61,121] {-} happens(pull,n1).
% 7.88/8.06 336 [hyper,121,60,121] {-} happens(push,n0).
% 7.88/8.06 338 [hyper,121,53,121] {-} terminates(push,spinning,A)|happens(pull,A).
% 7.88/8.06 350 [hyper,332,76] {-} less(n1,n2).
% 7.88/8.06 351 [hyper,332,74] {-} less(n0,n1).
% 7.88/8.06 575 [para_from,100.1.1,22.3.2] {-} -happens(A,n0)| -terminates(A,B,n0)| -holdsAt(B,n1).
% 7.88/8.06 1071 [para_into,102.1.1,69.3.1,demod,103,103] {-} A=n2| -less_or_equal(n2,A)|less(n2,A).
% 7.88/8.06 1874 [hyper,350,70] {-} less_or_equal(n1,n2).
% 7.88/8.06 1974 [para_into,351.1.1,57.3.1,unit_del,97,flip.3] {-} -happens(A,n0)|A=push|n2=n0.
% 7.88/8.06 5838 [factor,5782.1.3,unit_del,97,97] {-} -less_or_equal(n2,n1).
% 7.88/8.06 5839 [factor,5813.1.3,unit_del,97,97] {-} -less_or_equal(n1,n0).
% 7.88/8.06 16664 [para_from,286.2.1,64.1.1,unit_del,121] {-} -happens(push,n1)|n2=n1.
% 7.88/8.06 18781 [para_from,16664.2.1,5838.1.1,unit_del,332] {-} -happens(push,n1).
% 7.88/8.06 31325 [para_from,1071.1.1,5839.1.2,unit_del,1874,72] {-} -less_or_equal(n2,n0).
% 7.88/8.06 40940 [para_from,1974.2.1,335.1.1,unit_del,18781] {-} -happens(pull,n0)|n2=n0.
% 7.88/8.06 42125 [para_from,40940.2.1,31325.1.1,unit_del,332] {-} -happens(pull,n0).
% 7.88/8.06 42128 [hyper,42125,338] {-} terminates(push,spinning,n0).
% 7.88/8.06 42236 [hyper,42128,575,336,120] {-} $F.
% 7.88/8.06
% 7.88/8.06 % SZS output end Refutation
% 7.88/8.06 ------------ end of proof -------------
% 7.88/8.06
% 7.88/8.06
% 7.88/8.06 Search stopped by max_proofs option.
% 7.88/8.06
% 7.88/8.06
% 7.88/8.06 Search stopped by max_proofs option.
% 7.88/8.06
% 7.88/8.06 ============ end of search ============
% 7.88/8.06
% 7.88/8.06 That finishes the proof of the theorem.
% 7.88/8.06
% 7.88/8.06 Process 32212 finished Fri Jun 10 05:17:06 2022
%------------------------------------------------------------------------------