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

% Computer : n013.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:08 EDT 2022

% Result   : Theorem 0.44s 1.02s
% Output   : Refutation 0.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : ARI574_1 : TPTP v8.1.0. Released v5.1.0.
% 0.11/0.13  % Command  : spasst-tptp-script %s %d
% 0.13/0.34  % Computer : n013.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Fri Jun 17 13:06:29 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  % Using integer theory
% 0.44/1.02  
% 0.44/1.02  
% 0.44/1.02  % SZS status Theorem for /tmp/SPASST_12119_n013.cluster.edu
% 0.44/1.02  
% 0.44/1.02  SPASS V 2.2.22  in combination with yices.
% 0.44/1.02  SPASS beiseite: Proof found by SPASS and SMT.
% 0.44/1.02  Problem: /tmp/SPASST_12119_n013.cluster.edu 
% 0.44/1.02  SPASS derived 9 clauses, backtracked 6 clauses and kept 48 clauses.
% 0.44/1.02  SPASS backtracked 2 times (1 times due to theory inconsistency).
% 0.44/1.02  SPASS allocated 6228 KBytes.
% 0.44/1.02  SPASS spent	0:00:00.01 on the problem.
% 0.44/1.02  		0:00:00.00 for the input.
% 0.44/1.02  		0:00:00.00 for the FLOTTER CNF translation.
% 0.44/1.02  		0:00:00.00 for inferences.
% 0.44/1.02  		0:00:00.00 for the backtracking.
% 0.44/1.02  		0:00:00.00 for the reduction.
% 0.44/1.02  		0:00:00.00 for interacting with the SMT procedure.
% 0.44/1.02  		
% 0.44/1.02  
% 0.44/1.02  % SZS output start CNFRefutation for /tmp/SPASST_12119_n013.cluster.edu
% 0.44/1.02  
% 0.44/1.02  % Here is a proof with depth 0, length 7 :
% 0.44/1.02  1[0:Inp] ||  -> lesseq(skc3,4)* equal(skc3,4).
% 0.44/1.02  3(e)[0:Inp] ||  -> equal(skc3,4) lesseq(7,plus(skc2,skc3))*.
% 0.44/1.02  4[0:Inp] ||  -> equal(skc2,3) lesseq(7,plus(skc2,skc3))*.
% 0.44/1.02  5(e)[0:Inp] ||  -> equal(skc3,4) lesseq(plus(skc2,5),times(2,skc3))*.
% 0.44/1.02  6[0:Inp] ||  -> equal(skc2,3) lesseq(plus(skc2,5),times(2,skc3))*.
% 0.44/1.02  7[0:Inp] || equal(skc3,4) equal(skc2,3) lesseq(skc3,4) lesseq(plus(skc2,5),times(2,skc3))* lesseq(7,plus(skc2,skc3)) -> .
% 0.44/1.02  64(e)[0:ThR:7,6,5,4,3,1] ||  -> .
% 0.44/1.02  
% 0.44/1.02  % SZS output end CNFRefutation for /tmp/SPASST_12119_n013.cluster.edu
% 0.44/1.02  
% 0.44/1.02  Formulae used in the proof : fof_ineq_sys_has_1_sol
% 0.44/1.02  
% 0.44/1.02  SPASS+T ended
%------------------------------------------------------------------------------