TSTP Solution File: DAT022_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT022_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n010.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:48 EDT 2022
% Result : Theorem 0.43s 1.01s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT022_1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/0.12 % Command : spasst-tptp-script %s %d
% 0.13/0.33 % Computer : n010.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 17:32:03 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.46 % Using integer theory
% 0.43/1.01
% 0.43/1.01
% 0.43/1.01 % SZS status Theorem for /tmp/SPASST_6014_n010.cluster.edu
% 0.43/1.01
% 0.43/1.01 SPASS V 2.2.22 in combination with yices.
% 0.43/1.01 SPASS beiseite: Proof found by SPASS.
% 0.43/1.01 Problem: /tmp/SPASST_6014_n010.cluster.edu
% 0.43/1.01 SPASS derived 20 clauses, backtracked 4 clauses and kept 70 clauses.
% 0.43/1.01 SPASS backtracked 2 times (0 times due to theory inconsistency).
% 0.43/1.01 SPASS allocated 6264 KBytes.
% 0.43/1.01 SPASS spent 0:00:00.01 on the problem.
% 0.43/1.01 0:00:00.00 for the input.
% 0.43/1.01 0:00:00.00 for the FLOTTER CNF translation.
% 0.43/1.01 0:00:00.00 for inferences.
% 0.43/1.01 0:00:00.00 for the backtracking.
% 0.43/1.01 0:00:00.00 for the reduction.
% 0.43/1.01 0:00:00.00 for interacting with the SMT procedure.
% 0.43/1.01
% 0.43/1.01
% 0.43/1.01 % SZS output start CNFRefutation for /tmp/SPASST_6014_n010.cluster.edu
% 0.43/1.01
% 0.43/1.01 % Here is a proof with depth 5, length 22 :
% 0.43/1.01 3[0:Inp] || -> collection(skc3)*.
% 0.43/1.01 5[0:Inp] || greater(skc4,0)* -> .
% 0.43/1.01 7[0:Inp] || collection(U) -> collection(remove(V,U))*.
% 0.43/1.01 9[0:Inp] || -> in(skc4,add(2,remove(7,skc3)))*.
% 0.43/1.01 10[0:Inp] || in(U,skc3)* -> greater(U,0).
% 0.43/1.01 13(e)[0:Inp] || collection(U) in(V,remove(W,U))* -> in(V,U).
% 0.43/1.01 18(e)[0:Inp] || collection(U) in(V,add(W,U))* -> equal(V,W) in(V,U).
% 0.43/1.01 50[0:ArS:5.0] || less(0,skc4)* -> .
% 0.43/1.01 51[0:TOC:50.0] || -> lesseq(skc4,0)*.
% 0.43/1.01 52[0:ArS:10.1] || in(U,skc3)* -> less(0,U).
% 0.43/1.01 56[0:Res:3.0,13.0] || in(U,remove(V,skc3))* -> in(U,skc3).
% 0.43/1.01 61[0:Res:3.0,7.0] || -> collection(remove(U,skc3))*.
% 0.43/1.01 73[0:Res:9.0,18.1] || collection(remove(7,skc3)) -> in(skc4,remove(7,skc3))* equal(skc4,2).
% 0.43/1.01 76(e)[0:MRR:73.0,61.0] || -> equal(skc4,2) in(skc4,remove(7,skc3))*.
% 0.43/1.01 77(e)[1:Spt:76.0] || -> equal(skc4,2)**.
% 0.43/1.01 78[1:Rew:77.0,51.0] || -> lesseq(2,0)*.
% 0.43/1.01 80(e)[1:ArS:78.0] || -> .
% 0.43/1.01 81[1:Spt:80.0,76.0,77.0] || equal(skc4,2)** -> .
% 0.43/1.01 82[1:Spt:80.0,76.1] || -> in(skc4,remove(7,skc3))*.
% 0.43/1.01 83[1:Res:82.0,56.0] || -> in(skc4,skc3)*.
% 0.43/1.01 84[1:Res:83.0,52.0] || -> less(0,skc4)*.
% 0.43/1.01 87(e)[1:OCE:84.0,51.0] || -> .
% 0.43/1.01
% 0.43/1.01 % SZS output end CNFRefutation for /tmp/SPASST_6014_n010.cluster.edu
% 0.43/1.01
% 0.43/1.01 Formulae used in the proof : fof_collection_type fof_ax1 fof_co1 fof_add_type fof_ax3 fof_ax5
% 0.43/1.03
% 0.43/1.03 SPASS+T ended
%------------------------------------------------------------------------------