TSTP Solution File: ARI596_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI596_1 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n019.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.76s 1.06s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI596_1 : TPTP v8.1.0. Released v5.1.0.
% 0.03/0.12 % Command : spasst-tptp-script %s %d
% 0.12/0.33 % Computer : n019.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 17 12:54:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.46 % Using integer theory
% 0.76/1.06
% 0.76/1.06
% 0.76/1.06 % SZS status Incomplete for /tmp/SPASST_32738_n019.cluster.edu
% 0.76/1.06
% 0.76/1.06 SPASS V 2.2.22 in combination with yices.
% 0.76/1.06 SPASS beiseite: Unknown (SPASS (with standard axioms): completion, SMT procedure: unknown).
% 0.76/1.06 Problem: /tmp/SPASST_32738_n019.cluster.edu
% 0.76/1.06 SPASS derived 27 clauses, backtracked 0 clauses and kept 55 clauses.
% 0.76/1.06 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.76/1.06 SPASS allocated 6236 KBytes.
% 0.76/1.06 SPASS spent 0:00:00.05 on the problem.
% 0.76/1.06 0:00:00.00 for the input.
% 0.76/1.06 0:00:00.00 for the FLOTTER CNF translation.
% 0.76/1.06 0:00:00.00 for inferences.
% 0.76/1.06 0:00:00.00 for the backtracking.
% 0.76/1.06 0:00:00.00 for the reduction.
% 0.76/1.06 0:00:00.04 for interacting with the SMT procedure.
% 0.76/1.06
% 0.76/1.06
% 0.76/1.06 % SZS output start ListOfCNF for /tmp/SPASST_32738_n019.cluster.edu
% 0.76/1.06
% 0.76/1.06 The saturated set of worked-off clauses is :
% 0.76/1.06 72[0:ArS:70.0] || equal(a,-4)** -> .
% 0.76/1.06 71[0:ArS:69.0] || equal(a,-2)** -> .
% 0.76/1.06 68[0:Res:2.0,53.0] || equal(a,-3)** -> .
% 0.76/1.06 53[0:ArS:52.1] || p(U)* equal(U,-3) -> .
% 0.76/1.06 40[0:Res:3.0,5.1] || equal(plus(a,1),times(3,U))* -> .
% 0.76/1.06 39[0:Res:37.0,5.1] || equal(plus(a,-1),times(3,U))* -> .
% 0.76/1.06 67[0:ArS:65.0] || equal(a,2)** -> .
% 0.76/1.06 66[0:ArS:64.0] || equal(a,4)** -> .
% 0.76/1.06 63[0:Res:2.0,51.0] || equal(a,3)** -> .
% 0.76/1.06 51[0:SpL:24.0,5.1] || p(U)* equal(U,3) -> .
% 0.76/1.06 62[0:ArS:60.0] || equal(a,-1)** -> .
% 0.76/1.06 61[0:ArS:59.0] || equal(a,1)** -> .
% 0.76/1.06 58[0:Res:2.0,50.0] || equal(a,0)** -> .
% 0.76/1.06 50[0:SpL:22.0,5.1] || p(U)* equal(U,0) -> .
% 0.76/1.06 38[0:Res:2.0,5.1] || equal(a,times(3,U))* -> .
% 0.76/1.06 57[0:ArS:56.0] || p(-3)* -> .
% 0.76/1.06 55[0:SpL:24.0,49.0] || p(3)* -> .
% 0.76/1.06 54[0:SpL:22.0,49.0] || p(0)* -> .
% 0.76/1.06 49[0:EqR:5.1] || p(times(3,U))* -> .
% 0.76/1.06 5[0:Inp] || p(U)* equal(U,times(3,V))*+ -> .
% 0.76/1.06 3[0:Inp] || -> p(plus(a,1))*.
% 0.76/1.06 37[0:ArS:4.0] || -> p(plus(a,-1))*.
% 0.76/1.06 2[0:Inp] || -> p(a)*.
% 0.76/1.06 1[0:Inp] || -> true*.
% 0.76/1.06 19[0:ThA] || -> lesseq(U,V) less(plus(V,W),plus(U,W))*.
% 0.76/1.06 20[0:ThA] || -> lesseq(U,V) less(plus(W,V),plus(W,U))*.
% 0.76/1.06 18[0:ThA] || -> equal(U,V) less(V,U)* less(U,V)*.
% 0.76/1.06 21[0:ThA] || -> lesseq(U,V) less(uminus(U),uminus(V))*.
% 0.76/1.06 7[0:ThA] || -> equal(plus(U,plus(uminus(U),V)),V)**.
% 0.76/1.06 8[0:ThA] || -> equal(plus(uminus(U),plus(U,V)),V)**.
% 0.76/1.06 10[0:ThA] || -> equal(plus(plus(U,V),uminus(V)),U)**.
% 0.76/1.06 9[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**.
% 0.76/1.06 30[0:ThA] || evaleq(U,V)* -> equal(U,V).
% 0.76/1.06 26[0:ThA] || -> equal(times(U,-1),uminus(U))**.
% 0.76/1.06 11[0:ThA] || -> equal(plus(U,uminus(U)),0)**.
% 0.76/1.06 27[0:ThA] || -> equal(times(-1,U),uminus(U))**.
% 0.76/1.06 12[0:ThA] || -> equal(plus(uminus(U),U),0)**.
% 0.76/1.06 16[0:ThA] || -> less(U,plus(U,1))*.
% 0.76/1.06 6[0:ThA] || -> equal(uminus(uminus(U)),U)**.
% 0.76/1.06 17[0:ThA] || -> less(plus(U,-1),U)*.
% 0.76/1.06 13[0:ThA] || -> equal(plus(U,0),U)**.
% 0.76/1.06 24[0:ThA] || -> equal(times(U,1),U)**.
% 0.76/1.06 28[0:ThA] || -> equal(divide_nat(U,1),U)**.
% 0.76/1.06 22[0:ThA] || -> equal(times(U,0),0)**.
% 0.76/1.06 29[0:ThA] || -> equal(remainder(U,1),0)**.
% 0.76/1.06 14[0:ThA] || -> equal(plus(0,U),U)**.
% 0.76/1.06 25[0:ThA] || -> equal(times(1,U),U)**.
% 0.76/1.06 23[0:ThA] || -> equal(times(0,U),0)**.
% 0.76/1.06 35[0:ThA] || -> equal(floor(U),U)**.
% 0.76/1.06 36[0:ThA] || -> equal(ceiling(U),U)**.
% 0.76/1.06 15[0:ThA] || -> lesseq(U,U)*.
% 0.76/1.06 31[0:ThA] || -> evaleq(0,0)*.
% 0.76/1.06 32[0:ThA] || -> evaleq(1,1)*.
% 0.76/1.06 33[0:ThA] || -> isint(U)*.
% 0.76/1.06 34[0:ThA] || -> israt(U)*.
% 0.76/1.06
% 0.76/1.06 % SZS output end ListOfCNF for /tmp/SPASST_32738_n019.cluster.edu
% 0.76/1.06 SPASS+T ended
%------------------------------------------------------------------------------