TSTP Solution File: ARI646_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI646_1 : TPTP v8.1.0. Released v6.3.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n028.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:28 EDT 2022
% Result : Theorem 0.45s 1.04s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : ARI646_1 : TPTP v8.1.0. Released v6.3.0.
% 0.11/0.13 % Command : spasst-tptp-script %s %d
% 0.13/0.34 % Computer : n028.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 13:43:13 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48 % Using integer theory
% 0.45/1.04
% 0.45/1.04
% 0.45/1.04 % SZS status Theorem for /tmp/SPASST_8588_n028.cluster.edu
% 0.45/1.04
% 0.45/1.04 SPASS V 2.2.22 in combination with yices.
% 0.45/1.04 SPASS beiseite: Proof found by SMT.
% 0.45/1.04 Problem: /tmp/SPASST_8588_n028.cluster.edu
% 0.45/1.04 SPASS derived 0 clauses, backtracked 0 clauses and kept 44 clauses.
% 0.45/1.04 SPASS backtracked 1 times (1 times due to theory inconsistency).
% 0.45/1.04 SPASS allocated 6235 KBytes.
% 0.45/1.04 SPASS spent 0:00:00.01 on the problem.
% 0.45/1.04 0:00:00.00 for the input.
% 0.45/1.04 0:00:00.00 for the FLOTTER CNF translation.
% 0.45/1.04 0:00:00.00 for inferences.
% 0.45/1.04 0:00:00.00 for the backtracking.
% 0.45/1.04 0:00:00.00 for the reduction.
% 0.45/1.04 0:00:00.00 for interacting with the SMT procedure.
% 0.45/1.04
% 0.45/1.04
% 0.45/1.04 % SZS output start CNFRefutation for /tmp/SPASST_8588_n028.cluster.edu
% 0.45/1.04
% 0.45/1.04 % Here is a proof with depth 0, length 13 :
% 0.45/1.04 2[0:Inp] || equal(a,0) lesseq(0,a)* greater(10,a) -> .
% 0.45/1.04 3[0:Inp] || equal(a,1) lesseq(0,a)* greater(10,a) -> .
% 0.45/1.04 4[0:Inp] || equal(a,2) lesseq(0,a)* greater(10,a) -> .
% 0.45/1.04 5[0:Inp] || equal(a,3) lesseq(0,a)* greater(10,a) -> .
% 0.45/1.04 6[0:Inp] || equal(a,4) lesseq(0,a)* greater(10,a) -> .
% 0.45/1.04 7[0:Inp] || equal(a,5) lesseq(0,a)* greater(10,a) -> .
% 0.45/1.04 8[0:Inp] || equal(a,6) lesseq(0,a)* greater(10,a) -> .
% 0.45/1.04 9[0:Inp] || equal(a,7) lesseq(0,a)* greater(10,a) -> .
% 0.45/1.04 10[0:Inp] || equal(a,8) lesseq(0,a)* greater(10,a) -> .
% 0.45/1.04 11[0:Inp] || equal(a,9) lesseq(0,a)* greater(10,a) -> .
% 0.45/1.04 12[0:Inp] || -> equal(a,0) equal(a,1) equal(a,2) equal(a,3) equal(a,4) equal(a,5) equal(a,6) equal(a,7) equal(a,8) equal(a,9) greater(10,a)*.
% 0.45/1.04 13(e)[0:Inp] || -> lesseq(0,a)* equal(a,9) equal(a,8) equal(a,7) equal(a,6) equal(a,5) equal(a,4) equal(a,3) equal(a,2) equal(a,1) equal(a,0).
% 0.45/1.04 66(e)[0:ThR:13,12,11,10,9,8,7,6,5,4,3,2] || -> .
% 0.45/1.04
% 0.45/1.04 % SZS output end CNFRefutation for /tmp/SPASST_8588_n028.cluster.edu
% 0.45/1.04
% 0.45/1.04 Formulae used in the proof : fof_a_type fof_conj
% 0.45/1.04
% 0.45/1.04 SPASS+T ended
%------------------------------------------------------------------------------