TSTP Solution File: ARI597_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI597_1 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n032.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 : Thu Jul 14 22:18:15 EDT 2022
% Result : Unknown 0.50s 0.84s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : ARI597_1 : TPTP v8.1.0. Released v5.1.0.
% 0.00/0.10 % Command : spasst-tptp-script %s %d
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Fri Jun 17 15:05:01 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.38 % Using integer theory
% 0.50/0.84
% 0.50/0.84
% 0.50/0.84 % SZS status Incomplete for /tmp/SPASST_30792_n032.cluster.edu
% 0.50/0.84
% 0.50/0.84 SPASS V 2.2.22 in combination with yices.
% 0.50/0.84 SPASS beiseite: Unknown (SPASS (with standard axioms): completion, SMT procedure: unknown).
% 0.50/0.84 Problem: /tmp/SPASST_30792_n032.cluster.edu
% 0.50/0.84 SPASS derived 28 clauses, backtracked 0 clauses and kept 55 clauses.
% 0.50/0.84 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.50/0.84 SPASS allocated 6231 KBytes.
% 0.50/0.84 SPASS spent 0:00:00.04 on the problem.
% 0.50/0.84 0:00:00.00 for the input.
% 0.50/0.84 0:00:00.00 for the FLOTTER CNF translation.
% 0.50/0.84 0:00:00.00 for inferences.
% 0.50/0.84 0:00:00.00 for the backtracking.
% 0.50/0.84 0:00:00.00 for the reduction.
% 0.50/0.84 0:00:00.03 for interacting with the SMT procedure.
% 0.50/0.84
% 0.50/0.84
% 0.50/0.84 % SZS output start ListOfCNF for /tmp/SPASST_30792_n032.cluster.edu
% 0.50/0.84
% 0.50/0.84 The saturated set of worked-off clauses is :
% 0.50/0.84 67[0:Res:5.0,54.0] || equal(plus(a,b),-2)** -> .
% 0.50/0.84 66[0:Res:3.0,54.0] || equal(a,-2)** -> .
% 0.50/0.84 65[0:Res:4.0,54.0] || equal(b,-2)** -> .
% 0.50/0.84 54[0:ArS:53.1] || p(U)* equal(U,-2) -> .
% 0.50/0.84 40[0:Res:5.0,6.1] || equal(plus(a,b),times(2,U))* -> .
% 0.50/0.84 64[0:Res:5.0,52.0] || equal(plus(a,b),2)** -> .
% 0.50/0.84 61[0:Res:5.0,51.0] || equal(plus(a,b),0)** -> .
% 0.50/0.84 63[0:Res:3.0,52.0] || equal(a,2)** -> .
% 0.50/0.84 62[0:Res:4.0,52.0] || equal(b,2)** -> .
% 0.50/0.84 52[0:SpL:25.0,6.1] || p(U)* equal(U,2) -> .
% 0.50/0.84 60[0:Res:3.0,51.0] || equal(a,0)** -> .
% 0.50/0.84 59[0:Res:4.0,51.0] || equal(b,0)** -> .
% 0.50/0.84 51[0:SpL:23.0,6.1] || p(U)* equal(U,0) -> .
% 0.50/0.84 39[0:Res:3.0,6.1] || equal(a,times(2,U))* -> .
% 0.50/0.84 38[0:Res:4.0,6.1] || equal(b,times(2,U))* -> .
% 0.50/0.84 58[0:ArS:57.0] || p(-2)* -> .
% 0.50/0.84 56[0:SpL:25.0,50.0] || p(2)* -> .
% 0.50/0.84 55[0:SpL:23.0,50.0] || p(0)* -> .
% 0.50/0.84 50[0:EqR:6.1] || p(times(2,U))* -> .
% 0.50/0.84 6[0:Inp] || p(U)* equal(U,times(2,V))*+ -> .
% 0.50/0.84 5[0:Inp] || -> p(plus(a,b))*.
% 0.50/0.84 3[0:Inp] || -> p(a)*.
% 0.50/0.84 4[0:Inp] || -> p(b)*.
% 0.50/0.84 2[0:Inp] || -> true*.
% 0.50/0.84 20[0:ThA] || -> lesseq(U,V) less(plus(V,W),plus(U,W))*.
% 0.50/0.84 21[0:ThA] || -> lesseq(U,V) less(plus(W,V),plus(W,U))*.
% 0.50/0.84 19[0:ThA] || -> equal(U,V) less(V,U)* less(U,V)*.
% 0.50/0.84 22[0:ThA] || -> lesseq(U,V) less(uminus(U),uminus(V))*.
% 0.50/0.84 8[0:ThA] || -> equal(plus(U,plus(uminus(U),V)),V)**.
% 0.50/0.84 9[0:ThA] || -> equal(plus(uminus(U),plus(U,V)),V)**.
% 0.50/0.84 11[0:ThA] || -> equal(plus(plus(U,V),uminus(V)),U)**.
% 0.50/0.84 10[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**.
% 0.50/0.84 31[0:ThA] || evaleq(U,V)* -> equal(U,V).
% 0.50/0.84 27[0:ThA] || -> equal(times(U,-1),uminus(U))**.
% 0.50/0.84 12[0:ThA] || -> equal(plus(U,uminus(U)),0)**.
% 0.50/0.84 28[0:ThA] || -> equal(times(-1,U),uminus(U))**.
% 0.50/0.84 13[0:ThA] || -> equal(plus(uminus(U),U),0)**.
% 0.50/0.84 17[0:ThA] || -> less(U,plus(U,1))*.
% 0.50/0.84 7[0:ThA] || -> equal(uminus(uminus(U)),U)**.
% 0.50/0.84 18[0:ThA] || -> less(plus(U,-1),U)*.
% 0.50/0.84 14[0:ThA] || -> equal(plus(U,0),U)**.
% 0.50/0.84 25[0:ThA] || -> equal(times(U,1),U)**.
% 0.50/0.84 29[0:ThA] || -> equal(divide_nat(U,1),U)**.
% 0.50/0.84 23[0:ThA] || -> equal(times(U,0),0)**.
% 0.50/0.84 30[0:ThA] || -> equal(remainder(U,1),0)**.
% 0.50/0.84 15[0:ThA] || -> equal(plus(0,U),U)**.
% 0.50/0.84 26[0:ThA] || -> equal(times(1,U),U)**.
% 0.50/0.84 24[0:ThA] || -> equal(times(0,U),0)**.
% 0.50/0.84 36[0:ThA] || -> equal(floor(U),U)**.
% 0.50/0.84 37[0:ThA] || -> equal(ceiling(U),U)**.
% 0.50/0.84 16[0:ThA] || -> lesseq(U,U)*.
% 0.50/0.84 32[0:ThA] || -> evaleq(0,0)*.
% 0.50/0.84 33[0:ThA] || -> evaleq(1,1)*.
% 0.50/0.84 34[0:ThA] || -> isint(U)*.
% 0.50/0.84 35[0:ThA] || -> israt(U)*.
% 0.50/0.84
% 0.50/0.84 % SZS output end ListOfCNF for /tmp/SPASST_30792_n032.cluster.edu
% 0.50/0.84 SPASS+T ended
%------------------------------------------------------------------------------