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

View Problem - Process Solution

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

% Computer : n004.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:31:46 EDT 2022

% Result   : Theorem 0.75s 1.01s
% Output   : Refutation 0.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : DAT013_1 : TPTP v8.1.0. Released v5.0.0.
% 0.00/0.12  % Command  : spasst-tptp-script %s %d
% 0.12/0.33  % Computer : n004.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 : Fri Jul  1 17:48:08 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.46  % Using integer theory
% 0.75/1.01  
% 0.75/1.01  
% 0.75/1.01  % SZS status Theorem for /tmp/SPASST_9021_n004.cluster.edu
% 0.75/1.01  
% 0.75/1.01  SPASS V 2.2.22  in combination with yices.
% 0.75/1.01  SPASS beiseite: Proof found by SPASS.
% 0.75/1.01  Problem: /tmp/SPASST_9021_n004.cluster.edu 
% 0.75/1.01  SPASS derived 36 clauses, backtracked 5 clauses and kept 67 clauses.
% 0.75/1.01  SPASS backtracked 2 times (0 times due to theory inconsistency).
% 0.75/1.01  SPASS allocated 6259 KBytes.
% 0.75/1.01  SPASS spent	0:00:00.01 on the problem.
% 0.75/1.01  		0:00:00.00 for the input.
% 0.75/1.01  		0:00:00.00 for the FLOTTER CNF translation.
% 0.75/1.01  		0:00:00.00 for inferences.
% 0.75/1.01  		0:00:00.00 for the backtracking.
% 0.75/1.01  		0:00:00.00 for the reduction.
% 0.75/1.01  		0:00:00.00 for interacting with the SMT procedure.
% 0.75/1.01  		
% 0.75/1.01  
% 0.75/1.01  % SZS output start CNFRefutation for /tmp/SPASST_9021_n004.cluster.edu
% 0.75/1.01  
% 0.75/1.01  % Here is a proof with depth 3, length 19 :
% 0.75/1.01  4[0:Inp] ||  -> lesseq(skc8,skc6)*.
% 0.75/1.01  5[0:Inp] ||  -> lesseq(plus(skc7,3),skc8)*.
% 0.75/1.01  6[0:Inp] || greater(read(skc5,skc8),0)* -> .
% 0.75/1.01  9[0:Inp] || lesseq(U,skc6) lesseq(skc7,U) -> greater(read(skc5,U),0)*.
% 0.75/1.01  18[0:ThA] ||  -> equal(plus(U,0),U)**.
% 0.75/1.01  25[0:ThA] ||  -> lesseq(U,V) less(plus(W,V),plus(W,U))*.
% 0.75/1.01  42[0:ArS:6.0] || less(0,read(skc5,skc8))* -> .
% 0.75/1.01  43[0:TOC:42.0] ||  -> lesseq(read(skc5,skc8),0)*.
% 0.75/1.01  44[0:ArS:9.2] || lesseq(U,skc6) lesseq(skc7,U) -> less(0,read(skc5,U))*.
% 0.75/1.01  45[0:TOC:44.1] ||  -> less(U,skc7) less(skc6,U) less(0,read(skc5,U))*.
% 0.75/1.01  49[0:OCh:5.0,25.1] ||  -> lesseq(3,U) less(plus(skc7,U),skc8)*.
% 0.75/1.01  51[0:SpR:18.0,49.1] ||  -> lesseq(3,0) less(skc7,skc8)*.
% 0.75/1.01  57[0:ArS:51.0] ||  -> less(skc7,skc8)*.
% 0.75/1.01  77(e)[0:OCE:45.2,43.0] ||  -> less(skc8,skc7)* less(skc6,skc8).
% 0.75/1.01  80[1:Spt:77.0] ||  -> less(skc8,skc7)*.
% 0.75/1.01  81(e)[1:OCE:80.0,57.0] ||  -> .
% 0.75/1.01  84[1:Spt:81.0,77.0,80.0] || less(skc8,skc7)* -> .
% 0.75/1.01  85[1:Spt:81.0,77.1] ||  -> less(skc6,skc8)*.
% 0.75/1.01  89(e)[1:OCE:85.0,4.0] ||  -> .
% 0.75/1.01  
% 0.75/1.01  % SZS output end CNFRefutation for /tmp/SPASST_9021_n004.cluster.edu
% 0.75/1.01  
% 0.75/1.01  Formulae used in the proof : fof_co1 fof_ax1
% 0.75/1.03  
% 0.75/1.03  SPASS+T ended
%------------------------------------------------------------------------------