%------------------------------------------------------------------------------
% File     : SPASS+T---2.2.22
% Problem  : DAT011_1 : TPTP v8.1.0. Released v5.0.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 : Sat Jul 16 01:31:45 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : DAT011_1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/0.12  % Command  : spasst-tptp-script %s %d
% 0.12/0.33  % Computer : n014.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 Jul  1 18:25:40 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.46  % Using integer theory
% 0.70/1.02  
% 0.70/1.02  
% 0.70/1.02  % SZS status Theorem for /tmp/SPASST_7691_n014.cluster.edu
% 0.70/1.02  
% 0.70/1.02  SPASS V 2.2.22  in combination with yices.
% 0.70/1.02  SPASS beiseite: Proof found by SPASS and SMT.
% 0.70/1.02  Problem: /tmp/SPASST_7691_n014.cluster.edu 
% 0.70/1.02  SPASS derived 155 clauses, backtracked 7 clauses and kept 114 clauses.
% 0.70/1.02  SPASS backtracked 3 times (1 times due to theory inconsistency).
% 0.70/1.02  SPASS allocated 6359 KBytes.
% 0.70/1.02  SPASS spent	0:00:00.02 on the problem.
% 0.70/1.02  		0:00:00.00 for the input.
% 0.70/1.02  		0:00:00.00 for the FLOTTER CNF translation.
% 0.70/1.02  		0:00:00.00 for inferences.
% 0.70/1.02  		0:00:00.00 for the backtracking.
% 0.70/1.02  		0:00:00.01 for the reduction.
% 0.70/1.02  		0:00:00.00 for interacting with the SMT procedure.
% 0.70/1.02  		
% 0.70/1.02  
% 0.70/1.02  % SZS output start CNFRefutation for /tmp/SPASST_7691_n014.cluster.edu
% 0.70/1.02  
% 0.70/1.02  % Here is a proof with depth 0, length 8 :
% 0.70/1.02  3[0:Inp] ||  -> array(skc5)*.
% 0.70/1.02  4[0:Inp] ||  -> lesseq(skc7,skc8)*.
% 0.70/1.02  5[0:Inp] ||  -> lesseq(skc8,plus(skc6,1))*.
% 0.70/1.02  8[0:Inp] || array(U) -> equal(read(write(U,V,W),V),W)**.
% 0.70/1.02  9[0:Inp] || greater(read(write(skc5,plus(skc6,1),3),skc8),0)* -> .
% 0.70/1.02  10[0:Inp] || lesseq(U,skc6) lesseq(skc7,U) -> greater(read(skc5,U),0)*.
% 0.70/1.02  11[0:Inp] || array(U) -> equal(V,W) equal(read(write(U,V,X),W),read(U,W))**.
% 0.70/1.02  261(e)[0:ThR:11,10,9,8,5,4,3] ||  -> .
% 0.70/1.02  
% 0.70/1.02  % SZS output end CNFRefutation for /tmp/SPASST_7691_n014.cluster.edu
% 0.70/1.02  
% 0.70/1.02  Formulae used in the proof : fof_array_type fof_co1 fof_write_type fof_ax1
% 0.70/1.02  
% 0.70/1.02  SPASS+T ended
%------------------------------------------------------------------------------