TSTP Solution File: DAT105_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT105_1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n019.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:15 EDT 2022
% Result : Theorem 0.75s 1.04s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : DAT105_1 : TPTP v8.1.0. Released v6.1.0.
% 0.06/0.12 % Command : spasst-tptp-script %s %d
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jul 1 20:17:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.46 % Using integer theory
% 0.75/1.04
% 0.75/1.04
% 0.75/1.04 % SZS status Theorem for /tmp/SPASST_16310_n019.cluster.edu
% 0.75/1.04
% 0.75/1.04 SPASS V 2.2.22 in combination with yices.
% 0.75/1.04 SPASS beiseite: Proof found by SPASS.
% 0.75/1.04 Problem: /tmp/SPASST_16310_n019.cluster.edu
% 0.75/1.04 SPASS derived 209 clauses, backtracked 0 clauses and kept 132 clauses.
% 0.75/1.04 SPASS backtracked 1 times (0 times due to theory inconsistency).
% 0.75/1.04 SPASS allocated 6534 KBytes.
% 0.75/1.04 SPASS spent 0:00:00.05 on the problem.
% 0.75/1.04 0:00:00.00 for the input.
% 0.75/1.04 0:00:00.01 for the FLOTTER CNF translation.
% 0.75/1.04 0:00:00.00 for inferences.
% 0.75/1.04 0:00:00.00 for the backtracking.
% 0.75/1.04 0:00:00.02 for the reduction.
% 0.75/1.04 0:00:00.01 for interacting with the SMT procedure.
% 0.75/1.04
% 0.75/1.04
% 0.75/1.04 % SZS output start CNFRefutation for /tmp/SPASST_16310_n019.cluster.edu
% 0.75/1.04
% 0.75/1.04 % Here is a proof with depth 7, length 27 :
% 0.75/1.04 2[0:Inp] || -> list(nil)*.
% 0.75/1.04 7[0:Inp] || list(U) -> list(cons(V,U))*.
% 0.75/1.04 8[0:Inp] || list(U) equal(cons(V,U),nil)** -> .
% 0.75/1.04 10[0:Inp] || list(U) -> equal(head(cons(V,U)),V)**.
% 0.75/1.04 11[0:Inp] || list(U) equal(U,nil) -> inRange(V,U)*.
% 0.75/1.04 15[0:Inp] || list(U) inRange(V,U) -> equal(U,nil) greatereq(minus(V,head(U)),2)*.
% 0.75/1.04 17[0:Inp] || list(U) list(V) inRange(W,V)* less(X,W)* lesseq(0,X) equal(U,cons(X,V))* -> inRange(W,U)*.
% 0.75/1.04 22[0:ThA] || -> equal(plus(plus(U,V),uminus(V)),U)**.
% 0.75/1.04 25[0:ThA] || -> equal(plus(U,0),U)**.
% 0.75/1.04 29[0:ThA] || -> less(plus(U,-1),U)*.
% 0.75/1.04 49[0:ArS:15.3] || list(U) inRange(V,U) -> equal(U,nil) lesseq(2,plus(V,uminus(head(U))))*.
% 0.75/1.04 50[0:TOC:17.4] || list(U) list(V) inRange(W,U)* equal(V,cons(X,U))*+ -> inRange(W,V)* lesseq(W,X)* less(X,0).
% 0.75/1.04 91[0:SpR:22.0,49.3] || list(U) inRange(plus(V,head(U)),U)* -> equal(U,nil) lesseq(2,V).
% 0.75/1.04 109[0:SpL:10.1,91.1] || list(U) list(cons(V,U)) inRange(plus(W,V),cons(V,U))* -> equal(cons(V,U),nil) lesseq(2,W).
% 0.75/1.04 117[0:MRR:109.1,109.3,7.1,8.1] || list(U) inRange(plus(V,W),cons(W,U))* -> lesseq(2,V).
% 0.75/1.04 139[0:SpL:25.0,117.1] || list(U) inRange(V,cons(0,U))* -> lesseq(2,V).
% 0.75/1.04 178[0:EqR:50.3] || list(U) list(cons(V,U)) inRange(W,U) -> inRange(W,cons(V,U))* lesseq(W,V) less(V,0).
% 0.75/1.04 180[0:MRR:178.1,7.1] || list(U) inRange(V,U) -> inRange(V,cons(W,U))* lesseq(V,W) less(W,0).
% 0.75/1.04 271[0:Res:180.2,139.1] || list(U) inRange(V,U)* list(U) -> lesseq(V,0) less(0,0) lesseq(2,V)*.
% 0.75/1.04 288[0:ArS:271.4] || list(U) inRange(V,U)* list(U) -> lesseq(V,0) lesseq(2,V)*.
% 0.75/1.04 289[0:Obv:288.0] || inRange(U,V)*+ list(V) -> lesseq(U,0) lesseq(2,U)*.
% 0.75/1.04 346[0:Res:11.2,289.0] || list(U)* equal(U,nil) list(U)* -> lesseq(V,0) lesseq(2,V)*.
% 0.75/1.04 349[0:Obv:346.0] || equal(U,nil)+ list(U)* -> lesseq(V,0) lesseq(2,V)*.
% 0.75/1.04 351[0:EqR:349.0] || list(nil)* -> lesseq(U,0) lesseq(2,U)*.
% 0.75/1.04 352[0:MRR:351.0,2.0] || -> lesseq(U,0) lesseq(2,U)*.
% 0.75/1.04 360[0:OCE:352.1,29.0] || -> lesseq(plus(2,-1),0)*.
% 0.75/1.04 364(e)[0:ArS:360.0] || -> .
% 0.75/1.04
% 0.75/1.04 % SZS output end CNFRefutation for /tmp/SPASST_16310_n019.cluster.edu
% 0.75/1.04
% 0.75/1.04 Formulae used in the proof : fof_head_type fof_tail_type fof_cons_type fof_l2 fof_l1 fof_inRange fof_nil_type
% 0.75/1.06
% 0.75/1.07 SPASS+T ended
%------------------------------------------------------------------------------