TSTP Solution File: NUM900_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : NUM900_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_uns --cores 0 -t %d %s
% 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 : 300s
% DateTime : Wed Aug 31 18:02:49 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 36 ( 17 unt; 3 typ; 0 def)
% Number of atoms : 63 ( 17 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 52 ( 22 ~; 9 |; 16 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 149 ( 45 atm; 36 fun; 27 num; 41 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 3 usr; 5 con; 0-2 aty)
% Number of variables : 41 ( 29 !; 12 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_5,type,
sK0: $int ).
tff(func_def_6,type,
sK1: $int ).
tff(func_def_7,type,
sK2: $int ).
tff(f119,plain,
$false,
inference(evaluation,[],[f108]) ).
tff(f108,plain,
$less(1,$sum(1,0)),
inference(backward_demodulation,[],[f38,f102]) ).
tff(f102,plain,
0 = sK0,
inference(forward_demodulation,[],[f85,f8]) ).
tff(f8,plain,
! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
introduced(theory_axiom_145,[]) ).
tff(f85,plain,
sK0 = $sum(sK1,$uminus(sK1)),
inference(backward_demodulation,[],[f23,f82]) ).
tff(f82,plain,
sK1 = sK2,
inference(unit_resulting_resolution,[],[f24,f80,f11]) ).
tff(f11,plain,
! [X0: $int,X1: $int] :
( $less(X1,X0)
| $less(X0,X1)
| ( X0 = X1 ) ),
introduced(theory_axiom_149,[]) ).
tff(f80,plain,
~ $less(sK1,sK2),
inference(subsumption_resolution,[],[f73,f25]) ).
tff(f25,plain,
~ $less(sK0,0),
inference(unit_resulting_resolution,[],[f9,f22,f10]) ).
tff(f10,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X1,X2)
| ~ $less(X0,X1)
| $less(X0,X2) ),
introduced(theory_axiom_148,[]) ).
tff(f22,plain,
$less(0,sK0),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
( ~ $less(sK2,sK1)
& ( sK0 = $sum(sK1,$uminus(sK2)) )
& $less(0,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f19,f20]) ).
tff(f20,plain,
( ? [X0: $int,X1: $int,X2: $int] :
( ~ $less(X2,X1)
& ( $sum(X1,$uminus(X2)) = X0 )
& $less(0,X0) )
=> ( ~ $less(sK2,sK1)
& ( sK0 = $sum(sK1,$uminus(sK2)) )
& $less(0,sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f19,plain,
? [X0: $int,X1: $int,X2: $int] :
( ~ $less(X2,X1)
& ( $sum(X1,$uminus(X2)) = X0 )
& $less(0,X0) ),
inference(rectify,[],[f18]) ).
tff(f18,plain,
? [X2: $int,X1: $int,X0: $int] :
( ~ $less(X0,X1)
& ( $sum(X1,$uminus(X0)) = X2 )
& $less(0,X2) ),
inference(flattening,[],[f17]) ).
tff(f17,plain,
? [X0: $int,X2: $int,X1: $int] :
( ~ $less(X0,X1)
& $less(0,X2)
& ( $sum(X1,$uminus(X0)) = X2 ) ),
inference(ennf_transformation,[],[f16]) ).
tff(f16,plain,
~ ! [X0: $int,X2: $int,X1: $int] :
( ( $less(0,X2)
& ( $sum(X1,$uminus(X0)) = X2 ) )
=> $less(X0,X1) ),
inference(rectify,[],[f3]) ).
tff(f3,plain,
~ ! [X1: $int,X0: $int,X2: $int] :
( ( ( $sum(X0,$uminus(X1)) = X2 )
& $less(0,X2) )
=> $less(X1,X0) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X1: $int,X0: $int,X2: $int] :
( ( ( $difference(X0,X1) = X2 )
& $less(0,X2) )
=> $less(X1,X0) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X1: $int,X0: $int,X2: $int] :
( ( ( $difference(X0,X1) = X2 )
& $less(0,X2) )
=> $less(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_greater) ).
tff(f9,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_147,[]) ).
tff(f73,plain,
( ~ $less(sK1,sK2)
| $less(sK0,0) ),
inference(superposition,[],[f36,f8]) ).
tff(f36,plain,
! [X2: $int] :
( $less(sK0,$sum(X2,$uminus(sK2)))
| ~ $less(sK1,X2) ),
inference(superposition,[],[f12,f23]) ).
tff(f12,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(theory_axiom_150,[]) ).
tff(f24,plain,
~ $less(sK2,sK1),
inference(cnf_transformation,[],[f21]) ).
tff(f23,plain,
sK0 = $sum(sK1,$uminus(sK2)),
inference(cnf_transformation,[],[f21]) ).
tff(f38,plain,
$less(1,$sum(1,sK0)),
inference(forward_demodulation,[],[f37,f4]) ).
tff(f4,plain,
! [X0: $int,X1: $int] : ( $sum(X1,X0) = $sum(X0,X1) ),
introduced(theory_axiom_140,[]) ).
tff(f37,plain,
$less(1,$sum(sK0,1)),
inference(unit_resulting_resolution,[],[f29,f13]) ).
tff(f13,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_152,[]) ).
tff(f29,plain,
~ $less(sK0,1),
inference(evaluation,[],[f28]) ).
tff(f28,plain,
~ $less(sK0,$sum(0,1)),
inference(unit_resulting_resolution,[],[f22,f15]) ).
tff(f15,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(theory_axiom_166,[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM900=1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/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 : n014.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 : Tue Aug 30 09:14:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.49 % (23147)dis+1011_1:1_bd=off:canc=force:ev=cautious:nwc=5.0:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/21Mi)
% 0.19/0.50 % (23138)lrs+10_1:1_sd=10:sos=all:ss=axioms:st=5.0:tha=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.19/0.50 % (23125)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=32:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/32Mi)
% 0.19/0.50 % (23122)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.19/0.50 % (23125)First to succeed.
% 0.19/0.50 % (23125)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (23125)------------------------------
% 0.19/0.50 % (23125)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (23125)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (23125)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (23125)Memory used [KB]: 5500
% 0.19/0.50 % (23125)Time elapsed: 0.101 s
% 0.19/0.50 % (23125)Instructions burned: 6 (million)
% 0.19/0.50 % (23125)------------------------------
% 0.19/0.50 % (23125)------------------------------
% 0.19/0.50 % (23118)Success in time 0.153 s
%------------------------------------------------------------------------------