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

% Computer : n020.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:32:11 EDT 2022

% Result   : Theorem 0.75s 1.03s
% Output   : Refutation 0.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : DAT092_1 : TPTP v8.1.0. Released v6.1.0.
% 0.03/0.12  % Command  : spasst-tptp-script %s %d
% 0.13/0.33  % Computer : n020.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 20:50:00 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.18/0.46  % Using integer theory
% 0.75/1.03  
% 0.75/1.03  
% 0.75/1.03  % SZS status Theorem for /tmp/SPASST_13533_n020.cluster.edu
% 0.75/1.03  
% 0.75/1.03  SPASS V 2.2.22  in combination with yices.
% 0.75/1.03  SPASS beiseite: Proof found by SPASS.
% 0.75/1.03  Problem: /tmp/SPASST_13533_n020.cluster.edu 
% 0.75/1.03  SPASS derived 20 clauses, backtracked 0 clauses and kept 74 clauses.
% 0.75/1.03  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.75/1.03  SPASS allocated 6491 KBytes.
% 0.75/1.03  SPASS spent	0:00:00.02 on the problem.
% 0.75/1.03  		0:00:00.00 for the input.
% 0.75/1.03  		0:00:00.01 for the FLOTTER CNF translation.
% 0.75/1.03  		0:00:00.00 for inferences.
% 0.75/1.03  		0:00:00.00 for the backtracking.
% 0.75/1.03  		0:00:00.00 for the reduction.
% 0.75/1.03  		0:00:00.00 for interacting with the SMT procedure.
% 0.75/1.03  		
% 0.75/1.03  
% 0.75/1.03  % SZS output start CNFRefutation for /tmp/SPASST_13533_n020.cluster.edu
% 0.75/1.03  
% 0.75/1.03  % Here is a proof with depth 2, length 16 :
% 0.75/1.03  4[0:Inp] ||  -> list(nil)*.
% 0.75/1.03  6[0:Inp] ||  -> equal(length(nil),0)**.
% 0.75/1.03  7[0:Inp] ||  -> list(skf6(U,V))*.
% 0.75/1.03  13[0:Inp] || list(U) -> list(cons(V,U))*.
% 0.75/1.03  14[0:Inp] || list(U) -> equal(append(nil,U),U)**.
% 0.75/1.03  22[0:Inp] || list(U) -> equal(length(cons(V,U)),plus(1,length(U)))**.
% 0.75/1.03  24[0:Inp] || list(U) list(V) -> equal(length(append(V,U)),length(V))**.
% 0.75/1.03  67[0:ArS:22.1] || list(U) -> equal(length(cons(V,U)),plus(length(U),1))**.
% 0.75/1.03  77[0:Res:4.0,24.1] || list(U) -> equal(length(append(nil,U)),length(nil))**.
% 0.75/1.03  80[0:Rew:14.1,77.1,6.0,77.1] || list(U) -> equal(length(U),0)**.
% 0.75/1.03  82[0:Rew:80.1,67.1] || list(U) -> equal(length(cons(V,U)),plus(0,1))**.
% 0.75/1.03  85[0:ArS:82.1] || list(U) -> equal(length(cons(V,U)),1)**.
% 0.75/1.03  102[0:SpR:85.1,80.1] || list(U) list(cons(V,U))* -> equal(1,0).
% 0.75/1.03  105[0:ArS:102.2] || list(U) list(cons(V,U))* -> .
% 0.75/1.03  106[0:MRR:105.1,13.1] || list(U)* -> .
% 0.75/1.03  107(e)[0:UnC:106.0,7.0] ||  -> .
% 0.75/1.03  
% 0.75/1.03  % SZS output end CNFRefutation for /tmp/SPASST_13533_n020.cluster.edu
% 0.75/1.03  
% 0.75/1.03  Formulae used in the proof : fof_head_type fof_list_type fof_l fof_tail_type fof_cons_type fof_a_8 fof_l3
% 0.75/1.05  
% 0.75/1.06  SPASS+T ended
%------------------------------------------------------------------------------