TSTP Solution File: DAT013_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT013_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n024.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 : Mon May 20 19:49:18 EDT 2024
% Result : Theorem 0.87s 1.04s
% Output : Refutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 33 ( 9 unt; 7 typ; 0 def)
% Number of atoms : 87 ( 2 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 107 ( 46 ~; 22 |; 28 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 191 ( 84 atm; 21 fun; 41 num; 45 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 6 usr; 6 con; 0-3 aty)
% Number of variables : 52 ( 34 !; 18 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
array: $tType ).
tff(func_def_0,type,
read: ( array * $int ) > $int ).
tff(func_def_1,type,
write: ( array * $int * $int ) > array ).
tff(func_def_7,type,
sK0: array ).
tff(func_def_8,type,
sK1: $int ).
tff(func_def_9,type,
sK2: $int ).
tff(func_def_10,type,
sK3: $int ).
tff(f165,plain,
$false,
inference(subsumption_resolution,[],[f164,f135]) ).
tff(f135,plain,
$less(sK3,sK1),
inference(subsumption_resolution,[],[f130,f26]) ).
tff(f26,plain,
~ $less(sK2,sK3),
inference(cnf_transformation,[],[f23]) ).
tff(f23,plain,
( ~ $less(0,read(sK0,sK3))
& ~ $less(sK2,sK3)
& ~ $less(sK3,$sum(sK1,3))
& ! [X4: $int] :
( $less(0,read(sK0,X4))
| $less(sK2,X4)
| $less(X4,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f20,f22,f21]) ).
tff(f21,plain,
( ? [X0: array,X1: $int,X2: $int] :
( ? [X3: $int] :
( ~ $less(0,read(X0,X3))
& ~ $less(X2,X3)
& ~ $less(X3,$sum(X1,3)) )
& ! [X4: $int] :
( $less(0,read(X0,X4))
| $less(X2,X4)
| $less(X4,X1) ) )
=> ( ? [X3: $int] :
( ~ $less(0,read(sK0,X3))
& ~ $less(sK2,X3)
& ~ $less(X3,$sum(sK1,3)) )
& ! [X4: $int] :
( $less(0,read(sK0,X4))
| $less(sK2,X4)
| $less(X4,sK1) ) ) ),
introduced(choice_axiom,[]) ).
tff(f22,plain,
( ? [X3: $int] :
( ~ $less(0,read(sK0,X3))
& ~ $less(sK2,X3)
& ~ $less(X3,$sum(sK1,3)) )
=> ( ~ $less(0,read(sK0,sK3))
& ~ $less(sK2,sK3)
& ~ $less(sK3,$sum(sK1,3)) ) ),
introduced(choice_axiom,[]) ).
tff(f20,plain,
? [X0: array,X1: $int,X2: $int] :
( ? [X3: $int] :
( ~ $less(0,read(X0,X3))
& ~ $less(X2,X3)
& ~ $less(X3,$sum(X1,3)) )
& ! [X4: $int] :
( $less(0,read(X0,X4))
| $less(X2,X4)
| $less(X4,X1) ) ),
inference(rectify,[],[f19]) ).
tff(f19,plain,
? [X0: array,X1: $int,X2: $int] :
( ? [X4: $int] :
( ~ $less(0,read(X0,X4))
& ~ $less(X2,X4)
& ~ $less(X4,$sum(X1,3)) )
& ! [X3: $int] :
( $less(0,read(X0,X3))
| $less(X2,X3)
| $less(X3,X1) ) ),
inference(flattening,[],[f18]) ).
tff(f18,plain,
? [X0: array,X1: $int,X2: $int] :
( ? [X4: $int] :
( ~ $less(0,read(X0,X4))
& ~ $less(X2,X4)
& ~ $less(X4,$sum(X1,3)) )
& ! [X3: $int] :
( $less(0,read(X0,X3))
| $less(X2,X3)
| $less(X3,X1) ) ),
inference(ennf_transformation,[],[f5]) ).
tff(f5,plain,
~ ! [X0: array,X1: $int,X2: $int] :
( ! [X3: $int] :
( ( ~ $less(X2,X3)
& ~ $less(X3,X1) )
=> $less(0,read(X0,X3)) )
=> ! [X4: $int] :
( ( ~ $less(X2,X4)
& ~ $less(X4,$sum(X1,3)) )
=> $less(0,read(X0,X4)) ) ),
inference(theory_normalization,[],[f4]) ).
tff(f4,negated_conjecture,
~ ! [X0: array,X1: $int,X2: $int] :
( ! [X3: $int] :
( ( $lesseq(X3,X2)
& $lesseq(X1,X3) )
=> $greater(read(X0,X3),0) )
=> ! [X4: $int] :
( ( $lesseq(X4,X2)
& $lesseq($sum(X1,3),X4) )
=> $greater(read(X0,X4),0) ) ),
inference(negated_conjecture,[],[f3]) ).
tff(f3,conjecture,
! [X0: array,X1: $int,X2: $int] :
( ! [X3: $int] :
( ( $lesseq(X3,X2)
& $lesseq(X1,X3) )
=> $greater(read(X0,X3),0) )
=> ! [X4: $int] :
( ( $lesseq(X4,X2)
& $lesseq($sum(X1,3),X4) )
=> $greater(read(X0,X4),0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f130,plain,
( $less(sK2,sK3)
| $less(sK3,sK1) ),
inference(resolution,[],[f24,f27]) ).
tff(f27,plain,
~ $less(0,read(sK0,sK3)),
inference(cnf_transformation,[],[f23]) ).
tff(f24,plain,
! [X4: $int] :
( $less(0,read(sK0,X4))
| $less(sK2,X4)
| $less(X4,sK1) ),
inference(cnf_transformation,[],[f23]) ).
tff(f164,plain,
~ $less(sK3,sK1),
inference(evaluation,[],[f160]) ).
tff(f160,plain,
( ~ $less(sK3,sK1)
| ~ $less(0,3) ),
inference(superposition,[],[f124,f8]) ).
tff(f8,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(theory_axiom_137,[]) ).
tff(f124,plain,
! [X0: $int] :
( ~ $less(sK3,$sum(sK1,X0))
| ~ $less(X0,3) ),
inference(superposition,[],[f103,f6]) ).
tff(f6,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f103,plain,
! [X0: $int] :
( ~ $less(sK3,$sum(X0,sK1))
| ~ $less(X0,3) ),
inference(resolution,[],[f52,f14]) ).
tff(f14,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(theory_axiom_145,[]) ).
tff(f52,plain,
! [X0: $int] :
( ~ $less(X0,$sum(3,sK1))
| ~ $less(sK3,X0) ),
inference(resolution,[],[f28,f12]) ).
tff(f12,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(theory_axiom_143,[]) ).
tff(f28,plain,
~ $less(sK3,$sum(3,sK1)),
inference(forward_demodulation,[],[f25,f6]) ).
tff(f25,plain,
~ $less(sK3,$sum(sK1,3)),
inference(cnf_transformation,[],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : DAT013_1 : TPTP v8.2.0. Released v5.0.0.
% 0.15/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 23:13:23 EDT 2024
% 0.22/0.37 % CPUTime :
% 0.22/0.37 This is a TF0_THM_EQU_ARI problem
% 0.22/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.87/1.04 % (22584)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2993ds/34Mi)
% 0.87/1.04 % (22589)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2993ds/45Mi)
% 0.87/1.04 % (22591)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2993ds/56Mi)
% 0.87/1.04 % (22587)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2993ds/33Mi)
% 0.87/1.04 % (22590)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2993ds/83Mi)
% 0.87/1.04 % (22586)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2993ds/78Mi)
% 0.87/1.04 % (22585)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2993ds/51Mi)
% 0.87/1.04 % (22588)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2993ds/34Mi)
% 0.87/1.04 % (22589)First to succeed.
% 0.87/1.04 % (22589)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-22583"
% 0.87/1.04 % (22589)Refutation found. Thanks to Tanya!
% 0.87/1.04 % SZS status Theorem for theBenchmark
% 0.87/1.04 % SZS output start Proof for theBenchmark
% See solution above
% 0.87/1.04 % (22589)------------------------------
% 0.87/1.04 % (22589)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.87/1.04 % (22589)Termination reason: Refutation
% 0.87/1.04
% 0.87/1.04 % (22589)Memory used [KB]: 1086
% 0.87/1.04 % (22589)Time elapsed: 0.008 s
% 0.87/1.04 % (22589)Instructions burned: 8 (million)
% 0.87/1.04 % (22583)Success in time 0.671 s
% 0.87/1.05 % Vampire---4.8 exiting
%------------------------------------------------------------------------------