TSTP Solution File: SWV996_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : SWV996_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n014.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 : Wed Jul 20 21:49:39 EDT 2022
% Result : Unknown 0.81s 1.11s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWV996_1 : TPTP v8.1.0. Released v5.0.0.
% 0.13/0.13 % Command : spasst-tptp-script %s %d
% 0.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 05:14:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49 % Using integer theory
% 0.81/1.11
% 0.81/1.11
% 0.81/1.11 % SZS status Incomplete for /tmp/SPASST_2835_n014.cluster.edu
% 0.81/1.11
% 0.81/1.11 SPASS V 2.2.22 in combination with yices.
% 0.81/1.11 SPASS beiseite: Unknown (SPASS (with standard axioms): completion, SMT procedure: unknown).
% 0.81/1.11 Problem: /tmp/SPASST_2835_n014.cluster.edu
% 0.81/1.11 SPASS derived 61 clauses, backtracked 0 clauses and kept 48 clauses.
% 0.81/1.11 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.81/1.11 SPASS allocated 6267 KBytes.
% 0.81/1.11 SPASS spent 0:00:00.05 on the problem.
% 0.81/1.11 0:00:00.00 for the input.
% 0.81/1.11 0:00:00.00 for the FLOTTER CNF translation.
% 0.81/1.11 0:00:00.00 for inferences.
% 0.81/1.11 0:00:00.00 for the backtracking.
% 0.81/1.11 0:00:00.00 for the reduction.
% 0.81/1.11 0:00:00.04 for interacting with the SMT procedure.
% 0.81/1.11
% 0.81/1.11
% 0.81/1.11 % SZS output start ListOfCNF for /tmp/SPASST_2835_n014.cluster.edu
% 0.81/1.11
% 0.81/1.11 The saturated set of worked-off clauses is :
% 0.81/1.11 122[0:OCE:7.0,30.1] || -> equal(a(U),1) less(1,a(U))*.
% 0.81/1.11 114[0:OCE:9.0,30.1] || -> equal(b(U),1) less(1,b(U))*.
% 0.81/1.11 17[0:Inp] || equal(a(U),10)**+ equal(a(V),10)** -> equal(U,V)*.
% 0.81/1.11 49[0:Res:15.0,17.0] || equal(a(U),10)** -> equal(U,z2).
% 0.81/1.11 66[0:ArS:65.0] || equal(a(z3),10)** -> .
% 0.81/1.11 7[0:Inp] || -> lesseq(1,a(U))*.
% 0.81/1.11 9[0:Inp] || -> lesseq(1,b(U))*.
% 0.81/1.11 8[0:Inp] || -> lesseq(a(U),12)*.
% 0.81/1.11 10[0:Inp] || -> lesseq(b(U),5)*.
% 0.81/1.11 11[0:Inp] || equal(z2,z1)** -> .
% 0.81/1.11 12[0:Inp] || equal(z3,z1)** -> .
% 0.81/1.11 13[0:Inp] || equal(z3,z2)** -> .
% 0.81/1.11 16[0:Inp] || -> less(b(z2),3)*.
% 0.81/1.11 14[0:Inp] || -> equal(a(z1),9)**.
% 0.81/1.11 15[0:Inp] || -> equal(a(z2),10)**.
% 0.81/1.11 6[0:Inp] || -> less(z2,z1)*.
% 0.81/1.11 5[0:Inp] || -> true*.
% 0.81/1.11 31[0:ThA] || -> lesseq(U,V) less(plus(V,W),plus(U,W))*.
% 0.81/1.11 32[0:ThA] || -> lesseq(U,V) less(plus(W,V),plus(W,U))*.
% 0.81/1.11 30[0:ThA] || -> equal(U,V) less(V,U)* less(U,V)*.
% 0.81/1.11 33[0:ThA] || -> lesseq(U,V) less(uminus(U),uminus(V))*.
% 0.81/1.11 19[0:ThA] || -> equal(plus(U,plus(uminus(U),V)),V)**.
% 0.81/1.11 20[0:ThA] || -> equal(plus(uminus(U),plus(U,V)),V)**.
% 0.81/1.11 22[0:ThA] || -> equal(plus(plus(U,V),uminus(V)),U)**.
% 0.81/1.11 21[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**.
% 0.81/1.11 42[0:ThA] || evaleq(U,V)* -> equal(U,V).
% 0.81/1.11 38[0:ThA] || -> equal(times(U,-1),uminus(U))**.
% 0.81/1.11 23[0:ThA] || -> equal(plus(U,uminus(U)),0)**.
% 0.81/1.11 39[0:ThA] || -> equal(times(-1,U),uminus(U))**.
% 0.81/1.11 24[0:ThA] || -> equal(plus(uminus(U),U),0)**.
% 0.81/1.11 28[0:ThA] || -> less(U,plus(U,1))*.
% 0.81/1.11 18[0:ThA] || -> equal(uminus(uminus(U)),U)**.
% 0.81/1.11 29[0:ThA] || -> less(plus(U,-1),U)*.
% 0.81/1.11 25[0:ThA] || -> equal(plus(U,0),U)**.
% 0.81/1.11 36[0:ThA] || -> equal(times(U,1),U)**.
% 0.81/1.11 40[0:ThA] || -> equal(divide_nat(U,1),U)**.
% 0.81/1.11 34[0:ThA] || -> equal(times(U,0),0)**.
% 0.81/1.11 41[0:ThA] || -> equal(remainder(U,1),0)**.
% 0.81/1.11 26[0:ThA] || -> equal(plus(0,U),U)**.
% 0.81/1.11 37[0:ThA] || -> equal(times(1,U),U)**.
% 0.81/1.11 35[0:ThA] || -> equal(times(0,U),0)**.
% 0.81/1.11 47[0:ThA] || -> equal(floor(U),U)**.
% 0.81/1.11 48[0:ThA] || -> equal(ceiling(U),U)**.
% 0.81/1.11 27[0:ThA] || -> lesseq(U,U)*.
% 0.81/1.11 43[0:ThA] || -> evaleq(0,0)*.
% 0.81/1.11 44[0:ThA] || -> evaleq(1,1)*.
% 0.81/1.11 45[0:ThA] || -> isint(U)*.
% 0.81/1.11 46[0:ThA] || -> israt(U)*.
% 0.81/1.11
% 0.81/1.11 % SZS output end ListOfCNF for /tmp/SPASST_2835_n014.cluster.edu
% 0.81/1.11 SPASS+T ended
%------------------------------------------------------------------------------