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

% Computer : n021.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:14 EDT 2022

% Result   : Theorem 0.74s 1.05s
% Output   : Refutation 0.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : ARI594_1 : TPTP v8.1.0. Released v5.1.0.
% 0.11/0.12  % Command  : spasst-tptp-script %s %d
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jun 17 13:21:01 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.47  % Using integer theory
% 0.74/1.05  
% 0.74/1.05  
% 0.74/1.05  % SZS status Theorem for /tmp/SPASST_32353_n021.cluster.edu
% 0.74/1.05  
% 0.74/1.05  SPASS V 2.2.22  in combination with yices.
% 0.74/1.05  SPASS beiseite: Proof found by SPASS.
% 0.74/1.05  Problem: /tmp/SPASST_32353_n021.cluster.edu 
% 0.74/1.05  SPASS derived 18 clauses, backtracked 0 clauses and kept 42 clauses.
% 0.74/1.05  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.74/1.05  SPASS allocated 6227 KBytes.
% 0.74/1.05  SPASS spent	0:00:00.05 on the problem.
% 0.74/1.05  		0:00:00.00 for the input.
% 0.74/1.05  		0:00:00.00 for the FLOTTER CNF translation.
% 0.74/1.05  		0:00:00.00 for inferences.
% 0.74/1.05  		0:00:00.00 for the backtracking.
% 0.74/1.05  		0:00:00.00 for the reduction.
% 0.74/1.05  		0:00:00.04 for interacting with the SMT procedure.
% 0.74/1.05  		
% 0.74/1.05  
% 0.74/1.05  % SZS output start CNFRefutation for /tmp/SPASST_32353_n021.cluster.edu
% 0.74/1.05  
% 0.74/1.05  % Here is a proof with depth 1, length 7 :
% 0.74/1.05  1[0:Inp] || p(U)* equal(U,times(3,V))*+ -> .
% 0.74/1.05  2[0:Inp] || lesseq(U,7)* lesseq(5,U) -> p(U).
% 0.74/1.05  14[0:ThA] ||  -> less(plus(U,-1),U)*.
% 0.74/1.05  34[0:TOC:2.1] ||  -> p(U) less(U,5) less(7,U)*.
% 0.74/1.05  35[0:OCE:34.2,14.0] ||  -> p(plus(7,-1)) less(plus(7,-1),5)*.
% 0.74/1.05  41[0:ArS:35.1] ||  -> p(6)*.
% 0.74/1.05  65[0:ThR:41,1] ||  -> .
% 0.74/1.05  
% 0.74/1.05  % SZS output end CNFRefutation for /tmp/SPASST_32353_n021.cluster.edu
% 0.74/1.05  
% 0.74/1.05  Formulae used in the proof : fof_exists_X_in_5_to_7_div_3
% 0.74/1.05  
% 0.74/1.05  SPASS+T ended
%------------------------------------------------------------------------------