TSTP Solution File: ARI621_2 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI621_2 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n027.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.42s 1.01s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ARI621_2 : TPTP v8.1.0. Released v5.1.0.
% 0.06/0.12 % Command : spasst-tptp-script %s %d
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Fri Jun 17 11:55:06 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.46 % Using rational theory
% 0.42/1.01
% 0.42/1.01
% 0.42/1.01 % SZS status Theorem for /tmp/SPASST_26892_n027.cluster.edu
% 0.42/1.01
% 0.42/1.01 SPASS V 2.2.22 in combination with yices.
% 0.42/1.01 SPASS beiseite: Proof found by SMT.
% 0.42/1.01 Problem: /tmp/SPASST_26892_n027.cluster.edu
% 0.42/1.01 SPASS derived 129 clauses, backtracked 0 clauses and kept 59 clauses.
% 0.42/1.01 SPASS backtracked 1 times (1 times due to theory inconsistency).
% 0.42/1.01 SPASS allocated 6357 KBytes.
% 0.42/1.01 SPASS spent 0:00:00.02 on the problem.
% 0.42/1.01 0:00:00.00 for the input.
% 0.42/1.01 0:00:00.00 for the FLOTTER CNF translation.
% 0.42/1.01 0:00:00.00 for inferences.
% 0.42/1.01 0:00:00.00 for the backtracking.
% 0.42/1.01 0:00:00.01 for the reduction.
% 0.42/1.01 0:00:00.00 for interacting with the SMT procedure.
% 0.42/1.01
% 0.42/1.01
% 0.42/1.01 % SZS output start CNFRefutation for /tmp/SPASST_26892_n027.cluster.edu
% 0.42/1.01
% 0.42/1.01 % Here is a proof with depth 0, length 5 :
% 0.42/1.01 1[0:Inp] || -> pow2(12)*.
% 0.42/1.01 2[0:Inp] || -> pow2(skf1(U))*.
% 0.42/1.01 4[0:Inp] || pow2(U) -> equal(U,1) lesseq(2,U)*.
% 0.42/1.01 5[0:Inp] || pow2(U) -> equal(U,1) equal(times(2,skf1(U)),U)**.
% 0.42/1.01 242(e)[0:ThR:5,4,2,1] || -> .
% 0.42/1.01
% 0.42/1.01 % SZS output end CNFRefutation for /tmp/SPASST_26892_n027.cluster.edu
% 0.42/1.01
% 0.42/1.01 Formulae used in the proof : fof_not_pow_of_2_10
% 0.42/1.01
% 0.42/1.01 SPASS+T ended
%------------------------------------------------------------------------------