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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS+T---2.2.22
% Problem  : DAT010_1 : TPTP v8.1.0. Released v5.0.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:31:45 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : DAT010_1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/0.12  % Command  : spasst-tptp-script %s %d
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Fri Jul  1 18:51:00 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.47  % Using integer theory
% 0.77/1.04  
% 0.77/1.04  
% 0.77/1.04  % SZS status Theorem for /tmp/SPASST_31877_n020.cluster.edu
% 0.77/1.04  
% 0.77/1.04  SPASS V 2.2.22  in combination with yices.
% 0.77/1.04  SPASS beiseite: Proof found by SPASS and SMT.
% 0.77/1.04  Problem: /tmp/SPASST_31877_n020.cluster.edu 
% 0.77/1.04  SPASS derived 73 clauses, backtracked 26 clauses and kept 101 clauses.
% 0.77/1.04  SPASS backtracked 6 times (1 times due to theory inconsistency).
% 0.77/1.04  SPASS allocated 6320 KBytes.
% 0.77/1.04  SPASS spent	0:00:00.02 on the problem.
% 0.77/1.04  		0:00:00.00 for the input.
% 0.77/1.04  		0:00:00.00 for the FLOTTER CNF translation.
% 0.77/1.04  		0:00:00.00 for inferences.
% 0.77/1.04  		0:00:00.00 for the backtracking.
% 0.77/1.04  		0:00:00.01 for the reduction.
% 0.77/1.04  		0:00:00.00 for interacting with the SMT procedure.
% 0.77/1.04  		
% 0.77/1.04  
% 0.77/1.04  % SZS output start CNFRefutation for /tmp/SPASST_31877_n020.cluster.edu
% 0.77/1.04  
% 0.77/1.04  % Here is a proof with depth 0, length 7 :
% 0.77/1.04  3[0:Inp] ||  -> array(skc3)*.
% 0.77/1.04  4[0:Inp] ||  -> less(read(skc3,U),100)*.
% 0.77/1.04  5[0:Inp] || array(U) -> array(write(U,V,W))*.
% 0.77/1.04  6[0:Inp] || array(U) -> equal(read(write(U,V,W),V),W)**.
% 0.77/1.04  8[0:Inp] || array(U) -> equal(V,W) equal(read(write(U,V,X),W),read(U,W))**.
% 0.77/1.04  9[0:Inp] || less(read(write(write(write(write(skc3,3,33),4,444),5,55),4,44),skc4),100)* -> .
% 0.77/1.04  170(e)[0:ThR:9,8,6,5,4,3] ||  -> .
% 0.77/1.04  
% 0.77/1.04  % SZS output end CNFRefutation for /tmp/SPASST_31877_n020.cluster.edu
% 0.77/1.04  
% 0.77/1.04  Formulae used in the proof : fof_array_type fof_co1 fof_write_type fof_ax2
% 0.77/1.04  
% 0.77/1.05  SPASS+T ended
%------------------------------------------------------------------------------