TSTP Solution File: DAT086_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT086_1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n003.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:09 EDT 2022
% Result : Theorem 3.77s 2.64s
% Output : Refutation 3.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : DAT086_1 : TPTP v8.1.0. Released v6.1.0.
% 0.10/0.12 % Command : spasst-tptp-script %s %d
% 0.12/0.33 % Computer : n003.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 18:10:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 % Using integer theory
% 3.77/2.64
% 3.77/2.64
% 3.77/2.64 % SZS status Theorem for /tmp/SPASST_1918_n003.cluster.edu
% 3.77/2.64
% 3.77/2.64 SPASS V 2.2.22 in combination with yices.
% 3.77/2.64 SPASS beiseite: Proof found by SPASS.
% 3.77/2.64 Problem: /tmp/SPASST_1918_n003.cluster.edu
% 3.77/2.64 SPASS derived 6585 clauses, backtracked 0 clauses and kept 1494 clauses.
% 3.77/2.64 SPASS backtracked 1 times (0 times due to theory inconsistency).
% 3.77/2.64 SPASS allocated 15005 KBytes.
% 3.77/2.64 SPASS spent 0:00:01.58 on the problem.
% 3.77/2.64 0:00:00.00 for the input.
% 3.77/2.64 0:00:00.01 for the FLOTTER CNF translation.
% 3.77/2.64 0:00:00.10 for inferences.
% 3.77/2.64 0:00:00.02 for the backtracking.
% 3.77/2.64 0:00:01.29 for the reduction.
% 3.77/2.64 0:00:00.07 for interacting with the SMT procedure.
% 3.77/2.64
% 3.77/2.64
% 3.77/2.64 % SZS output start CNFRefutation for /tmp/SPASST_1918_n003.cluster.edu
% 3.77/2.64
% 3.77/2.64 % Here is a proof with depth 6, length 38 :
% 3.77/2.64 4[0:Inp] || -> list(nil)*.
% 3.77/2.64 6[0:Inp] || -> equal(length(nil),0)**.
% 3.77/2.64 13[0:Inp] || list(U) -> list(cons(V,U))*.
% 3.77/2.64 15[0:Inp] || list(U) equal(cons(V,U),nil)** -> .
% 3.77/2.64 17[0:Inp] || list(U) -> equal(head(cons(V,U)),V)**.
% 3.77/2.64 22[0:Inp] || list(U) -> equal(length(cons(V,U)),plus(1,length(U)))**.
% 3.77/2.64 25[0:Inp] || list(U) inRange(V,U) -> list(skf8(V,U))* equal(U,nil).
% 3.77/2.64 27[0:Inp] || list(U) inRange(V,U) -> equal(U,nil) less(skf9(V,U),V)*.
% 3.77/2.64 29[0:Inp] || greatereq(U,3) greatereq(length(V),4)* list(V) -> inRange(U,V)*.
% 3.77/2.64 31[0:Inp] || list(U) inRange(V,U) -> equal(U,nil) equal(cons(skf9(V,U),skf8(V,U)),U)**.
% 3.77/2.64 45[0:ThA] || -> lesseq(U,U)*.
% 3.77/2.64 67[0:ArS:22.1] || list(U) -> equal(length(cons(V,U)),plus(length(U),1))**.
% 3.77/2.64 71[0:ArS:29.1] || lesseq(3,U)* lesseq(4,length(V))* list(V) -> inRange(U,V)*.
% 3.77/2.64 72[0:TOC:71.1] || list(U)+ -> inRange(V,U)* less(V,3)* less(length(U),4)*.
% 3.77/2.64 123[0:Res:13.1,72.0] || list(U) -> inRange(V,cons(W,U))* less(V,3) less(length(cons(W,U)),4)*.
% 3.77/2.64 127[0:Rew:67.1,123.3] || list(U) -> inRange(V,cons(W,U))* less(V,3) less(plus(length(U),1),4)*.
% 3.77/2.64 128[0:ArS:127.3] || list(U)+ -> inRange(V,cons(W,U))* less(V,3) less(length(U),3)*.
% 3.77/2.64 361[0:SpR:31.3,17.1] || list(U) inRange(V,U) list(skf8(V,U))* -> equal(U,nil) equal(skf9(V,U),head(U)).
% 3.77/2.64 370[0:MRR:361.2,25.2] || list(U) inRange(V,U) -> equal(U,nil) equal(skf9(V,U),head(U))**.
% 3.77/2.64 371[0:Rew:370.3,27.3] || list(U) inRange(V,U) -> equal(U,nil) less(head(U),V)*.
% 3.77/2.64 440[0:OCE:371.3,45.0] || list(U) inRange(head(U),U)* -> equal(U,nil).
% 3.77/2.64 850[0:SpL:17.1,440.1] || list(U) list(cons(V,U)) inRange(V,cons(V,U))* -> equal(cons(V,U),nil).
% 3.77/2.64 853[0:MRR:850.1,850.3,13.1,15.1] || list(U) inRange(V,cons(V,U))* -> .
% 3.77/2.64 1398[0:Res:13.1,128.0] || list(U) -> inRange(V,cons(W,cons(X,U)))* less(V,3) less(length(cons(X,U)),3)*.
% 3.77/2.64 1403[0:Rew:67.1,1398.3] || list(U) -> inRange(V,cons(W,cons(X,U)))* less(V,3) less(plus(length(U),1),3).
% 3.77/2.64 1404[0:ArS:1403.3] || list(U) -> inRange(V,cons(W,cons(X,U)))* less(V,3) less(length(U),2).
% 3.77/2.64 11636[0:Res:1404.1,853.1] || list(U) list(cons(V,U))* -> less(W,3)* less(length(U),2)*.
% 3.77/2.64 11641[0:BLD:11636.2] || list(U) list(cons(V,U))* -> less(length(U),2)*.
% 3.77/2.64 11642[0:MRR:11641.1,13.1] || list(U) -> less(length(U),2)*.
% 3.77/2.64 11654[0:SpR:67.1,11642.1] || list(U) list(cons(V,U))* -> less(plus(length(U),1),2)*.
% 3.77/2.64 11658[0:ArS:11654.2] || list(U) list(cons(V,U))* -> less(length(U),1)*.
% 3.77/2.64 11659[0:MRR:11658.1,13.1] || list(U) -> less(length(U),1)*.
% 3.77/2.64 11665[0:SpR:67.1,11659.1] || list(U) list(cons(V,U))* -> less(plus(length(U),1),1)*.
% 3.77/2.64 11669[0:ArS:11665.2] || list(U) list(cons(V,U))* -> less(length(U),0).
% 3.77/2.64 11670[0:MRR:11669.1,13.1] || list(U) -> less(length(U),0)*.
% 3.77/2.64 11674[0:SpR:6.0,11670.1] || list(nil)* -> less(0,0).
% 3.77/2.64 11678[0:ArS:11674.1] || list(nil)* -> .
% 3.77/2.64 11679(e)[0:MRR:11678.0,4.0] || -> .
% 3.77/2.64
% 3.77/2.64 % SZS output end CNFRefutation for /tmp/SPASST_1918_n003.cluster.edu
% 3.77/2.64
% 3.77/2.64 Formulae used in the proof : fof_head_type fof_list_type fof_tail_type fof_l_6 fof_l2 fof_a_8 fof_a_4 fof_a_3 fof_in_conv fof_nil_type fof_l_7
% 4.54/3.33
% 4.54/3.34 SPASS+T ended
%------------------------------------------------------------------------------