TSTP Solution File: COM002_10 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : COM002_10 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n006.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 : 300s
% DateTime : Mon May 22 15:23:55 EDT 2023
% Result : Unknown 3.73s 2.66s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : COM002_10 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.09 % Command : spasst-tptp-script %s %d
% 0.09/0.29 % Computer : n006.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 22 10:59:49 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.14/0.39 % Using EUF theory
% 3.73/2.66
% 3.73/2.66
% 3.73/2.66 % SZS status CounterSatisfiable for /tmp/SPASST_23565_n006.cluster.edu
% 3.73/2.66
% 3.73/2.66 SPASS V 2.2.22 in combination with yices.
% 3.73/2.66 SPASS beiseite: Satisfiable.
% 3.73/2.66 Problem: /tmp/SPASST_23565_n006.cluster.edu
% 3.73/2.66 SPASS derived 277 clauses, backtracked 0 clauses and kept 175 clauses.
% 3.73/2.66 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 3.73/2.66 SPASS allocated 6759 KBytes.
% 3.73/2.66 SPASS spent 0:00:01.60 on the problem.
% 3.73/2.66 0:00:00.00 for the input.
% 3.73/2.66 0:00:00.00 for the FLOTTER CNF translation.
% 3.73/2.66 0:00:00.00 for inferences.
% 3.73/2.66 0:00:00.00 for the backtracking.
% 3.73/2.66 0:00:00.02 for the reduction.
% 3.73/2.66 0:00:01.57 for interacting with the SMT procedure.
% 3.73/2.66
% 3.73/2.66
% 3.73/2.66 % SZS output start ListOfCNF for /tmp/SPASST_23565_n006.cluster.edu
% 3.73/2.66
% 3.73/2.66 The saturated set of worked-off clauses is :
% 3.73/2.66 623[0:MRR:622.0,9.0] || follows(U,p8)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 615[0:Obv:613.0] || labels(loop,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 604[0:MRR:603.0,9.0] || follows(U,p8)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 596[0:Obv:594.0] || labels(loop,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 636[0:MRR:635.0,9.0] || state(U) succeeds(U,p8) -> succeeds(U,p1)*.
% 3.73/2.66 586[0:MRR:585.0,10.0] || follows(U,p7)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 515[0:MRR:514.0,9.0] || follows(U,p8)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 507[0:Obv:505.0] || labels(loop,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 627[0:MRR:626.0,9.0] || state(U) succeeds(U,p8) -> succeeds(U,p2)*.
% 3.73/2.66 625[0:MRR:624.0,10.0] || state(U) succeeds(U,p7) -> succeeds(U,p1)*.
% 3.73/2.66 495[0:MRR:494.0,10.0] || follows(U,p7)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 464[0:MRR:463.0,11.0] || follows(U,p6)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 462[0:Obv:453.0] || succeeds(U,p8)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 461[0:Obv:454.1] || follows(U,p5)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 440[0:Obv:435.1] || follows(U,p3)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 402[0:Obv:398.0] || succeeds(U,p8)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 359[0:Obv:354.0] || succeeds(U,p7)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 352[0:MRR:351.0,9.0] || follows(U,p8)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p6)*.
% 3.73/2.66 346[0:Obv:339.1] || follows(U,p6)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p6)*.
% 3.73/2.66 550[0:MRR:549.0,14.0] || follows(U,p3) state(U) -> succeeds(U,p6)*.
% 3.73/2.66 345[0:Obv:340.1] || follows(U,p3)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p6)*.
% 3.73/2.66 544[0:MRR:543.0,13.0] || -> succeeds(p4,p6)*.
% 3.73/2.66 536[0:MRR:535.0,14.0] || state(U) succeeds(U,p3)* -> succeeds(U,p6).
% 3.73/2.66 344[0:Obv:341.0] || labels(loop,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p6)*.
% 3.73/2.66 525[0:MRR:524.0,9.0] || state(U) succeeds(U,p8) -> succeeds(U,p3)*.
% 3.73/2.66 331[0:MRR:330.0,10.0] || follows(U,p7)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 521[0:MRR:520.0,12.0] || state(U) succeeds(U,p5) -> succeeds(U,p1)*.
% 3.73/2.66 320[0:MRR:319.0,13.0] || follows(U,p4)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 317[0:Obv:316.0] || labels(out,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 497[0:MRR:496.0,10.0] || state(U) succeeds(U,p7) -> succeeds(U,p2)*.
% 3.73/2.66 326[0:Obv:325.0] || succeeds(U,p8)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 305[0:MRR:304.0,11.0] || follows(U,p6)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 303[0:Obv:302.0] || succeeds(U,p7)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 300[0:MRR:299.0,12.0] || follows(U,p5)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 475[0:MRR:474.0,12.0] || state(U) succeeds(U,p5) -> succeeds(U,p2)*.
% 3.73/2.66 296[0:MRR:295.0,13.0] || follows(U,p4)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 285[0:Obv:282.1] || follows(U,p5)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p6)*.
% 3.73/2.66 279[0:Obv:276.1] || follows(U,p4)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p6)*.
% 3.73/2.66 271[0:Obv:268.1] || labels(out,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p6)*.
% 3.73/2.66 470[0:MRR:469.0,11.0] || state(U) succeeds(U,p6) -> succeeds(U,p1)*.
% 3.73/2.66 293[0:Obv:292.0] || labels(out,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 254[0:MRR:253.0,14.0] || follows(U,p3)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 251[0:Obv:246.0] || succeeds(U,p5)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 241[0:Obv:226.1] || follows(U,p7)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p7)*.
% 3.73/2.66 240[0:Obv:227.1] || follows(U,p4)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p7)*.
% 3.73/2.66 252[0:Obv:245.0] || succeeds(U,p6)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 239[0:Obv:228.1] || labels(out,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p7)*.
% 3.73/2.66 238[0:Obv:229.1] || follows(U,p5)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p7)*.
% 3.73/2.66 237[0:Obv:230.1] || follows(U,p6)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p7)*.
% 3.73/2.66 433[0:MRR:432.0,11.0] || follows(U,p6) state(U) -> succeeds(U,p7)*.
% 3.73/2.66 236[0:Obv:231.1] || follows(U,p3)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p7)*.
% 3.73/2.66 417[0:MRR:416.0,14.0] || follows(U,p3) state(U) -> succeeds(U,p7)*.
% 3.73/2.66 413[0:Obv:408.0] || succeeds(U,p6)* state(U) -> succeeds(U,p7).
% 3.73/2.66 412[0:MRR:411.0,13.0] || -> succeeds(p4,p7)*.
% 3.73/2.66 405[0:MRR:404.0,14.0] || state(U) succeeds(U,p3)* -> succeeds(U,p7).
% 3.73/2.66 243[0:MRR:242.0,9.0] || follows(U,p8)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p7)*.
% 3.73/2.66 235[0:Obv:232.0] || labels(loop,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p7)*.
% 3.73/2.66 380[0:MRR:379.0,9.0] || state(U) succeeds(U,p8) -> succeeds(U,p6)*.
% 3.73/2.66 370[0:MRR:369.0,12.0] || follows(U,p5) state(U) -> succeeds(U,p6)*.
% 3.73/2.66 367[0:MRR:366.0,13.0] || follows(U,p4) state(U) -> succeeds(U,p6)*.
% 3.73/2.66 224[0:MRR:223.0,10.0] || follows(U,p7)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p6)*.
% 3.73/2.66 365[0:Obv:363.0] || labels(out,U) state(U) -> succeeds(U,p6)*.
% 3.73/2.66 364[0:Obv:362.0] || succeeds(U,p5)* state(U) -> succeeds(U,p6).
% 3.73/2.66 343[0:MRR:342.0,13.0] || state(U) succeeds(U,p4)* -> succeeds(U,p6).
% 3.73/2.66 333[0:MRR:332.0,10.0] || state(U) succeeds(U,p7) -> succeeds(U,p3)*.
% 3.73/2.66 222[0:Obv:221.0] || succeeds(U,p8)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p6)*.
% 3.73/2.66 219[0:MRR:218.0,11.0] || follows(U,p6)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 217[0:Obv:216.0] || succeeds(U,p7)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 214[0:MRR:213.0,12.0] || follows(U,p5)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 207[0:Obv:206.0] || succeeds(U,p4)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 211[0:MRR:210.0,12.0] || follows(U,p5)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p4)*.
% 3.73/2.66 204[0:MRR:203.1,9.0] || follows(U,p7)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p8)*.
% 3.73/2.66 201[0:MRR:200.1,9.0] || follows(U,p4)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p8)*.
% 3.73/2.66 198[0:MRR:197.1,9.0] || labels(out,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p8)*.
% 3.73/2.66 307[0:MRR:306.0,11.0] || state(U) succeeds(U,p6) -> succeeds(U,p2)*.
% 3.73/2.66 195[0:MRR:194.0,14.0] || follows(U,p3)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 193[0:Obv:186.0] || succeeds(U,p6)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 192[0:Obv:187.0] || succeeds(U,p5)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 184[0:MRR:183.1,9.0] || follows(U,p5)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p8)*.
% 3.73/2.66 181[0:MRR:180.1,9.0] || follows(U,p6)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p8)*.
% 3.73/2.66 191[0:Obv:188.0] || succeeds(U,p4)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 174[0:MRR:173.1,9.0] || follows(U,p3)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p8)*.
% 3.73/2.66 274[0:MRR:273.0,14.0] || state(U) succeeds(U,p3) -> succeeds(U,p1)*.
% 3.73/2.66 266[0:MRR:265.0,12.0] || follows(U,p5) state(U) -> succeeds(U,p7)*.
% 3.73/2.66 261[0:MRR:260.0,13.0] || follows(U,p4) state(U) -> succeeds(U,p7)*.
% 3.73/2.66 171[0:MRR:170.0,15.0] || follows(U,p2)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 259[0:Obv:257.0] || labels(out,U) state(U) -> succeeds(U,p7)*.
% 3.73/2.66 258[0:Obv:256.0] || succeeds(U,p5)* state(U) -> succeeds(U,p7).
% 3.73/2.66 249[0:MRR:248.0,13.0] || state(U) succeeds(U,p4) -> succeeds(U,p1)*.
% 3.73/2.66 234[0:MRR:233.0,13.0] || state(U) succeeds(U,p4)* -> succeeds(U,p7).
% 3.73/2.66 169[0:Obv:168.0] || succeeds(U,p3)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 137[0:MRR:136.1,10.0] || succeeds(U,p8)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p7)*.
% 3.73/2.66 134[0:MRR:133.1,11.0] || succeeds(U,p7)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p6)*.
% 3.73/2.66 131[0:MRR:130.1,14.0] || succeeds(U,p6)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 105[0:MRR:104.1,14.0] || succeeds(U,p5)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 128[0:MRR:127.1,13.0] || succeeds(U,p5)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p4)*.
% 3.73/2.66 190[0:MRR:189.0,13.0] || state(U) succeeds(U,p4) -> succeeds(U,p2)*.
% 3.73/2.66 178[0:MRR:177.0,10.0] || follows(U,p7) state(U) -> succeeds(U,p8)*.
% 3.73/2.66 166[0:MRR:165.0,13.0] || follows(U,p4) state(U) -> succeeds(U,p8)*.
% 3.73/2.66 164[0:Obv:162.0] || labels(out,U) state(U) -> succeeds(U,p8)*.
% 3.73/2.66 123[0:MRR:122.1,15.0] || succeeds(U,p3)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p2)*.
% 3.73/2.66 159[0:MRR:158.0,12.0] || follows(U,p5) state(U) -> succeeds(U,p8)*.
% 3.73/2.66 156[0:MRR:155.0,11.0] || follows(U,p6) state(U) -> succeeds(U,p8)*.
% 3.73/2.66 154[0:Obv:153.0] || succeeds(U,p7)* state(U) -> succeeds(U,p8).
% 3.73/2.66 150[0:MRR:149.0,14.0] || follows(U,p3) state(U) -> succeeds(U,p8)*.
% 3.73/2.66 120[0:MRR:119.1,16.0] || succeeds(U,p2)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p1)*.
% 3.73/2.66 148[0:Obv:143.0] || succeeds(U,p4)* state(U) -> succeeds(U,p8).
% 3.73/2.66 147[0:Obv:142.0] || succeeds(U,p5)* state(U) -> succeeds(U,p8).
% 3.73/2.66 146[0:Obv:141.0] || succeeds(U,p6)* state(U) -> succeeds(U,p8).
% 3.73/2.66 145[0:MRR:144.0,13.0] || -> succeeds(p4,p8)*.
% 3.73/2.66 139[0:MRR:138.0,14.0] || state(U) succeeds(U,p3)* -> succeeds(U,p8).
% 3.73/2.66 100[0:MRR:99.1,9.0] || labels(loop,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p8)*.
% 3.73/2.66 97[0:MRR:96.1,13.0] || labels(out,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p4)*.
% 3.73/2.66 95[0:Obv:94.0] || labels(out,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 117[0:MRR:111.0,111.1,10.0,9.0] || state(U) succeeds(U,p8) -> succeeds(U,p7)*.
% 3.73/2.66 116[0:MRR:110.0,110.1,11.0,10.0] || state(U) succeeds(U,p7) -> succeeds(U,p6)*.
% 3.73/2.66 115[0:MRR:109.0,109.1,14.0,11.0] || state(U) succeeds(U,p6) -> succeeds(U,p3)*.
% 3.73/2.66 114[0:MRR:108.0,108.1,13.0,12.0] || state(U) succeeds(U,p5) -> succeeds(U,p4)*.
% 3.73/2.66 113[0:MRR:107.0,107.1,15.0,14.0] || state(U) succeeds(U,p3) -> succeeds(U,p2)*.
% 3.73/2.66 112[0:MRR:106.0,106.1,16.0,15.0] || state(U) succeeds(U,p2) -> succeeds(U,p1)*.
% 3.73/2.66 78[0:Obv:77.1] || follows(U,V)*+ state(V) state(U) state(W) succeeds(W,U)* -> succeeds(W,V)*.
% 3.73/2.66 102[0:MRR:101.0,12.0] || state(U) succeeds(U,p5) -> succeeds(U,p3)*.
% 3.73/2.66 88[0:MRR:87.0,13.0] || follows(U,p4)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 92[0:MRR:90.1,90.2,1.0,9.0] || state(U) labels(loop,U) -> succeeds(U,p8)*.
% 3.73/2.66 91[0:MRR:89.1,89.2,2.0,13.0] || state(U) labels(out,U) -> succeeds(U,p4)*.
% 3.73/2.66 46[0:Inp] || state(U) label(V) state(W) labels(V,U)* has(W,goto(V))*+ -> succeeds(U,W)*.
% 3.73/2.66 85[0:MRR:84.1,14.0] || succeeds(U,p4)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 3.73/2.66 82[0:MRR:81.0,81.1,14.0,13.0] || state(U) succeeds(U,p4) -> succeeds(U,p3)*.
% 3.73/2.66 80[0:MRR:79.0,79.1,4.0,8.0] || -> succeeds(p4,p3)*.
% 3.73/2.66 45[0:Inp] || state(U) state(V) state(W) succeeds(V,U)*+ succeeds(W,V)* -> succeeds(W,U)*.
% 3.73/2.66 44[0:Inp] || state(U) boolean(V) state(W) has(W,ifthen(V,U))* -> succeeds(U,W).
% 3.73/2.66 43[0:Inp] || state(U) state(V) follows(V,U) -> succeeds(V,U)*.
% 3.73/2.66 39[0:Inp] || register(U) number(V) -> number(plus_f(U,V))*.
% 3.73/2.66 38[0:Inp] || number(U) register(V) -> number(times_f(U,V))*.
% 3.73/2.66 40[0:Inp] || boolean(U) state(V) -> statement(ifthen(U,V))*.
% 3.73/2.66 41[0:Inp] || register(U) number(V) -> statement(assign(U,V))*.
% 3.73/2.66 42[0:Inp] || register(U) number(V) -> boolean(equal_function(U,V))*.
% 3.73/2.66 35[0:Inp] || -> has(p7,assign(register_j,plus_f(register_j,n1)))*.
% 3.73/2.66 36[0:Inp] || -> has(p6,assign(register_k,times_f(n2,register_k)))*.
% 3.73/2.66 37[0:Inp] || -> has(p3,ifthen(equal_function(register_j,n),p4))*.
% 3.73/2.66 34[0:Inp] || label(U) -> statement(goto(U))*.
% 3.73/2.66 32[0:Inp] || -> has(p2,assign(register_k,n1))*.
% 3.73/2.66 33[0:Inp] || -> has(p1,assign(register_j,n0))*.
% 3.73/2.66 30[0:Inp] || -> has(p8,goto(loop))*.
% 3.73/2.66 31[0:Inp] || -> has(p4,goto(out))*.
% 3.73/2.66 23[0:Inp] || -> follows(p8,p7)*.
% 3.73/2.66 24[0:Inp] || -> follows(p7,p6)*.
% 3.73/2.66 25[0:Inp] || -> follows(p6,p3)*.
% 3.73/2.66 26[0:Inp] || -> follows(p5,p4)*.
% 3.73/2.66 27[0:Inp] || -> follows(p3,p2)*.
% 3.73/2.66 29[0:Inp] || -> follows(p2,p1)*.
% 3.73/2.66 28[0:Inp] || -> labels(loop,p3)*.
% 3.73/2.66 9[0:Inp] || -> state(p8)*.
% 3.73/2.66 10[0:Inp] || -> state(p7)*.
% 3.73/2.66 11[0:Inp] || -> state(p6)*.
% 3.73/2.66 12[0:Inp] || -> state(p5)*.
% 3.73/2.66 13[0:Inp] || -> state(p4)*.
% 3.73/2.66 14[0:Inp] || -> state(p3)*.
% 3.73/2.66 15[0:Inp] || -> state(p2)*.
% 3.73/2.66 16[0:Inp] || -> state(p1)*.
% 3.73/2.66 22[0:Inp] || -> state(skc6)*.
% 3.73/2.66 5[0:Inp] || -> number(n2)*.
% 3.73/2.66 6[0:Inp] || -> number(n1)*.
% 3.73/2.66 7[0:Inp] || -> number(n0)*.
% 3.73/2.66 8[0:Inp] || -> number(n)*.
% 3.73/2.66 18[0:Inp] || -> number(skc10)*.
% 3.73/2.66 3[0:Inp] || -> register(register_k)*.
% 3.73/2.66 4[0:Inp] || -> register(register_j)*.
% 3.73/2.66 19[0:Inp] || -> register(skc9)*.
% 3.73/2.66 1[0:Inp] || -> label(loop)*.
% 3.73/2.66 2[0:Inp] || -> label(out)*.
% 3.73/2.66 21[0:Inp] || -> label(skc7)*.
% 3.73/2.66 17[0:Inp] || -> boolean(skc11)*.
% 3.73/2.66 20[0:Inp] || -> statement(skc8)*.
% 3.73/2.66
% 3.73/2.66 % SZS output end ListOfCNF for /tmp/SPASST_23565_n006.cluster.edu
% 3.73/2.66 SPASS+T ended
%------------------------------------------------------------------------------