TSTP Solution File: DAT080_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT080_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:07 EDT 2022
% Result : Theorem 3.71s 2.59s
% Output : Refutation 3.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : DAT080_1 : TPTP v8.1.0. Released v6.1.0.
% 0.04/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 20:52:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 % Using integer theory
% 3.71/2.59
% 3.71/2.59
% 3.71/2.59 % SZS status Theorem for /tmp/SPASST_28336_n029.cluster.edu
% 3.71/2.59
% 3.71/2.59 SPASS V 2.2.22 in combination with yices.
% 3.71/2.59 SPASS beiseite: Proof found by SPASS.
% 3.71/2.59 Problem: /tmp/SPASST_28336_n029.cluster.edu
% 3.71/2.59 SPASS derived 6938 clauses, backtracked 21 clauses and kept 1497 clauses.
% 3.71/2.59 SPASS backtracked 3 times (0 times due to theory inconsistency).
% 3.71/2.59 SPASS allocated 16463 KBytes.
% 3.71/2.59 SPASS spent 0:00:01.55 on the problem.
% 3.71/2.59 0:00:00.00 for the input.
% 3.71/2.59 0:00:00.01 for the FLOTTER CNF translation.
% 3.71/2.59 0:00:00.09 for inferences.
% 3.71/2.59 0:00:00.01 for the backtracking.
% 3.71/2.59 0:00:01.26 for the reduction.
% 3.71/2.59 0:00:00.09 for interacting with the SMT procedure.
% 3.71/2.59
% 3.71/2.59
% 3.71/2.59 % SZS output start CNFRefutation for /tmp/SPASST_28336_n029.cluster.edu
% 3.71/2.59
% 3.71/2.59 % Here is a proof with depth 7, length 62 :
% 3.71/2.59 4[0:Inp] || -> list(nil)*.
% 3.71/2.59 7[0:Inp] || -> list(skf6(U,V))*.
% 3.71/2.59 8[0:Inp] || -> list(skf5(U,V))*.
% 3.71/2.59 9[0:Inp] || -> equal(count(U,nil),0)**.
% 3.71/2.59 12[0:Inp] || list(U) -> list(tail(U))*.
% 3.71/2.59 13[0:Inp] || list(U) -> list(cons(V,U))*.
% 3.71/2.59 16[0:Inp] || list(U) -> equal(tail(cons(V,U)),U)**.
% 3.71/2.59 17[0:Inp] || list(U) -> equal(head(cons(V,U)),V)**.
% 3.71/2.59 18[0:Inp] || -> in(4,cons(1,cons(2,cons(3,nil))))*.
% 3.71/2.59 21[0:Inp] || list(U) greater(count(V,U),0)* -> in(V,U).
% 3.71/2.59 22[0:Inp] || list(U) in(V,U) -> greater(count(V,U),0)*.
% 3.71/2.59 24[0:Inp] || list(U) -> equal(U,nil) equal(cons(head(U),tail(U)),U)**.
% 3.71/2.59 27[0:Inp] || list(U) -> equal(V,W) equal(count(V,cons(W,U)),count(V,U))**.
% 3.71/2.59 33[0:Inp] || list(U) in(V,U) -> in(V,skf6(V,U)) equal(cons(V,skf5(V,U)),U)**.
% 3.71/2.59 34[0:Inp] || list(U) in(V,U) -> equal(cons(V,skf5(V,U)),U) equal(cons(skf7(V,U),skf6(V,U)),U)**.
% 3.71/2.59 68[0:ArS:22.2] || list(U) in(V,U) -> less(0,count(V,U))*.
% 3.71/2.59 69[0:ArS:21.1] || list(U) less(0,count(V,U))* -> in(V,U).
% 3.71/2.59 70[0:TOC:69.1] || list(U) -> in(V,U) lesseq(count(V,U),0)*.
% 3.71/2.59 94[0:SpR:9.0,68.2] || list(nil) in(U,nil)* -> less(0,0).
% 3.71/2.59 99[0:ArS:94.2] || list(nil) in(U,nil)* -> .
% 3.71/2.59 100[0:MRR:99.0,4.0] || in(U,nil)* -> .
% 3.71/2.59 234[0:SpR:27.2,68.2] || list(U) list(cons(V,U)) in(W,cons(V,U))* -> equal(W,V) less(0,count(W,U)).
% 3.71/2.59 240[0:SpR:24.2,27.2] || list(U) list(tail(U)) -> equal(U,nil) equal(V,head(U)) equal(count(V,tail(U)),count(V,U))**.
% 3.71/2.59 243[0:MRR:240.1,12.1] || list(U) -> equal(U,nil) equal(V,head(U)) equal(count(V,tail(U)),count(V,U))**.
% 3.71/2.59 244[0:MRR:234.1,13.1] || list(U) in(V,cons(W,U))* -> equal(V,W) less(0,count(V,U)).
% 3.71/2.59 548[0:SpR:33.3,17.1] || list(U) in(V,U) list(skf5(V,U)) -> in(V,skf6(V,U))* equal(head(U),V).
% 3.71/2.59 558[0:MRR:548.2,8.0] || list(U) in(V,U) -> in(V,skf6(V,U))* equal(head(U),V).
% 3.71/2.59 668[0:SpR:34.3,16.1] || list(U) in(V,U) list(skf6(V,U)) -> equal(cons(V,skf5(V,U)),U)** equal(skf6(V,U),tail(U)).
% 3.71/2.59 683[0:MRR:668.2,7.0] || list(U) in(V,U) -> equal(cons(V,skf5(V,U)),U)** equal(skf6(V,U),tail(U)).
% 3.71/2.59 1646[0:Res:18.0,244.1] || list(cons(2,cons(3,nil))) -> equal(4,1) less(0,count(4,cons(2,cons(3,nil))))*.
% 3.71/2.59 1656[0:ArS:1646.1] || list(cons(2,cons(3,nil))) -> less(0,count(4,cons(2,cons(3,nil))))*.
% 3.71/2.59 1785[0:SpR:243.3,70.2] || list(U) list(tail(U)) -> equal(U,nil) equal(V,head(U)) in(V,tail(U)) lesseq(count(V,U),0)*.
% 3.71/2.59 1899[0:MRR:1785.1,12.1] || list(U) -> equal(U,nil) equal(V,head(U)) in(V,tail(U)) lesseq(count(V,U),0)*.
% 3.71/2.59 2541[0:SpR:683.2,17.1] || list(U) in(V,U) list(skf5(V,U))* -> equal(skf6(V,U),tail(U)) equal(head(U),V).
% 3.71/2.59 2564[0:MRR:2541.2,8.0] || list(U) in(V,U) -> equal(skf6(V,U),tail(U))** equal(head(U),V).
% 3.71/2.59 2565[0:Rew:2564.2,558.2] || list(U) in(V,U) -> in(V,tail(U))* equal(head(U),V).
% 3.71/2.59 2766[0:SpR:16.1,2565.2] || list(U) list(cons(V,U)) in(W,cons(V,U))* -> in(W,U) equal(head(cons(V,U)),W).
% 3.71/2.59 2769[0:Rew:17.1,2766.4] || list(U) list(cons(V,U)) in(W,cons(V,U))* -> in(W,U) equal(V,W).
% 3.71/2.59 2770[0:MRR:2769.1,13.1] || list(U) in(V,cons(W,U))* -> in(V,U) equal(W,V).
% 3.71/2.59 11404[0:OCE:1899.4,1656.1] || list(cons(2,cons(3,nil))) list(cons(2,cons(3,nil))) -> equal(cons(2,cons(3,nil)),nil) equal(head(cons(2,cons(3,nil))),4) in(4,tail(cons(2,cons(3,nil))))*.
% 3.71/2.59 12253(e)[0:Obv:11404.0] || list(cons(2,cons(3,nil))) -> equal(cons(2,cons(3,nil)),nil) equal(head(cons(2,cons(3,nil))),4) in(4,tail(cons(2,cons(3,nil))))*.
% 3.71/2.59 12260(e)[1:Spt:12253.1] || -> equal(cons(2,cons(3,nil)),nil)**.
% 3.71/2.59 12262[1:Rew:12260.0,1656.0] || list(nil) -> less(0,count(4,cons(2,cons(3,nil))))*.
% 3.71/2.59 12289[1:Rew:12260.0,12262.1] || list(nil) -> less(0,count(4,nil))*.
% 3.71/2.59 12290[1:Rew:9.0,12289.1] || list(nil)* -> less(0,0).
% 3.71/2.59 12291[1:ArS:12290.1] || list(nil)* -> .
% 3.71/2.59 12292(e)[1:MRR:12291.0,4.0] || -> .
% 3.71/2.59 12301[1:Spt:12292.0,12253.1,12260.0] || equal(cons(2,cons(3,nil)),nil)** -> .
% 3.71/2.59 12302(e)[1:Spt:12292.0,12253.0,12253.2,12253.3] || list(cons(2,cons(3,nil))) -> equal(head(cons(2,cons(3,nil))),4) in(4,tail(cons(2,cons(3,nil))))*.
% 3.71/2.59 12303[2:Spt:12302.0,12302.1] || list(cons(2,cons(3,nil))) -> equal(head(cons(2,cons(3,nil))),4)**.
% 3.71/2.59 12304[2:SpR:12303.1,17.1] || list(cons(2,cons(3,nil)))* list(cons(3,nil)) -> equal(4,2).
% 3.71/2.59 12315[2:ArS:12304.2] || list(cons(2,cons(3,nil)))* list(cons(3,nil)) -> .
% 3.71/2.59 12316[2:MRR:12315.0,13.1] || list(cons(3,nil))* -> .
% 3.71/2.59 12335[2:Res:13.1,12316.0] || list(nil)* -> .
% 3.71/2.59 12336(e)[2:MRR:12335.0,4.0] || -> .
% 3.71/2.59 12337[2:Spt:12336.0,12302.1,12303.1] || equal(head(cons(2,cons(3,nil))),4)** -> .
% 3.71/2.59 12338[2:Spt:12336.0,12302.0,12303.0] || -> list(cons(2,cons(3,nil)))*.
% 3.71/2.59 12339[2:Spt:12336.0,12302.2] || -> in(4,tail(cons(2,cons(3,nil))))*.
% 3.71/2.59 12342[2:SpR:16.1,12339.0] || list(cons(3,nil)) -> in(4,cons(3,nil))*.
% 3.71/2.59 12424[2:Res:12342.1,2770.1] || list(cons(3,nil))* list(nil) -> in(4,nil) equal(4,3).
% 3.71/2.59 12427[2:ArS:12424.3] || list(cons(3,nil))* list(nil) -> in(4,nil).
% 3.71/2.59 12428(e)[2:MRR:12427.0,12427.1,12427.2,13.1,4.0,100.0] || -> .
% 3.71/2.59
% 3.71/2.59 % SZS output end CNFRefutation for /tmp/SPASST_28336_n029.cluster.edu
% 3.71/2.59
% 3.71/2.59 Formulae used in the proof : fof_head_type fof_l fof_in_conv fof_nil_type fof_inRange fof_t_5 fof_l_6 fof_tail_type fof_l4 fof_l2 fof_l1 fof_a_8 fof_l_1
% 5.55/3.51
% 5.55/3.51 SPASS+T ended
%------------------------------------------------------------------------------