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

View Problem - Process Solution

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

% Computer : n025.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 21 01:29:35 EDT 2022

% Result   : Theorem 19.86s 19.21s
% Output   : Refutation 19.86s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWW063_1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/0.13  % Command  : spasst-tptp-script %s %d
% 0.13/0.34  % Computer : n025.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 : Sat Jun  4 10:52:16 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.52  % Using integer theory
% 19.86/19.21  
% 19.86/19.21  
% 19.86/19.21  % SZS status Theorem for /tmp/SPASST_22440_n025.cluster.edu
% 19.86/19.21  
% 19.86/19.21  SPASS V 2.2.22  in combination with yices.
% 19.86/19.21  SPASS beiseite: Proof found by SPASS.
% 19.86/19.21  Problem: /tmp/SPASST_22440_n025.cluster.edu 
% 19.86/19.21  SPASS derived 89 clauses, backtracked 0 clauses and kept 526 clauses.
% 19.86/19.21  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 19.86/19.21  SPASS allocated 11891 KBytes.
% 19.86/19.21  SPASS spent	0:00:01.75 on the problem.
% 19.86/19.21  		0:00:00.08 for the input.
% 19.86/19.21  		0:00:01.10 for the FLOTTER CNF translation.
% 19.86/19.21  		0:00:00.00 for inferences.
% 19.86/19.21  		0:00:00.00 for the backtracking.
% 19.86/19.21  		0:00:00.51 for the reduction.
% 19.86/19.21  		0:00:00.01 for interacting with the SMT procedure.
% 19.86/19.21  		
% 19.86/19.21  
% 19.86/19.21  % SZS output start CNFRefutation for /tmp/SPASST_22440_n025.cluster.edu
% 19.86/19.21  
% 19.86/19.21  % Here is a proof with depth 3, length 14 :
% 19.86/19.21  11[0:Inp] ||  -> less(z2,z5)*.
% 19.86/19.21  25[0:Inp] || equal(z5,z2)** -> .
% 19.86/19.21  34[0:Inp] ||  -> equal(a(z2),10)**.
% 19.86/19.21  37[0:Inp] ||  -> equal(a(z5),9)**.
% 19.86/19.21  39[0:Inp] ||  -> less(b(z2),3)*.
% 19.86/19.21  45[0:Inp] || equal(a(U),10) less(b(U),3)* less(U,V)* equal(a(V),9) -> equal(V,U).
% 19.86/19.21  529[0:TOC:45.2] || equal(a(U),9)+ equal(a(V),10) -> equal(U,V) lesseq(U,V)* lesseq(3,b(V))*.
% 19.86/19.21  1103[0:SpL:37.0,529.0] || equal(9,9) equal(a(U),10) -> equal(z5,U) lesseq(z5,U) lesseq(3,b(U))*.
% 19.86/19.21  1108[0:ArS:1103.0] || equal(a(U),10) -> equal(z5,U) lesseq(z5,U) lesseq(3,b(U))*.
% 19.86/19.21  1118[0:OCE:1108.3,39.0] || equal(a(z2),10) -> equal(z5,z2) lesseq(z5,z2)*.
% 19.86/19.21  1129[0:Rew:34.0,1118.0] || equal(10,10) -> equal(z5,z2) lesseq(z5,z2)*.
% 19.86/19.21  1130[0:ArS:1129.0] ||  -> equal(z5,z2) lesseq(z5,z2)*.
% 19.86/19.21  1131[0:MRR:1130.0,25.0] ||  -> lesseq(z5,z2)*.
% 19.86/19.21  1146(e)[0:OCE:1131.0,11.0] ||  -> .
% 19.86/19.21  
% 19.86/19.21  % SZS output end CNFRefutation for /tmp/SPASST_22440_n025.cluster.edu
% 19.86/19.21  
% 19.86/19.21  Formulae used in the proof : fof_0
% 19.86/19.25  
% 19.86/19.25  SPASS+T ended
%------------------------------------------------------------------------------