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

% Computer : n022.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.75s 1.03s
% Output   : Refutation 0.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GEG024_1 : TPTP v8.1.0. Bugfixed v5.2.0.
% 0.03/0.12  % Command  : spasst-tptp-script %s %d
% 0.12/0.33  % Computer : n022.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 : Tue Jun  7 04:56:35 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  % Using integer theory
% 0.75/1.03  
% 0.75/1.03  
% 0.75/1.03  % SZS status Theorem for /tmp/SPASST_15723_n022.cluster.edu
% 0.75/1.03  
% 0.75/1.03  SPASS V 2.2.22  in combination with yices.
% 0.75/1.03  SPASS beiseite: Proof found by SPASS.
% 0.75/1.03  Problem: /tmp/SPASST_15723_n022.cluster.edu 
% 0.75/1.03  SPASS derived 136 clauses, backtracked 0 clauses and kept 116 clauses.
% 0.75/1.03  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.75/1.03  SPASS allocated 6394 KBytes.
% 0.75/1.03  SPASS spent	0:00:00.03 on the problem.
% 0.75/1.03  		0:00:00.00 for the input.
% 0.75/1.03  		0:00:00.01 for the FLOTTER CNF translation.
% 0.75/1.03  		0:00:00.00 for inferences.
% 0.75/1.03  		0:00:00.00 for the backtracking.
% 0.75/1.03  		0:00:00.00 for the reduction.
% 0.75/1.03  		0:00:00.00 for interacting with the SMT procedure.
% 0.75/1.03  		
% 0.75/1.03  
% 0.75/1.03  % SZS output start CNFRefutation for /tmp/SPASST_15723_n022.cluster.edu
% 0.75/1.03  
% 0.75/1.03  % Here is a proof with depth 2, length 14 :
% 0.75/1.03  8[0:Inp] ||  -> city(hamburg)*.
% 0.75/1.03  9[0:Inp] ||  -> city(kiel)*.
% 0.75/1.03  12[0:Inp] ||  -> equal(inh(hamburg),1774224)**.
% 0.75/1.03  26[0:Inp] ||  -> equal(d(hamburg,kiel),90)**.
% 0.75/1.03  31[0:Inp] || city(U) city(V) -> equal(d(U,V),d(V,U))*.
% 0.75/1.03  32[0:Inp] || lesseq(1000000,inh(U)) lesseq(d(kiel,U),100)* city(U) -> .
% 0.75/1.03  65[0:TOC:32.1] || city(U) -> less(100,d(kiel,U))* less(inh(U),1000000).
% 0.75/1.03  76[0:Res:8.0,65.0] ||  -> less(100,d(kiel,hamburg))* less(inh(hamburg),1000000).
% 0.75/1.03  124[0:Rew:12.0,76.1] ||  -> less(100,d(kiel,hamburg))* less(1774224,1000000).
% 0.75/1.03  125[0:ArS:124.1] ||  -> less(100,d(kiel,hamburg))*.
% 0.75/1.03  237[0:SpR:31.2,125.0] || city(kiel) city(hamburg) -> less(100,d(hamburg,kiel))*.
% 0.75/1.03  272[0:Rew:26.0,237.2] || city(kiel)* city(hamburg) -> less(100,90).
% 0.75/1.03  273[0:ArS:272.2] || city(kiel)* city(hamburg) -> .
% 0.75/1.03  274(e)[0:MRR:273.0,273.1,9.0,8.0] ||  -> .
% 0.75/1.03  
% 0.75/1.03  % SZS output end CNFRefutation for /tmp/SPASST_15723_n022.cluster.edu
% 0.75/1.03  
% 0.75/1.03  Formulae used in the proof : fof_berlin_type fof_hamburg_type fof_exists_big_city_distance_1
% 0.75/1.05  
% 0.75/1.05  SPASS+T ended
%------------------------------------------------------------------------------