TSTP Solution File: DAT051_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT051_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n006.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:58 EDT 2022
% Result : Theorem 0.82s 1.09s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT051_1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/0.12 % Command : spasst-tptp-script %s %d
% 0.12/0.33 % Computer : n006.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 19:13:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.46 % Using integer theory
% 0.82/1.09
% 0.82/1.09
% 0.82/1.09 % SZS status Theorem for /tmp/SPASST_8399_n006.cluster.edu
% 0.82/1.09
% 0.82/1.09 SPASS V 2.2.22 in combination with yices.
% 0.82/1.09 SPASS beiseite: Proof found by SPASS and SMT.
% 0.82/1.09 Problem: /tmp/SPASST_8399_n006.cluster.edu
% 0.82/1.09 SPASS derived 226 clauses, backtracked 11 clauses and kept 142 clauses.
% 0.82/1.09 SPASS backtracked 2 times (1 times due to theory inconsistency).
% 0.82/1.09 SPASS allocated 6460 KBytes.
% 0.82/1.09 SPASS spent 0:00:00.03 on the problem.
% 0.82/1.09 0:00:00.00 for the input.
% 0.82/1.09 0:00:00.00 for the FLOTTER CNF translation.
% 0.82/1.09 0:00:00.00 for inferences.
% 0.82/1.09 0:00:00.00 for the backtracking.
% 0.82/1.09 0:00:00.01 for the reduction.
% 0.82/1.09 0:00:00.00 for interacting with the SMT procedure.
% 0.82/1.09
% 0.82/1.09
% 0.82/1.09 % SZS output start CNFRefutation for /tmp/SPASST_8399_n006.cluster.edu
% 0.82/1.09
% 0.82/1.09 % Here is a proof with depth 0, length 12 :
% 0.82/1.09 4[0:Inp] || -> record(skc2)*.
% 0.82/1.09 5[0:Inp] || -> isrecord(skc2)*.
% 0.82/1.09 6[0:Inp] || -> isrecord(next(skc2))*.
% 0.82/1.09 8[0:Inp] || record(U) -> record(split2(U))*.
% 0.82/1.09 10[0:Inp] || record(U) -> record(next(U))*.
% 0.82/1.09 15[0:Inp] || equal(times(2,length(split2(skc2))),length(skc2))** -> .
% 0.82/1.09 18[0:Inp] || equal(times(2,length(split2(skc2))),minus(length(skc2),1))** -> .
% 0.82/1.09 20(e)[0:Inp] || record(U) isrecord(U) isrecord(next(U))* -> isrecord(split2(U)).
% 0.82/1.09 22(e)[0:Inp] || record(U) isrecord(U) -> equal(plus(length(next(U)),1),length(U))**.
% 0.82/1.09 24(e)[0:Inp] || record(U) isrecord(U) isrecord(next(U)) -> equal(split2(next(next(U))),next(split2(U)))**.
% 0.82/1.09 26[0:Inp] || -> equal(times(2,length(split2(next(next(skc2))))),length(next(next(skc2)))) equal(times(2,length(split2(next(next(skc2))))),minus(length(next(next(skc2))),1))**.
% 0.82/1.09 445(e)[0:ThR:26,24,22,20,18,15,10,8,6,5,4] || -> .
% 0.82/1.09
% 0.82/1.09 % SZS output end CNFRefutation for /tmp/SPASST_8399_n006.cluster.edu
% 0.82/1.09
% 0.82/1.09 Formulae used in the proof : fof_record_type fof_co1 fof_split1_type fof_ax1 fof_ax2 fof_ax6 fof_ax7 fof_ax12 fof_ax8
% 0.82/1.09
% 0.82/1.09 SPASS+T ended
%------------------------------------------------------------------------------