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

View Problem - Process Solution

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

% Computer : n010.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 : Thu Jul 14 22:18:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : ARI591_1 : TPTP v8.1.0. Released v5.1.0.
% 0.12/0.13  % Command  : spasst-tptp-script %s %d
% 0.12/0.34  % Computer : n010.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 Jun 17 10:51:38 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.47  % Using integer theory
% 0.80/1.09  
% 0.80/1.09  
% 0.80/1.09  % SZS status Theorem for /tmp/SPASST_24175_n010.cluster.edu
% 0.80/1.09  
% 0.80/1.09  SPASS V 2.2.22  in combination with yices.
% 0.80/1.09  SPASS beiseite: Proof found by SPASS.
% 0.80/1.09  Problem: /tmp/SPASST_24175_n010.cluster.edu 
% 0.80/1.09  SPASS derived 14 clauses, backtracked 0 clauses and kept 35 clauses.
% 0.80/1.09  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.80/1.09  SPASS allocated 6224 KBytes.
% 0.80/1.09  SPASS spent	0:00:00.05 on the problem.
% 0.80/1.09  		0:00:00.00 for the input.
% 0.80/1.09  		0:00:00.00 for the FLOTTER CNF translation.
% 0.80/1.09  		0:00:00.00 for inferences.
% 0.80/1.09  		0:00:00.00 for the backtracking.
% 0.80/1.09  		0:00:00.00 for the reduction.
% 0.80/1.09  		0:00:00.04 for interacting with the SMT procedure.
% 0.80/1.09  		
% 0.80/1.09  
% 0.80/1.09  % SZS output start CNFRefutation for /tmp/SPASST_24175_n010.cluster.edu
% 0.80/1.09  
% 0.80/1.09  % Here is a proof with depth 2, length 10 :
% 0.80/1.09  1[0:Inp] || less(U,3)* less(0,U) -> equal(skc1,U).
% 0.80/1.09  13[0:ThA] ||  -> less(plus(U,-1),U)*.
% 0.80/1.09  14[0:ThA] ||  -> equal(U,V) less(V,U)* less(U,V)*.
% 0.80/1.09  33[0:TOC:1.1] ||  -> lesseq(U,0) equal(skc1,U) lesseq(3,U)*.
% 0.80/1.09  34[0:OCE:33.2,13.0] ||  -> lesseq(plus(3,-1),0)* equal(skc1,plus(3,-1)).
% 0.80/1.09  35[0:OCE:33.2,14.1] ||  -> lesseq(U,0) equal(skc1,U) equal(3,U) less(3,U)*.
% 0.80/1.09  37[0:ArS:34.1] ||  -> equal(skc1,2)**.
% 0.80/1.09  39[0:Rew:37.0,35.1] ||  -> lesseq(U,0) equal(2,U) equal(3,U) less(3,U)*.
% 0.80/1.09  48[0:OCE:39.3,14.1] ||  -> lesseq(U,0) equal(2,U) equal(3,U) equal(3,U) less(3,U)*.
% 0.80/1.09  59[0:ThR:48] ||  -> .
% 0.80/1.09  
% 0.80/1.09  % SZS output end CNFRefutation for /tmp/SPASST_24175_n010.cluster.edu
% 0.80/1.09  
% 0.80/1.09  Formulae used in the proof :
% 0.80/1.09  
% 0.80/1.09  SPASS+T ended
%------------------------------------------------------------------------------