TSTP Solution File: DAT055_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT055_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.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:28 EDT 2024
% Result : Theorem 0.51s 0.74s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of formulae : 47 ( 11 unt; 6 typ; 0 def)
% Number of atoms : 88 ( 10 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 85 ( 38 ~; 28 |; 12 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 81 ( 46 atm; 16 fun; 7 num; 12 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
list: $tType ).
tff(func_def_0,type,
a: list ).
tff(func_def_1,type,
l: $int ).
tff(func_def_2,type,
k: $int ).
tff(func_def_3,type,
min: list > $int ).
tff(func_def_4,type,
max: list > $int ).
tff(f164,plain,
$false,
inference(avatar_sat_refutation,[],[f39,f60,f89,f125,f163]) ).
tff(f163,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f162]) ).
tff(f162,plain,
( $false
| ~ spl0_3 ),
inference(subsumption_resolution,[],[f156,f27]) ).
tff(f27,plain,
! [X0: $int] : $less(X0,$sum(k,X0)),
inference(evaluation,[],[f23]) ).
tff(f23,plain,
! [X0: $int] : $less($sum(0,X0),$sum(k,X0)),
inference(unit_resulting_resolution,[],[f20,f12]) ).
tff(f12,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(theory_axiom_145,[]) ).
tff(f20,plain,
$less(0,k),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
( ~ $less(l,$sum(max(a),k))
& $less(0,k)
& ~ $less(min(a),l)
& ! [X0: list] : ~ $less(max(X0),min(X0)) ),
inference(flattening,[],[f16]) ).
tff(f16,plain,
( ~ $less(l,$sum(max(a),k))
& $less(0,k)
& ~ $less(min(a),l)
& ! [X0: list] : ~ $less(max(X0),min(X0)) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ( ( $less(0,k)
& ~ $less(min(a),l)
& ! [X0: list] : ~ $less(max(X0),min(X0)) )
=> $less(l,$sum(max(a),k)) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( $less(0,k)
& $lesseq(l,min(a))
& ! [X0: list] : $lesseq(min(X0),max(X0)) )
=> $less(l,$sum(max(a),k)) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ( $less(0,k)
& $lesseq(l,min(a))
& ! [X0: list] : $lesseq(min(X0),max(X0)) )
=> $less(l,$sum(max(a),k)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',boyer_moore_max_min) ).
tff(f156,plain,
( ~ $less(l,$sum(k,l))
| ~ spl0_3 ),
inference(superposition,[],[f22,f54]) ).
tff(f54,plain,
( ( l = max(a) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f52]) ).
tff(f52,plain,
( spl0_3
<=> ( l = max(a) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
tff(f22,plain,
~ $less(l,$sum(k,max(a))),
inference(forward_demodulation,[],[f21,f4]) ).
tff(f4,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f21,plain,
~ $less(l,$sum(max(a),k)),
inference(cnf_transformation,[],[f17]) ).
tff(f125,plain,
( spl0_3
| ~ spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f118,f56,f31,f52]) ).
tff(f31,plain,
( spl0_1
<=> ( l = min(a) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
tff(f56,plain,
( spl0_4
<=> $less(l,max(a)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
tff(f118,plain,
( ( l = max(a) )
| ~ spl0_1
| spl0_4 ),
inference(subsumption_resolution,[],[f112,f57]) ).
tff(f57,plain,
( ~ $less(l,max(a))
| spl0_4 ),
inference(avatar_component_clause,[],[f56]) ).
tff(f112,plain,
( $less(l,max(a))
| ( l = max(a) )
| ~ spl0_1 ),
inference(resolution,[],[f92,f11]) ).
tff(f11,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_144,[]) ).
tff(f92,plain,
( ~ $less(max(a),l)
| ~ spl0_1 ),
inference(superposition,[],[f18,f33]) ).
tff(f33,plain,
( ( l = min(a) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f31]) ).
tff(f18,plain,
! [X0: list] : ~ $less(max(X0),min(X0)),
inference(cnf_transformation,[],[f17]) ).
tff(f89,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f88]) ).
tff(f88,plain,
( $false
| ~ spl0_4 ),
inference(subsumption_resolution,[],[f80,f22]) ).
tff(f80,plain,
( $less(l,$sum(k,max(a)))
| ~ spl0_4 ),
inference(unit_resulting_resolution,[],[f58,f27,f10]) ).
tff(f10,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X1,X2)
| ~ $less(X0,X1)
| $less(X0,X2) ),
introduced(theory_axiom_143,[]) ).
tff(f58,plain,
( $less(l,max(a))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f56]) ).
tff(f60,plain,
( spl0_3
| spl0_4
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f50,f35,f56,f52]) ).
tff(f35,plain,
( spl0_2
<=> $less(l,min(a)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
tff(f50,plain,
( $less(l,max(a))
| ( l = max(a) )
| ~ spl0_2 ),
inference(resolution,[],[f46,f11]) ).
tff(f46,plain,
( ~ $less(max(a),l)
| ~ spl0_2 ),
inference(unit_resulting_resolution,[],[f37,f18,f10]) ).
tff(f37,plain,
( $less(l,min(a))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f35]) ).
tff(f39,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f29,f35,f31]) ).
tff(f29,plain,
( $less(l,min(a))
| ( l = min(a) ) ),
inference(resolution,[],[f19,f11]) ).
tff(f19,plain,
~ $less(min(a),l),
inference(cnf_transformation,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : DAT055_1 : TPTP v8.2.0. Released v5.0.0.
% 0.04/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 23:42:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF0_THM_NEQ_ARI problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.73 % (8922)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 (2996ds/56Mi)
% 0.51/0.73 % (8915)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 (2996ds/34Mi)
% 0.51/0.73 % (8916)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 (2996ds/51Mi)
% 0.51/0.73 % (8917)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.51/0.73 % (8918)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.51/0.73 % (8919)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 (2996ds/34Mi)
% 0.51/0.73 % (8920)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.51/0.73 % (8921)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 (2996ds/83Mi)
% 0.51/0.74 % (8921)First to succeed.
% 0.51/0.74 % (8921)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-8777"
% 0.51/0.74 % (8921)Refutation found. Thanks to Tanya!
% 0.51/0.74 % SZS status Theorem for theBenchmark
% 0.51/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.51/0.74 % (8921)------------------------------
% 0.51/0.74 % (8921)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.74 % (8921)Termination reason: Refutation
% 0.51/0.74
% 0.51/0.74 % (8921)Memory used [KB]: 1071
% 0.51/0.74 % (8921)Time elapsed: 0.007 s
% 0.51/0.74 % (8921)Instructions burned: 7 (million)
% 0.51/0.74 % (8777)Success in time 0.378 s
% 0.51/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------