TSTP Solution File: DAT007_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT007_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n023.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:44 EDT 2022
% Result : Theorem 0.41s 1.02s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : DAT007_1 : TPTP v8.1.0. Released v5.0.0.
% 0.10/0.12 % Command : spasst-tptp-script %s %d
% 0.12/0.32 % Computer : n023.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.17/0.32 % CPULimit : 300
% 0.17/0.32 % WCLimit : 600
% 0.17/0.32 % DateTime : Fri Jul 1 18:00:58 EDT 2022
% 0.17/0.32 % CPUTime :
% 0.17/0.45 % Using integer theory
% 0.41/1.02
% 0.41/1.02
% 0.41/1.02 % SZS status Theorem for /tmp/SPASST_14263_n023.cluster.edu
% 0.41/1.02
% 0.41/1.02 SPASS V 2.2.22 in combination with yices.
% 0.41/1.02 SPASS beiseite: Proof found by SPASS.
% 0.41/1.02 Problem: /tmp/SPASST_14263_n023.cluster.edu
% 0.41/1.02 SPASS derived 36 clauses, backtracked 0 clauses and kept 53 clauses.
% 0.41/1.02 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.41/1.02 SPASS allocated 6314 KBytes.
% 0.41/1.02 SPASS spent 0:00:00.02 on the problem.
% 0.41/1.02 0:00:00.00 for the input.
% 0.41/1.02 0:00:00.00 for the FLOTTER CNF translation.
% 0.41/1.02 0:00:00.00 for inferences.
% 0.41/1.02 0:00:00.00 for the backtracking.
% 0.41/1.02 0:00:00.01 for the reduction.
% 0.41/1.02 0:00:00.00 for interacting with the SMT procedure.
% 0.41/1.02
% 0.41/1.02
% 0.41/1.02 % SZS output start CNFRefutation for /tmp/SPASST_14263_n023.cluster.edu
% 0.41/1.02
% 0.41/1.02 % Here is a proof with depth 5, length 23 :
% 0.41/1.02 3[0:Inp] || -> array(skc2)*.
% 0.41/1.02 4[0:Inp] || array(U) -> array(write(U,V,W))*.
% 0.41/1.02 5[0:Inp] || array(U) -> equal(read(write(U,V,W),V),W)**.
% 0.41/1.02 7[0:Inp] || array(U) -> equal(V,W) equal(read(write(U,V,X),W),read(U,W))**.
% 0.41/1.02 8[0:Inp] || less(30,read(write(write(write(write(skc2,3,33),4,444),5,55),4,44),U)) less(read(write(write(write(write(skc2,3,33),4,444),5,55),4,44),U),40)* -> .
% 0.41/1.02 40[0:TOC:8.1] || -> lesseq(40,read(write(write(write(write(skc2,3,33),4,444),5,55),4,44),U))* lesseq(read(write(write(write(write(skc2,3,33),4,444),5,55),4,44),U),30).
% 0.41/1.02 42[0:Res:3.0,5.0] || -> equal(read(write(skc2,U,V),U),V)**.
% 0.41/1.02 43[0:Res:3.0,4.0] || -> array(write(skc2,U,V))*.
% 0.41/1.02 65[0:SpR:7.2,40.0] || array(write(write(write(skc2,3,33),4,444),5,55)) -> equal(4,U) lesseq(40,read(write(write(write(skc2,3,33),4,444),5,55),U)) lesseq(read(write(write(write(write(skc2,3,33),4,444),5,55),4,44),U),30)*.
% 0.41/1.02 69[0:Rew:7.2,65.3] || array(write(write(write(skc2,3,33),4,444),5,55)) -> equal(4,U) lesseq(40,read(write(write(write(skc2,3,33),4,444),5,55),U))* lesseq(read(write(write(write(skc2,3,33),4,444),5,55),U),30).
% 0.41/1.02 71[0:SpR:7.2,69.2] || array(write(write(skc2,3,33),4,444)) array(write(write(write(skc2,3,33),4,444),5,55)) -> equal(5,U) equal(4,U) lesseq(40,read(write(write(skc2,3,33),4,444),U)) lesseq(read(write(write(write(skc2,3,33),4,444),5,55),U),30)*.
% 0.41/1.02 75[0:Rew:7.2,71.5] || array(write(write(skc2,3,33),4,444)) array(write(write(write(skc2,3,33),4,444),5,55))* -> equal(5,U) equal(4,U) lesseq(40,read(write(write(skc2,3,33),4,444),U))* lesseq(read(write(write(skc2,3,33),4,444),U),30).
% 0.41/1.02 76[0:MRR:75.1,4.1] || array(write(write(skc2,3,33),4,444)) -> equal(5,U) equal(4,U) lesseq(40,read(write(write(skc2,3,33),4,444),U))* lesseq(read(write(write(skc2,3,33),4,444),U),30).
% 0.41/1.02 78[0:SpR:7.2,76.3] || array(write(skc2,3,33)) array(write(write(skc2,3,33),4,444)) -> equal(4,U) equal(5,U) equal(4,U) lesseq(40,read(write(skc2,3,33),U)) lesseq(read(write(write(skc2,3,33),4,444),U),30)*.
% 0.41/1.02 82[0:Obv:78.2] || array(write(skc2,3,33)) array(write(write(skc2,3,33),4,444)) -> equal(5,U) equal(4,U) lesseq(40,read(write(skc2,3,33),U)) lesseq(read(write(write(skc2,3,33),4,444),U),30)*.
% 0.41/1.02 83[0:Rew:7.2,82.5] || array(write(skc2,3,33)) array(write(write(skc2,3,33),4,444))* -> equal(5,U) equal(4,U) lesseq(40,read(write(skc2,3,33),U))* lesseq(read(write(skc2,3,33),U),30).
% 0.41/1.02 84[0:MRR:83.0,43.0] || array(write(write(skc2,3,33),4,444))*+ -> equal(5,U) equal(4,U) lesseq(40,read(write(skc2,3,33),U))* lesseq(read(write(skc2,3,33),U),30).
% 0.41/1.02 85[0:Res:4.1,84.0] || array(write(skc2,3,33)) -> equal(5,U) equal(4,U) lesseq(40,read(write(skc2,3,33),U))* lesseq(read(write(skc2,3,33),U),30).
% 0.41/1.02 86[0:MRR:85.0,43.0] || -> equal(5,U) equal(4,U) lesseq(40,read(write(skc2,3,33),U))* lesseq(read(write(skc2,3,33),U),30).
% 0.41/1.02 95[0:SpR:42.0,86.2] || -> equal(5,3) equal(4,3) lesseq(40,33) lesseq(read(write(skc2,3,33),3),30)*.
% 0.41/1.02 101[0:ArS:95.2] || -> lesseq(read(write(skc2,3,33),3),30)*.
% 0.41/1.02 102[0:Rew:42.0,101.0] || -> lesseq(33,30)*.
% 0.41/1.02 103(e)[0:ArS:102.0] || -> .
% 0.41/1.02
% 0.41/1.02 % SZS output end CNFRefutation for /tmp/SPASST_14263_n023.cluster.edu
% 0.41/1.02
% 0.41/1.02 Formulae used in the proof : fof_array_type fof_co1 fof_write_type fof_ax2
% 0.74/1.03
% 0.74/1.03 SPASS+T ended
%------------------------------------------------------------------------------