TSTP Solution File: ARI079_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : ARI079_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n001.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 : 300s
% DateTime : Wed Aug 31 15:47:23 EDT 2022
% Result : Theorem 0.20s 0.54s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 22 ( 0 atm; 7 fun; 1 num; 14 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 0 usr; 1 con; 0-2 aty)
% Number of variables : 14 ( 8 !; 6 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
tff(f20,plain,
$false,
inference(trivial_inequality_removal,[],[f19]) ).
tff(f19,plain,
! [X0: $int] : ( X0 != X0 ),
inference(superposition,[],[f18,f5]) ).
tff(f5,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(theory_axiom_142,[]) ).
tff(f18,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) != X0 ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) != X0 ),
inference(rectify,[],[f16]) ).
tff(f16,plain,
! [X1: $int,X0: $int] : ( $sum(X1,X0) != X1 ),
inference(ennf_transformation,[],[f15]) ).
tff(f15,plain,
~ ? [X0: $int,X1: $int] : ( $sum(X1,X0) = X1 ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ? [X1: $int,X0: $int] : ( $sum(X0,X1) = X0 ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
? [X1: $int,X0: $int] : ( $sum(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_something_anotherthing_firstthing) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI079=1 : TPTP v8.1.0. Released v5.0.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n001.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 : 300
% 0.13/0.34 % DateTime : Mon Aug 29 15:41:44 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.20/0.52 % (24484)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.53 % (24491)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.53 % (24491)First to succeed.
% 0.20/0.54 % (24491)Refutation found. Thanks to Tanya!
% 0.20/0.54 % SZS status Theorem for theBenchmark
% 0.20/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.54 % (24491)------------------------------
% 0.20/0.54 % (24491)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (24491)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (24491)Termination reason: Refutation
% 0.20/0.54
% 0.20/0.54 % (24491)Memory used [KB]: 5373
% 0.20/0.54 % (24491)Time elapsed: 0.109 s
% 0.20/0.54 % (24491)Instructions burned: 2 (million)
% 0.20/0.54 % (24491)------------------------------
% 0.20/0.54 % (24491)------------------------------
% 0.20/0.54 % (24480)Success in time 0.187 s
%------------------------------------------------------------------------------