TSTP Solution File: DAT101_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT101_1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n021.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:13 EDT 2022
% Result : Theorem 0.46s 1.06s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT101_1 : TPTP v8.1.0. Released v6.1.0.
% 0.07/0.13 % Command : spasst-tptp-script %s %d
% 0.13/0.34 % Computer : n021.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 20:31:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 % Using integer theory
% 0.46/1.06
% 0.46/1.06
% 0.46/1.06 % SZS status Theorem for /tmp/SPASST_8534_n021.cluster.edu
% 0.46/1.06
% 0.46/1.06 SPASS V 2.2.22 in combination with yices.
% 0.46/1.06 SPASS beiseite: Proof found by SPASS.
% 0.46/1.06 Problem: /tmp/SPASST_8534_n021.cluster.edu
% 0.46/1.06 SPASS derived 145 clauses, backtracked 12 clauses and kept 123 clauses.
% 0.46/1.06 SPASS backtracked 3 times (0 times due to theory inconsistency).
% 0.46/1.06 SPASS allocated 6422 KBytes.
% 0.46/1.06 SPASS spent 0:00:00.04 on the problem.
% 0.46/1.06 0:00:00.00 for the input.
% 0.46/1.06 0:00:00.01 for the FLOTTER CNF translation.
% 0.46/1.06 0:00:00.00 for inferences.
% 0.46/1.06 0:00:00.00 for the backtracking.
% 0.46/1.06 0:00:00.02 for the reduction.
% 0.46/1.06 0:00:00.00 for interacting with the SMT procedure.
% 0.46/1.06
% 0.46/1.06
% 0.46/1.06 % SZS output start CNFRefutation for /tmp/SPASST_8534_n021.cluster.edu
% 0.46/1.06
% 0.46/1.06 % Here is a proof with depth 8, length 50 :
% 0.46/1.06 2[0:Inp] || -> list(nil)*.
% 0.46/1.06 4[0:Inp] || -> lesseq(0,skf3(U,V))*.
% 0.46/1.06 5[0:Inp] || -> inRange(U,skf2(U,V))*.
% 0.46/1.06 6[0:Inp] || list(U) -> list(tail(U))*.
% 0.46/1.06 7[0:Inp] || list(U) -> list(cons(V,U))*.
% 0.46/1.06 8[0:Inp] || list(U) equal(cons(V,U),nil)** -> .
% 0.46/1.06 9[0:Inp] || list(U) -> equal(tail(cons(V,U)),U)**.
% 0.46/1.06 10[0:Inp] || list(U) -> equal(head(cons(V,U)),V)**.
% 0.46/1.06 13[0:Inp] || greatereq(U,4) -> inRange(U,cons(1,cons(5,cons(2,nil))))*.
% 0.46/1.06 14[0:Inp] || list(U) inRange(V,U) -> list(skf2(V,U))* equal(U,nil).
% 0.46/1.06 15[0:Inp] || list(U) inRange(V,U) -> equal(U,nil) less(skf3(V,U),V)*.
% 0.46/1.06 16[0:Inp] || list(U) inRange(V,U) -> equal(U,nil) equal(cons(skf3(V,U),skf2(V,U)),U)**.
% 0.46/1.06 27[0:ThA] || -> lesseq(U,U)*.
% 0.46/1.06 49[0:ArS:13.0] || lesseq(4,U) -> inRange(U,cons(1,cons(5,cons(2,nil))))*.
% 0.46/1.06 50(e)[0:TOC:49.0] || -> less(U,4) inRange(U,cons(1,cons(5,cons(2,nil))))*.
% 0.46/1.06 73[0:OCh:15.3,4.0] || list(U) inRange(V,U)* -> equal(U,nil) less(0,V).
% 0.46/1.06 80(e)[0:Res:50.1,73.1] || list(cons(1,cons(5,cons(2,nil))))* -> less(U,4)* equal(cons(1,cons(5,cons(2,nil))),nil) less(0,U).
% 0.46/1.06 83[1:Spt:80.2] || -> equal(cons(1,cons(5,cons(2,nil))),nil)**.
% 0.46/1.06 89[1:SpL:83.0,8.1] || list(cons(5,cons(2,nil)))* equal(nil,nil) -> .
% 0.46/1.06 90[1:Obv:89.1] || list(cons(5,cons(2,nil)))* -> .
% 0.46/1.06 94[1:Res:7.1,90.0] || list(cons(2,nil))* -> .
% 0.46/1.06 95[1:Res:7.1,94.0] || list(nil)* -> .
% 0.46/1.06 96(e)[1:MRR:95.0,2.0] || -> .
% 0.46/1.06 97(e)[1:Spt:96.0,80.2,83.0] || equal(cons(1,cons(5,cons(2,nil))),nil)** -> .
% 0.46/1.06 98[1:Spt:96.0,80.0,80.1,80.3] || list(cons(1,cons(5,cons(2,nil))))*+ -> less(U,4)* less(0,U).
% 0.46/1.06 104[0:SpR:16.3,9.1] || list(U) inRange(V,U) list(skf2(V,U))* -> equal(U,nil) equal(skf2(V,U),tail(U)).
% 0.46/1.06 105[0:SpR:16.3,10.1] || list(U) inRange(V,U) list(skf2(V,U))* -> equal(U,nil) equal(skf3(V,U),head(U)).
% 0.46/1.06 108[0:MRR:105.2,14.2] || list(U) inRange(V,U) -> equal(U,nil) equal(skf3(V,U),head(U))**.
% 0.46/1.06 109[0:Rew:108.3,15.3] || list(U) inRange(V,U) -> equal(U,nil) less(head(U),V)*.
% 0.46/1.06 111[0:MRR:104.2,14.2] || list(U) inRange(V,U) -> equal(U,nil) equal(skf2(V,U),tail(U))**.
% 0.46/1.06 130[0:OCE:109.3,27.0] || list(U) inRange(head(U),U)* -> equal(U,nil).
% 0.46/1.06 196[0:SpR:111.3,5.0] || list(U) inRange(V,U) -> equal(U,nil) inRange(V,tail(U))*.
% 0.46/1.06 204[0:Res:196.3,130.1] || list(U) inRange(head(tail(U)),U)* list(tail(U)) -> equal(U,nil) equal(tail(U),nil).
% 0.46/1.06 206[0:MRR:204.2,6.1] || list(U) inRange(head(tail(U)),U)* -> equal(U,nil) equal(tail(U),nil).
% 0.46/1.06 213[0:SpL:9.1,206.1] || list(U) list(cons(V,U)) inRange(head(U),cons(V,U))* -> equal(cons(V,U),nil) equal(tail(cons(V,U)),nil).
% 0.46/1.06 218[0:Rew:9.1,213.4] || list(U) list(cons(V,U)) inRange(head(U),cons(V,U))* -> equal(cons(V,U),nil) equal(U,nil).
% 0.46/1.06 219[0:MRR:218.1,218.3,7.1,8.1] || list(U) inRange(head(U),cons(V,U))* -> equal(U,nil).
% 0.46/1.06 223(e)[0:Res:50.1,219.1] || list(cons(5,cons(2,nil))) -> less(head(cons(5,cons(2,nil))),4)* equal(cons(5,cons(2,nil)),nil).
% 0.46/1.06 226[2:Spt:223.2] || -> equal(cons(5,cons(2,nil)),nil)**.
% 0.46/1.06 244[2:SpL:226.0,8.1] || list(cons(2,nil))* equal(nil,nil) -> .
% 0.46/1.06 251[2:Obv:244.1] || list(cons(2,nil))* -> .
% 0.46/1.06 254[2:Res:7.1,251.0] || list(nil)* -> .
% 0.46/1.06 255(e)[2:MRR:254.0,2.0] || -> .
% 0.46/1.06 256(e)[2:Spt:255.0,223.2,226.0] || equal(cons(5,cons(2,nil)),nil)** -> .
% 0.46/1.06 257[2:Spt:255.0,223.0,223.1] || list(cons(5,cons(2,nil))) -> less(head(cons(5,cons(2,nil))),4)*.
% 0.46/1.06 258[2:SpR:10.1,257.1] || list(cons(2,nil)) list(cons(5,cons(2,nil)))* -> less(5,4).
% 0.46/1.06 259[2:ArS:258.2] || list(cons(2,nil)) list(cons(5,cons(2,nil)))* -> .
% 0.46/1.06 260[2:MRR:259.1,7.1] || list(cons(2,nil))* -> .
% 0.46/1.06 261[2:Res:7.1,260.0] || list(nil)* -> .
% 0.46/1.06 262(e)[2:MRR:261.0,2.0] || -> .
% 0.46/1.06
% 0.46/1.06 % SZS output end CNFRefutation for /tmp/SPASST_8534_n021.cluster.edu
% 0.46/1.06
% 0.46/1.06 Formulae used in the proof : fof_head_type fof_list_type fof_inRange fof_nil_type fof_cons_type fof_tail_type fof_l2 fof_l4 fof_l3 fof_c
% 0.78/1.08
% 0.78/1.08 SPASS+T ended
%------------------------------------------------------------------------------