TSTP Solution File: ARI686_1 by SPASS+T---2.2.22

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS+T---2.2.22
% Problem  : ARI686_1 : TPTP v8.1.0. Released v6.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : spasst-tptp-script %s %d

% Computer : n006.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:37 EDT 2022

% Result   : Unknown 0.75s 1.05s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ARI686_1 : TPTP v8.1.0. Released v6.3.0.
% 0.07/0.12  % Command  : spasst-tptp-script %s %d
% 0.12/0.34  % Computer : n006.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 12:04:26 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  % Using integer theory
% 0.75/1.05  
% 0.75/1.05  
% 0.75/1.05  % SZS status Incomplete for /tmp/SPASST_15721_n006.cluster.edu
% 0.75/1.05  
% 0.75/1.05  SPASS V 2.2.22  in combination with yices.
% 0.75/1.05  SPASS beiseite: Unknown (SPASS (with standard axioms): completion, SMT procedure: unknown).
% 0.75/1.05  Problem: /tmp/SPASST_15721_n006.cluster.edu 
% 0.75/1.05  SPASS derived 2 clauses, backtracked 0 clauses and kept 35 clauses.
% 0.75/1.05  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.75/1.05  SPASS allocated 6331 KBytes.
% 0.75/1.05  SPASS spent	0:00:00.04 on the problem.
% 0.75/1.05  		0:00:00.00 for the input.
% 0.75/1.05  		0:00:00.00 for the FLOTTER CNF translation.
% 0.75/1.05  		0:00:00.00 for inferences.
% 0.75/1.05  		0:00:00.00 for the backtracking.
% 0.75/1.05  		0:00:00.00 for the reduction.
% 0.75/1.05  		0:00:00.03 for interacting with the SMT procedure.
% 0.75/1.05  		
% 0.75/1.05  
% 0.75/1.05  % SZS output start ListOfCNF for /tmp/SPASST_15721_n006.cluster.edu
% 0.75/1.05  
% 0.75/1.05  The saturated set of worked-off clauses is :
% 0.75/1.05  38[0:Rew:26.0,4.0,26.0,4.0] || equal(plus(times(2,times(times(times(times(times(times(times(a,a),a),a),a),a),a),a)),uminus(plus(plus(plus(plus(plus(times(612,a),uminus(times(a,a))),times(-2,times(times(a,a),a))),times(2,times(times(times(times(a,a),a),a),a))),times(-2,times(times(times(times(times(a,a),a),a),a),a))),times(-2,times(times(times(times(times(times(a,a),a),a),a),a),a))))),0)** -> .
% 0.75/1.05  37[0:Rew:26.0,36.0,26.0,36.0,26.0,36.0,26.0,36.0] ||  -> equal(times(a,plus(a,uminus(times(times(2,a),plus(a,times(times(3,a),plus(a,uminus(times(times(4,a),plus(a,times(times(5,a),plus(a,uminus(times(times(6,a),plus(a,times(times(7,a),plus(a,uminus(times(times(8,a),plus(a,9)))))))))))))))))))),0)**.
% 0.75/1.05  2[0:Inp] ||  -> equal(times(times(5,a),a),times(2,a))**.
% 0.75/1.05  1[0:Inp] ||  -> true*.
% 0.75/1.05  18[0:ThA] ||  -> lesseq(U,V) less(plus(V,W),plus(U,W))*.
% 0.75/1.05  19[0:ThA] ||  -> lesseq(U,V) less(plus(W,V),plus(W,U))*.
% 0.75/1.05  17[0:ThA] ||  -> equal(U,V) less(V,U)* less(U,V)*.
% 0.75/1.05  20[0:ThA] ||  -> lesseq(U,V) less(uminus(U),uminus(V))*.
% 0.75/1.05  6[0:ThA] ||  -> equal(plus(U,plus(uminus(U),V)),V)**.
% 0.75/1.05  7[0:ThA] ||  -> equal(plus(uminus(U),plus(U,V)),V)**.
% 0.75/1.05  9[0:ThA] ||  -> equal(plus(plus(U,V),uminus(V)),U)**.
% 0.75/1.05  8[0:ThA] ||  -> equal(plus(plus(U,uminus(V)),V),U)**.
% 0.75/1.05  29[0:ThA] || evaleq(U,V)* -> equal(U,V).
% 0.75/1.05  25[0:ThA] ||  -> equal(times(U,-1),uminus(U))**.
% 0.75/1.05  10[0:ThA] ||  -> equal(plus(U,uminus(U)),0)**.
% 0.75/1.05  26[0:ThA] ||  -> equal(times(-1,U),uminus(U))**.
% 0.75/1.05  11[0:ThA] ||  -> equal(plus(uminus(U),U),0)**.
% 0.75/1.05  15[0:ThA] ||  -> less(U,plus(U,1))*.
% 0.75/1.05  5[0:ThA] ||  -> equal(uminus(uminus(U)),U)**.
% 0.75/1.05  16[0:ThA] ||  -> less(plus(U,-1),U)*.
% 0.75/1.05  12[0:ThA] ||  -> equal(plus(U,0),U)**.
% 0.75/1.05  23[0:ThA] ||  -> equal(times(U,1),U)**.
% 0.75/1.05  27[0:ThA] ||  -> equal(divide_nat(U,1),U)**.
% 0.75/1.05  21[0:ThA] ||  -> equal(times(U,0),0)**.
% 0.75/1.05  28[0:ThA] ||  -> equal(remainder(U,1),0)**.
% 0.75/1.05  13[0:ThA] ||  -> equal(plus(0,U),U)**.
% 0.75/1.05  24[0:ThA] ||  -> equal(times(1,U),U)**.
% 0.75/1.05  22[0:ThA] ||  -> equal(times(0,U),0)**.
% 0.75/1.05  34[0:ThA] ||  -> equal(floor(U),U)**.
% 0.75/1.05  35[0:ThA] ||  -> equal(ceiling(U),U)**.
% 0.75/1.05  14[0:ThA] ||  -> lesseq(U,U)*.
% 0.75/1.05  30[0:ThA] ||  -> evaleq(0,0)*.
% 0.75/1.05  31[0:ThA] ||  -> evaleq(1,1)*.
% 0.75/1.05  32[0:ThA] ||  -> isint(U)*.
% 0.75/1.05  33[0:ThA] ||  -> israt(U)*.
% 0.75/1.05  
% 0.75/1.05  % SZS output end ListOfCNF for /tmp/SPASST_15721_n006.cluster.edu
% 0.75/1.05  SPASS+T ended
%------------------------------------------------------------------------------