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

View Problem - Process Solution

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

% Computer : n019.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:20 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ARI614_1 : TPTP v8.1.0. Released v5.1.0.
% 0.07/0.13  % Command  : spasst-tptp-script %s %d
% 0.13/0.34  % Computer : n019.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 Jun 17 11:12:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  % Using integer theory
% 0.82/1.09  
% 0.82/1.09  
% 0.82/1.09  % SZS status Theorem for /tmp/SPASST_20112_n019.cluster.edu
% 0.82/1.09  
% 0.82/1.09  SPASS V 2.2.22  in combination with yices.
% 0.82/1.09  SPASS beiseite: Proof found by SPASS.
% 0.82/1.09  Problem: /tmp/SPASST_20112_n019.cluster.edu 
% 0.82/1.09  SPASS derived 121 clauses, backtracked 0 clauses and kept 60 clauses.
% 0.82/1.09  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.82/1.09  SPASS allocated 6358 KBytes.
% 0.82/1.09  SPASS spent	0:00:00.09 on the problem.
% 0.82/1.09  		0:00:00.00 for the input.
% 0.82/1.09  		0:00:00.00 for the FLOTTER CNF translation.
% 0.82/1.09  		0:00:00.00 for inferences.
% 0.82/1.09  		0:00:00.00 for the backtracking.
% 0.82/1.09  		0:00:00.01 for the reduction.
% 0.82/1.09  		0:00:00.08 for interacting with the SMT procedure.
% 0.82/1.09  		
% 0.82/1.09  
% 0.82/1.09  % SZS output start CNFRefutation for /tmp/SPASST_20112_n019.cluster.edu
% 0.82/1.09  
% 0.82/1.09  % Here is a proof with depth 4, length 28 :
% 0.82/1.09  2[0:Inp] || less(a,U)* -> p(U).
% 0.82/1.09  3[0:Inp] || less(U,0)* -> q(U).
% 0.82/1.09  4[0:Inp] || p(U)* q(V)* equal(plus(U,V),0)**+ -> .
% 0.82/1.09  6[0:ThA] ||  -> equal(plus(U,plus(uminus(U),V)),V)**.
% 0.82/1.09  7[0:ThA] ||  -> equal(plus(uminus(U),plus(U,V)),V)**.
% 0.82/1.09  9[0:ThA] ||  -> equal(plus(plus(U,V),uminus(V)),U)**.
% 0.82/1.09  10[0:ThA] ||  -> equal(plus(U,uminus(U)),0)**.
% 0.82/1.09  11[0:ThA] ||  -> equal(plus(uminus(U),U),0)**.
% 0.82/1.09  15[0:ThA] ||  -> less(U,plus(U,1))*.
% 0.82/1.09  16[0:ThA] ||  -> less(plus(U,-1),U)*.
% 0.82/1.09  17[0:ThA] ||  -> equal(U,V) less(V,U)* less(U,V)*.
% 0.82/1.09  36[0:TOC:3.0] ||  -> q(U) lesseq(0,U)*.
% 0.82/1.09  37[0:TOC:2.0] ||  -> p(U) lesseq(U,a)*.
% 0.82/1.09  39[0:OCE:36.1,17.1] ||  -> q(U) equal(0,U) less(0,U)*.
% 0.82/1.09  42[0:OCE:37.1,17.1] ||  -> p(U) equal(U,a) less(U,a)*.
% 0.82/1.09  51[0:SpL:9.0,4.2] || p(plus(U,V))* q(uminus(V)) equal(U,0) -> .
% 0.82/1.09  52[0:SpL:7.0,4.2] || p(uminus(U)) q(plus(U,V))* equal(V,0) -> .
% 0.82/1.09  57[0:OCE:39.2,16.0] ||  -> q(plus(0,-1))* equal(plus(0,-1),0).
% 0.82/1.09  70[0:OCE:42.2,15.0] ||  -> p(plus(a,1))* equal(plus(a,1),a).
% 0.82/1.09  105[0:SpL:7.0,51.0] || p(U) q(uminus(plus(V,U)))* equal(uminus(V),0) -> .
% 0.82/1.09  114[0:ArS:105.2] || p(U) q(uminus(plus(V,U)))* equal(0,V) -> .
% 0.82/1.09  123[0:SpL:9.0,52.1] || p(uminus(plus(U,V)))* q(U) equal(uminus(V),0) -> .
% 0.82/1.09  129[0:ArS:123.2] || p(uminus(plus(U,V)))* q(U) equal(0,V) -> .
% 0.82/1.09  139[0:SpL:9.0,114.1] || p(uminus(U))* q(uminus(V))* equal(plus(V,U),0)**+ -> .
% 0.82/1.09  149[0:SpL:6.0,129.0] || p(uminus(U))* q(V)* equal(plus(uminus(V),U),0)**+ -> .
% 0.82/1.09  205[0:SpL:10.0,139.2] || p(uminus(uminus(U)))* q(uminus(U)) equal(0,0) -> .
% 0.82/1.09  217[0:SpL:11.0,149.2] || p(uminus(U))* q(U) equal(0,0) -> .
% 0.82/1.09  237[0:ThR:217,205,70,57,37,36] ||  -> .
% 0.82/1.09  
% 0.82/1.09  % SZS output end CNFRefutation for /tmp/SPASST_20112_n019.cluster.edu
% 0.82/1.09  
% 0.82/1.09  Formulae used in the proof : fof_a_type fof_interv_a_infty_and_neginfty_1_contain_compl
% 0.82/1.10  
% 0.82/1.10  SPASS+T ended
%------------------------------------------------------------------------------