TSTP Solution File: ARI588_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI588_1 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n004.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:13 EDT 2022
% Result : Theorem 0.88s 1.14s
% Output : Refutation 0.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI588_1 : TPTP v8.1.0. Released v5.1.0.
% 0.03/0.13 % Command : spasst-tptp-script %s %d
% 0.13/0.34 % Computer : n004.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:48:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48 % Using integer theory
% 0.88/1.14
% 0.88/1.14
% 0.88/1.14 % SZS status Theorem for /tmp/SPASST_20561_n004.cluster.edu
% 0.88/1.14
% 0.88/1.14 SPASS V 2.2.22 in combination with yices.
% 0.88/1.14 SPASS beiseite: Proof found by SPASS and SMT.
% 0.88/1.14 Problem: /tmp/SPASST_20561_n004.cluster.edu
% 0.88/1.14 SPASS derived 757 clauses, backtracked 20 clauses and kept 222 clauses.
% 0.88/1.14 SPASS backtracked 5 times (1 times due to theory inconsistency).
% 0.88/1.14 SPASS allocated 7116 KBytes.
% 0.88/1.14 SPASS spent 0:00:00.12 on the problem.
% 0.88/1.14 0:00:00.00 for the input.
% 0.88/1.14 0:00:00.00 for the FLOTTER CNF translation.
% 0.88/1.14 0:00:00.02 for inferences.
% 0.88/1.14 0:00:00.00 for the backtracking.
% 0.88/1.14 0:00:00.08 for the reduction.
% 0.88/1.14 0:00:00.01 for interacting with the SMT procedure.
% 0.88/1.14
% 0.88/1.14
% 0.88/1.14 % SZS output start CNFRefutation for /tmp/SPASST_20561_n004.cluster.edu
% 0.88/1.14
% 0.88/1.14 % Here is a proof with depth 6, length 30 :
% 0.88/1.14 1[0:Inp] || less(skf1(U),plus(U,-1)) -> lesseq(plus(3,uminus(U)),skf1(U))*.
% 0.88/1.14 2[0:Inp] || lesseq(plus(3,uminus(U)),skf1(U))* -> less(skf1(U),plus(U,-1)).
% 0.88/1.14 3[0:ThA] || -> equal(uminus(uminus(U)),U)**.
% 0.88/1.14 6[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**.
% 0.88/1.14 10[0:ThA] || -> equal(plus(U,0),U)**.
% 0.88/1.14 34[0:ArS:2.0] || lesseq(plus(uminus(U),3),skf1(U))* -> less(skf1(U),plus(U,-1)).
% 0.88/1.14 35[0:TOC:34.0] || -> less(skf1(U),plus(U,-1)) less(skf1(U),plus(uminus(U),3))*.
% 0.88/1.14 36[0:ArS:1.1] || less(skf1(U),plus(U,-1)) -> lesseq(plus(uminus(U),3),skf1(U))*.
% 0.88/1.14 37[0:TOC:36.0] || -> lesseq(plus(U,-1),skf1(U)) lesseq(plus(uminus(U),3),skf1(U))*.
% 0.88/1.14 38[0:SpR:3.0,37.1] || -> lesseq(plus(uminus(U),-1),skf1(uminus(U)))* lesseq(plus(U,3),skf1(uminus(U))).
% 0.88/1.14 56[0:OCE:35.1,37.1] || -> less(skf1(U),plus(U,-1)) lesseq(plus(U,-1),skf1(U))*.
% 0.88/1.14 106[0:SpR:6.0,56.1] || -> less(skf1(plus(U,uminus(-1))),plus(plus(U,uminus(-1)),-1))* lesseq(U,skf1(plus(U,uminus(-1)))).
% 0.88/1.14 109[0:OCh:56.1,35.1] || -> less(skf1(U),plus(U,-1))* less(skf1(U),plus(U,-1))* less(plus(U,-1),plus(uminus(U),3)).
% 0.88/1.14 115[0:ArS:106.1] || -> less(skf1(plus(U,1)),plus(U,0))* lesseq(U,skf1(plus(U,1))).
% 0.88/1.14 116[0:Rew:10.0,115.0] || -> less(skf1(plus(U,1)),U) lesseq(U,skf1(plus(U,1)))*.
% 0.88/1.14 117[0:Obv:109.0] || -> less(skf1(U),plus(U,-1))* less(plus(U,-1),plus(uminus(U),3)).
% 0.88/1.14 257[0:OCh:116.1,35.1] || -> less(skf1(plus(U,1)),U) less(skf1(plus(U,1)),plus(plus(U,1),-1))* less(U,plus(uminus(plus(U,1)),3)).
% 0.88/1.14 266[0:ArS:257.1] || -> less(skf1(plus(U,1)),U) less(skf1(plus(U,1)),plus(U,0))* less(U,plus(uminus(plus(U,1)),3)).
% 0.88/1.14 267[0:Rew:10.0,266.1] || -> less(skf1(plus(U,1)),U)* less(skf1(plus(U,1)),U)* less(U,plus(uminus(plus(U,1)),3)).
% 0.88/1.14 268[0:Obv:267.0] || -> less(skf1(plus(U,1)),U)* less(U,plus(uminus(plus(U,1)),3)).
% 0.88/1.14 276[0:OCE:117.0,38.0] || -> less(plus(uminus(U),-1),plus(uminus(uminus(U)),3)) lesseq(plus(U,3),skf1(uminus(U)))*.
% 0.88/1.14 286[0:Rew:3.0,276.0] || -> less(plus(uminus(U),-1),plus(U,3)) lesseq(plus(U,3),skf1(uminus(U)))*.
% 0.88/1.14 391[0:SpR:3.0,286.1] || -> less(plus(uminus(uminus(U)),-1),plus(uminus(U),3)) lesseq(plus(uminus(U),3),skf1(U))*.
% 0.88/1.14 404[0:Rew:3.0,391.0] || -> less(plus(U,-1),plus(uminus(U),3)) lesseq(plus(uminus(U),3),skf1(U))*.
% 0.88/1.14 459[0:OCh:404.1,268.0] || -> less(plus(plus(U,1),-1),plus(uminus(plus(U,1)),3))* less(U,plus(uminus(plus(U,1)),3)) less(plus(uminus(plus(U,1)),3),U).
% 0.88/1.14 473[0:ArS:459.0] || -> less(plus(U,0),plus(uminus(plus(U,1)),3))* less(U,plus(uminus(plus(U,1)),3)) less(plus(uminus(plus(U,1)),3),U).
% 0.88/1.15 474[0:Rew:10.0,473.0] || -> less(U,plus(uminus(plus(U,1)),3)) less(U,plus(uminus(plus(U,1)),3)) less(plus(uminus(plus(U,1)),3),U)*.
% 0.88/1.15 475[0:Obv:474.0] || -> less(U,plus(uminus(plus(U,1)),3)) less(plus(uminus(plus(U,1)),3),U)*.
% 0.88/1.15 604[0:SpR:6.0,475.1] || -> less(plus(U,uminus(1)),plus(uminus(plus(plus(U,uminus(1)),1)),3))* less(plus(uminus(U),3),plus(U,uminus(1))).
% 0.88/1.15 1432(e)[0:ThR:604] || -> .
% 0.88/1.15
% 0.88/1.15 % SZS output end CNFRefutation for /tmp/SPASST_20561_n004.cluster.edu
% 0.88/1.15
% 0.88/1.15 Formulae used in the proof : fof_exists_X_complementary_halflines
% 0.88/1.15
% 0.88/1.15 SPASS+T ended
%------------------------------------------------------------------------------