TSTP Solution File: ARI598_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI598_1 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n020.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.82s 1.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ARI598_1 : TPTP v8.1.0. Released v5.1.0.
% 0.12/0.12 % Command : spasst-tptp-script %s %d
% 0.12/0.33 % Computer : n020.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 14:30:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.46 % Using integer theory
% 0.82/1.09
% 0.82/1.09
% 0.82/1.09 % SZS status Incomplete for /tmp/SPASST_28811_n020.cluster.edu
% 0.82/1.09
% 0.82/1.09 SPASS V 2.2.22 in combination with yices.
% 0.82/1.09 SPASS beiseite: Unknown (SPASS (with standard axioms): completion, SMT procedure: unknown).
% 0.82/1.09 Problem: /tmp/SPASST_28811_n020.cluster.edu
% 0.82/1.09 SPASS derived 21 clauses, backtracked 0 clauses and kept 48 clauses.
% 0.82/1.09 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.82/1.09 SPASS allocated 6230 KBytes.
% 0.82/1.09 SPASS spent 0:00:00.04 on the problem.
% 0.82/1.09 0:00:00.00 for the input.
% 0.82/1.09 0:00:00.00 for the FLOTTER CNF translation.
% 0.82/1.09 0:00:00.00 for inferences.
% 0.82/1.09 0:00:00.00 for the backtracking.
% 0.82/1.09 0:00:00.00 for the reduction.
% 0.82/1.09 0:00:00.04 for interacting with the SMT procedure.
% 0.82/1.09
% 0.82/1.09
% 0.82/1.09 % SZS output start ListOfCNF for /tmp/SPASST_28811_n020.cluster.edu
% 0.82/1.09
% 0.82/1.09 The saturated set of worked-off clauses is :
% 0.82/1.09 59[0:Res:2.0,48.0] || equal(a,-2)** -> .
% 0.82/1.09 61[0:ArS:60.0] || equal(a,-1)** -> .
% 0.82/1.09 37[0:Res:4.0,3.1] || equal(plus(times(3,a),1),times(2,U))* -> .
% 0.82/1.09 48[0:ArS:47.1] || p(U)* equal(U,-2) -> .
% 0.82/1.09 56[0:Res:2.0,46.0] || equal(a,2)** -> .
% 0.82/1.09 46[0:SpL:23.0,3.1] || p(U)* equal(U,2) -> .
% 0.82/1.09 53[0:Res:2.0,45.0] || equal(a,0)** -> .
% 0.82/1.09 45[0:SpL:21.0,3.1] || p(U)* equal(U,0) -> .
% 0.82/1.09 52[0:ArS:51.0] || p(-2)* -> .
% 0.82/1.09 50[0:SpL:23.0,44.0] || p(2)* -> .
% 0.82/1.09 49[0:SpL:21.0,44.0] || p(0)* -> .
% 0.82/1.09 44[0:EqR:3.1] || p(times(2,U))* -> .
% 0.82/1.09 3[0:Inp] || p(U)* equal(U,times(2,V))*+ -> .
% 0.82/1.09 36[0:Res:2.0,3.1] || equal(a,times(2,U))* -> .
% 0.82/1.09 4[0:Inp] || -> p(plus(times(3,a),1))*.
% 0.82/1.09 2[0:Inp] || -> p(a)*.
% 0.82/1.09 1[0:Inp] || -> true*.
% 0.82/1.09 18[0:ThA] || -> lesseq(U,V) less(plus(V,W),plus(U,W))*.
% 0.82/1.09 19[0:ThA] || -> lesseq(U,V) less(plus(W,V),plus(W,U))*.
% 0.82/1.09 17[0:ThA] || -> equal(U,V) less(V,U)* less(U,V)*.
% 0.82/1.09 20[0:ThA] || -> lesseq(U,V) less(uminus(U),uminus(V))*.
% 0.82/1.09 6[0:ThA] || -> equal(plus(U,plus(uminus(U),V)),V)**.
% 0.82/1.09 7[0:ThA] || -> equal(plus(uminus(U),plus(U,V)),V)**.
% 0.82/1.09 9[0:ThA] || -> equal(plus(plus(U,V),uminus(V)),U)**.
% 0.82/1.09 8[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**.
% 0.82/1.09 29[0:ThA] || evaleq(U,V)* -> equal(U,V).
% 0.82/1.09 25[0:ThA] || -> equal(times(U,-1),uminus(U))**.
% 0.82/1.09 10[0:ThA] || -> equal(plus(U,uminus(U)),0)**.
% 0.82/1.09 26[0:ThA] || -> equal(times(-1,U),uminus(U))**.
% 0.82/1.09 11[0:ThA] || -> equal(plus(uminus(U),U),0)**.
% 0.82/1.09 15[0:ThA] || -> less(U,plus(U,1))*.
% 0.82/1.09 5[0:ThA] || -> equal(uminus(uminus(U)),U)**.
% 0.82/1.09 16[0:ThA] || -> less(plus(U,-1),U)*.
% 0.82/1.09 12[0:ThA] || -> equal(plus(U,0),U)**.
% 0.82/1.09 23[0:ThA] || -> equal(times(U,1),U)**.
% 0.82/1.09 27[0:ThA] || -> equal(divide_nat(U,1),U)**.
% 0.82/1.09 21[0:ThA] || -> equal(times(U,0),0)**.
% 0.82/1.09 28[0:ThA] || -> equal(remainder(U,1),0)**.
% 0.82/1.09 13[0:ThA] || -> equal(plus(0,U),U)**.
% 0.82/1.09 24[0:ThA] || -> equal(times(1,U),U)**.
% 0.82/1.09 22[0:ThA] || -> equal(times(0,U),0)**.
% 0.82/1.09 34[0:ThA] || -> equal(floor(U),U)**.
% 0.82/1.09 35[0:ThA] || -> equal(ceiling(U),U)**.
% 0.82/1.09 14[0:ThA] || -> lesseq(U,U)*.
% 0.82/1.09 30[0:ThA] || -> evaleq(0,0)*.
% 0.82/1.09 31[0:ThA] || -> evaleq(1,1)*.
% 0.82/1.09 32[0:ThA] || -> isint(U)*.
% 0.82/1.09 33[0:ThA] || -> israt(U)*.
% 0.82/1.09
% 0.82/1.09 % SZS output end ListOfCNF for /tmp/SPASST_28811_n020.cluster.edu
% 0.82/1.09 SPASS+T ended
%------------------------------------------------------------------------------