TSTP Solution File: ARI711_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI711_1 : TPTP v8.1.0. Released v6.3.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n015.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:43 EDT 2022
% Result : Unknown 0.83s 1.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI711_1 : TPTP v8.1.0. Released v6.3.0.
% 0.03/0.13 % Command : spasst-tptp-script %s %d
% 0.14/0.34 % Computer : n015.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 11:09:57 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.47 % Using integer theory
% 0.83/1.08
% 0.83/1.08
% 0.83/1.08 % SZS status Incomplete for /tmp/SPASST_17739_n015.cluster.edu
% 0.83/1.08
% 0.83/1.08 SPASS V 2.2.22 in combination with yices.
% 0.83/1.08 SPASS beiseite: Unknown (SPASS (with standard axioms): completion, SMT procedure: unknown).
% 0.83/1.08 Problem: /tmp/SPASST_17739_n015.cluster.edu
% 0.83/1.08 SPASS derived 1 clauses, backtracked 0 clauses and kept 34 clauses.
% 0.83/1.08 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.83/1.08 SPASS allocated 7055 KBytes.
% 0.83/1.08 SPASS spent 0:00:00.03 on the problem.
% 0.83/1.08 0:00:00.00 for the input.
% 0.83/1.08 0:00:00.00 for the FLOTTER CNF translation.
% 0.83/1.08 0:00:00.00 for inferences.
% 0.83/1.08 0:00:00.00 for the backtracking.
% 0.83/1.08 0:00:00.00 for the reduction.
% 0.83/1.08 0:00:00.01 for interacting with the SMT procedure.
% 0.83/1.08
% 0.83/1.08
% 0.83/1.08 % SZS output start ListOfCNF for /tmp/SPASST_17739_n015.cluster.edu
% 0.83/1.08
% 0.83/1.08 The saturated set of worked-off clauses is :
% 0.83/1.08 38[0:Rew:27.0,37.0,27.0,37.0,27.0,37.0] || equal(plus(times(times(times(c,c),c),c),uminus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(plus(times(-4,a),-1),times(-6,times(a,a))),times(-4,times(times(a,a),a))),uminus(times(times(times(a,a),a),a))),times(-4,b)),times(-12,times(b,a))),times(-6,times(b,b))),times(-12,times(times(b,a),a))),times(-12,times(times(b,b),a))),times(-4,times(times(b,b),b))),times(-4,times(times(times(b,a),a),a))),times(-6,times(times(times(b,b),a),a))),times(-4,times(times(times(b,b),b),a))),uminus(times(times(times(b,b),b),b))),times(-4,c)),times(-12,times(c,a))),times(-12,times(c,b))),times(-6,times(c,c))),times(-12,times(times(c,a),a))),times(-24,times(times(c,b),a))),times(-12,times(times(c,b),b))),times(-12,times(times(c,c),a))),times(-12,times(times(c,c),b))),times(-4,times(times(c,c),c))),times(-4,times(times(times(c,a),a),a))),times(-12,times(times(times(c,b),a),a))),times(-12,times(times(times(c,b),b),a))),times(-4,times(times(times(c,b),b),b))),times(-6,times(times(times(c,c),a),a))),times(-12,times(times(times(c,c),b),a))),times(-6,times(times(times(c,c),b),b))),times(-4,times(times(times(c,c),c),a))),times(-4,times(times(times(c,c),c),b))))),0)** -> .
% 0.83/1.08 4[0:Inp] || -> equal(times(times(times(plus(plus(plus(a,b),c),1),plus(plus(plus(a,b),c),1)),plus(plus(plus(a,b),c),1)),plus(plus(plus(a,b),c),1)),0)**.
% 0.83/1.08 3[0:Inp] || -> true*.
% 0.83/1.08 19[0:ThA] || -> lesseq(U,V) less(plus(V,W),plus(U,W))*.
% 0.83/1.08 20[0:ThA] || -> lesseq(U,V) less(plus(W,V),plus(W,U))*.
% 0.83/1.08 18[0:ThA] || -> equal(U,V) less(V,U)* less(U,V)*.
% 0.83/1.08 21[0:ThA] || -> lesseq(U,V) less(uminus(U),uminus(V))*.
% 0.83/1.08 7[0:ThA] || -> equal(plus(U,plus(uminus(U),V)),V)**.
% 0.83/1.08 8[0:ThA] || -> equal(plus(uminus(U),plus(U,V)),V)**.
% 0.83/1.08 10[0:ThA] || -> equal(plus(plus(U,V),uminus(V)),U)**.
% 0.83/1.08 9[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**.
% 0.83/1.08 30[0:ThA] || evaleq(U,V)* -> equal(U,V).
% 0.83/1.08 26[0:ThA] || -> equal(times(U,-1),uminus(U))**.
% 0.83/1.08 11[0:ThA] || -> equal(plus(U,uminus(U)),0)**.
% 0.83/1.08 27[0:ThA] || -> equal(times(-1,U),uminus(U))**.
% 0.83/1.08 12[0:ThA] || -> equal(plus(uminus(U),U),0)**.
% 0.83/1.08 16[0:ThA] || -> less(U,plus(U,1))*.
% 0.83/1.08 6[0:ThA] || -> equal(uminus(uminus(U)),U)**.
% 0.83/1.08 17[0:ThA] || -> less(plus(U,-1),U)*.
% 0.83/1.08 13[0:ThA] || -> equal(plus(U,0),U)**.
% 0.83/1.08 24[0:ThA] || -> equal(times(U,1),U)**.
% 0.83/1.08 28[0:ThA] || -> equal(divide_nat(U,1),U)**.
% 0.83/1.08 22[0:ThA] || -> equal(times(U,0),0)**.
% 0.83/1.08 29[0:ThA] || -> equal(remainder(U,1),0)**.
% 0.83/1.08 14[0:ThA] || -> equal(plus(0,U),U)**.
% 0.83/1.08 25[0:ThA] || -> equal(times(1,U),U)**.
% 0.83/1.08 23[0:ThA] || -> equal(times(0,U),0)**.
% 0.83/1.08 35[0:ThA] || -> equal(floor(U),U)**.
% 0.83/1.08 36[0:ThA] || -> equal(ceiling(U),U)**.
% 0.83/1.08 15[0:ThA] || -> lesseq(U,U)*.
% 0.83/1.08 31[0:ThA] || -> evaleq(0,0)*.
% 0.83/1.08 32[0:ThA] || -> evaleq(1,1)*.
% 0.83/1.08 33[0:ThA] || -> isint(U)*.
% 0.83/1.08 34[0:ThA] || -> israt(U)*.
% 0.83/1.08
% 0.83/1.08 % SZS output end ListOfCNF for /tmp/SPASST_17739_n015.cluster.edu
% 0.83/1.08 SPASS+T ended
%------------------------------------------------------------------------------