TSTP Solution File: DAT021_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT021_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n025.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.04s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : DAT021_1 : TPTP v8.1.0. Released v5.0.0.
% 0.06/0.12 % Command : spasst-tptp-script %s %d
% 0.12/0.32 % Computer : n025.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Fri Jul 1 17:13:54 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.45 % Using integer theory
% 0.43/1.04
% 0.43/1.04
% 0.43/1.04 % SZS status Theorem for /tmp/SPASST_27093_n025.cluster.edu
% 0.43/1.04
% 0.43/1.04 SPASS V 2.2.22 in combination with yices.
% 0.43/1.04 SPASS beiseite: Proof found by SPASS and SMT.
% 0.43/1.04 Problem: /tmp/SPASST_27093_n025.cluster.edu
% 0.43/1.04 SPASS derived 119 clauses, backtracked 55 clauses and kept 176 clauses.
% 0.43/1.04 SPASS backtracked 6 times (1 times due to theory inconsistency).
% 0.43/1.04 SPASS allocated 6341 KBytes.
% 0.43/1.04 SPASS spent 0:00:00.03 on the problem.
% 0.43/1.04 0:00:00.00 for the input.
% 0.43/1.04 0:00:00.00 for the FLOTTER CNF translation.
% 0.43/1.04 0:00:00.00 for inferences.
% 0.43/1.04 0:00:00.00 for the backtracking.
% 0.43/1.04 0:00:00.01 for the reduction.
% 0.43/1.04 0:00:00.00 for interacting with the SMT procedure.
% 0.43/1.04
% 0.43/1.04
% 0.43/1.04 % SZS output start CNFRefutation for /tmp/SPASST_27093_n025.cluster.edu
% 0.43/1.04
% 0.43/1.04 % Here is a proof with depth 0, length 9 :
% 0.43/1.04 1[0:Inp] || -> collection(empty)*.
% 0.43/1.04 3[0:Inp] || in(U,empty)* -> .
% 0.43/1.04 4[0:Inp] || equal(skc4,skc3)** -> .
% 0.43/1.04 5[0:Inp] || less(plus(skc4,skc3),9)* -> .
% 0.43/1.04 7[0:Inp] || collection(U) -> collection(add(V,U))*.
% 0.43/1.04 11(e)[0:Inp] || -> in(skc4,add(5,add(3,add(1,empty))))*.
% 0.43/1.04 12[0:Inp] || -> in(skc3,add(5,add(3,add(1,empty))))*.
% 0.43/1.04 18[0:Inp] || collection(U) in(V,add(W,U))* -> equal(V,W) in(V,U).
% 0.43/1.04 260(e)[0:ThR:18,12,11,7,5,4,3,1] || -> .
% 0.43/1.04
% 0.43/1.04 % SZS output end CNFRefutation for /tmp/SPASST_27093_n025.cluster.edu
% 0.43/1.04
% 0.43/1.04 Formulae used in the proof : fof_collection_type fof_ax1 fof_co1 fof_remove_type fof_ax3 fof_ax5
% 0.43/1.04
% 0.43/1.04 SPASS+T ended
%------------------------------------------------------------------------------