TSTP Solution File: NUM893_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NUM893_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 : n011.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 18:07:08 EDT 2022
% Result : Theorem 0.20s 0.57s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 48 ( 47 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 52 ( 22 ~; 14 |; 11 &)
% ( 4 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 120 ( 0 atm; 75 fun; 8 num; 37 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 : 4 ( 0 usr; 1 con; 0-2 aty)
% Number of variables : 37 ( 25 !; 12 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
tff(f127,plain,
$false,
inference(subsumption_resolution,[],[f126,f59]) ).
tff(f59,plain,
! [X0: $int] : ( $sum(0,X0) = X0 ),
inference(superposition,[],[f6,f4]) ).
tff(f4,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_140,[]) ).
tff(f6,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(theory_axiom_142,[]) ).
tff(f126,plain,
! [X0: $int] : ( $sum(0,X0) != X0 ),
inference(subsumption_resolution,[],[f122,f6]) ).
tff(f122,plain,
! [X0: $int] :
( ( $sum(X0,0) != X0 )
| ( $sum(0,X0) != X0 ) ),
inference(evaluation,[],[f109]) ).
tff(f109,plain,
! [X0: $int] :
( ( $sum(0,X0) != X0 )
| ( $sum(X0,$uminus(0)) != X0 ) ),
inference(superposition,[],[f24,f8]) ).
tff(f8,plain,
! [X0: $int] : ( $sum(X0,$uminus(X0)) = 0 ),
introduced(theory_axiom_145,[]) ).
tff(f24,plain,
! [X2: $int,X1: $int] :
( ( $sum(X2,$uminus($sum(X2,$uminus(X1)))) != X1 )
| ( $sum($sum(X2,$uminus(X1)),X1) != X2 ) ),
inference(equality_resolution,[],[f23]) ).
tff(f23,plain,
! [X2: $int,X0: $int,X1: $int] :
( ( $sum(X2,$uminus(X1)) != X0 )
| ( $sum(X2,$uminus(X0)) != X1 )
| ( $sum(X0,X1) != X2 ) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
! [X0: $int,X1: $int,X2: $int] :
( ( ( $sum(X2,$uminus(X1)) != X0 )
| ( $sum(X2,$uminus(X0)) != X1 )
| ( $sum(X0,X1) != X2 ) )
& ( ( ( $sum(X2,$uminus(X1)) = X0 )
& ( $sum(X2,$uminus(X0)) = X1 ) )
| ( $sum(X0,X1) = X2 ) ) ),
inference(rectify,[],[f19]) ).
tff(f19,plain,
! [X2: $int,X0: $int,X1: $int] :
( ( ( $sum(X1,$uminus(X0)) != X2 )
| ( $sum(X1,$uminus(X2)) != X0 )
| ( $sum(X2,X0) != X1 ) )
& ( ( ( $sum(X1,$uminus(X0)) = X2 )
& ( $sum(X1,$uminus(X2)) = X0 ) )
| ( $sum(X2,X0) = X1 ) ) ),
inference(flattening,[],[f18]) ).
tff(f18,plain,
! [X2: $int,X0: $int,X1: $int] :
( ( ( $sum(X1,$uminus(X0)) != X2 )
| ( $sum(X1,$uminus(X2)) != X0 )
| ( $sum(X2,X0) != X1 ) )
& ( ( ( $sum(X1,$uminus(X0)) = X2 )
& ( $sum(X1,$uminus(X2)) = X0 ) )
| ( $sum(X2,X0) = X1 ) ) ),
inference(nnf_transformation,[],[f17]) ).
tff(f17,plain,
! [X2: $int,X0: $int,X1: $int] :
( ( $sum(X2,X0) = X1 )
<~> ( ( $sum(X1,$uminus(X0)) = X2 )
& ( $sum(X1,$uminus(X2)) = X0 ) ) ),
inference(ennf_transformation,[],[f16]) ).
tff(f16,plain,
~ ? [X1: $int,X0: $int,X2: $int] :
( ( ( $sum(X1,$uminus(X0)) = X2 )
& ( $sum(X1,$uminus(X2)) = X0 ) )
<=> ( $sum(X2,X0) = X1 ) ),
inference(rectify,[],[f3]) ).
tff(f3,plain,
~ ? [X1: $int,X2: $int,X0: $int] :
( ( $sum(X0,X1) = X2 )
<=> ( ( $sum(X2,$uminus(X1)) = X0 )
& ( $sum(X2,$uminus(X0)) = X1 ) ) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ? [X1: $int,X2: $int,X0: $int] :
( ( $sum(X0,X1) = X2 )
<=> ( ( $difference(X2,X1) = X0 )
& ( $difference(X2,X0) = X1 ) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
? [X1: $int,X2: $int,X0: $int] :
( ( $sum(X0,X1) = X2 )
<=> ( ( $difference(X2,X1) = X0 )
& ( $difference(X2,X0) = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_same_as_difference) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM893=1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/0.14 % 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.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 09:10:55 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.55 % (27810)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.55 % (27810)First to succeed.
% 0.20/0.56 % (27834)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/177Mi)
% 0.20/0.57 % (27826)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.57 % (27810)Refutation found. Thanks to Tanya!
% 0.20/0.57 % SZS status Theorem for theBenchmark
% 0.20/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.57 % (27810)------------------------------
% 0.20/0.57 % (27810)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57 % (27810)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57 % (27810)Termination reason: Refutation
% 0.20/0.57
% 0.20/0.57 % (27810)Memory used [KB]: 5500
% 0.20/0.57 % (27810)Time elapsed: 0.133 s
% 0.20/0.57 % (27810)Instructions burned: 9 (million)
% 0.20/0.57 % (27810)------------------------------
% 0.20/0.57 % (27810)------------------------------
% 0.20/0.57 % (27801)Success in time 0.213 s
%------------------------------------------------------------------------------