TSTP Solution File: SWW006_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : SWW006_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n021.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 : Thu Jul 21 01:29:27 EDT 2022
% Result : Theorem 2.00s 2.14s
% Output : Refutation 2.00s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW006_1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/0.13 % Command : spasst-tptp-script %s %d
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 6 00:00:05 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.48 % Using integer theory
% 2.00/2.14
% 2.00/2.14
% 2.00/2.14 % SZS status Theorem for /tmp/SPASST_13076_n021.cluster.edu
% 2.00/2.14
% 2.00/2.14 SPASS V 2.2.22 in combination with yices.
% 2.00/2.14 SPASS beiseite: Proof found by SPASS.
% 2.00/2.14 Problem: /tmp/SPASST_13076_n021.cluster.edu
% 2.00/2.14 SPASS derived 300 clauses, backtracked 18 clauses and kept 192 clauses.
% 2.00/2.14 SPASS backtracked 5 times (0 times due to theory inconsistency).
% 2.00/2.14 SPASS allocated 7182 KBytes.
% 2.00/2.14 SPASS spent 0:00:00.18 on the problem.
% 2.00/2.14 0:00:00.01 for the input.
% 2.00/2.14 0:00:00.06 for the FLOTTER CNF translation.
% 2.00/2.14 0:00:00.01 for inferences.
% 2.00/2.14 0:00:00.00 for the backtracking.
% 2.00/2.14 0:00:00.08 for the reduction.
% 2.00/2.14 0:00:00.01 for interacting with the SMT procedure.
% 2.00/2.14
% 2.00/2.14
% 2.00/2.14 % SZS output start CNFRefutation for /tmp/SPASST_13076_n021.cluster.edu
% 2.00/2.14
% 2.00/2.14 % Here is a proof with depth 5, length 47 :
% 2.00/2.14 8[0:Inp] || -> less(z2,z1)*.
% 2.00/2.14 13[0:Inp] || equal(z2,z1)** -> .
% 2.00/2.14 14[0:Inp] || equal(z3,z1)** -> .
% 2.00/2.14 17[0:Inp] || equal(z3,z2)** -> .
% 2.00/2.14 23[0:Inp] || -> equal(a(z1),5)**.
% 2.00/2.14 24[0:Inp] || -> equal(a(z2),10)**.
% 2.00/2.14 25[0:Inp] || -> equal(a(z3),6)**.
% 2.00/2.14 27[0:Inp] || -> equal(b(z1),5)**.
% 2.00/2.14 28[0:Inp] || -> less(b(z2),3)*.
% 2.00/2.14 29[0:Inp] || -> equal(b(z3),2)**.
% 2.00/2.14 73[0:Inp] || equal(b(U),2)** equal(a(U),8) equal(a(V),10) less(b(V),3)* less(V,W)* equal(a(W),5) -> equal(V,U)* equal(W,U)* equal(W,V).
% 2.00/2.14 81[0:Inp] || equal(b(U),2)** equal(a(U),6) equal(a(V),10) less(b(V),3)* less(V,W)* equal(b(W),5) equal(a(W),5) -> equal(V,U)* equal(W,U)* equal(W,V).
% 2.00/2.14 191[0:TOC:73.4] || equal(a(U),5)+ equal(a(V),10) equal(a(W),8) equal(b(W),2)** -> equal(U,V) equal(U,W)* equal(V,W)* lesseq(U,V)* lesseq(3,b(V))*.
% 2.00/2.14 199[0:TOC:81.4] || equal(b(U),5)+ equal(a(U),5) equal(a(V),10) equal(a(W),6) equal(b(W),2)** -> equal(U,V) equal(U,W)* equal(V,W)* lesseq(U,V)* lesseq(3,b(V))*.
% 2.00/2.14 530[0:SpL:23.0,191.0] || equal(5,5) equal(a(U),10) equal(a(V),8) equal(b(V),2)** -> equal(z1,U) equal(z1,V) equal(U,V)* lesseq(z1,U) lesseq(3,b(U))*.
% 2.00/2.14 531[0:ArS:530.0] || equal(a(U),10)+ equal(a(V),8) equal(b(V),2)** -> equal(z1,U) equal(z1,V) equal(U,V)* lesseq(z1,U) lesseq(3,b(U))*.
% 2.00/2.14 537[0:SpL:24.0,531.0] || equal(10,10) equal(a(U),8) equal(b(U),2)** -> equal(z2,z1) equal(z1,U) equal(z2,U) lesseq(z1,z2) lesseq(3,b(z2))*.
% 2.00/2.14 540[0:ArS:537.0] || equal(a(U),8) equal(b(U),2)** -> equal(z2,z1) equal(z1,U) equal(z2,U) lesseq(z1,z2) lesseq(3,b(z2))*.
% 2.00/2.14 541(e)[0:MRR:540.2,13.0] || equal(a(U),8) equal(b(U),2)** -> equal(z1,U) equal(z2,U) lesseq(z1,z2) lesseq(3,b(z2))*.
% 2.00/2.14 552[1:Spt:541.4] || -> lesseq(z1,z2)*.
% 2.00/2.14 555(e)[1:OCE:552.0,8.0] || -> .
% 2.00/2.14 558[1:Spt:555.0,541.4,552.0] || lesseq(z1,z2)* -> .
% 2.00/2.14 559(e)[1:Spt:555.0,541.0,541.1,541.2,541.3,541.5] || equal(a(U),8) equal(b(U),2)** -> equal(z1,U) equal(z2,U) lesseq(3,b(z2))*.
% 2.00/2.14 562[2:Spt:559.4] || -> lesseq(3,b(z2))*.
% 2.00/2.14 565(e)[2:OCE:562.0,28.0] || -> .
% 2.00/2.14 570[2:Spt:565.0,559.4,562.0] || lesseq(3,b(z2))* -> .
% 2.00/2.14 571[2:Spt:565.0,559.0,559.1,559.2,559.3] || equal(a(U),8) equal(b(U),2)** -> equal(z1,U) equal(z2,U).
% 2.00/2.14 896[0:SpL:27.0,199.0] || equal(5,5) equal(a(z1),5) equal(a(U),10) equal(a(V),6) equal(b(V),2)** -> equal(z1,U) equal(z1,V) equal(U,V)* lesseq(z1,U) lesseq(3,b(U))*.
% 2.00/2.14 897[0:ArS:896.0] || equal(a(z1),5) equal(a(U),10) equal(a(V),6) equal(b(V),2)** -> equal(z1,U) equal(z1,V) equal(U,V)* lesseq(z1,U) lesseq(3,b(U))*.
% 2.00/2.14 898[0:Rew:23.0,897.0] || equal(5,5) equal(a(U),10) equal(a(V),6) equal(b(V),2)** -> equal(z1,U) equal(z1,V) equal(U,V)* lesseq(z1,U) lesseq(3,b(U))*.
% 2.00/2.14 899[0:ArS:898.0] || equal(a(U),10)+ equal(a(V),6) equal(b(V),2)** -> equal(z1,U) equal(z1,V) equal(U,V)* lesseq(z1,U) lesseq(3,b(U))*.
% 2.00/2.14 904[0:SpL:24.0,899.0] || equal(10,10) equal(a(U),6) equal(b(U),2)** -> equal(z2,z1) equal(z1,U) equal(z2,U) lesseq(z1,z2) lesseq(3,b(z2))*.
% 2.00/2.14 907[0:ArS:904.0] || equal(a(U),6) equal(b(U),2)** -> equal(z2,z1) equal(z1,U) equal(z2,U) lesseq(z1,z2) lesseq(3,b(z2))*.
% 2.00/2.14 908(e)[0:MRR:907.2,13.0] || equal(a(U),6) equal(b(U),2)** -> equal(z1,U) equal(z2,U) lesseq(z1,z2) lesseq(3,b(z2))*.
% 2.00/2.14 911[3:Spt:908.4] || -> lesseq(z1,z2)*.
% 2.00/2.14 914(e)[3:OCE:911.0,8.0] || -> .
% 2.00/2.14 917[3:Spt:914.0,908.4,911.0] || lesseq(z1,z2)* -> .
% 2.00/2.14 918(e)[3:Spt:914.0,908.0,908.1,908.2,908.3,908.5] || equal(a(U),6) equal(b(U),2)** -> equal(z1,U) equal(z2,U) lesseq(3,b(z2))*.
% 2.00/2.14 920[4:Spt:918.4] || -> lesseq(3,b(z2))*.
% 2.00/2.14 923(e)[4:OCE:920.0,28.0] || -> .
% 2.00/2.14 928[4:Spt:923.0,918.4,920.0] || lesseq(3,b(z2))* -> .
% 2.00/2.14 929[4:Spt:923.0,918.0,918.1,918.2,918.3] || equal(a(U),6) equal(b(U),2)** -> equal(z1,U) equal(z2,U).
% 2.00/2.14 932[4:SpL:29.0,929.1] || equal(a(z3),6)** equal(2,2) -> equal(z3,z1) equal(z3,z2).
% 2.00/2.14 937[4:ArS:932.1] || equal(a(z3),6)** -> equal(z3,z1) equal(z3,z2).
% 2.00/2.14 938[4:Rew:25.0,937.0] || equal(6,6) -> equal(z3,z1) equal(z3,z2)**.
% 2.00/2.14 939[4:ArS:938.0] || -> equal(z3,z1) equal(z3,z2)**.
% 2.00/2.14 940(e)[4:MRR:939.0,939.1,14.0,17.0] || -> .
% 2.00/2.14
% 2.00/2.14 % SZS output end CNFRefutation for /tmp/SPASST_13076_n021.cluster.edu
% 2.00/2.14
% 2.00/2.14 Formulae used in the proof : fof_z1_type fof_0
% 2.00/2.17
% 2.00/2.17 SPASS+T ended
%------------------------------------------------------------------------------