TSTP Solution File: DAT044_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT044_1 : TPTP v8.1.2. 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 : n027.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 : Sun May 5 05:04:23 EDT 2024
% Result : Theorem 0.61s 0.79s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 27 ( 10 unt; 8 typ; 0 def)
% Number of atoms : 32 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 10 ~; 4 |; 1 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 55 ( 16 atm; 12 fun; 10 num; 17 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 22 !; 2 ?; 24 :)
% 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_3,type,
count: collection > $int ).
tff(func_def_9,type,
sK0: collection ).
tff(func_def_10,type,
sK1: $int ).
tff(pred_def_1,type,
in: ( $int * collection ) > $o ).
tff(f93,plain,
$false,
inference(subsumption_resolution,[],[f92,f23]) ).
tff(f23,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_142,[]) ).
tff(f92,plain,
$less($sum(1,count(sK0)),$sum(1,count(sK0))),
inference(forward_demodulation,[],[f91,f84]) ).
tff(f84,plain,
count(add(sK1,sK0)) = $sum(1,count(sK0)),
inference(forward_demodulation,[],[f78,f18]) ).
tff(f18,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f78,plain,
count(add(sK1,sK0)) = $sum(count(sK0),1),
inference(unit_resulting_resolution,[],[f66,f48]) ).
tff(f48,plain,
! [X0: $int,X1: collection] :
( in(X0,X1)
| ( count(add(X0,X1)) = $sum(count(X1),1) ) ),
inference(cnf_transformation,[],[f32]) ).
tff(f32,plain,
! [X0: $int,X1: collection] :
( ~ in(X0,X1)
<=> ( count(add(X0,X1)) = $sum(count(X1),1) ) ),
inference(rectify,[],[f8]) ).
tff(f8,axiom,
! [X13: $int,X14: collection] :
( ~ in(X13,X14)
<=> ( count(add(X13,X14)) = $sum(count(X14),1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Um5aQCCWM6/Vampire---4.8_3267',ax3) ).
tff(f66,plain,
~ in(sK1,sK0),
inference(unit_resulting_resolution,[],[f23,f42]) ).
tff(f42,plain,
! [X2: $int] :
( ~ in(X2,sK0)
| $less(X2,sK1) ),
inference(cnf_transformation,[],[f40]) ).
tff(f40,plain,
? [X0: collection,X1: $int] :
( ~ $less(count(X0),count(add(X1,X0)))
& ! [X2: $int] :
( $less(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f17]) ).
tff(f17,plain,
~ ! [X0: collection,X1: $int] :
( ! [X2: $int] :
( in(X2,X0)
=> $less(X2,X1) )
=> $less(count(X0),count(add(X1,X0))) ),
inference(theory_normalization,[],[f14]) ).
tff(f14,negated_conjecture,
~ ! [X0: collection,X1: $int] :
( ! [X2: $int] :
( in(X2,X0)
=> $greater(X1,X2) )
=> $greater(count(add(X1,X0)),count(X0)) ),
inference(negated_conjecture,[],[f13]) ).
tff(f13,conjecture,
! [X0: collection,X1: $int] :
( ! [X2: $int] :
( in(X2,X0)
=> $greater(X1,X2) )
=> $greater(count(add(X1,X0)),count(X0)) ),
file('/export/starexec/sandbox2/tmp/tmp.Um5aQCCWM6/Vampire---4.8_3267',co1) ).
tff(f91,plain,
$less(count(add(sK1,sK0)),$sum(1,count(sK0))),
inference(forward_demodulation,[],[f88,f18]) ).
tff(f88,plain,
$less(count(add(sK1,sK0)),$sum(count(sK0),1)),
inference(unit_resulting_resolution,[],[f43,f27]) ).
tff(f27,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_147,[]) ).
tff(f43,plain,
~ $less(count(sK0),count(add(sK1,sK0))),
inference(cnf_transformation,[],[f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : DAT044_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/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.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 13:26:51 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TF0_THM_EQU_ARI problem
% 0.13/0.36 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/tmp/tmp.Um5aQCCWM6/Vampire---4.8_3267
% 0.61/0.79 % (3377)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 Vampire---4 for (2995ds/51Mi)
% 0.61/0.79 % (3379)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.79 % (3380)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 Vampire---4 for (2995ds/34Mi)
% 0.61/0.79 % (3378)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.79 % (3381)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.79 % (3383)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.61/0.79 % (3382)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 Vampire---4 for (2995ds/83Mi)
% 0.61/0.79 % (3376)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 Vampire---4 for (2995ds/34Mi)
% 0.61/0.79 % (3382)First to succeed.
% 0.61/0.79 % (3382)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3375"
% 0.61/0.79 % (3382)Refutation found. Thanks to Tanya!
% 0.61/0.79 % SZS status Theorem for Vampire---4
% 0.61/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.79 % (3382)------------------------------
% 0.61/0.79 % (3382)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.79 % (3382)Termination reason: Refutation
% 0.61/0.79
% 0.61/0.79 % (3382)Memory used [KB]: 1069
% 0.61/0.79 % (3382)Time elapsed: 0.004 s
% 0.61/0.79 % (3382)Instructions burned: 5 (million)
% 0.61/0.79 % (3375)Success in time 0.43 s
% 0.61/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------