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

% Computer : n026.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 02:41:53 EDT 2022

% Result   : Theorem 0.43s 1.09s
% Output   : Refutation 0.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GEG025_1 : TPTP v8.1.0. Bugfixed v5.2.0.
% 0.11/0.13  % Command  : spasst-tptp-script %s %d
% 0.13/0.34  % Computer : n026.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun  7 05:29:31 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  % Using integer theory
% 0.43/1.09  
% 0.43/1.09  
% 0.43/1.09  % SZS status Theorem for /tmp/SPASST_315_n026.cluster.edu
% 0.43/1.09  
% 0.43/1.09  SPASS V 2.2.22  in combination with yices.
% 0.43/1.09  SPASS beiseite: Proof found by SMT.
% 0.43/1.09  Problem: /tmp/SPASST_315_n026.cluster.edu 
% 0.43/1.09  SPASS derived 227 clauses, backtracked 0 clauses and kept 176 clauses.
% 0.43/1.09  SPASS backtracked 1 times (1 times due to theory inconsistency).
% 0.43/1.09  SPASS allocated 6612 KBytes.
% 0.43/1.09  SPASS spent	0:00:00.04 on the problem.
% 0.43/1.09  		0:00:00.00 for the input.
% 0.43/1.09  		0:00:00.01 for the FLOTTER CNF translation.
% 0.43/1.09  		0:00:00.00 for inferences.
% 0.43/1.09  		0:00:00.00 for the backtracking.
% 0.43/1.09  		0:00:00.02 for the reduction.
% 0.43/1.09  		0:00:00.00 for interacting with the SMT procedure.
% 0.43/1.09  		
% 0.43/1.09  
% 0.43/1.09  % SZS output start CNFRefutation for /tmp/SPASST_315_n026.cluster.edu
% 0.43/1.09  
% 0.43/1.09  % Here is a proof with depth 0, length 11 :
% 0.43/1.09  4[0:Inp] ||  -> city(saarbruecken)*.
% 0.43/1.09  5[0:Inp] ||  -> city(frankfurt)*.
% 0.43/1.09  7[0:Inp] ||  -> city(berlin)*.
% 0.43/1.09  11[0:Inp] ||  -> equal(inh(berlin),3442675)**.
% 0.43/1.09  20[0:Inp] ||  -> equal(d(berlin,frankfurt),420)**.
% 0.43/1.09  21[0:Inp] ||  -> equal(d(saarbruecken,frankfurt),160)**.
% 0.43/1.09  29[0:Inp] ||  -> equal(d(munich,saarbruecken),360)**.
% 0.43/1.09  31[0:Inp] || city(U) city(V) -> equal(d(U,V),d(V,U))*.
% 0.43/1.09  32[0:Inp] || lesseq(3000000,inh(U)) lesseq(d(saarbruecken,U),600)* city(U) -> .
% 0.43/1.09  33[0:Inp] || city(U) city(V) city(W) -> lesseq(d(U,W),plus(d(U,V),d(V,W)))*.
% 0.43/1.09  520(e)[0:ThR:33,32,31,29,21,20,11,7,5,4] ||  -> .
% 0.43/1.09  
% 0.43/1.09  % SZS output end CNFRefutation for /tmp/SPASST_315_n026.cluster.edu
% 0.43/1.09  
% 0.43/1.09  Formulae used in the proof : fof_munich_type fof_saarbruecken_type fof_cologne_type fof_city_type fof_exists_big_city_distance_2
% 0.79/1.09  
% 0.79/1.09  SPASS+T ended
%------------------------------------------------------------------------------