TSTP Solution File: DAT071_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT071_1 : TPTP v8.1.2. Released v6.1.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 : n031.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:29 EDT 2024
% Result : Theorem 0.71s 0.88s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of formulae : 42 ( 13 unt; 16 typ; 0 def)
% Number of atoms : 151 ( 35 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 190 ( 65 ~; 26 |; 84 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 220 ( 115 atm; 0 fun; 44 num; 61 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 19 ( 9 >; 10 *; 0 +; 0 <<)
% Number of predicates : 9 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 68 ( 38 !; 30 ?; 68 :)
% 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_2,type,
init: $int > array ).
tff(func_def_3,type,
max: ( array * $int ) > $int ).
tff(func_def_5,type,
rev: ( array * $int ) > array ).
tff(func_def_10,type,
sK0: array ).
tff(func_def_11,type,
sK1: $int ).
tff(func_def_12,type,
sK2: $int ).
tff(func_def_13,type,
sK3: $int ).
tff(func_def_14,type,
sK4: $int ).
tff(func_def_15,type,
sK5: $int ).
tff(func_def_16,type,
sK6: ( array * array ) > $int ).
tff(pred_def_4,type,
sorted: ( array * $int ) > $o ).
tff(pred_def_6,type,
inRange: ( array * $int * $int ) > $o ).
tff(pred_def_7,type,
distinct: ( array * $int ) > $o ).
tff(f70,plain,
$false,
inference(subsumption_resolution,[],[f69,f67]) ).
tff(f67,plain,
~ $less(sK3,sK2),
inference(forward_demodulation,[],[f64,f44]) ).
tff(f44,plain,
sK2 = read(sK0,sK5),
inference(cnf_transformation,[],[f38]) ).
tff(f38,plain,
( ( sK2 != sK3 )
& ( sK3 = read(sK0,sK4) )
& ~ $less(sK4,0)
& $less(sK4,sK1)
& ! [X5: $int] :
( ~ $less(sK3,read(sK0,X5))
| $less(X5,0)
| ~ $less(X5,sK1) )
& ( sK2 = read(sK0,sK5) )
& ~ $less(sK5,0)
& $less(sK5,sK1)
& ! [X7: $int] :
( ~ $less(sK2,read(sK0,X7))
| $less(X7,0)
| ~ $less(X7,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f33,f37,f36,f35]) ).
tff(f35,plain,
( ? [X0: array,X1: $int,X2: $int,X3: $int] :
( ( X2 != X3 )
& ? [X4: $int] :
( ( read(X0,X4) = X3 )
& ~ $less(X4,0)
& $less(X4,X1) )
& ! [X5: $int] :
( ~ $less(X3,read(X0,X5))
| $less(X5,0)
| ~ $less(X5,X1) )
& ? [X6: $int] :
( ( read(X0,X6) = X2 )
& ~ $less(X6,0)
& $less(X6,X1) )
& ! [X7: $int] :
( ~ $less(X2,read(X0,X7))
| $less(X7,0)
| ~ $less(X7,X1) ) )
=> ( ( sK2 != sK3 )
& ? [X4: $int] :
( ( sK3 = read(sK0,X4) )
& ~ $less(X4,0)
& $less(X4,sK1) )
& ! [X5: $int] :
( ~ $less(sK3,read(sK0,X5))
| $less(X5,0)
| ~ $less(X5,sK1) )
& ? [X6: $int] :
( ( sK2 = read(sK0,X6) )
& ~ $less(X6,0)
& $less(X6,sK1) )
& ! [X7: $int] :
( ~ $less(sK2,read(sK0,X7))
| $less(X7,0)
| ~ $less(X7,sK1) ) ) ),
introduced(choice_axiom,[]) ).
tff(f36,plain,
( ? [X4: $int] :
( ( sK3 = read(sK0,X4) )
& ~ $less(X4,0)
& $less(X4,sK1) )
=> ( ( sK3 = read(sK0,sK4) )
& ~ $less(sK4,0)
& $less(sK4,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f37,plain,
( ? [X6: $int] :
( ( sK2 = read(sK0,X6) )
& ~ $less(X6,0)
& $less(X6,sK1) )
=> ( ( sK2 = read(sK0,sK5) )
& ~ $less(sK5,0)
& $less(sK5,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f33,plain,
? [X0: array,X1: $int,X2: $int,X3: $int] :
( ( X2 != X3 )
& ? [X4: $int] :
( ( read(X0,X4) = X3 )
& ~ $less(X4,0)
& $less(X4,X1) )
& ! [X5: $int] :
( ~ $less(X3,read(X0,X5))
| $less(X5,0)
| ~ $less(X5,X1) )
& ? [X6: $int] :
( ( read(X0,X6) = X2 )
& ~ $less(X6,0)
& $less(X6,X1) )
& ! [X7: $int] :
( ~ $less(X2,read(X0,X7))
| $less(X7,0)
| ~ $less(X7,X1) ) ),
inference(flattening,[],[f32]) ).
tff(f32,plain,
? [X0: array,X1: $int,X2: $int,X3: $int] :
( ( X2 != X3 )
& ? [X4: $int] :
( ( read(X0,X4) = X3 )
& ~ $less(X4,0)
& $less(X4,X1) )
& ! [X5: $int] :
( ~ $less(X3,read(X0,X5))
| $less(X5,0)
| ~ $less(X5,X1) )
& ? [X6: $int] :
( ( read(X0,X6) = X2 )
& ~ $less(X6,0)
& $less(X6,X1) )
& ! [X7: $int] :
( ~ $less(X2,read(X0,X7))
| $less(X7,0)
| ~ $less(X7,X1) ) ),
inference(ennf_transformation,[],[f30]) ).
tff(f30,plain,
~ ! [X0: array,X1: $int,X2: $int,X3: $int] :
( ( ? [X4: $int] :
( ( read(X0,X4) = X3 )
& ~ $less(X4,0)
& $less(X4,X1) )
& ! [X5: $int] :
( ( ~ $less(X5,0)
& $less(X5,X1) )
=> ~ $less(X3,read(X0,X5)) )
& ? [X6: $int] :
( ( read(X0,X6) = X2 )
& ~ $less(X6,0)
& $less(X6,X1) )
& ! [X7: $int] :
( ( ~ $less(X7,0)
& $less(X7,X1) )
=> ~ $less(X2,read(X0,X7)) ) )
=> ( X2 = X3 ) ),
inference(rectify,[],[f17]) ).
tff(f17,plain,
~ ! [X0: array,X5: $int,X8: $int,X9: $int] :
( ( ? [X1: $int] :
( ( read(X0,X1) = X9 )
& ~ $less(X1,0)
& $less(X1,X5) )
& ! [X1: $int] :
( ( ~ $less(X1,0)
& $less(X1,X5) )
=> ~ $less(X9,read(X0,X1)) )
& ? [X1: $int] :
( ( read(X0,X1) = X8 )
& ~ $less(X1,0)
& $less(X1,X5) )
& ! [X1: $int] :
( ( ~ $less(X1,0)
& $less(X1,X5) )
=> ~ $less(X8,read(X0,X1)) ) )
=> ( X8 = X9 ) ),
inference(theory_normalization,[],[f11]) ).
tff(f11,negated_conjecture,
~ ! [X0: array,X5: $int,X8: $int,X9: $int] :
( ( ? [X1: $int] :
( ( read(X0,X1) = X9 )
& $greatereq(X1,0)
& $greater(X5,X1) )
& ! [X1: $int] :
( ( $greatereq(X1,0)
& $greater(X5,X1) )
=> $lesseq(read(X0,X1),X9) )
& ? [X1: $int] :
( ( read(X0,X1) = X8 )
& $greatereq(X1,0)
& $greater(X5,X1) )
& ! [X1: $int] :
( ( $greatereq(X1,0)
& $greater(X5,X1) )
=> $lesseq(read(X0,X1),X8) ) )
=> ( X8 = X9 ) ),
inference(negated_conjecture,[],[f10]) ).
tff(f10,conjecture,
! [X0: array,X5: $int,X8: $int,X9: $int] :
( ( ? [X1: $int] :
( ( read(X0,X1) = X9 )
& $greatereq(X1,0)
& $greater(X5,X1) )
& ! [X1: $int] :
( ( $greatereq(X1,0)
& $greater(X5,X1) )
=> $lesseq(read(X0,X1),X9) )
& ? [X1: $int] :
( ( read(X0,X1) = X8 )
& $greatereq(X1,0)
& $greater(X5,X1) )
& ! [X1: $int] :
( ( $greatereq(X1,0)
& $greater(X5,X1) )
=> $lesseq(read(X0,X1),X8) ) )
=> ( X8 = X9 ) ),
file('/export/starexec/sandbox2/tmp/tmp.2bNOpzO4L6/Vampire---4.8_25656',c) ).
tff(f64,plain,
~ $less(sK3,read(sK0,sK5)),
inference(unit_resulting_resolution,[],[f42,f43,f45]) ).
tff(f45,plain,
! [X5: $int] :
( ~ $less(sK3,read(sK0,X5))
| $less(X5,0)
| ~ $less(X5,sK1) ),
inference(cnf_transformation,[],[f38]) ).
tff(f43,plain,
~ $less(sK5,0),
inference(cnf_transformation,[],[f38]) ).
tff(f42,plain,
$less(sK5,sK1),
inference(cnf_transformation,[],[f38]) ).
tff(f69,plain,
$less(sK3,sK2),
inference(unit_resulting_resolution,[],[f49,f62,f25]) ).
tff(f25,plain,
! [X0: $int,X1: $int] :
( ( X0 = X1 )
| $less(X1,X0)
| $less(X0,X1) ),
introduced(theory_axiom_144,[]) ).
tff(f62,plain,
~ $less(sK2,sK3),
inference(forward_demodulation,[],[f61,f48]) ).
tff(f48,plain,
sK3 = read(sK0,sK4),
inference(cnf_transformation,[],[f38]) ).
tff(f61,plain,
~ $less(sK2,read(sK0,sK4)),
inference(unit_resulting_resolution,[],[f46,f47,f41]) ).
tff(f41,plain,
! [X7: $int] :
( ~ $less(sK2,read(sK0,X7))
| $less(X7,0)
| ~ $less(X7,sK1) ),
inference(cnf_transformation,[],[f38]) ).
tff(f47,plain,
~ $less(sK4,0),
inference(cnf_transformation,[],[f38]) ).
tff(f46,plain,
$less(sK4,sK1),
inference(cnf_transformation,[],[f38]) ).
tff(f49,plain,
sK2 != sK3,
inference(cnf_transformation,[],[f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : DAT071_1 : TPTP v8.1.2. Released v6.1.0.
% 0.11/0.15 % 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.16/0.36 % Computer : n031.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 13:35:17 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a TF0_THM_EQU_ARI problem
% 0.16/0.37 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.2bNOpzO4L6/Vampire---4.8_25656
% 0.71/0.88 % (25923)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.71/0.88 % (25921)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 (2994ds/34Mi)
% 0.71/0.88 % (25924)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.71/0.88 % (25922)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 (2994ds/51Mi)
% 0.71/0.88 % (25925)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 (2994ds/34Mi)
% 0.71/0.88 % (25926)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.71/0.88 % (25927)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 (2994ds/83Mi)
% 0.71/0.88 % (25928)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 (2994ds/56Mi)
% 0.71/0.88 % (25924)First to succeed.
% 0.71/0.88 % (25924)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-25851"
% 0.71/0.88 % (25924)Refutation found. Thanks to Tanya!
% 0.71/0.88 % SZS status Theorem for Vampire---4
% 0.71/0.88 % SZS output start Proof for Vampire---4
% See solution above
% 0.71/0.88 % (25924)------------------------------
% 0.71/0.88 % (25924)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.88 % (25924)Termination reason: Refutation
% 0.71/0.88
% 0.71/0.88 % (25924)Memory used [KB]: 1053
% 0.71/0.88 % (25924)Time elapsed: 0.004 s
% 0.71/0.88 % (25924)Instructions burned: 5 (million)
% 0.71/0.88 % (25851)Success in time 0.507 s
% 0.71/0.88 % Vampire---4.8 exiting
%------------------------------------------------------------------------------