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

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

% Result   : Theorem 0.42s 1.04s
% Output   : Refutation 0.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : DAT082_1 : TPTP v8.1.0. Released v6.1.0.
% 0.00/0.12  % Command  : spasst-tptp-script %s %d
% 0.12/0.33  % Computer : n024.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 21:02:00 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.17/0.45  % Using integer theory
% 0.42/1.04  
% 0.42/1.04  
% 0.42/1.04  % SZS status Theorem for /tmp/SPASST_25122_n024.cluster.edu
% 0.42/1.04  
% 0.42/1.04  SPASS V 2.2.22  in combination with yices.
% 0.42/1.04  SPASS beiseite: Proof found by SPASS.
% 0.42/1.04  Problem: /tmp/SPASST_25122_n024.cluster.edu 
% 0.42/1.04  SPASS derived 16 clauses, backtracked 0 clauses and kept 68 clauses.
% 0.42/1.04  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.42/1.04  SPASS allocated 6491 KBytes.
% 0.42/1.04  SPASS spent	0:00:00.02 on the problem.
% 0.42/1.04  		0:00:00.00 for the input.
% 0.42/1.04  		0:00:00.01 for the FLOTTER CNF translation.
% 0.42/1.04  		0:00:00.00 for inferences.
% 0.42/1.04  		0:00:00.00 for the backtracking.
% 0.42/1.04  		0:00:00.00 for the reduction.
% 0.42/1.04  		0:00:00.00 for interacting with the SMT procedure.
% 0.42/1.04  		
% 0.42/1.04  
% 0.42/1.04  % SZS output start CNFRefutation for /tmp/SPASST_25122_n024.cluster.edu
% 0.42/1.04  
% 0.42/1.04  % Here is a proof with depth 3, length 15 :
% 0.42/1.04  4[0:Inp] ||  -> list(nil)*.
% 0.42/1.04  6[0:Inp] ||  -> equal(length(nil),0)**.
% 0.42/1.04  13[0:Inp] || list(U) -> list(cons(V,U))*.
% 0.42/1.04  18[0:Inp] || equal(length(cons(1,cons(2,nil))),2)** -> .
% 0.42/1.04  23[0:Inp] || list(U) -> equal(length(cons(V,U)),plus(1,length(U)))**.
% 0.42/1.04  67[0:ArS:23.1] || list(U) -> equal(length(cons(V,U)),plus(length(U),1))**.
% 0.42/1.04  92[0:SpL:67.1,18.0] || list(cons(2,nil)) equal(plus(length(cons(2,nil)),1),2)** -> .
% 0.42/1.04  93[0:ArS:92.1] || list(cons(2,nil)) equal(length(cons(2,nil)),1)** -> .
% 0.42/1.04  94[0:SpL:67.1,93.1] || list(nil) list(cons(2,nil))* equal(plus(length(nil),1),1) -> .
% 0.42/1.04  95[0:ArS:94.2] || list(nil) list(cons(2,nil))* equal(length(nil),0) -> .
% 0.42/1.04  96[0:Rew:6.0,95.2] || list(nil) list(cons(2,nil))* equal(0,0) -> .
% 0.42/1.04  97[0:ArS:96.2] || list(nil) list(cons(2,nil))* -> .
% 0.42/1.04  98[0:MRR:97.0,4.0] || list(cons(2,nil))* -> .
% 0.42/1.04  99[0:Res:13.1,98.0] || list(nil)* -> .
% 0.42/1.04  100(e)[0:MRR:99.0,4.0] ||  -> .
% 0.42/1.04  
% 0.42/1.04  % SZS output end CNFRefutation for /tmp/SPASST_25122_n024.cluster.edu
% 0.42/1.04  
% 0.42/1.04  Formulae used in the proof : fof_head_type fof_list_type fof_tail_type fof_l1 fof_a_8
% 0.42/1.06  
% 0.42/1.06  SPASS+T ended
%------------------------------------------------------------------------------