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

View Problem - Process Solution

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

% Computer : n017.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:06 EDT 2022

% Result   : Theorem 0.44s 1.06s
% Output   : Refutation 0.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : DAT076_1 : TPTP v8.1.0. Released v6.1.0.
% 0.10/0.13  % Command  : spasst-tptp-script %s %d
% 0.12/0.33  % Computer : n017.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:24:24 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  % Using integer theory
% 0.44/1.06  
% 0.44/1.06  
% 0.44/1.06  % SZS status Theorem for /tmp/SPASST_3616_n017.cluster.edu
% 0.44/1.06  
% 0.44/1.06  SPASS V 2.2.22  in combination with yices.
% 0.44/1.06  SPASS beiseite: Proof found by SPASS.
% 0.44/1.06  Problem: /tmp/SPASST_3616_n017.cluster.edu 
% 0.44/1.06  SPASS derived 30 clauses, backtracked 0 clauses and kept 80 clauses.
% 0.44/1.06  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.44/1.06  SPASS allocated 6390 KBytes.
% 0.44/1.06  SPASS spent	0:00:00.03 on the problem.
% 0.44/1.06  		0:00:00.00 for the input.
% 0.44/1.06  		0:00:00.01 for the FLOTTER CNF translation.
% 0.44/1.06  		0:00:00.00 for inferences.
% 0.44/1.06  		0:00:00.00 for the backtracking.
% 0.44/1.06  		0:00:00.01 for the reduction.
% 0.44/1.06  		0:00:00.00 for interacting with the SMT procedure.
% 0.44/1.06  		
% 0.44/1.06  
% 0.44/1.06  % SZS output start CNFRefutation for /tmp/SPASST_3616_n017.cluster.edu
% 0.44/1.06  
% 0.44/1.06  % Here is a proof with depth 4, length 12 :
% 0.44/1.06  3[0:Inp] ||  -> array(skc1)*.
% 0.44/1.06  7[0:Inp] ||  -> lesseq(0,skf11(U,V))*.
% 0.44/1.06  12[0:Inp] || array(U) -> array(rev(U,V))*.
% 0.44/1.06  16[0:Inp] || array(U) -> sorted(U,V) less(skf11(U,V),V)*.
% 0.44/1.06  20(e)[0:Inp] || array(U) sorted(U,V) sorted(rev(U,V),V)* -> .
% 0.44/1.06  94[0:Res:3.0,20.0] || sorted(skc1,U) sorted(rev(skc1,U),U)* -> .
% 0.44/1.06  122[0:OCE:16.2,7.0] || array(U) -> sorted(U,0)*.
% 0.44/1.06  125[0:Res:122.1,94.1] || array(rev(skc1,0))* sorted(skc1,0) -> .
% 0.44/1.06  127[0:Res:12.1,125.0] || array(skc1) sorted(skc1,0)* -> .
% 0.44/1.06  128[0:MRR:127.0,3.0] || sorted(skc1,0)* -> .
% 0.44/1.06  129[0:Res:122.1,128.0] || array(skc1)* -> .
% 0.44/1.06  130(e)[0:MRR:129.0,3.0] ||  -> .
% 0.44/1.06  
% 0.44/1.06  % SZS output end CNFRefutation for /tmp/SPASST_3616_n017.cluster.edu
% 0.44/1.06  
% 0.44/1.06  Formulae used in the proof : fof_read_type fof_distinct fof_ax3 fof_sorted1
% 0.79/1.08  
% 0.79/1.08  SPASS+T ended
%------------------------------------------------------------------------------