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

View Problem - Process Solution

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

% Computer : n023.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.42s 1.06s
% Output   : Refutation 0.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : GEG022_1 : TPTP v8.1.0. Bugfixed v5.2.0.
% 0.06/0.12  % Command  : spasst-tptp-script %s %d
% 0.11/0.33  % Computer : n023.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Tue Jun  7 05:44:23 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.45  % Using integer theory
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  % SZS status Theorem for /tmp/SPASST_12634_n023.cluster.edu
% 0.42/1.06  
% 0.42/1.06  SPASS V 2.2.22  in combination with yices.
% 0.42/1.06  SPASS beiseite: Proof found by SMT.
% 0.42/1.06  Problem: /tmp/SPASST_12634_n023.cluster.edu 
% 0.42/1.06  SPASS derived 198 clauses, backtracked 0 clauses and kept 162 clauses.
% 0.42/1.06  SPASS backtracked 1 times (1 times due to theory inconsistency).
% 0.42/1.06  SPASS allocated 6558 KBytes.
% 0.42/1.06  SPASS spent	0:00:00.04 on the problem.
% 0.42/1.06  		0:00:00.00 for the input.
% 0.42/1.06  		0:00:00.00 for the FLOTTER CNF translation.
% 0.42/1.06  		0:00:00.00 for inferences.
% 0.42/1.06  		0:00:00.00 for the backtracking.
% 0.42/1.06  		0:00:00.02 for the reduction.
% 0.42/1.06  		0:00:00.00 for interacting with the SMT procedure.
% 0.42/1.06  		
% 0.42/1.06  
% 0.42/1.06  % SZS output start CNFRefutation for /tmp/SPASST_12634_n023.cluster.edu
% 0.42/1.06  
% 0.42/1.06  % Here is a proof with depth 0, length 10 :
% 0.42/1.06  2[0:Inp] ||  -> city(munich)*.
% 0.42/1.06  4[0:Inp] ||  -> city(frankfurt)*.
% 0.42/1.06  7[0:Inp] ||  -> city(hamburg)*.
% 0.42/1.06  16[0:Inp] ||  -> equal(d(hamburg,frankfurt),390)**.
% 0.42/1.06  20[0:Inp] ||  -> equal(d(munich,frankfurt),300)**.
% 0.42/1.06  21[0:Inp] ||  -> equal(d(munich,saarbruecken),360)**.
% 0.42/1.06  22[0:Inp] || lesseq(d(hamburg,munich),700)* -> .
% 0.42/1.06  24[0:Inp] || city(U) city(V) -> equal(d(U,V),d(V,U))*.
% 0.42/1.06  25[0:Inp] || city(U) city(V) city(W) -> lesseq(d(U,W),plus(d(U,V),d(V,W)))*.
% 0.42/1.06  440(e)[0:ThR:25,24,22,21,20,16,7,4,2] ||  -> .
% 0.42/1.06  
% 0.42/1.06  % SZS output end CNFRefutation for /tmp/SPASST_12634_n023.cluster.edu
% 0.42/1.06  
% 0.42/1.06  Formulae used in the proof : fof_d_type fof_saarbruecken_type fof_berlin_type fof_city_distance_2
% 0.42/1.06  
% 0.42/1.06  SPASS+T ended
%------------------------------------------------------------------------------