TSTP Solution File: ARI620_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI620_1 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n003.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:22 EDT 2022
% Result : Theorem 0.45s 1.01s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ARI620_1 : TPTP v8.1.0. Released v5.1.0.
% 0.11/0.12 % Command : spasst-tptp-script %s %d
% 0.13/0.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jun 17 13:54:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 % Using integer theory
% 0.45/1.01
% 0.45/1.01
% 0.45/1.01 % SZS status Theorem for /tmp/SPASST_19339_n003.cluster.edu
% 0.45/1.01
% 0.45/1.01 SPASS V 2.2.22 in combination with yices.
% 0.45/1.01 SPASS beiseite: Proof found by SPASS.
% 0.45/1.01 Problem: /tmp/SPASST_19339_n003.cluster.edu
% 0.45/1.01 SPASS derived 41 clauses, backtracked 0 clauses and kept 52 clauses.
% 0.45/1.01 SPASS backtracked 1 times (0 times due to theory inconsistency).
% 0.45/1.01 SPASS allocated 6257 KBytes.
% 0.45/1.01 SPASS spent 0:00:00.01 on the problem.
% 0.45/1.01 0:00:00.00 for the input.
% 0.45/1.01 0:00:00.00 for the FLOTTER CNF translation.
% 0.45/1.01 0:00:00.00 for inferences.
% 0.45/1.01 0:00:00.00 for the backtracking.
% 0.45/1.01 0:00:00.00 for the reduction.
% 0.45/1.01 0:00:00.00 for interacting with the SMT procedure.
% 0.45/1.01
% 0.45/1.01
% 0.45/1.01 % SZS output start CNFRefutation for /tmp/SPASST_19339_n003.cluster.edu
% 0.45/1.01
% 0.45/1.01 % Here is a proof with depth 3, length 19 :
% 0.45/1.01 1[0:Inp] || pow2(8)* -> .
% 0.45/1.01 2[0:Inp] || equal(U,1) -> pow2(U)*.
% 0.45/1.01 6[0:Inp] || pow2(U)* equal(times(2,U),V)* lesseq(2,V)* -> pow2(V).
% 0.45/1.01 17[0:ThA] || -> less(U,plus(U,1))*.
% 0.45/1.01 25[0:ThA] || -> equal(times(U,1),U)**.
% 0.45/1.01 38[0:TOC:6.2] || pow2(U)* equal(times(2,U),V)*+ -> pow2(V) less(V,2)*.
% 0.45/1.01 40[0:Res:38.3,1.0] || pow2(U)* equal(times(2,U),8) -> less(8,2)*.
% 0.45/1.01 45[0:ArS:40.2] || pow2(U)* equal(U,4) -> .
% 0.45/1.01 77[0:EqR:38.1] || pow2(U) -> pow2(times(2,U)) less(times(2,U),2)*.
% 0.45/1.01 82[0:ArS:77.2] || pow2(U) -> pow2(times(2,U))* less(U,1).
% 0.45/1.01 86[0:SpR:25.0,82.1] || pow2(1) -> pow2(2) less(1,1)*.
% 0.45/1.01 89[0:Res:82.1,45.0] || pow2(U) equal(times(2,U),4) -> less(U,1)*.
% 0.45/1.01 91[0:ArS:86.2] || pow2(1) -> pow2(2)*.
% 0.45/1.01 93[0:ArS:89.1] || pow2(U) equal(U,2) -> less(U,1)*.
% 0.45/1.01 97[0:OCE:93.2,17.0] || pow2(plus(1,1))* equal(plus(1,1),2) -> .
% 0.45/1.01 102[0:ArS:97.1] || pow2(2)* -> .
% 0.45/1.01 103[0:MRR:91.1,102.0] || pow2(1)* -> .
% 0.45/1.01 107[0:Res:2.1,103.0] || equal(1,1)* -> .
% 0.45/1.01 108(e)[0:ArS:107.0] || -> .
% 0.45/1.01
% 0.45/1.01 % SZS output end CNFRefutation for /tmp/SPASST_19339_n003.cluster.edu
% 0.45/1.01
% 0.45/1.01 Formulae used in the proof : fof_pow_of_2_8
% 0.76/1.03
% 0.76/1.03 SPASS+T ended
%------------------------------------------------------------------------------