TSTP Solution File: ARI533_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI533_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n013.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:17:56 EDT 2022
% Result : Unknown 0.46s 1.06s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : ARI533_1 : TPTP v8.1.0. Released v5.0.0.
% 0.08/0.13 % Command : spasst-tptp-script %s %d
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jun 17 13:43:29 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.48 % Using rational theory
% 0.46/1.04
% 0.46/1.04
% 0.46/1.04 % SZS status Incomplete for /tmp/SPASST_3126_n013.cluster.edu
% 0.46/1.04
% 0.46/1.04 SPASS V 2.2.22 in combination with yices.
% 0.46/1.04 SPASS beiseite: Unknown (SPASS (with standard axioms): completion, SMT procedure: unknown).
% 0.46/1.04 Problem: /tmp/SPASST_3126_n013.cluster.edu
% 0.46/1.04 SPASS derived 0 clauses, backtracked 0 clauses and kept 51 clauses.
% 0.46/1.04 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.46/1.04 SPASS allocated 6228 KBytes.
% 0.46/1.04 SPASS spent 0:00:00.01 on the problem.
% 0.46/1.04 0:00:00.00 for the input.
% 0.46/1.04 0:00:00.00 for the FLOTTER CNF translation.
% 0.46/1.04 0:00:00.00 for inferences.
% 0.46/1.04 0:00:00.00 for the backtracking.
% 0.46/1.04 0:00:00.00 for the reduction.
% 0.46/1.04 0:00:00.00 for interacting with the SMT procedure.
% 0.46/1.04
% 0.46/1.04
% 0.46/1.04 % SZS output start ListOfCNF for /tmp/SPASST_3126_n013.cluster.edu
% 0.46/1.04
% 0.46/1.04 The saturated set of worked-off clauses is :
% 0.46/1.04 40[0:ThX] || isint(U) -> equal(floor(plus(V,U)),plus(floor(V),U))**.
% 0.46/1.04 41[0:ThX] || isint(U) -> equal(ceiling(plus(V,U)),plus(ceiling(V),U))**.
% 0.46/1.04 48[0:ThX] || -> less(U,V)* less(W,U)* lesseq(floor(V),floor(W))*.
% 0.46/1.04 50[0:ThX] || -> less(U,V)* less(W,U)* lesseq(ceiling(V),ceiling(W))*.
% 0.46/1.04 44[0:ThX] || isint(uminus(U)) isint(plus(V,U))* -> isint(V).
% 0.46/1.04 45[0:ThX] || isint(uminus(U)) isint(plus(U,V))* -> isint(V).
% 0.46/1.04 15[0:ThA] || -> lesseq(U,V) less(plus(V,W),plus(U,W))*.
% 0.46/1.04 16[0:ThA] || -> lesseq(U,V) less(plus(W,V),plus(W,U))*.
% 0.46/1.04 43[0:ThX] || isint(U) isint(V) -> isint(plus(V,U))*.
% 0.46/1.04 46[0:ThX] || isint(U) isint(V) -> isint(times(V,U))*.
% 0.46/1.04 14[0:ThA] || -> equal(U,V) less(V,U)* less(U,V)*.
% 0.46/1.04 17[0:ThA] || -> lesseq(U,V) less(uminus(U),uminus(V))*.
% 0.46/1.04 47[0:ThX] || -> less(U,V) lesseq(floor(V),floor(U))*.
% 0.46/1.04 49[0:ThX] || -> less(U,V) lesseq(ceiling(V),ceiling(U))*.
% 0.46/1.04 3[0:ThA] || -> equal(plus(U,plus(uminus(U),V)),V)**.
% 0.46/1.04 4[0:ThA] || -> equal(plus(uminus(U),plus(U,V)),V)**.
% 0.46/1.04 6[0:ThA] || -> equal(plus(plus(U,V),uminus(V)),U)**.
% 0.46/1.04 5[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**.
% 0.46/1.04 26[0:ThA] || evaleq(U,V)* -> equal(U,V).
% 0.46/1.04 38[0:ThX] || isint(U) -> equal(floor(U),U)**.
% 0.46/1.04 39[0:ThX] || isint(U) -> equal(ceiling(U),U)**.
% 0.46/1.04 51[0:ThX] || -> equal(floor(uminus(U)),uminus(ceiling(U)))**.
% 0.46/1.04 52[0:ThX] || -> equal(ceiling(uminus(U)),uminus(floor(U)))**.
% 0.46/1.04 42[0:ThX] || isint(U) -> isint(uminus(U))*.
% 0.46/1.04 35[0:ThX] || -> less(U,floor(plus(U,1)))*.
% 0.46/1.04 36[0:ThX] || -> less(ceiling(U),plus(U,1))*.
% 0.46/1.04 37[0:ThX] || -> less(ceiling(plus(U,-1)),U)*.
% 0.46/1.04 34[0:ThX] || -> less(plus(U,-1),floor(U))*.
% 0.46/1.04 22[0:ThA] || -> equal(times(U,-1),uminus(U))**.
% 0.46/1.04 7[0:ThA] || -> equal(plus(U,uminus(U)),0)**.
% 0.46/1.04 23[0:ThA] || -> equal(times(-1,U),uminus(U))**.
% 0.46/1.04 8[0:ThA] || -> equal(plus(uminus(U),U),0)**.
% 0.46/1.04 12[0:ThA] || -> less(U,plus(U,1))*.
% 0.46/1.04 2[0:ThA] || -> equal(uminus(uminus(U)),U)**.
% 0.46/1.04 13[0:ThA] || -> less(plus(U,-1),U)*.
% 0.46/1.04 9[0:ThA] || -> equal(plus(U,0),U)**.
% 0.46/1.04 20[0:ThA] || -> equal(times(U,1),U)**.
% 0.46/1.04 24[0:ThA] || -> equal(divide_nat(U,1),U)**.
% 0.46/1.04 18[0:ThA] || -> equal(times(U,0),0)**.
% 0.46/1.04 25[0:ThA] || -> equal(remainder(U,1),0)**.
% 0.46/1.04 10[0:ThA] || -> equal(plus(0,U),U)**.
% 0.46/1.04 21[0:ThA] || -> equal(times(1,U),U)**.
% 0.46/1.04 19[0:ThA] || -> equal(times(0,U),0)**.
% 0.46/1.04 33[0:ThX] || -> lesseq(U,ceiling(U))*.
% 0.46/1.04 32[0:ThX] || -> lesseq(floor(U),U)*.
% 0.46/1.04 30[0:ThX] || -> isint(floor(U))*.
% 0.46/1.04 31[0:ThX] || -> isint(ceiling(U))*.
% 0.46/1.04 11[0:ThA] || -> lesseq(U,U)*.
% 0.46/1.04 27[0:ThA] || -> evaleq(0,0)*.
% 0.46/1.04 28[0:ThA] || -> evaleq(1,1)*.
% 0.46/1.04 29[0:ThA] || -> israt(U)*.
% 0.46/1.04
% 0.46/1.04 % SZS output end ListOfCNF for /tmp/SPASST_3126_n013.cluster.edu
% 0.46/1.06 SPASS+T ended
%------------------------------------------------------------------------------