TSTP Solution File: DAT034_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT034_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n015.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:52 EDT 2022
% Result : Theorem 0.84s 1.10s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : DAT034_1 : TPTP v8.1.0. Released v5.0.0.
% 0.11/0.12 % Command : spasst-tptp-script %s %d
% 0.12/0.33 % Computer : n015.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 17:48:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.46 % Using integer theory
% 0.84/1.10
% 0.84/1.10
% 0.84/1.10 % SZS status Theorem for /tmp/SPASST_12122_n015.cluster.edu
% 0.84/1.10
% 0.84/1.10 SPASS V 2.2.22 in combination with yices.
% 0.84/1.10 SPASS beiseite: Proof found by SPASS.
% 0.84/1.10 Problem: /tmp/SPASST_12122_n015.cluster.edu
% 0.84/1.10 SPASS derived 155 clauses, backtracked 42 clauses and kept 163 clauses.
% 0.84/1.10 SPASS backtracked 4 times (0 times due to theory inconsistency).
% 0.84/1.10 SPASS allocated 6404 KBytes.
% 0.84/1.10 SPASS spent 0:00:00.03 on the problem.
% 0.84/1.10 0:00:00.00 for the input.
% 0.84/1.10 0:00:00.01 for the FLOTTER CNF translation.
% 0.84/1.10 0:00:00.00 for inferences.
% 0.84/1.10 0:00:00.00 for the backtracking.
% 0.84/1.10 0:00:00.01 for the reduction.
% 0.84/1.10 0:00:00.00 for interacting with the SMT procedure.
% 0.84/1.10
% 0.84/1.10
% 0.84/1.10 % SZS output start CNFRefutation for /tmp/SPASST_12122_n015.cluster.edu
% 0.84/1.10
% 0.84/1.10 % Here is a proof with depth 3, length 14 :
% 0.84/1.10 4[0:Inp] || -> collection(skc3)*.
% 0.84/1.10 11[0:Inp] || greatereq(plus(count(skc3),1),count(add(skc4,skc3)))* -> .
% 0.84/1.10 21(e)[0:Inp] || collection(U) in(V,U) -> equal(count(add(V,U)),count(U))**.
% 0.84/1.10 23(e)[0:Inp] || collection(U) -> in(V,U) equal(count(add(V,U)),plus(count(U),1))**.
% 0.84/1.10 39[0:ThA] || -> less(U,plus(U,1))*.
% 0.84/1.10 61[0:ArS:11.0] || lesseq(count(add(skc4,skc3)),plus(count(skc3),1))* -> .
% 0.84/1.10 62[0:TOC:61.0] || -> less(plus(count(skc3),1),count(add(skc4,skc3)))*.
% 0.84/1.10 74(e)[0:Res:4.0,23.0] || -> in(U,skc3) equal(count(add(U,skc3)),plus(count(skc3),1))**.
% 0.84/1.10 78(e)[0:Res:4.0,21.0] || in(U,skc3) -> equal(count(add(U,skc3)),count(skc3))**.
% 0.84/1.10 153[0:SpR:78.1,62.0] || in(skc4,skc3) -> less(plus(count(skc3),1),count(skc3))*.
% 0.84/1.10 158[0:OCE:153.1,39.0] || in(skc4,skc3)* -> .
% 0.84/1.10 218[0:SpR:74.1,62.0] || -> in(skc4,skc3) less(plus(count(skc3),1),plus(count(skc3),1))*.
% 0.84/1.10 224[0:MRR:218.0,158.0] || -> less(plus(count(skc3),1),plus(count(skc3),1))*.
% 0.84/1.10 313(e)[0:OCE:224.0,224.0] || -> .
% 0.84/1.10
% 0.84/1.10 % SZS output end CNFRefutation for /tmp/SPASST_12122_n015.cluster.edu
% 0.84/1.10
% 0.84/1.10 Formulae used in the proof : fof_collection_type fof_ax3 fof_ax4 fof_ax6
% 0.84/1.10
% 0.84/1.10 SPASS+T ended
%------------------------------------------------------------------------------