TSTP Solution File: DAT027_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT027_1 : TPTP v8.1.0. Released v5.0.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:31:50 EDT 2022
% Result : Theorem 0.46s 1.14s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : DAT027_1 : TPTP v8.1.0. Released v5.0.0.
% 0.08/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 19:41:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.48 % Using integer theory
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14 % SZS status Theorem for /tmp/SPASST_25812_n021.cluster.edu
% 0.46/1.14
% 0.46/1.14 SPASS V 2.2.22 in combination with yices.
% 0.46/1.14 SPASS beiseite: Proof found by SPASS.
% 0.46/1.14 Problem: /tmp/SPASST_25812_n021.cluster.edu
% 0.46/1.14 SPASS derived 121 clauses, backtracked 16 clauses and kept 137 clauses.
% 0.46/1.14 SPASS backtracked 5 times (0 times due to theory inconsistency).
% 0.46/1.14 SPASS allocated 6323 KBytes.
% 0.46/1.14 SPASS spent 0:00:00.02 on the problem.
% 0.46/1.14 0:00:00.00 for the input.
% 0.46/1.14 0:00:00.00 for the FLOTTER CNF translation.
% 0.46/1.14 0:00:00.00 for inferences.
% 0.46/1.14 0:00:00.00 for the backtracking.
% 0.46/1.14 0:00:00.01 for the reduction.
% 0.46/1.14 0:00:00.00 for interacting with the SMT procedure.
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14 % SZS output start CNFRefutation for /tmp/SPASST_25812_n021.cluster.edu
% 0.46/1.14
% 0.46/1.14 % Here is a proof with depth 7, length 49 :
% 0.46/1.14 3[0:Inp] || -> collection(skc6)*.
% 0.46/1.14 4[0:Inp] || -> in(skc7,skc6)*.
% 0.46/1.14 5[0:Inp] || -> greatereq(skc5,0)*.
% 0.46/1.14 7[0:Inp] || greater(skc8,0)* -> .
% 0.46/1.14 8[0:Inp] || collection(U) -> collection(remove(V,U))*.
% 0.46/1.14 10[0:Inp] || in(U,skc6)* -> greater(U,0).
% 0.46/1.14 14(e)[0:Inp] || -> in(skc8,add(plus(skc7,skc5),remove(skc7,skc6)))*.
% 0.46/1.14 15(e)[0:Inp] || collection(U) in(V,remove(W,U))* -> in(V,U).
% 0.46/1.14 20(e)[0:Inp] || collection(U) in(V,add(W,U))* -> equal(V,W) in(V,U).
% 0.46/1.14 28[0:ThA] || -> equal(plus(U,0),U)**.
% 0.46/1.14 33[0:ThA] || -> equal(U,V) less(V,U)* less(U,V)*.
% 0.46/1.14 35[0:ThA] || -> lesseq(U,V) less(plus(W,V),plus(W,U))*.
% 0.46/1.14 52[0:ArS:5.0] || -> lesseq(0,skc5)*.
% 0.46/1.14 53[0:ArS:7.0] || less(0,skc8)* -> .
% 0.46/1.14 54[0:TOC:53.0] || -> lesseq(skc8,0)*.
% 0.46/1.14 55[0:ArS:10.1] || in(U,skc6)* -> less(0,U).
% 0.46/1.14 59[0:Res:3.0,15.0] || in(U,remove(V,skc6))* -> in(U,skc6).
% 0.46/1.14 64[0:Res:3.0,8.0] || -> collection(remove(U,skc6))*.
% 0.46/1.14 66[0:Res:4.0,55.0] || -> less(0,skc7)*.
% 0.46/1.14 80[0:Res:14.0,20.1] || collection(remove(skc7,skc6)) -> in(skc8,remove(skc7,skc6))* equal(plus(skc7,skc5),skc8).
% 0.46/1.14 85(e)[0:MRR:80.0,64.0] || -> in(skc8,remove(skc7,skc6))* equal(plus(skc7,skc5),skc8).
% 0.46/1.14 89(e)[0:OCE:52.0,33.1] || -> equal(skc5,0) less(0,skc5)*.
% 0.46/1.14 91[1:Spt:89.0] || -> equal(skc5,0)**.
% 0.46/1.14 95[1:Rew:91.0,85.1] || -> in(skc8,remove(skc7,skc6))* equal(plus(skc7,0),skc8).
% 0.46/1.14 99(e)[1:Rew:28.0,95.1] || -> in(skc8,remove(skc7,skc6))* equal(skc8,skc7).
% 0.46/1.14 102[2:Spt:99.1] || -> equal(skc8,skc7)**.
% 0.46/1.14 103[2:Rew:102.0,54.0] || -> lesseq(skc7,0)*.
% 0.46/1.14 108(e)[2:OCE:103.0,66.0] || -> .
% 0.46/1.14 111[2:Spt:108.0,99.1,102.0] || equal(skc8,skc7)** -> .
% 0.46/1.14 112[2:Spt:108.0,99.0] || -> in(skc8,remove(skc7,skc6))*.
% 0.46/1.14 117[2:Res:112.0,59.0] || -> in(skc8,skc6)*.
% 0.46/1.14 119[2:Res:117.0,55.0] || -> less(0,skc8)*.
% 0.46/1.14 122(e)[2:OCE:119.0,54.0] || -> .
% 0.46/1.14 125[1:Spt:122.0,89.0,91.0] || equal(skc5,0)** -> .
% 0.46/1.14 126[1:Spt:122.0,89.1] || -> less(0,skc5)*.
% 0.46/1.14 131[2:Spt:85.1] || -> equal(plus(skc7,skc5),skc8)**.
% 0.46/1.14 134[2:SpR:131.0,35.1] || -> lesseq(skc5,U) less(plus(skc7,U),skc8)*.
% 0.46/1.14 188(e)[2:SpR:28.0,134.1] || -> lesseq(skc5,0) less(skc7,skc8)*.
% 0.46/1.14 195[3:Spt:188.0] || -> lesseq(skc5,0)*.
% 0.46/1.14 196(e)[3:OCE:195.0,126.0] || -> .
% 0.46/1.14 201[3:Spt:196.0,188.0,195.0] || lesseq(skc5,0)* -> .
% 0.46/1.14 202[3:Spt:196.0,188.1] || -> less(skc7,skc8)*.
% 0.46/1.14 206[3:OCh:202.0,54.0] || -> less(skc7,0)*.
% 0.46/1.14 207(e)[3:OCE:206.0,66.0] || -> .
% 0.46/1.14 210(e)[2:Spt:207.0,85.1,131.0] || equal(plus(skc7,skc5),skc8)** -> .
% 0.46/1.14 211[2:Spt:207.0,85.0] || -> in(skc8,remove(skc7,skc6))*.
% 0.46/1.14 212[2:Res:211.0,59.0] || -> in(skc8,skc6)*.
% 0.46/1.14 213[2:Res:212.0,55.0] || -> less(0,skc8)*.
% 0.46/1.14 216(e)[2:OCE:213.0,54.0] || -> .
% 0.46/1.14
% 0.46/1.14 % SZS output end CNFRefutation for /tmp/SPASST_25812_n021.cluster.edu
% 0.46/1.14
% 0.46/1.14 Formulae used in the proof : fof_collection_type fof_co1 fof_ax1 fof_add_type fof_ax3 fof_ax5
% 0.46/1.16
% 0.46/1.16 SPASS+T ended
%------------------------------------------------------------------------------