TSTP Solution File: ARI613_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : ARI613_1 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n021.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:46:37 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 9 unt; 3 typ; 0 def)
% Number of atoms : 69 ( 9 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 77 ( 31 ~; 21 |; 15 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 109 ( 19 atm; 17 fun; 34 num; 39 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 6 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 0 usr; 5 con; 0-2 aty)
% Number of variables : 39 ( 33 !; 6 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_1,type,
p: $int > $o ).
tff(pred_def_2,type,
q: $int > $o ).
tff(pred_def_4,type,
sQ0_eqProxy: ( $int * $int ) > $o ).
tff(f58,plain,
$false,
inference(evaluation,[],[f53]) ).
tff(f53,plain,
~ $less(-4,1),
inference(unit_resulting_resolution,[],[f52,f21]) ).
tff(f21,plain,
! [X0: $int] :
( ~ $less(X0,1)
| q(X0) ),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
( ! [X0: $int] :
( ~ $less(X0,1)
| q(X0) )
& ! [X1: $int] :
( ~ $less(3,X1)
| p(X1) )
& ! [X2: $int,X3: $int] :
( ~ p(X3)
| ~ q(X2)
| ( 0 != $sum(X3,X2) ) ) ),
inference(rectify,[],[f17]) ).
tff(f17,plain,
( ! [X1: $int] :
( ~ $less(X1,1)
| q(X1) )
& ! [X0: $int] :
( ~ $less(3,X0)
| p(X0) )
& ! [X2: $int,X3: $int] :
( ~ p(X3)
| ~ q(X2)
| ( 0 != $sum(X3,X2) ) ) ),
inference(flattening,[],[f16]) ).
tff(f16,plain,
( ! [X2: $int,X3: $int] :
( ~ p(X3)
| ~ q(X2)
| ( 0 != $sum(X3,X2) ) )
& ! [X0: $int] :
( ~ $less(3,X0)
| p(X0) )
& ! [X1: $int] :
( ~ $less(X1,1)
| q(X1) ) ),
inference(ennf_transformation,[],[f15]) ).
tff(f15,plain,
~ ( ( ! [X0: $int] :
( $less(3,X0)
=> p(X0) )
& ! [X1: $int] :
( $less(X1,1)
=> q(X1) ) )
=> ? [X2: $int,X3: $int] :
( q(X2)
& ( 0 = $sum(X3,X2) )
& p(X3) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( ! [X0: $int] :
( $less(3,X0)
=> p(X0) )
& ! [X0: $int] :
( $less(X0,1)
=> q(X0) ) )
=> ? [X1: $int,X0: $int] :
( ( $sum(X0,X1) = 0 )
& q(X1)
& p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ( ! [X0: $int] :
( $less(3,X0)
=> p(X0) )
& ! [X0: $int] :
( $less(X0,1)
=> q(X0) ) )
=> ? [X1: $int,X0: $int] :
( ( $sum(X0,X1) = 0 )
& q(X1)
& p(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',interv_3_infty_and_neginfty_1_contain_compl) ).
tff(f52,plain,
~ q(-4),
inference(evaluation,[],[f46]) ).
tff(f46,plain,
~ q($uminus(4)),
inference(unit_resulting_resolution,[],[f44,f41]) ).
tff(f41,plain,
! [X0: $int] :
( ~ q($uminus(X0))
| ~ p(X0) ),
inference(resolution,[],[f26,f28]) ).
tff(f28,plain,
! [X0: $int] : sQ0_eqProxy(0,$sum(X0,$uminus(X0))),
inference(equality_proxy_replacement,[],[f7,f22]) ).
tff(f22,plain,
! [X0: $int,X1: $int] :
( sQ0_eqProxy(X0,X1)
<=> ( X0 = X1 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ0_eqProxy])]) ).
tff(f7,plain,
! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
introduced(theory_axiom_145,[]) ).
tff(f26,plain,
! [X2: $int,X3: $int] :
( ~ sQ0_eqProxy(0,$sum(X3,X2))
| ~ q(X2)
| ~ p(X3) ),
inference(equality_proxy_replacement,[],[f19,f22]) ).
tff(f19,plain,
! [X2: $int,X3: $int] :
( ~ p(X3)
| ~ q(X2)
| ( 0 != $sum(X3,X2) ) ),
inference(cnf_transformation,[],[f18]) ).
tff(f44,plain,
p(4),
inference(evaluation,[],[f43]) ).
tff(f43,plain,
p($sum(3,1)),
inference(unit_resulting_resolution,[],[f8,f40]) ).
tff(f40,plain,
! [X0: $int] :
( p($sum(X0,1))
| $less(X0,3) ),
inference(resolution,[],[f20,f12]) ).
tff(f12,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_152,[]) ).
tff(f20,plain,
! [X1: $int] :
( ~ $less(3,X1)
| p(X1) ),
inference(cnf_transformation,[],[f18]) ).
tff(f8,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_147,[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : ARI613=1 : TPTP v8.1.0. Released v5.1.0.
% 0.10/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 29 15:47:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.49 % (12633)lrs+1010_1:1_aac=none:bce=on:nicw=on:nm=0:plsq=on:plsql=on:sac=on:sos=on:sp=frequency:spb=units:to=lpo:i=34:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/34Mi)
% 0.19/0.49 % (12658)lrs+1_3:1_ep=RSTC:sos=on:urr=on:i=43:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/43Mi)
% 0.19/0.50 % (12648)lrs+10_1:1_ev=force:gve=cautious:tha=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.50 % (12650)lrs+10_1:1_ss=axioms:st=5.0:tha=off:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.50 % (12642)lrs+10_1:1_canc=force:tha=some:to=lpo:i=35:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/35Mi)
% 0.19/0.50 % (12644)lrs+10_1:1_ep=R:gve=force:plsq=on:plsqr=32,1:uwa=one_side_interpreted:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.50 % (12644)Instruction limit reached!
% 0.19/0.50 % (12644)------------------------------
% 0.19/0.50 % (12644)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (12644)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (12644)Termination reason: Unknown
% 0.19/0.50 % (12644)Termination phase: Saturation
% 0.19/0.50
% 0.19/0.50 % (12644)Memory used [KB]: 895
% 0.19/0.50 % (12644)Time elapsed: 0.002 s
% 0.19/0.50 % (12644)Instructions burned: 2 (million)
% 0.19/0.50 % (12644)------------------------------
% 0.19/0.50 % (12644)------------------------------
% 0.19/0.51 % (12640)lrs+1010_1:1_ep=RST:s2a=on:s2at=5.0:sos=all:i=26:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/26Mi)
% 0.19/0.51 % (12658)First to succeed.
% 0.19/0.51 % (12650)Refutation not found, incomplete strategy% (12650)------------------------------
% 0.19/0.51 % (12650)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (12658)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (12658)------------------------------
% 0.19/0.52 % (12658)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (12658)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (12658)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (12658)Memory used [KB]: 5500
% 0.19/0.52 % (12658)Time elapsed: 0.116 s
% 0.19/0.52 % (12658)Instructions burned: 2 (million)
% 0.19/0.52 % (12658)------------------------------
% 0.19/0.52 % (12658)------------------------------
% 0.19/0.52 % (12631)Success in time 0.172 s
%------------------------------------------------------------------------------