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

% Result   : Theorem 0.43s 1.07s
% Output   : Refutation 0.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.11  % Problem  : DAT041_1 : TPTP v8.1.0. Released v5.0.0.
% 0.12/0.12  % Command  : spasst-tptp-script %s %d
% 0.13/0.33  % Computer : n006.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Fri Jul  1 18:09:22 EDT 2022
% 0.19/0.33  % CPUTime  : 
% 0.19/0.45  % Using integer theory
% 0.43/1.07  
% 0.43/1.07  
% 0.43/1.07  % SZS status Theorem for /tmp/SPASST_16578_n006.cluster.edu
% 0.43/1.07  
% 0.43/1.07  SPASS V 2.2.22  in combination with yices.
% 0.43/1.07  SPASS beiseite: Proof found by SPASS.
% 0.43/1.07  Problem: /tmp/SPASST_16578_n006.cluster.edu 
% 0.43/1.07  SPASS derived 87 clauses, backtracked 0 clauses and kept 97 clauses.
% 0.43/1.07  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.43/1.07  SPASS allocated 6373 KBytes.
% 0.43/1.07  SPASS spent	0:00:00.03 on the problem.
% 0.43/1.07  		0:00:00.00 for the input.
% 0.43/1.07  		0:00:00.01 for the FLOTTER CNF translation.
% 0.43/1.07  		0:00:00.00 for inferences.
% 0.43/1.07  		0:00:00.00 for the backtracking.
% 0.43/1.07  		0:00:00.01 for the reduction.
% 0.43/1.07  		0:00:00.00 for interacting with the SMT procedure.
% 0.43/1.07  		
% 0.43/1.07  
% 0.43/1.07  % SZS output start CNFRefutation for /tmp/SPASST_16578_n006.cluster.edu
% 0.43/1.07  
% 0.43/1.07  % Here is a proof with depth 3, length 14 :
% 0.43/1.07  2[0:Inp] ||  -> collection(empty)*.
% 0.43/1.07  7[0:Inp] || collection(U) -> collection(add(V,U))*.
% 0.43/1.07  8[0:Inp] || collection(U) -> in(V,add(V,U))*.
% 0.43/1.07  17[0:Inp] || collection(U) greater(plus(count(U),1),count(add(V,U)))* -> .
% 0.43/1.07  20[0:Inp] || collection(U) in(V,U) -> equal(count(add(V,U)),count(U))**.
% 0.43/1.07  38[0:ThA] ||  -> less(U,plus(U,1))*.
% 0.43/1.07  60[0:ArS:17.1] || collection(U) less(count(add(V,U)),plus(count(U),1))* -> .
% 0.43/1.07  61[0:TOC:60.1] || collection(U) -> lesseq(plus(count(U),1),count(add(V,U)))*.
% 0.43/1.07  157[0:SpR:20.2,61.1] || collection(U) in(V,U)* collection(U) -> lesseq(plus(count(U),1),count(U))*.
% 0.43/1.07  167[0:Obv:157.0] || in(U,V)*+ collection(V) -> lesseq(plus(count(V),1),count(V))*.
% 0.43/1.07  195[0:Res:8.1,167.0] || collection(U) collection(add(V,U)) -> lesseq(plus(count(add(V,U)),1),count(add(V,U)))*.
% 0.43/1.07  198[0:MRR:195.1,7.1] || collection(U) -> lesseq(plus(count(add(V,U)),1),count(add(V,U)))*.
% 0.43/1.07  206[0:OCE:198.1,38.0] || collection(U)* -> .
% 0.43/1.07  210(e)[0:UnC:206.0,2.0] ||  -> .
% 0.43/1.07  
% 0.43/1.07  % SZS output end CNFRefutation for /tmp/SPASST_16578_n006.cluster.edu
% 0.43/1.07  
% 0.43/1.07  Formulae used in the proof : fof_count_type fof_remove_type fof_add_type fof_ax5 fof_ax4
% 0.82/1.09  
% 0.82/1.09  SPASS+T ended
%------------------------------------------------------------------------------