TSTP Solution File: ARI679_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI679_1 : TPTP v8.1.0. Released v6.3.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 : Thu Jul 14 22:18:36 EDT 2022
% Result : Unknown 0.75s 1.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI679_1 : TPTP v8.1.0. Released v6.3.0.
% 0.03/0.13 % Command : spasst-tptp-script %s %d
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 14:38:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.47 % Using integer theory
% 0.75/1.02
% 0.75/1.02
% 0.75/1.02 % SZS status Incomplete for /tmp/SPASST_10009_n014.cluster.edu
% 0.75/1.02
% 0.75/1.02 SPASS V 2.2.22 in combination with yices.
% 0.75/1.02 SPASS beiseite: Unknown (SPASS (with standard axioms): completion, SMT procedure: unknown).
% 0.75/1.02 Problem: /tmp/SPASST_10009_n014.cluster.edu
% 0.75/1.02 SPASS derived 54 clauses, backtracked 23 clauses and kept 73 clauses.
% 0.75/1.02 SPASS backtracked 4 times (0 times due to theory inconsistency).
% 0.75/1.02 SPASS allocated 6269 KBytes.
% 0.75/1.02 SPASS spent 0:00:00.02 on the problem.
% 0.75/1.02 0:00:00.00 for the input.
% 0.75/1.02 0:00:00.00 for the FLOTTER CNF translation.
% 0.75/1.02 0:00:00.00 for inferences.
% 0.75/1.02 0:00:00.00 for the backtracking.
% 0.75/1.02 0:00:00.00 for the reduction.
% 0.75/1.02 0:00:00.01 for interacting with the SMT procedure.
% 0.75/1.02
% 0.75/1.02
% 0.75/1.02 % SZS output start ListOfCNF for /tmp/SPASST_10009_n014.cluster.edu
% 0.75/1.02
% 0.75/1.02 The saturated set of worked-off clauses is :
% 0.75/1.02 119[6:Spt:52.0] || -> equal(times(c,plus(d,-3)),times(2,plus(d,-3)))**.
% 0.75/1.02 41[1:Spt:40.0] || -> less(times(c,d),6)*.
% 0.75/1.02 111[5:Spt:105.0,67.0,94.0] || equal(c,2)** -> .
% 0.75/1.02 90[4:Spt:85.0,56.0,58.0] || equal(d,3)** -> .
% 0.75/1.02 3[0:Inp] || -> lesseq(2,c)*.
% 0.75/1.02 112[5:Spt:105.0,67.1] || -> less(2,c)*.
% 0.75/1.02 4[0:Inp] || -> lesseq(3,d)*.
% 0.75/1.02 91[4:Spt:85.0,56.1] || -> less(3,d)*.
% 0.75/1.02 2[0:Inp] || -> true*.
% 0.75/1.02 20[0:ThA] || -> lesseq(U,V) less(plus(V,W),plus(U,W))*.
% 0.75/1.02 21[0:ThA] || -> lesseq(U,V) less(plus(W,V),plus(W,U))*.
% 0.75/1.02 19[0:ThA] || -> equal(U,V) less(V,U)* less(U,V)*.
% 0.75/1.02 22[0:ThA] || -> lesseq(U,V) less(uminus(U),uminus(V))*.
% 0.75/1.02 8[0:ThA] || -> equal(plus(U,plus(uminus(U),V)),V)**.
% 0.75/1.02 9[0:ThA] || -> equal(plus(uminus(U),plus(U,V)),V)**.
% 0.75/1.02 11[0:ThA] || -> equal(plus(plus(U,V),uminus(V)),U)**.
% 0.75/1.02 10[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**.
% 0.75/1.02 31[0:ThA] || evaleq(U,V)* -> equal(U,V).
% 0.75/1.02 27[0:ThA] || -> equal(times(U,-1),uminus(U))**.
% 0.75/1.02 12[0:ThA] || -> equal(plus(U,uminus(U)),0)**.
% 0.75/1.02 28[0:ThA] || -> equal(times(-1,U),uminus(U))**.
% 0.75/1.02 13[0:ThA] || -> equal(plus(uminus(U),U),0)**.
% 0.75/1.02 17[0:ThA] || -> less(U,plus(U,1))*.
% 0.75/1.02 7[0:ThA] || -> equal(uminus(uminus(U)),U)**.
% 0.75/1.02 18[0:ThA] || -> less(plus(U,-1),U)*.
% 0.75/1.02 14[0:ThA] || -> equal(plus(U,0),U)**.
% 0.75/1.02 25[0:ThA] || -> equal(times(U,1),U)**.
% 0.75/1.02 29[0:ThA] || -> equal(divide_nat(U,1),U)**.
% 0.75/1.02 23[0:ThA] || -> equal(times(U,0),0)**.
% 0.75/1.02 30[0:ThA] || -> equal(remainder(U,1),0)**.
% 0.75/1.02 15[0:ThA] || -> equal(plus(0,U),U)**.
% 0.75/1.02 26[0:ThA] || -> equal(times(1,U),U)**.
% 0.75/1.02 24[0:ThA] || -> equal(times(0,U),0)**.
% 0.75/1.02 36[0:ThA] || -> equal(floor(U),U)**.
% 0.75/1.02 37[0:ThA] || -> equal(ceiling(U),U)**.
% 0.75/1.02 16[0:ThA] || -> lesseq(U,U)*.
% 0.75/1.02 32[0:ThA] || -> evaleq(0,0)*.
% 0.75/1.02 33[0:ThA] || -> evaleq(1,1)*.
% 0.75/1.02 34[0:ThA] || -> isint(U)*.
% 0.75/1.02 35[0:ThA] || -> israt(U)*.
% 0.75/1.02
% 0.75/1.02 % SZS output end ListOfCNF for /tmp/SPASST_10009_n014.cluster.edu
% 0.75/1.02 SPASS+T ended
%------------------------------------------------------------------------------