TSTP Solution File: DAT031_1 by SPASS+T---2.2.22

View Problem - Process Solution

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

% Computer : n011.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:51 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : DAT031_1 : TPTP v8.1.0. Released v5.0.0.
% 0.11/0.12  % Command  : spasst-tptp-script %s %d
% 0.12/0.33  % Computer : n011.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 17:31:04 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.46  % Using integer theory
% 0.75/1.02  
% 0.75/1.02  
% 0.75/1.02  % SZS status Theorem for /tmp/SPASST_32664_n011.cluster.edu
% 0.75/1.02  
% 0.75/1.02  SPASS V 2.2.22  in combination with yices.
% 0.75/1.02  SPASS beiseite: Proof found by SPASS.
% 0.75/1.02  Problem: /tmp/SPASST_32664_n011.cluster.edu 
% 0.75/1.02  SPASS derived 20 clauses, backtracked 0 clauses and kept 52 clauses.
% 0.75/1.02  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.75/1.02  SPASS allocated 6257 KBytes.
% 0.75/1.02  SPASS spent	0:00:00.02 on the problem.
% 0.75/1.02  		0:00:00.00 for the input.
% 0.75/1.02  		0:00:00.00 for the FLOTTER CNF translation.
% 0.75/1.02  		0:00:00.00 for inferences.
% 0.75/1.02  		0:00:00.00 for the backtracking.
% 0.75/1.02  		0:00:00.00 for the reduction.
% 0.75/1.02  		0:00:00.00 for interacting with the SMT procedure.
% 0.75/1.02  		
% 0.75/1.02  
% 0.75/1.02  % SZS output start CNFRefutation for /tmp/SPASST_32664_n011.cluster.edu
% 0.75/1.02  
% 0.75/1.02  % Here is a proof with depth 3, length 12 :
% 0.75/1.02  1[0:Inp] ||  -> collection(empty)*.
% 0.75/1.02  5[0:Inp] || collection(U) -> collection(add(V,U))*.
% 0.75/1.02  6[0:Inp] || collection(U) -> in(V,add(V,U))*.
% 0.75/1.02  10[0:Inp] || collection(U) in(V,U) -> in(V,add(W,U))*.
% 0.75/1.02  15[0:Inp] || in(U,add(10,add(30,add(50,empty))))* lesseq(U,40) lesseq(20,U) -> .
% 0.75/1.02  47[0:TOC:15.2] || in(U,add(10,add(30,add(50,empty))))* -> less(U,20) less(40,U).
% 0.75/1.02  67[0:Res:10.2,47.0] || collection(add(30,add(50,empty))) in(U,add(30,add(50,empty)))* -> less(U,20) less(40,U).
% 0.75/1.02  81[0:Res:6.1,67.1] || collection(add(50,empty)) collection(add(30,add(50,empty)))* -> less(30,20) less(40,30).
% 0.75/1.02  84[0:ArS:81.3] || collection(add(50,empty)) collection(add(30,add(50,empty)))* -> .
% 0.75/1.02  85[0:MRR:84.1,5.1] || collection(add(50,empty))* -> .
% 0.75/1.02  86[0:Res:5.1,85.0] || collection(empty)* -> .
% 0.75/1.02  87(e)[0:MRR:86.0,1.0] ||  -> .
% 0.75/1.02  
% 0.75/1.02  % SZS output end CNFRefutation for /tmp/SPASST_32664_n011.cluster.edu
% 0.75/1.02  
% 0.75/1.02  Formulae used in the proof : fof_remove_type fof_add_type fof_ax5 fof_ax4
% 0.75/1.04  
% 0.75/1.04  SPASS+T ended
%------------------------------------------------------------------------------