TSTP Solution File: ARI647_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : ARI647_1 : TPTP v8.1.0. Released v6.3.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 : n026.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:48:50 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 40 ( 22 unt; 4 typ; 0 def)
% Number of atoms : 55 ( 28 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 45 ( 26 ~; 18 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 204 ( 26 atm; 63 fun; 89 num; 26 var)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 7 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 1 usr; 7 con; 0-2 aty)
% Number of variables : 26 ( 26 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
a: $int ).
tff(pred_def_3,type,
sQ0_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_4,type,
sQ1_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_5,type,
sQ2_eqProxy: ( $real * $real ) > $o ).
tff(f415,plain,
$false,
inference(evaluation,[],[f411]) ).
tff(f411,plain,
$less(1,$sum(3,$product(-2,1))),
inference(backward_demodulation,[],[f271,f300]) ).
tff(f300,plain,
a = 1,
inference(trivial_inequality_removal,[],[f296]) ).
tff(f296,plain,
( ( a = 1 )
| ( 3 != 3 ) ),
inference(superposition,[],[f237,f26]) ).
tff(f26,plain,
! [X0: $int] : ( $product(X0,1) = X0 ),
inference(literal_reordering,[],[f17]) ).
tff(f17,plain,
! [X0: $int] : ( $product(X0,1) = X0 ),
introduced(theory_axiom_142,[]) ).
tff(f237,plain,
! [X0: $int] :
( ( 3 != $product(3,X0) )
| ( a = X0 ) ),
inference(evaluation,[],[f224]) ).
tff(f224,plain,
! [X0: $int] :
( ( 3 = 0 )
| ( a = X0 )
| ( 3 != $product(3,X0) ) ),
inference(superposition,[],[f39,f35]) ).
tff(f35,plain,
3 = $product(3,a),
inference(literal_reordering,[],[f23]) ).
tff(f23,plain,
3 = $product(3,a),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
( ~ $less($product(-1,$product(2,a)),-1)
& ( 3 = $product(3,a) ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ( ( 3 != $product(3,a) )
| $less($product(-1,$product(2,a)),-1) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( 3 != $product(3,a) )
| ~ $lesseq(-1,$product(-1,$product(2,a))) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ( 3 != $product(3,a) )
| ~ $lesseq(-1,$product(-1,$product(2,a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
tff(f39,plain,
! [X2: $int,X3: $int,X0: $int] :
( ( $product(X0,X3) != $product(X0,X2) )
| ( 0 = X0 )
| ( X2 = X3 ) ),
inference(literal_reordering,[],[f25]) ).
tff(f25,plain,
! [X2: $int,X3: $int,X0: $int] :
( ( X2 = X3 )
| ( $product(X0,X3) != $product(X0,X2) )
| ( 0 = X0 ) ),
inference(equality_resolution,[],[f20]) ).
tff(f20,plain,
! [X2: $int,X3: $int,X0: $int,X1: $int] :
( ( 0 = X0 )
| ( $product(X0,X3) != X1 )
| ( X2 = X3 )
| ( $product(X0,X2) != X1 ) ),
introduced(theory_axiom_156,[]) ).
tff(f271,plain,
$less(1,$sum(3,$product(-2,a))),
inference(evaluation,[],[f270]) ).
tff(f270,plain,
$less(1,$sum($sum(2,$product(-2,a)),1)),
inference(resolution,[],[f174,f36]) ).
tff(f36,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,$sum(X0,1)) ),
inference(literal_reordering,[],[f13]) ).
tff(f13,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_152,[]) ).
tff(f174,plain,
~ $less($sum(2,$product(-2,a)),1),
inference(evaluation,[],[f173]) ).
tff(f173,plain,
~ $less($sum(2,$product(-2,a)),$sum(0,1)),
inference(resolution,[],[f170,f28]) ).
tff(f28,plain,
! [X0: $int,X1: $int] :
( ~ $less(X0,X1)
| ~ $less(X1,$sum(X0,1)) ),
inference(literal_reordering,[],[f21]) ).
tff(f21,plain,
! [X0: $int,X1: $int] :
( ~ $less(X0,X1)
| ~ $less(X1,$sum(X0,1)) ),
introduced(theory_axiom_166,[]) ).
tff(f170,plain,
$less(0,$sum(2,$product(-2,a))),
inference(evaluation,[],[f169]) ).
tff(f169,plain,
$less(0,$sum($sum(1,$product(-2,a)),1)),
inference(resolution,[],[f148,f36]) ).
tff(f148,plain,
~ $less($sum(1,$product(-2,a)),0),
inference(evaluation,[],[f147]) ).
tff(f147,plain,
~ $less($sum(1,$product(-2,a)),$sum(-1,1)),
inference(resolution,[],[f118,f28]) ).
tff(f118,plain,
$less(-1,$sum(1,$product(-2,a))),
inference(forward_demodulation,[],[f112,f32]) ).
tff(f32,plain,
! [X0: $int,X1: $int] : ( $sum(X1,X0) = $sum(X0,X1) ),
inference(literal_reordering,[],[f4]) ).
tff(f4,plain,
! [X0: $int,X1: $int] : ( $sum(X1,X0) = $sum(X0,X1) ),
introduced(theory_axiom_140,[]) ).
tff(f112,plain,
$less(-1,$sum($product(-2,a),1)),
inference(resolution,[],[f36,f83]) ).
tff(f83,plain,
~ $less($product(-2,a),-1),
inference(evaluation,[],[f29]) ).
tff(f29,plain,
~ $less($product(-1,$product(2,a)),-1),
inference(literal_reordering,[],[f24]) ).
tff(f24,plain,
~ $less($product(-1,$product(2,a)),-1),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ARI647=1 : TPTP v8.1.0. Released v6.3.0.
% 0.06/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.12/0.35 % Computer : n026.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Mon Aug 29 16:07:20 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.45 % (25623)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.45 % (25623)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.20/0.45 % (25623)Terminated due to inappropriate strategy.
% 0.20/0.45 % (25623)------------------------------
% 0.20/0.45 % (25623)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.45 % (25623)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.45 % (25623)Termination reason: Inappropriate
% 0.20/0.45
% 0.20/0.45 % (25623)Memory used [KB]: 895
% 0.20/0.45 % (25623)Time elapsed: 0.002 s
% 0.20/0.45 % (25623)Instructions burned: 2 (million)
% 0.20/0.45 % (25623)------------------------------
% 0.20/0.45 % (25623)------------------------------
% 0.20/0.46 % (25639)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.20/0.46 % (25631)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.20/0.49 % (25631)First to succeed.
% 0.20/0.49 % (25631)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Theorem for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49 % (25631)------------------------------
% 0.20/0.49 % (25631)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (25631)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (25631)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (25631)Memory used [KB]: 6012
% 0.20/0.49 % (25631)Time elapsed: 0.024 s
% 0.20/0.49 % (25631)Instructions burned: 21 (million)
% 0.20/0.49 % (25631)------------------------------
% 0.20/0.49 % (25631)------------------------------
% 0.20/0.49 % (25616)Success in time 0.131 s
%------------------------------------------------------------------------------