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

View Problem - Process Solution

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

% Computer : n021.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:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : DAT099_1 : TPTP v8.1.0. Released v6.1.0.
% 0.08/0.13  % Command  : spasst-tptp-script %s %d
% 0.13/0.34  % Computer : n021.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 : Fri Jul  1 17:53:44 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.48  % Using integer theory
% 0.45/1.06  
% 0.45/1.06  
% 0.45/1.06  % SZS status Theorem for /tmp/SPASST_27733_n021.cluster.edu
% 0.45/1.06  
% 0.45/1.06  SPASS V 2.2.22  in combination with yices.
% 0.45/1.06  SPASS beiseite: Proof found by SMT.
% 0.45/1.06  Problem: /tmp/SPASST_27733_n021.cluster.edu 
% 0.45/1.06  SPASS derived 108 clauses, backtracked 0 clauses and kept 94 clauses.
% 0.45/1.06  SPASS backtracked 1 times (1 times due to theory inconsistency).
% 0.45/1.06  SPASS allocated 6398 KBytes.
% 0.45/1.06  SPASS spent	0:00:00.03 on the problem.
% 0.45/1.06  		0:00:00.00 for the input.
% 0.45/1.06  		0:00:00.01 for the FLOTTER CNF translation.
% 0.45/1.06  		0:00:00.00 for inferences.
% 0.45/1.06  		0:00:00.00 for the backtracking.
% 0.45/1.06  		0:00:00.01 for the reduction.
% 0.45/1.06  		0:00:00.00 for interacting with the SMT procedure.
% 0.45/1.06  		
% 0.45/1.06  
% 0.45/1.06  % SZS output start CNFRefutation for /tmp/SPASST_27733_n021.cluster.edu
% 0.45/1.06  
% 0.45/1.06  % Here is a proof with depth 0, length 7 :
% 0.45/1.06  2[0:Inp] ||  -> list(nil)*.
% 0.45/1.06  4[0:Inp] ||  -> greatereq(skc2,4)*.
% 0.45/1.06  8[0:Inp] || list(U) -> list(cons(V,U))*.
% 0.45/1.06  12[0:Inp] || list(U) equal(U,nil) -> inRange(V,U)*.
% 0.45/1.06  13[0:Inp] || inRange(skc2,cons(1,cons(3,cons(2,nil))))* -> .
% 0.45/1.06  18[0:Inp] || list(U) list(V) inRange(W,V)* less(X,W)* lesseq(0,X) equal(U,cons(X,V))* -> inRange(W,U)*.
% 0.45/1.06  206(e)[0:ThR:18,13,12,8,4,2] ||  -> .
% 0.45/1.06  
% 0.45/1.06  % SZS output end CNFRefutation for /tmp/SPASST_27733_n021.cluster.edu
% 0.45/1.06  
% 0.45/1.06  Formulae used in the proof : fof_head_type fof_list_type fof_tail_type fof_l1 fof_inRange fof_nil_type fof_cons_type fof_l2
% 0.45/1.06  
% 0.45/1.06  SPASS+T ended
%------------------------------------------------------------------------------