TSTP Solution File: COM001_10 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : COM001_10 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n005.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:54 EDT 2023
% Result : Unknown 0.79s 1.14s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : COM001_10 : TPTP v8.2.0. Released v8.2.0.
% 0.10/0.13 % Command : spasst-tptp-script %s %d
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 22 11:01:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % Using EUF theory
% 0.79/1.13
% 0.79/1.13
% 0.79/1.13 % SZS status CounterSatisfiable for /tmp/SPASST_11010_n005.cluster.edu
% 0.79/1.13
% 0.79/1.13 SPASS V 2.2.22 in combination with yices.
% 0.79/1.13 SPASS beiseite: Satisfiable.
% 0.79/1.13 Problem: /tmp/SPASST_11010_n005.cluster.edu
% 0.79/1.13 SPASS derived 46 clauses, backtracked 0 clauses and kept 61 clauses.
% 0.79/1.13 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.79/1.13 SPASS allocated 6390 KBytes.
% 0.79/1.13 SPASS spent 0:00:00.09 on the problem.
% 0.79/1.13 0:00:00.00 for the input.
% 0.79/1.13 0:00:00.00 for the FLOTTER CNF translation.
% 0.79/1.13 0:00:00.00 for inferences.
% 0.79/1.13 0:00:00.00 for the backtracking.
% 0.79/1.13 0:00:00.00 for the reduction.
% 0.79/1.13 0:00:00.08 for interacting with the SMT procedure.
% 0.79/1.13
% 0.79/1.13
% 0.79/1.13 % SZS output start ListOfCNF for /tmp/SPASST_11010_n005.cluster.edu
% 0.79/1.13
% 0.79/1.13 The saturated set of worked-off clauses is :
% 0.79/1.13 132[0:MRR:131.1,5.0] || follows(U,p5)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p8)*.
% 0.79/1.13 130[0:Obv:129.1] || follows(U,p5)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 0.79/1.13 127[0:MRR:126.1,5.0] || follows(U,p4)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p8)*.
% 0.79/1.13 122[0:MRR:121.1,5.0] || labels(out,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p8)*.
% 0.79/1.13 117[0:MRR:116.0,5.0] || follows(U,p8)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 0.79/1.13 115[0:Obv:111.1] || follows(U,p3)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 0.79/1.13 114[0:Obv:112.0] || labels(loop,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 0.79/1.13 106[0:MRR:105.1,5.0] || follows(U,p3)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p8)*.
% 0.79/1.13 77[0:Obv:76.0] || succeeds(U,p5)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 0.79/1.13 134[0:MRR:133.0,6.0] || state(U) succeeds(U,p5) -> succeeds(U,p3)*.
% 0.79/1.13 70[0:MRR:69.0,7.0] || follows(U,p4)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 0.79/1.13 95[0:MRR:94.0,6.0] || follows(U,p5)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p4)*.
% 0.79/1.13 68[0:Obv:67.0] || labels(out,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 0.79/1.13 109[0:MRR:108.0,6.0] || follows(U,p5) state(U) -> succeeds(U,p8)*.
% 0.79/1.13 103[0:MRR:102.0,7.0] || follows(U,p4) state(U) -> succeeds(U,p8)*.
% 0.79/1.13 101[0:Obv:99.0] || labels(out,U) state(U) -> succeeds(U,p8)*.
% 0.79/1.13 82[0:MRR:81.1,8.0] || succeeds(U,p8)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 0.79/1.13 100[0:Obv:98.0] || succeeds(U,p5)* state(U) -> succeeds(U,p8).
% 0.79/1.13 92[0:MRR:91.0,8.0] || follows(U,p3) state(U) -> succeeds(U,p8)*.
% 0.79/1.13 90[0:Obv:87.0] || succeeds(U,p4)* state(U) -> succeeds(U,p8).
% 0.79/1.13 89[0:MRR:88.0,7.0] || -> succeeds(p4,p8)*.
% 0.79/1.13 79[0:MRR:78.1,7.0] || succeeds(U,p5)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p4)*.
% 0.79/1.13 84[0:MRR:83.0,8.0] || state(U) succeeds(U,p3)* -> succeeds(U,p8).
% 0.79/1.13 65[0:MRR:64.1,5.0] || labels(loop,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p8)*.
% 0.79/1.13 74[0:MRR:72.0,72.1,8.0,5.0] || state(U) succeeds(U,p8) -> succeeds(U,p3)*.
% 0.79/1.13 73[0:MRR:71.0,71.1,7.0,6.0] || state(U) succeeds(U,p5) -> succeeds(U,p4)*.
% 0.79/1.13 52[0:Obv:49.1] || follows(U,V)*+ state(V) state(U) state(W) succeeds(W,U)* -> succeeds(W,V)*.
% 0.79/1.13 62[0:MRR:61.1,7.0] || labels(out,U)+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p4)*.
% 0.79/1.13 55[0:MRR:54.1,8.0] || succeeds(U,p4)*+ state(U) state(V) succeeds(V,U)* -> succeeds(V,p3)*.
% 0.79/1.13 59[0:MRR:57.1,57.2,1.0,5.0] || state(U) labels(loop,U) -> succeeds(U,p8)*.
% 0.79/1.13 58[0:MRR:56.1,56.2,2.0,7.0] || state(U) labels(out,U) -> succeeds(U,p4)*.
% 0.79/1.13 27[0:Inp] || state(U) label(V) state(W) labels(V,U)* has(W,goto(V))*+ -> succeeds(U,W)*.
% 0.79/1.13 51[0:MRR:50.0,50.1,8.0,7.0] || state(U) succeeds(U,p4) -> succeeds(U,p3)*.
% 0.79/1.13 26[0:Inp] || state(U) state(V) state(W) succeeds(V,U)*+ succeeds(W,V)* -> succeeds(W,U)*.
% 0.79/1.13 48[0:MRR:47.0,47.1,3.0,4.0] || -> succeeds(p4,p3)*.
% 0.79/1.13 25[0:Inp] || state(U) boolean(V) state(W) has(W,ifthen(V,U))* -> succeeds(U,W).
% 0.79/1.13 24[0:Inp] || state(U) state(V) follows(V,U) -> succeeds(V,U)*.
% 0.79/1.13 23[0:Inp] || register(U) number(V) -> boolean(equal_function(U,V))*.
% 0.79/1.13 22[0:Inp] || boolean(U) state(V) -> statement(ifthen(U,V))*.
% 0.79/1.13 21[0:Inp] || -> has(p3,ifthen(equal_function(register_j,n),p4))*.
% 0.79/1.13 20[0:Inp] || label(U) -> statement(goto(U))*.
% 0.79/1.13 18[0:Inp] || -> has(p8,goto(loop))*.
% 0.79/1.13 19[0:Inp] || -> has(p4,goto(out))*.
% 0.79/1.13 15[0:Inp] || -> follows(p8,p3)*.
% 0.79/1.13 16[0:Inp] || -> follows(p5,p4)*.
% 0.79/1.13 17[0:Inp] || -> labels(loop,p3)*.
% 0.79/1.13 5[0:Inp] || -> state(p8)*.
% 0.79/1.13 6[0:Inp] || -> state(p5)*.
% 0.79/1.13 7[0:Inp] || -> state(p4)*.
% 0.79/1.13 8[0:Inp] || -> state(p3)*.
% 0.79/1.13 14[0:Inp] || -> state(skc6)*.
% 0.79/1.13 1[0:Inp] || -> label(loop)*.
% 0.79/1.13 2[0:Inp] || -> label(out)*.
% 0.79/1.13 13[0:Inp] || -> label(skc7)*.
% 0.79/1.13 9[0:Inp] || -> boolean(skc11)*.
% 0.79/1.13 3[0:Inp] || -> register(register_j)*.
% 0.79/1.13 4[0:Inp] || -> number(n)*.
% 0.79/1.13 10[0:Inp] || -> number(skc10)*.
% 0.79/1.13 11[0:Inp] || -> register(skc9)*.
% 0.79/1.13 12[0:Inp] || -> statement(skc8)*.
% 0.79/1.13
% 0.79/1.13 % SZS output end ListOfCNF for /tmp/SPASST_11010_n005.cluster.edu
% 0.79/1.13 SPASS+T ended
%------------------------------------------------------------------------------