TSTP Solution File: SYO524_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : SYO524_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n020.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 19:59:43 EDT 2022
% Result : Theorem 1.97s 1.63s
% Output : Refutation 1.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYO524_1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/0.12 % Command : spasst-tptp-script %s %d
% 0.12/0.33 % Computer : n020.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 8 20:43:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 % Using integer theory
% 1.97/1.63
% 1.97/1.63
% 1.97/1.63 % SZS status Theorem for /tmp/SPASST_11930_n020.cluster.edu
% 1.97/1.63
% 1.97/1.63 SPASS V 2.2.22 in combination with yices.
% 1.97/1.63 SPASS beiseite: Proof found by SMT.
% 1.97/1.63 Problem: /tmp/SPASST_11930_n020.cluster.edu
% 1.97/1.63 SPASS derived 5548 clauses, backtracked 0 clauses and kept 1224 clauses.
% 1.97/1.63 SPASS backtracked 1 times (1 times due to theory inconsistency).
% 1.97/1.63 SPASS allocated 12815 KBytes.
% 1.97/1.63 SPASS spent 0:00:00.67 on the problem.
% 1.97/1.63 0:00:00.00 for the input.
% 1.97/1.63 0:00:00.00 for the FLOTTER CNF translation.
% 1.97/1.63 0:00:00.06 for inferences.
% 1.97/1.63 0:00:00.01 for the backtracking.
% 1.97/1.63 0:00:00.54 for the reduction.
% 1.97/1.63 0:00:00.05 for interacting with the SMT procedure.
% 1.97/1.63
% 1.97/1.63
% 1.97/1.63 % SZS output start CNFRefutation for /tmp/SPASST_11930_n020.cluster.edu
% 1.97/1.63
% 1.97/1.63 % Here is a proof with depth 4, length 18 :
% 1.97/1.63 2[0:Inp] || -> lesseq(f(7),3)*.
% 1.97/1.63 3[0:Inp] || lesseq(f(4),3)* -> .
% 1.97/1.63 4[0:Inp] || equal(U,plus(V,1))*+ equal(W,plus(V,2))* -> lesseq(f(U),f(W))*.
% 1.97/1.63 8[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**.
% 1.97/1.63 36[0:TOC:3.0] || -> less(3,f(4))*.
% 1.97/1.63 39[0:EqR:4.0] || equal(U,plus(V,2)) -> lesseq(f(plus(V,1)),f(U))*.
% 1.97/1.63 42[0:SpL:8.0,4.0] || equal(U,V)* equal(W,plus(plus(V,uminus(1)),2))* -> lesseq(f(U),f(W))*.
% 1.97/1.63 45[0:ArS:42.1] || equal(U,V)* equal(W,plus(V,1))*+ -> lesseq(f(U),f(W))*.
% 1.97/1.63 48[0:SpR:8.0,39.1] || equal(U,plus(plus(V,uminus(1)),2)) -> lesseq(f(V),f(U))*.
% 1.97/1.63 55[0:ArS:48.0] || equal(U,plus(V,1)) -> lesseq(f(V),f(U))*.
% 1.97/1.63 86[0:OCh:55.1,2.0] || equal(plus(U,1),7) -> lesseq(f(U),3)*.
% 1.97/1.63 93[0:ArS:86.0] || equal(U,6) -> lesseq(f(U),3)*.
% 1.97/1.63 183[0:SpL:8.0,45.1] || equal(U,plus(V,uminus(1)))* equal(W,V)* -> lesseq(f(U),f(W))*.
% 1.97/1.63 185[0:ArS:183.0] || equal(U,plus(V,-1))*+ equal(W,V)* -> lesseq(f(U),f(W))*.
% 1.97/1.63 378[0:EqR:185.0] || equal(U,V) -> lesseq(f(plus(V,-1)),f(U))*.
% 1.97/1.63 381[0:SpL:8.0,185.0] || equal(U,V)* equal(W,plus(V,uminus(-1)))* -> lesseq(f(U),f(W))*.
% 1.97/1.63 400(e)[0:OCh:378.1,93.1] || equal(U,V)* equal(U,6)* -> lesseq(f(plus(V,-1)),3)*.
% 1.97/1.63 9145(e)[0:ThR:400,381,36] || -> .
% 1.97/1.63
% 1.97/1.63 % SZS output end CNFRefutation for /tmp/SPASST_11930_n020.cluster.edu
% 1.97/1.63
% 1.97/1.63 Formulae used in the proof : fof_f_type fof_co1
% 2.15/1.82
% 2.15/1.82 SPASS+T ended
%------------------------------------------------------------------------------