↑ Up

SPASS+T---2.2.22.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS+T---2.2.22
% Problem  : DAT083_1 : TPTP v8.1.0. Released v6.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : spasst-tptp-script %s %d

% Computer : n029.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:08 EDT 2022

% Result   : Theorem 0.44s 1.05s
% Output   : Refutation 0.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : DAT083_1 : TPTP v8.1.0. Released v6.1.0.
% 0.11/0.12  % Command  : spasst-tptp-script %s %d
% 0.12/0.33  % Computer : n029.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:52:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.46  % Using integer theory
% 0.44/1.05  
% 0.44/1.05  
% 0.44/1.05  % SZS status Theorem for /tmp/SPASST_12545_n029.cluster.edu
% 0.44/1.05  
% 0.44/1.05  SPASS V 2.2.22  in combination with yices.
% 0.44/1.05  SPASS beiseite: Proof found by SPASS.
% 0.44/1.05  Problem: /tmp/SPASST_12545_n029.cluster.edu 
% 0.44/1.05  SPASS derived 17 clauses, backtracked 0 clauses and kept 67 clauses.
% 0.44/1.05  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.44/1.05  SPASS allocated 6492 KBytes.
% 0.44/1.05  SPASS spent	0:00:00.03 on the problem.
% 0.44/1.05  		0:00:00.00 for the input.
% 0.44/1.05  		0:00:00.01 for the FLOTTER CNF translation.
% 0.44/1.05  		0:00:00.00 for inferences.
% 0.44/1.05  		0:00:00.00 for the backtracking.
% 0.44/1.05  		0:00:00.00 for the reduction.
% 0.44/1.05  		0:00:00.00 for interacting with the SMT procedure.
% 0.44/1.05  		
% 0.44/1.05  
% 0.44/1.05  % SZS output start CNFRefutation for /tmp/SPASST_12545_n029.cluster.edu
% 0.44/1.05  
% 0.44/1.05  % Here is a proof with depth 2, length 13 :
% 0.44/1.05  4[0:Inp] ||  -> list(nil)*.
% 0.44/1.05  6[0:Inp] ||  -> equal(length(nil),0)**.
% 0.44/1.05  13[0:Inp] || list(U) -> list(cons(V,U))*.
% 0.44/1.05  15[0:Inp] ||  -> equal(length(cons(1,cons(2,nil))),3)**.
% 0.44/1.05  23[0:Inp] || list(U) -> equal(length(cons(V,U)),plus(1,length(U)))**.
% 0.44/1.05  67[0:ArS:23.1] || list(U) -> equal(length(cons(V,U)),plus(length(U),1))**.
% 0.44/1.05  91[0:SpR:67.1,15.0] || list(cons(2,nil)) -> equal(plus(length(cons(2,nil)),1),3)**.
% 0.44/1.05  93[0:ArS:91.1] || list(cons(2,nil)) -> equal(length(cons(2,nil)),2)**.
% 0.44/1.05  94[0:SpR:93.1,67.1] || list(cons(2,nil))* list(nil) -> equal(plus(length(nil),1),2).
% 0.44/1.05  97[0:ArS:94.2] || list(cons(2,nil))* list(nil) -> equal(length(nil),1).
% 0.44/1.05  98[0:Rew:6.0,97.2] || list(cons(2,nil))* list(nil) -> equal(1,0).
% 0.44/1.05  99[0:ArS:98.2] || list(cons(2,nil))* list(nil) -> .
% 0.44/1.05  100(e)[0:MRR:99.0,99.1,13.1,4.0] ||  -> .
% 0.44/1.05  
% 0.44/1.05  % SZS output end CNFRefutation for /tmp/SPASST_12545_n029.cluster.edu
% 0.44/1.05  
% 0.44/1.05  Formulae used in the proof : fof_head_type fof_list_type fof_tail_type fof_l_6 fof_a_8
% 0.79/1.07  
% 0.79/1.08  SPASS+T ended
%------------------------------------------------------------------------------