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

View Problem - Process Solution

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

% Computer : n009.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:41 EDT 2022

% Result   : Theorem 0.68s 0.99s
% Output   : Refutation 0.68s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : DAT001_1 : TPTP v8.1.0. Released v5.0.0.
% 0.11/0.11  % Command  : spasst-tptp-script %s %d
% 0.11/0.32  % Computer : n009.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Fri Jul  1 18:00:37 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.18/0.44  % Using integer theory
% 0.68/0.99  
% 0.68/0.99  
% 0.68/0.99  % SZS status Theorem for /tmp/SPASST_23501_n009.cluster.edu
% 0.68/0.99  
% 0.68/0.99  SPASS V 2.2.22  in combination with yices.
% 0.68/0.99  SPASS beiseite: Proof found by SPASS.
% 0.68/0.99  Problem: /tmp/SPASST_23501_n009.cluster.edu 
% 0.68/0.99  SPASS derived 6 clauses, backtracked 0 clauses and kept 43 clauses.
% 0.68/0.99  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.68/0.99  SPASS allocated 6232 KBytes.
% 0.68/0.99  SPASS spent	0:00:00.01 on the problem.
% 0.68/0.99  		0:00:00.00 for the input.
% 0.68/0.99  		0:00:00.00 for the FLOTTER CNF translation.
% 0.68/0.99  		0:00:00.00 for inferences.
% 0.68/0.99  		0:00:00.00 for the backtracking.
% 0.68/0.99  		0:00:00.00 for the reduction.
% 0.68/0.99  		0:00:00.00 for interacting with the SMT procedure.
% 0.68/0.99  		
% 0.68/0.99  
% 0.68/0.99  % SZS output start CNFRefutation for /tmp/SPASST_23501_n009.cluster.edu
% 0.68/0.99  
% 0.68/0.99  % Here is a proof with depth 5, length 19 :
% 0.68/0.99  2[0:Inp] ||  -> list(nil)*.
% 0.68/0.99  4[0:Inp] ||  -> sorted(mycons(U,nil))*.
% 0.68/0.99  5[0:Inp] || list(U) -> list(mycons(V,U))*.
% 0.68/0.99  6[0:Inp] || sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil))))))* -> .
% 0.68/0.99  7[0:Inp] || list(U) sorted(mycons(V,U)) less(W,V) -> sorted(mycons(W,mycons(V,U)))*.
% 0.68/0.99  39[0:TOC:7.2] || list(U) sorted(mycons(V,U)) -> sorted(mycons(W,mycons(V,U)))* lesseq(V,W).
% 0.68/0.99  40[0:Res:39.3,6.0] || list(mycons(4,mycons(7,mycons(100,nil)))) sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil)))))* -> lesseq(2,1).
% 0.68/0.99  41[0:ArS:40.2] || list(mycons(4,mycons(7,mycons(100,nil)))) sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil)))))* -> .
% 0.68/0.99  44[0:Res:39.2,41.1] || list(mycons(7,mycons(100,nil))) sorted(mycons(4,mycons(7,mycons(100,nil))))* list(mycons(4,mycons(7,mycons(100,nil)))) -> lesseq(4,2).
% 0.68/0.99  45[0:ArS:44.3] || list(mycons(7,mycons(100,nil))) sorted(mycons(4,mycons(7,mycons(100,nil))))* list(mycons(4,mycons(7,mycons(100,nil)))) -> .
% 0.68/0.99  46[0:MRR:45.2,5.1] || list(mycons(7,mycons(100,nil))) sorted(mycons(4,mycons(7,mycons(100,nil))))* -> .
% 0.68/0.99  47[0:Res:39.2,46.1] || list(mycons(100,nil)) sorted(mycons(7,mycons(100,nil)))* list(mycons(7,mycons(100,nil))) -> lesseq(7,4).
% 0.68/0.99  48[0:ArS:47.3] || list(mycons(100,nil)) sorted(mycons(7,mycons(100,nil)))* list(mycons(7,mycons(100,nil))) -> .
% 0.68/0.99  49[0:MRR:48.2,5.1] || list(mycons(100,nil)) sorted(mycons(7,mycons(100,nil)))* -> .
% 0.68/0.99  50[0:Res:39.2,49.1] || list(nil) sorted(mycons(100,nil))* list(mycons(100,nil)) -> lesseq(100,7).
% 0.68/0.99  51[0:ArS:50.3] || list(nil) sorted(mycons(100,nil))* list(mycons(100,nil)) -> .
% 0.68/0.99  52[0:MRR:51.0,51.1,2.0,4.0] || list(mycons(100,nil))* -> .
% 0.68/0.99  53[0:Res:5.1,52.0] || list(nil)* -> .
% 0.68/0.99  54(e)[0:MRR:53.0,2.0] ||  -> .
% 0.68/0.99  
% 0.68/0.99  % SZS output end CNFRefutation for /tmp/SPASST_23501_n009.cluster.edu
% 0.68/0.99  
% 0.68/0.99  Formulae used in the proof : fof_empty_is_sorted fof_list_type fof_single_is_sorted fof_mycons_type fof_check_list
% 0.74/1.01  
% 0.74/1.01  SPASS+T ended
%------------------------------------------------------------------------------