TSTP Solution File: DAT026_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT026_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 : n032.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.42s 0.61s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 20
% Syntax : Number of formulae : 59 ( 12 unt; 9 typ; 0 def)
% Number of atoms : 154 ( 29 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 167 ( 63 ~; 45 |; 42 &)
% ( 6 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 161 ( 34 atm; 23 fun; 44 num; 60 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 7 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 84 ( 66 !; 18 ?; 84 :)
% 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_8,type,
sK0: collection ).
tff(func_def_9,type,
sK1: collection ).
tff(func_def_10,type,
sK2: $int ).
tff(func_def_11,type,
sK3: $int ).
tff(pred_def_1,type,
in: ( $int * collection ) > $o ).
tff(f121,plain,
$false,
inference(avatar_sat_refutation,[],[f80,f117,f120]) ).
tff(f120,plain,
~ spl4_4,
inference(avatar_contradiction_clause,[],[f119]) ).
tff(f119,plain,
( $false
| ~ spl4_4 ),
inference(subsumption_resolution,[],[f118,f62]) ).
tff(f62,plain,
~ in(sK3,sK1),
inference(resolution,[],[f35,f39]) ).
tff(f39,plain,
~ $less(0,sK3),
inference(cnf_transformation,[],[f30]) ).
tff(f30,plain,
( ~ $less(0,sK3)
& in(sK3,sK0)
& ( sK0 = add($sum(sK2,2),remove(sK2,sK1)) )
& in(sK2,sK1)
& ! [X4: $int] :
( $less(0,X4)
| ~ in(X4,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f27,f29,f28]) ).
tff(f28,plain,
( ? [X0: collection,X1: collection,X2: $int] :
( ? [X3: $int] :
( ~ $less(0,X3)
& in(X3,X0) )
& ( add($sum(X2,2),remove(X2,X1)) = X0 )
& in(X2,X1)
& ! [X4: $int] :
( $less(0,X4)
| ~ in(X4,X1) ) )
=> ( ? [X3: $int] :
( ~ $less(0,X3)
& in(X3,sK0) )
& ( sK0 = add($sum(sK2,2),remove(sK2,sK1)) )
& in(sK2,sK1)
& ! [X4: $int] :
( $less(0,X4)
| ~ in(X4,sK1) ) ) ),
introduced(choice_axiom,[]) ).
tff(f29,plain,
( ? [X3: $int] :
( ~ $less(0,X3)
& in(X3,sK0) )
=> ( ~ $less(0,sK3)
& in(sK3,sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f27,plain,
? [X0: collection,X1: collection,X2: $int] :
( ? [X3: $int] :
( ~ $less(0,X3)
& in(X3,X0) )
& ( add($sum(X2,2),remove(X2,X1)) = X0 )
& in(X2,X1)
& ! [X4: $int] :
( $less(0,X4)
| ~ in(X4,X1) ) ),
inference(rectify,[],[f26]) ).
tff(f26,plain,
? [X0: collection,X1: collection,X2: $int] :
( ? [X4: $int] :
( ~ $less(0,X4)
& in(X4,X0) )
& ( add($sum(X2,2),remove(X2,X1)) = X0 )
& in(X2,X1)
& ! [X3: $int] :
( $less(0,X3)
| ~ in(X3,X1) ) ),
inference(flattening,[],[f25]) ).
tff(f25,plain,
? [X0: collection,X1: collection,X2: $int] :
( ? [X4: $int] :
( ~ $less(0,X4)
& in(X4,X0) )
& ( add($sum(X2,2),remove(X2,X1)) = X0 )
& in(X2,X1)
& ! [X3: $int] :
( $less(0,X3)
| ~ in(X3,X1) ) ),
inference(ennf_transformation,[],[f8]) ).
tff(f8,plain,
~ ! [X0: collection,X1: collection,X2: $int] :
( ( ( add($sum(X2,2),remove(X2,X1)) = X0 )
& in(X2,X1)
& ! [X3: $int] :
( in(X3,X1)
=> $less(0,X3) ) )
=> ! [X4: $int] :
( in(X4,X0)
=> $less(0,X4) ) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,negated_conjecture,
~ ! [X0: collection,X1: collection,X2: $int] :
( ( ( add($sum(X2,2),remove(X2,X1)) = X0 )
& in(X2,X1)
& ! [X3: $int] :
( in(X3,X1)
=> $greater(X3,0) ) )
=> ! [X4: $int] :
( in(X4,X0)
=> $greater(X4,0) ) ),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
! [X0: collection,X1: collection,X2: $int] :
( ( ( add($sum(X2,2),remove(X2,X1)) = X0 )
& in(X2,X1)
& ! [X3: $int] :
( in(X3,X1)
=> $greater(X3,0) ) )
=> ! [X4: $int] :
( in(X4,X0)
=> $greater(X4,0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f35,plain,
! [X4: $int] :
( $less(0,X4)
| ~ in(X4,sK1) ),
inference(cnf_transformation,[],[f30]) ).
tff(f118,plain,
( in(sK3,sK1)
| ~ spl4_4 ),
inference(resolution,[],[f79,f45]) ).
tff(f45,plain,
! [X2: $int,X0: $int,X1: collection] :
( ~ in(X0,remove(X2,X1))
| in(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
tff(f34,plain,
! [X0: $int,X1: collection,X2: $int] :
( ( ( ( X0 != X2 )
& in(X0,X1) )
| ~ in(X0,remove(X2,X1)) )
& ( in(X0,remove(X2,X1))
| ( X0 = X2 )
| ~ in(X0,X1) ) ),
inference(flattening,[],[f33]) ).
tff(f33,plain,
! [X0: $int,X1: collection,X2: $int] :
( ( ( ( X0 != X2 )
& in(X0,X1) )
| ~ in(X0,remove(X2,X1)) )
& ( in(X0,remove(X2,X1))
| ( X0 = X2 )
| ~ in(X0,X1) ) ),
inference(nnf_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/sandbox/benchmark/theBenchmark.p',ax5) ).
tff(f79,plain,
( in(sK3,remove(sK2,sK1))
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f77]) ).
tff(f77,plain,
( spl4_4
<=> in(sK3,remove(sK2,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
tff(f117,plain,
~ spl4_3,
inference(avatar_contradiction_clause,[],[f116]) ).
tff(f116,plain,
( $false
| ~ spl4_3 ),
inference(subsumption_resolution,[],[f115,f36]) ).
tff(f36,plain,
in(sK2,sK1),
inference(cnf_transformation,[],[f30]) ).
tff(f115,plain,
( ~ in(sK2,sK1)
| ~ spl4_3 ),
inference(evaluation,[],[f111]) ).
tff(f111,plain,
( ~ in(sK2,sK1)
| ~ $less(0,2)
| ~ spl4_3 ),
inference(superposition,[],[f99,f11]) ).
tff(f11,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(theory_axiom_137,[]) ).
tff(f99,plain,
( ! [X0: $int] :
( ~ in($sum(sK2,X0),sK1)
| ~ $less(X0,2) )
| ~ spl4_3 ),
inference(superposition,[],[f94,f9]) ).
tff(f9,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f94,plain,
( ! [X0: $int] :
( ~ in($sum(X0,sK2),sK1)
| ~ $less(X0,2) )
| ~ spl4_3 ),
inference(resolution,[],[f85,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(f85,plain,
( ! [X0: $int] :
( ~ $less(X0,$sum(2,sK2))
| ~ in(X0,sK1) )
| ~ spl4_3 ),
inference(superposition,[],[f64,f75]) ).
tff(f75,plain,
( ( sK3 = $sum(2,sK2) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f73]) ).
tff(f73,plain,
( spl4_3
<=> ( sK3 = $sum(2,sK2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
tff(f64,plain,
! [X0: $int] :
( ~ $less(X0,sK3)
| ~ in(X0,sK1) ),
inference(resolution,[],[f52,f35]) ).
tff(f52,plain,
! [X0: $int] :
( ~ $less(0,X0)
| ~ $less(X0,sK3) ),
inference(resolution,[],[f39,f15]) ).
tff(f15,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(theory_axiom_143,[]) ).
tff(f80,plain,
( spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f71,f77,f73]) ).
tff(f71,plain,
( in(sK3,remove(sK2,sK1))
| ( sK3 = $sum(2,sK2) ) ),
inference(resolution,[],[f70,f42]) ).
tff(f42,plain,
! [X2: $int,X0: $int,X1: collection] :
( ~ in(X0,add(X2,X1))
| in(X0,X1)
| ( X0 = X2 ) ),
inference(cnf_transformation,[],[f32]) ).
tff(f32,plain,
! [X0: $int,X1: collection,X2: $int] :
( ( ( X0 = X2 )
| in(X0,X1)
| ~ in(X0,add(X2,X1)) )
& ( in(X0,add(X2,X1))
| ( ( X0 != X2 )
& ~ in(X0,X1) ) ) ),
inference(flattening,[],[f31]) ).
tff(f31,plain,
! [X0: $int,X1: collection,X2: $int] :
( ( ( X0 = X2 )
| in(X0,X1)
| ~ in(X0,add(X2,X1)) )
& ( in(X0,add(X2,X1))
| ( ( X0 != X2 )
& ~ in(X0,X1) ) ) ),
inference(nnf_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/sandbox/benchmark/theBenchmark.p',ax4) ).
tff(f70,plain,
in(sK3,add($sum(2,sK2),remove(sK2,sK1))),
inference(superposition,[],[f38,f50]) ).
tff(f50,plain,
sK0 = add($sum(2,sK2),remove(sK2,sK1)),
inference(forward_demodulation,[],[f37,f9]) ).
tff(f37,plain,
sK0 = add($sum(sK2,2),remove(sK2,sK1)),
inference(cnf_transformation,[],[f30]) ).
tff(f38,plain,
in(sK3,sK0),
inference(cnf_transformation,[],[f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : DAT026_1 : TPTP v8.2.0. Released v5.0.0.
% 0.02/0.11 % 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.12/0.30 % Computer : n032.cluster.edu
% 0.12/0.30 % Model : x86_64 x86_64
% 0.12/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30 % Memory : 8042.1875MB
% 0.12/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Sun May 19 23:18:07 EDT 2024
% 0.12/0.31 % CPUTime :
% 0.12/0.31 This is a TF0_THM_EQU_ARI problem
% 0.12/0.31 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.42/0.61 % (17700)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 (2997ds/83Mi)
% 0.42/0.61 % (17699)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2997ds/45Mi)
% 0.42/0.61 % (17694)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 (2997ds/34Mi)
% 0.42/0.61 % (17696)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2997ds/78Mi)
% 0.42/0.61 % (17698)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 (2997ds/34Mi)
% 0.42/0.61 % (17695)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 (2997ds/51Mi)
% 0.42/0.61 % (17697)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2997ds/33Mi)
% 0.42/0.61 % (17699)First to succeed.
% 0.42/0.61 % (17699)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-17693"
% 0.42/0.61 % (17699)Refutation found. Thanks to Tanya!
% 0.42/0.61 % SZS status Theorem for theBenchmark
% 0.42/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 0.42/0.62 % (17699)------------------------------
% 0.42/0.62 % (17699)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.42/0.62 % (17699)Termination reason: Refutation
% 0.42/0.62
% 0.42/0.62 % (17699)Memory used [KB]: 1082
% 0.42/0.62 % (17699)Time elapsed: 0.004 s
% 0.42/0.62 % (17699)Instructions burned: 7 (million)
% 0.42/0.62 % (17693)Success in time 0.3 s
% 0.42/0.62 % Vampire---4.8 exiting
%------------------------------------------------------------------------------