TSTP Solution File: ARI734_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI734_1 : TPTP v8.1.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n013.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 14 22:18:49 EDT 2022
% Result : Theorem 1.13s 1.32s
% Output : Refutation 1.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : ARI734_1 : TPTP v8.1.0. Released v6.4.0.
% 0.04/0.13 % Command : spasst-tptp-script %s %d
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 14:25:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.48 % Using integer theory
% 1.13/1.32
% 1.13/1.32
% 1.13/1.32 % SZS status Theorem for /tmp/SPASST_20901_n013.cluster.edu
% 1.13/1.32
% 1.13/1.32 SPASS V 2.2.22 in combination with yices.
% 1.13/1.32 SPASS beiseite: Proof found by SPASS and SMT.
% 1.13/1.32 Problem: /tmp/SPASST_20901_n013.cluster.edu
% 1.13/1.32 SPASS derived 33 clauses, backtracked 5 clauses and kept 56 clauses.
% 1.13/1.32 SPASS backtracked 2 times (1 times due to theory inconsistency).
% 1.13/1.32 SPASS allocated 6296 KBytes.
% 1.13/1.32 SPASS spent 0:00:00.30 on the problem.
% 1.13/1.32 0:00:00.00 for the input.
% 1.13/1.32 0:00:00.00 for the FLOTTER CNF translation.
% 1.13/1.32 0:00:00.00 for inferences.
% 1.13/1.32 0:00:00.00 for the backtracking.
% 1.13/1.32 0:00:00.01 for the reduction.
% 1.13/1.32 0:00:00.29 for interacting with the SMT procedure.
% 1.13/1.32
% 1.13/1.32
% 1.13/1.32 % SZS output start CNFRefutation for /tmp/SPASST_20901_n013.cluster.edu
% 1.13/1.32
% 1.13/1.32 % Here is a proof with depth 2, length 27 :
% 1.13/1.32 1[0:Inp] || -> greatereq(skc1,0)*.
% 1.13/1.32 2[0:Inp] || -> SkP0(U,V)* equal(V,0).
% 1.13/1.32 3[0:Inp] || equal(U,0) -> SkP0(U,V)*.
% 1.13/1.32 4[0:Inp] || equal(U,times(2,skc1)) SkP0(U,skc1)* equal(skc1,0) equal(V,times(2,W))* equal(W,minus(skc1,1))* -> .
% 1.13/1.32 5[0:Inp] || equal(U,times(2,skc1)) SkP0(U,skc1)* equal(U,plus(V,2))* equal(V,times(2,W))* equal(W,minus(skc1,1))* -> .
% 1.13/1.32 7[0:ThA] || -> equal(plus(U,plus(uminus(U),V)),V)**.
% 1.13/1.32 9[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**.
% 1.13/1.32 18[0:ThA] || -> equal(U,V) less(V,U)* less(U,V)*.
% 1.13/1.32 37[0:ArS:1.0] || -> lesseq(0,skc1)*.
% 1.13/1.32 38[0:ArS:4.4] || equal(U,times(2,skc1)) SkP0(U,skc1)* equal(skc1,0) equal(V,times(2,W))* equal(W,plus(skc1,-1))* -> .
% 1.13/1.32 39[0:AED:38.3] || SkP0(U,skc1)* equal(V,plus(skc1,-1))* equal(U,times(2,skc1)) equal(skc1,0) -> .
% 1.13/1.32 40[0:ArS:5.4] || SkP0(U,skc1)* equal(U,plus(V,2))*+ equal(V,times(2,W))* equal(W,plus(skc1,-1))* equal(U,times(2,skc1)) -> .
% 1.13/1.32 41(e)[0:OCE:37.0,18.1] || -> equal(skc1,0) less(0,skc1)*.
% 1.13/1.32 43(e)[1:Spt:41.0] || -> equal(skc1,0)**.
% 1.13/1.32 46[1:Rew:43.0,39.2] || SkP0(U,skc1)* equal(V,plus(skc1,-1))* equal(U,times(2,0)) equal(skc1,0) -> .
% 1.13/1.32 48[1:ArS:46.2] || SkP0(U,skc1)* equal(V,plus(skc1,-1))* equal(U,0) equal(skc1,0) -> .
% 1.13/1.32 49[1:AED:48.1] || SkP0(U,skc1)* equal(U,0) equal(skc1,0) -> .
% 1.13/1.32 50[1:Rew:43.0,49.2,43.0,49.0] || SkP0(U,0)* equal(U,0) equal(0,0) -> .
% 1.13/1.32 51[1:ArS:50.2] || SkP0(U,0)* equal(U,0) -> .
% 1.13/1.32 52[1:MRR:51.0,3.1] || equal(U,0)* -> .
% 1.13/1.32 53(e)[1:UnC:52.0,7.0] || -> .
% 1.13/1.32 58[1:Spt:53.0,41.0,43.0] || equal(skc1,0)** -> .
% 1.13/1.32 59[1:Spt:53.0,41.1] || -> less(0,skc1)*.
% 1.13/1.32 68[0:SpL:9.0,40.1] || SkP0(U,skc1)* equal(U,V)* equal(plus(V,uminus(2)),times(2,W))* equal(W,plus(skc1,-1))* equal(U,times(2,skc1)) -> .
% 1.13/1.32 72[0:ArS:68.2] || SkP0(U,skc1)* equal(U,V)* equal(plus(V,-2),times(2,W))*+ equal(W,plus(skc1,-1))* equal(U,times(2,skc1)) -> .
% 1.13/1.32 101[0:SpL:9.0,72.2] || SkP0(U,skc1)* equal(U,plus(V,uminus(-2)))* equal(V,times(2,W))* equal(W,plus(skc1,-1))* equal(U,times(2,skc1)) -> .
% 1.13/1.32 112[1:ThR:58,101,2] || -> .
% 1.13/1.32
% 1.13/1.32 % SZS output end CNFRefutation for /tmp/SPASST_20901_n013.cluster.edu
% 1.13/1.32
% 1.13/1.32 Formulae used in the proof : fof_formula
% 1.13/1.32
% 1.13/1.32 SPASS+T ended
%------------------------------------------------------------------------------