TSTP Solution File: COM002_20 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : COM002_20 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% 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 : 300s
% DateTime : Mon May 22 15:23:55 EDT 2023
% Result : Unknown 2.48s 1.93s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : COM002_20 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.11 % Command : spasst-tptp-script %s %d
% 0.12/0.30 % Computer : n027.cluster.edu
% 0.12/0.30 % Model : x86_64 x86_64
% 0.12/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30 % Memory : 8042.1875MB
% 0.12/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.30 % CPULimit : 300
% 0.12/0.30 % WCLimit : 300
% 0.12/0.30 % DateTime : Mon May 22 11:22:54 EDT 2023
% 0.12/0.31 % CPUTime :
% 0.16/0.43 % Using EUF theory
% 2.48/1.92
% 2.48/1.92
% 2.48/1.92 % SZS status CounterSatisfiable for /tmp/SPASST_29930_n027.cluster.edu
% 2.48/1.92
% 2.48/1.92 SPASS V 2.2.22 in combination with yices.
% 2.48/1.92 SPASS beiseite: Satisfiable.
% 2.48/1.92 Problem: /tmp/SPASST_29930_n027.cluster.edu
% 2.48/1.92 SPASS derived 4 clauses, backtracked 0 clauses and kept 50 clauses.
% 2.48/1.92 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 2.48/1.92 SPASS allocated 6427 KBytes.
% 2.48/1.92 SPASS spent 0:00:00.93 on the problem.
% 2.48/1.92 0:00:00.00 for the input.
% 2.48/1.92 0:00:00.01 for the FLOTTER CNF translation.
% 2.48/1.92 0:00:00.00 for inferences.
% 2.48/1.92 0:00:00.00 for the backtracking.
% 2.48/1.92 0:00:00.00 for the reduction.
% 2.48/1.92 0:00:00.91 for interacting with the SMT procedure.
% 2.48/1.92
% 2.48/1.92
% 2.48/1.92 % SZS output start ListOfCNF for /tmp/SPASST_29930_n027.cluster.edu
% 2.48/1.92
% 2.48/1.92 The saturated set of worked-off clauses is :
% 2.48/1.92 82[0:MRR:80.0,80.1,1.0,9.0] || state(U) labels(loop,U) fails(U,p8)* -> .
% 2.48/1.92 81[0:MRR:79.0,79.1,2.0,13.0] || state(U) labels(out,U) fails(U,p4)* -> .
% 2.48/1.92 46[0:Inp] || label(U) state(V) state(W) labels(U,W)* fails(W,V)* has(V,goto(U))*+ -> .
% 2.48/1.92 78[0:MRR:77.0,77.1,4.0,8.0] || fails(p4,p3)* -> .
% 2.48/1.92 45[0:Inp] || state(U) state(V) state(W) fails(W,V)*+ -> fails(W,U)* fails(U,V)*.
% 2.48/1.92 44[0:Inp] || boolean(U) state(V) state(W) fails(W,V) has(V,ifthen(U,W))* -> .
% 2.48/1.92 43[0:Inp] || state(U) state(V) fails(V,U)* follows(V,U) -> .
% 2.48/1.92 39[0:Inp] || register(U) number(V) -> number(plus_f(U,V))*.
% 2.48/1.92 38[0:Inp] || number(U) register(V) -> number(times_f(U,V))*.
% 2.48/1.92 40[0:Inp] || boolean(U) state(V) -> statement(ifthen(U,V))*.
% 2.48/1.92 41[0:Inp] || register(U) number(V) -> statement(assign(U,V))*.
% 2.48/1.92 42[0:Inp] || register(U) number(V) -> boolean(equal_function(U,V))*.
% 2.48/1.92 35[0:Inp] || -> has(p7,assign(register_j,plus_f(register_j,n1)))*.
% 2.48/1.92 36[0:Inp] || -> has(p6,assign(register_k,times_f(n2,register_k)))*.
% 2.48/1.92 37[0:Inp] || -> has(p3,ifthen(equal_function(register_j,n),p4))*.
% 2.48/1.92 34[0:Inp] || label(U) -> statement(goto(U))*.
% 2.48/1.92 32[0:Inp] || -> has(p2,assign(register_k,n1))*.
% 2.48/1.92 33[0:Inp] || -> has(p1,assign(register_j,n0))*.
% 2.48/1.92 30[0:Inp] || -> has(p8,goto(loop))*.
% 2.48/1.92 31[0:Inp] || -> has(p4,goto(out))*.
% 2.48/1.92 23[0:Inp] || -> follows(p8,p7)*.
% 2.48/1.92 24[0:Inp] || -> follows(p7,p6)*.
% 2.48/1.92 25[0:Inp] || -> follows(p6,p3)*.
% 2.48/1.92 26[0:Inp] || -> follows(p5,p4)*.
% 2.48/1.92 27[0:Inp] || -> follows(p3,p2)*.
% 2.48/1.92 29[0:Inp] || -> follows(p2,p1)*.
% 2.48/1.92 28[0:Inp] || -> labels(loop,p3)*.
% 2.48/1.92 9[0:Inp] || -> state(p8)*.
% 2.48/1.92 10[0:Inp] || -> state(p7)*.
% 2.48/1.92 11[0:Inp] || -> state(p6)*.
% 2.48/1.92 12[0:Inp] || -> state(p5)*.
% 2.48/1.92 13[0:Inp] || -> state(p4)*.
% 2.48/1.92 14[0:Inp] || -> state(p3)*.
% 2.48/1.92 15[0:Inp] || -> state(p2)*.
% 2.48/1.92 16[0:Inp] || -> state(p1)*.
% 2.48/1.92 22[0:Inp] || -> state(skc6)*.
% 2.48/1.92 5[0:Inp] || -> number(n2)*.
% 2.48/1.92 6[0:Inp] || -> number(n1)*.
% 2.48/1.92 7[0:Inp] || -> number(n0)*.
% 2.48/1.92 8[0:Inp] || -> number(n)*.
% 2.48/1.92 18[0:Inp] || -> number(skc10)*.
% 2.48/1.92 3[0:Inp] || -> register(register_k)*.
% 2.48/1.92 4[0:Inp] || -> register(register_j)*.
% 2.48/1.92 19[0:Inp] || -> register(skc9)*.
% 2.48/1.92 1[0:Inp] || -> label(loop)*.
% 2.48/1.92 2[0:Inp] || -> label(out)*.
% 2.48/1.92 21[0:Inp] || -> label(skc7)*.
% 2.48/1.92 17[0:Inp] || -> boolean(skc11)*.
% 2.48/1.92 20[0:Inp] || -> statement(skc8)*.
% 2.48/1.92
% 2.48/1.92 % SZS output end ListOfCNF for /tmp/SPASST_29930_n027.cluster.edu
% 2.48/1.93 SPASS+T ended
%------------------------------------------------------------------------------