TSTP Solution File: DAT027_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT027_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 : n025.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:21 EDT 2024
% Result : Theorem 0.61s 0.81s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of formulae : 54 ( 14 unt; 10 typ; 0 def)
% Number of atoms : 111 ( 20 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 104 ( 37 ~; 31 |; 21 &)
% ( 6 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 124 ( 33 atm; 15 fun; 29 num; 47 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 8 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 63 ( 53 !; 10 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
collection: $tType ).
tff(func_def_0,type,
empty: collection ).
tff(func_def_1,type,
add: ( $int * collection ) > collection ).
tff(func_def_2,type,
remove: ( $int * collection ) > collection ).
tff(func_def_7,type,
sK0: collection ).
tff(func_def_8,type,
sK1: collection ).
tff(func_def_9,type,
sK2: $int ).
tff(func_def_10,type,
sK3: $int ).
tff(func_def_11,type,
sK4: $int ).
tff(pred_def_1,type,
in: ( $int * collection ) > $o ).
tff(f1039,plain,
$false,
inference(avatar_sat_refutation,[],[f72,f262,f1032]) ).
tff(f1032,plain,
~ spl5_4,
inference(avatar_contradiction_clause,[],[f1031]) ).
tff(f1031,plain,
( $false
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f1020,f28]) ).
tff(f28,plain,
~ $less(0,sK4),
inference(cnf_transformation,[],[f26]) ).
tff(f26,plain,
? [X0: collection,X1: collection,X2: $int,X3: $int] :
( ? [X5: $int] :
( ~ $less(0,X5)
& in(X5,X0) )
& ( add($sum(X2,X3),remove(X2,X1)) = X0 )
& ~ $less(X3,0)
& in(X2,X1)
& ! [X4: $int] :
( $less(0,X4)
| ~ in(X4,X1) ) ),
inference(flattening,[],[f25]) ).
tff(f25,plain,
? [X0: collection,X1: collection,X2: $int,X3: $int] :
( ? [X5: $int] :
( ~ $less(0,X5)
& in(X5,X0) )
& ( add($sum(X2,X3),remove(X2,X1)) = X0 )
& ~ $less(X3,0)
& in(X2,X1)
& ! [X4: $int] :
( $less(0,X4)
| ~ in(X4,X1) ) ),
inference(ennf_transformation,[],[f8]) ).
tff(f8,plain,
~ ! [X0: collection,X1: collection,X2: $int,X3: $int] :
( ( ( add($sum(X2,X3),remove(X2,X1)) = X0 )
& ~ $less(X3,0)
& in(X2,X1)
& ! [X4: $int] :
( in(X4,X1)
=> $less(0,X4) ) )
=> ! [X5: $int] :
( in(X5,X0)
=> $less(0,X5) ) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,negated_conjecture,
~ ! [X0: collection,X1: collection,X2: $int,X3: $int] :
( ( ( add($sum(X2,X3),remove(X2,X1)) = X0 )
& $greatereq(X3,0)
& in(X2,X1)
& ! [X4: $int] :
( in(X4,X1)
=> $greater(X4,0) ) )
=> ! [X5: $int] :
( in(X5,X0)
=> $greater(X5,0) ) ),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
! [X0: collection,X1: collection,X2: $int,X3: $int] :
( ( ( add($sum(X2,X3),remove(X2,X1)) = X0 )
& $greatereq(X3,0)
& in(X2,X1)
& ! [X4: $int] :
( in(X4,X1)
=> $greater(X4,0) ) )
=> ! [X5: $int] :
( in(X5,X0)
=> $greater(X5,0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f1020,plain,
( $less(0,sK4)
| ~ spl5_4 ),
inference(superposition,[],[f289,f332]) ).
tff(f332,plain,
sK4 = $sum(sK2,sK3),
inference(unit_resulting_resolution,[],[f27,f85,f92]) ).
tff(f92,plain,
! [X0: $int] :
( in(X0,remove(sK2,sK1))
| ~ in(X0,sK0)
| ( $sum(sK2,sK3) = X0 ) ),
inference(superposition,[],[f35,f32]) ).
tff(f32,plain,
sK0 = add($sum(sK2,sK3),remove(sK2,sK1)),
inference(cnf_transformation,[],[f26]) ).
tff(f35,plain,
! [X2: $int,X0: $int,X1: collection] :
( ~ in(X0,add(X2,X1))
| in(X0,X1)
| ( X0 = X2 ) ),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
! [X0: $int,X1: collection,X2: $int] :
( ( ( X0 = X2 )
| in(X0,X1) )
<=> in(X0,add(X2,X1)) ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X5: $int,X6: collection,X7: $int] :
( ( ( X5 = X7 )
| in(X5,X6) )
<=> in(X5,add(X7,X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
tff(f85,plain,
! [X0: $int] : ~ in(sK4,remove(X0,sK1)),
inference(unit_resulting_resolution,[],[f80,f38]) ).
tff(f38,plain,
! [X2: $int,X0: $int,X1: collection] :
( ~ in(X0,remove(X2,X1))
| in(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tff(f23,plain,
! [X0: $int,X1: collection,X2: $int] :
( ( ( X0 != X2 )
& in(X0,X1) )
<=> in(X0,remove(X2,X1)) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X8: $int,X9: collection,X10: $int] :
( ( ( X8 != X10 )
& in(X8,X9) )
<=> in(X8,remove(X10,X9)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
tff(f80,plain,
~ in(sK4,sK1),
inference(unit_resulting_resolution,[],[f28,f29]) ).
tff(f29,plain,
! [X4: $int] :
( ~ in(X4,sK1)
| $less(0,X4) ),
inference(cnf_transformation,[],[f26]) ).
tff(f27,plain,
in(sK4,sK0),
inference(cnf_transformation,[],[f26]) ).
tff(f289,plain,
( $less(0,$sum(sK2,sK3))
| ~ spl5_4 ),
inference(unit_resulting_resolution,[],[f109,f70,f15]) ).
tff(f15,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X1,X2)
| ~ $less(X0,X1)
| $less(X0,X2) ),
introduced(theory_axiom_143,[]) ).
tff(f70,plain,
( $less(0,sK3)
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f68]) ).
tff(f68,plain,
( spl5_4
<=> $less(0,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
tff(f109,plain,
! [X0: $int] : $less(X0,$sum(sK2,X0)),
inference(evaluation,[],[f103]) ).
tff(f103,plain,
! [X0: $int] : $less($sum(0,X0),$sum(sK2,X0)),
inference(unit_resulting_resolution,[],[f82,f17]) ).
tff(f17,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(theory_axiom_145,[]) ).
tff(f82,plain,
$less(0,sK2),
inference(unit_resulting_resolution,[],[f30,f29]) ).
tff(f30,plain,
in(sK2,sK1),
inference(cnf_transformation,[],[f26]) ).
tff(f262,plain,
~ spl5_3,
inference(avatar_contradiction_clause,[],[f261]) ).
tff(f261,plain,
( $false
| ~ spl5_3 ),
inference(subsumption_resolution,[],[f247,f30]) ).
tff(f247,plain,
( ~ in(sK2,sK1)
| ~ spl5_3 ),
inference(superposition,[],[f80,f226]) ).
tff(f226,plain,
( ( sK2 = sK4 )
| ~ spl5_3 ),
inference(unit_resulting_resolution,[],[f27,f85,f99]) ).
tff(f99,plain,
( ! [X0: $int] :
( in(X0,remove(sK2,sK1))
| ~ in(X0,sK0)
| ( sK2 = X0 ) )
| ~ spl5_3 ),
inference(evaluation,[],[f98]) ).
tff(f98,plain,
( ! [X0: $int] :
( ( $sum(sK2,0) = X0 )
| ~ in(X0,sK0)
| in(X0,remove(sK2,sK1)) )
| ~ spl5_3 ),
inference(forward_demodulation,[],[f92,f66]) ).
tff(f66,plain,
( ( 0 = sK3 )
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f64]) ).
tff(f64,plain,
( spl5_3
<=> ( 0 = sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
tff(f72,plain,
( spl5_3
| spl5_4 ),
inference(avatar_split_clause,[],[f62,f68,f64]) ).
tff(f62,plain,
( $less(0,sK3)
| ( 0 = sK3 ) ),
inference(resolution,[],[f31,f16]) ).
tff(f16,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_144,[]) ).
tff(f31,plain,
~ $less(sK3,0),
inference(cnf_transformation,[],[f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15 % Problem : DAT027_1 : TPTP v8.2.0. Released v5.0.0.
% 0.09/0.17 % 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.18/0.40 % Computer : n025.cluster.edu
% 0.18/0.40 % Model : x86_64 x86_64
% 0.18/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.40 % Memory : 8042.1875MB
% 0.18/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.40 % CPULimit : 300
% 0.18/0.40 % WCLimit : 300
% 0.18/0.40 % DateTime : Sun May 19 23:18:38 EDT 2024
% 0.18/0.40 % CPUTime :
% 0.18/0.40 This is a TF0_THM_EQU_ARI problem
% 0.18/0.40 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.61/0.79 % (22836)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.61/0.79 % (22837)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.61/0.79 % (22838)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.61/0.79 % (22831)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.61/0.79 % (22833)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.61/0.79 % (22832)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.61/0.80 % (22835)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.61/0.80 % (22834)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.61/0.81 % (22836)Instruction limit reached!
% 0.61/0.81 % (22836)------------------------------
% 0.61/0.81 % (22836)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (22836)Termination reason: Unknown
% 0.61/0.81 % (22836)Termination phase: Saturation
% 0.61/0.81
% 0.61/0.81 % (22836)Memory used [KB]: 1406
% 0.61/0.81 % (22836)Time elapsed: 0.019 s
% 0.61/0.81 % (22836)Instructions burned: 45 (million)
% 0.61/0.81 % (22836)------------------------------
% 0.61/0.81 % (22836)------------------------------
% 0.61/0.81 % (22837)First to succeed.
% 0.61/0.81 % (22831)Instruction limit reached!
% 0.61/0.81 % (22831)------------------------------
% 0.61/0.81 % (22831)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (22831)Termination reason: Unknown
% 0.61/0.81 % (22831)Termination phase: Saturation
% 0.61/0.81
% 0.61/0.81 % (22831)Memory used [KB]: 1142
% 0.61/0.81 % (22831)Time elapsed: 0.020 s
% 0.61/0.81 % (22831)Instructions burned: 35 (million)
% 0.61/0.81 % (22831)------------------------------
% 0.61/0.81 % (22831)------------------------------
% 0.61/0.81 % (22837)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22830"
% 0.61/0.81 % (22837)Refutation found. Thanks to Tanya!
% 0.61/0.81 % SZS status Theorem for theBenchmark
% 0.61/0.81 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.81 % (22837)------------------------------
% 0.61/0.81 % (22837)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (22837)Termination reason: Refutation
% 0.61/0.81
% 0.61/0.81 % (22837)Memory used [KB]: 1280
% 0.61/0.81 % (22837)Time elapsed: 0.021 s
% 0.61/0.81 % (22837)Instructions burned: 31 (million)
% 0.61/0.81 % (22830)Success in time 0.402 s
% 0.61/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------