TSTP Solution File: ARI615_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI615_1 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n014.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:20 EDT 2022
% Result : Theorem 0.74s 1.05s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 6
% Syntax : Number of clauses : 7 ( 4 unt; 0 nHn; 7 RR)
% Number of literals : 11 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
lesseq(skc4,skc5),
file('ARI615=1.p',unknown),
[] ).
cnf(2,axiom,
p(skc7,skc6,skc4),
file('ARI615=1.p',unknown),
[] ).
cnf(3,axiom,
~ p(skc7,skc6,skc5),
file('ARI615=1.p',unknown),
[] ).
cnf(4,axiom,
( ~ p(U,V,W)
| lesseq(U,plus(V,W)) ),
file('ARI615=1.p',unknown),
[] ).
cnf(5,axiom,
( ~ p(U,V,W)
| lesseq(plus(V,uminus(W)),U) ),
file('ARI615=1.p',unknown),
[] ).
cnf(6,axiom,
( ~ lesseq(U,plus(V,W))
| ~ lesseq(plus(V,uminus(W)),U)
| p(U,V,W) ),
file('ARI615=1.p',unknown),
[] ).
cnf(343,plain,
$false,
inference(thr,[status(thm)],[6,5,4,3,2,1]),
[iquote('0:ThR:6,5,4,3,2,1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI615_1 : TPTP v8.1.0. Released v5.1.0.
% 0.12/0.13 % Command : spasst-tptp-script %s %d
% 0.13/0.34 % Computer : n014.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:50:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48 % Using integer theory
% 0.74/1.05
% 0.74/1.05
% 0.74/1.05 % SZS status Theorem for /tmp/SPASST_16903_n014.cluster.edu
% 0.74/1.05
% 0.74/1.05 SPASS V 2.2.22 in combination with yices.
% 0.74/1.05 SPASS beiseite: Proof found by SPASS and SMT.
% 0.74/1.05 Problem: /tmp/SPASST_16903_n014.cluster.edu
% 0.74/1.05 SPASS derived 196 clauses, backtracked 5 clauses and kept 160 clauses.
% 0.74/1.05 SPASS backtracked 2 times (1 times due to theory inconsistency).
% 0.74/1.05 SPASS allocated 6424 KBytes.
% 0.74/1.05 SPASS spent 0:00:00.03 on the problem.
% 0.74/1.05 0:00:00.00 for the input.
% 0.74/1.05 0:00:00.00 for the FLOTTER CNF translation.
% 0.74/1.05 0:00:00.00 for inferences.
% 0.74/1.05 0:00:00.00 for the backtracking.
% 0.74/1.05 0:00:00.01 for the reduction.
% 0.74/1.05 0:00:00.00 for interacting with the SMT procedure.
% 0.74/1.05
% 0.74/1.05
% 0.74/1.05 % SZS output start CNFRefutation for /tmp/SPASST_16903_n014.cluster.edu
% See solution above
% 0.74/1.05
% 0.74/1.05 Formulae used in the proof : fof_interv_with_smaller_radius_contained
% 0.74/1.05
% 0.74/1.05 SPASS+T ended
%------------------------------------------------------------------------------