↑ 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  : DAT103_1 : TPTP v8.1.0. Released v6.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : spasst-tptp-script %s %d

% Computer : n011.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:14 EDT 2022

% Result   : Theorem 0.45s 1.07s
% Output   : Refutation 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : DAT103_1 : TPTP v8.1.0. Released v6.1.0.
% 0.10/0.12  % Command  : spasst-tptp-script %s %d
% 0.13/0.34  % Computer : n011.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 Jul  1 17:56:19 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  % Using integer theory
% 0.45/1.07  
% 0.45/1.07  
% 0.45/1.07  % SZS status Theorem for /tmp/SPASST_21167_n011.cluster.edu
% 0.45/1.07  
% 0.45/1.07  SPASS V 2.2.22  in combination with yices.
% 0.45/1.07  SPASS beiseite: Proof found by SMT.
% 0.45/1.07  Problem: /tmp/SPASST_21167_n011.cluster.edu 
% 0.45/1.07  SPASS derived 173 clauses, backtracked 0 clauses and kept 110 clauses.
% 0.45/1.07  SPASS backtracked 1 times (1 times due to theory inconsistency).
% 0.45/1.07  SPASS allocated 6409 KBytes.
% 0.45/1.07  SPASS spent	0:00:00.03 on the problem.
% 0.45/1.07  		0:00:00.00 for the input.
% 0.45/1.07  		0:00:00.01 for the FLOTTER CNF translation.
% 0.45/1.07  		0:00:00.00 for inferences.
% 0.45/1.07  		0:00:00.00 for the backtracking.
% 0.45/1.07  		0:00:00.01 for the reduction.
% 0.45/1.07  		0:00:00.00 for interacting with the SMT procedure.
% 0.45/1.07  		
% 0.45/1.07  
% 0.45/1.07  % SZS output start CNFRefutation for /tmp/SPASST_21167_n011.cluster.edu
% 0.45/1.07  
% 0.45/1.07  % Here is a proof with depth 0, length 9 :
% 0.45/1.07  4[0:Inp] ||  -> list(skc3)*.
% 0.45/1.07  5[0:Inp] ||  -> inRange(skc4,skc3)*.
% 0.45/1.07  6[0:Inp] ||  -> list(skf2(U,V))*.
% 0.45/1.07  7[0:Inp] || equal(skc3,nil)** -> .
% 0.45/1.07  10[0:Inp] ||  -> less(minus(skc4,head(skc3)),1)*.
% 0.45/1.07  14[0:Inp] || list(U) -> equal(head(cons(V,U)),V)**.
% 0.45/1.07  18[0:Inp] || list(U) inRange(V,U) -> equal(U,nil) less(skf3(V,U),V)*.
% 0.45/1.07  19(e)[0:Inp] || list(U) inRange(V,U) -> equal(U,nil) equal(cons(skf3(V,U),skf2(V,U)),U)**.
% 0.45/1.07  279(e)[0:ThR:19,18,14,10,7,6,5,4] ||  -> .
% 0.45/1.07  
% 0.45/1.07  % SZS output end CNFRefutation for /tmp/SPASST_21167_n011.cluster.edu
% 0.45/1.07  
% 0.45/1.07  Formulae used in the proof : fof_list_type fof_c fof_inRange fof_nil_type fof_tail_type fof_l2
% 0.45/1.07  
% 0.45/1.07  SPASS+T ended
%------------------------------------------------------------------------------