TSTP Solution File: DAT009_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT009_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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n019.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 : Wed May 1 02:18:32 EDT 2024
% Result : Theorem 0.62s 0.81s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 16
% Syntax : Number of formulae : 45 ( 21 unt; 7 typ; 0 def)
% Number of atoms : 67 ( 25 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 47 ( 18 ~; 9 |; 15 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 146 ( 41 atm; 28 fun; 26 num; 51 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 6 usr; 7 con; 0-3 aty)
% Number of variables : 70 ( 52 !; 18 ?; 70 :)
% 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_7,type,
sK0: array ).
tff(func_def_8,type,
sK1: array ).
tff(func_def_9,type,
sK2: $int ).
tff(func_def_10,type,
sK3: $int ).
tff(f436,plain,
$false,
inference(subsumption_resolution,[],[f435,f11]) ).
tff(f11,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_142,[]) ).
tff(f435,plain,
$less($sum(3,sK2),$sum(3,sK2)),
inference(forward_demodulation,[],[f401,f40]) ).
tff(f40,plain,
$sum(3,sK2) = read(sK0,sK2),
inference(superposition,[],[f29,f30]) ).
tff(f30,plain,
sK0 = write(sK1,sK2,$sum(3,sK2)),
inference(backward_demodulation,[],[f26,f6]) ).
tff(f6,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f26,plain,
sK0 = write(sK1,sK2,$sum(sK2,3)),
inference(cnf_transformation,[],[f24]) ).
tff(f24,plain,
( ~ $less(sK3,read(sK0,sK3))
& ( sK0 = write(sK1,sK2,$sum(sK2,3)) )
& ! [X4: $int] : $less(X4,read(sK1,X4)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f21,f23,f22]) ).
tff(f22,plain,
( ? [X0: array,X1: array,X2: $int] :
( ? [X3: $int] : ~ $less(X3,read(X0,X3))
& ( write(X1,X2,$sum(X2,3)) = X0 )
& ! [X4: $int] : $less(X4,read(X1,X4)) )
=> ( ? [X3: $int] : ~ $less(X3,read(sK0,X3))
& ( sK0 = write(sK1,sK2,$sum(sK2,3)) )
& ! [X4: $int] : $less(X4,read(sK1,X4)) ) ),
introduced(choice_axiom,[]) ).
tff(f23,plain,
( ? [X3: $int] : ~ $less(X3,read(sK0,X3))
=> ~ $less(sK3,read(sK0,sK3)) ),
introduced(choice_axiom,[]) ).
tff(f21,plain,
? [X0: array,X1: array,X2: $int] :
( ? [X3: $int] : ~ $less(X3,read(X0,X3))
& ( write(X1,X2,$sum(X2,3)) = X0 )
& ! [X4: $int] : $less(X4,read(X1,X4)) ),
inference(rectify,[],[f20]) ).
tff(f20,plain,
? [X0: array,X1: array,X2: $int] :
( ? [X4: $int] : ~ $less(X4,read(X0,X4))
& ( write(X1,X2,$sum(X2,3)) = X0 )
& ! [X3: $int] : $less(X3,read(X1,X3)) ),
inference(flattening,[],[f19]) ).
tff(f19,plain,
? [X0: array,X1: array,X2: $int] :
( ? [X4: $int] : ~ $less(X4,read(X0,X4))
& ( write(X1,X2,$sum(X2,3)) = X0 )
& ! [X3: $int] : $less(X3,read(X1,X3)) ),
inference(ennf_transformation,[],[f5]) ).
tff(f5,plain,
~ ! [X0: array,X1: array,X2: $int] :
( ( ( write(X1,X2,$sum(X2,3)) = X0 )
& ! [X3: $int] : $less(X3,read(X1,X3)) )
=> ! [X4: $int] : $less(X4,read(X0,X4)) ),
inference(theory_normalization,[],[f4]) ).
tff(f4,negated_conjecture,
~ ! [X0: array,X1: array,X2: $int] :
( ( ( write(X1,X2,$sum(X2,3)) = X0 )
& ! [X3: $int] : $greater(read(X1,X3),X3) )
=> ! [X4: $int] : $greater(read(X0,X4),X4) ),
inference(negated_conjecture,[],[f3]) ).
tff(f3,conjecture,
! [X0: array,X1: array,X2: $int] :
( ( ( write(X1,X2,$sum(X2,3)) = X0 )
& ! [X3: $int] : $greater(read(X1,X3),X3) )
=> ! [X4: $int] : $greater(read(X0,X4),X4) ),
file('/export/starexec/sandbox/tmp/tmp.zfT0M66YU6/Vampire---4.8_2646',co1) ).
tff(f29,plain,
! [X2: $int,X0: array,X1: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: array,X1: $int,X2: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.zfT0M66YU6/Vampire---4.8_2646',ax1) ).
tff(f401,plain,
$less(read(sK0,sK2),$sum(3,sK2)),
inference(backward_demodulation,[],[f189,f382]) ).
tff(f382,plain,
sK2 = sK3,
inference(resolution,[],[f89,f27]) ).
tff(f27,plain,
~ $less(sK3,read(sK0,sK3)),
inference(cnf_transformation,[],[f24]) ).
tff(f89,plain,
! [X0: $int] :
( $less(X0,read(sK0,X0))
| ( sK2 = X0 ) ),
inference(superposition,[],[f25,f86]) ).
tff(f86,plain,
! [X0: $int] :
( ( read(sK1,X0) = read(sK0,X0) )
| ( sK2 = X0 ) ),
inference(superposition,[],[f28,f30]) ).
tff(f28,plain,
! [X2: $int,X3: $int,X0: array,X1: $int] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
! [X0: array,X1: $int,X2: $int,X3: $int] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X3: array,X4: $int,X5: $int,X6: $int] :
( ( read(write(X3,X4,X6),X5) = read(X3,X5) )
| ( X4 = X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.zfT0M66YU6/Vampire---4.8_2646',ax2) ).
tff(f25,plain,
! [X4: $int] : $less(X4,read(sK1,X4)),
inference(cnf_transformation,[],[f24]) ).
tff(f189,plain,
$less(read(sK0,sK3),$sum(3,sK3)),
inference(evaluation,[],[f188]) ).
tff(f188,plain,
$less(read(sK0,sK3),$sum($sum(2,sK3),1)),
inference(resolution,[],[f142,f15]) ).
tff(f15,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,$sum(X0,1)) ),
introduced(theory_axiom_147,[]) ).
tff(f142,plain,
~ $less($sum(2,sK3),read(sK0,sK3)),
inference(resolution,[],[f118,f42]) ).
tff(f42,plain,
! [X0: $int,X1: $int] :
( ~ $less(X0,X1)
| ~ $less(X1,X0) ),
inference(resolution,[],[f12,f11]) ).
tff(f12,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(theory_axiom_143,[]) ).
tff(f118,plain,
$less(read(sK0,sK3),$sum(2,sK3)),
inference(evaluation,[],[f117]) ).
tff(f117,plain,
$less(read(sK0,sK3),$sum($sum(1,sK3),1)),
inference(resolution,[],[f95,f15]) ).
tff(f95,plain,
~ $less($sum(1,sK3),read(sK0,sK3)),
inference(resolution,[],[f42,f33]) ).
tff(f33,plain,
$less(read(sK0,sK3),$sum(1,sK3)),
inference(forward_demodulation,[],[f31,f6]) ).
tff(f31,plain,
$less(read(sK0,sK3),$sum(sK3,1)),
inference(resolution,[],[f15,f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : DAT009_1 : TPTP v8.1.2. Released v5.0.0.
% 0.08/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.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Apr 30 16:33:44 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a TF0_THM_EQU_ARI problem
% 0.10/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/tmp/tmp.zfT0M66YU6/Vampire---4.8_2646
% 0.60/0.79 % (2762)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.60/0.79 % (2761)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.60/0.79 % (2759)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.60/0.79 % (2763)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.60/0.79 % (2760)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.60/0.79 % (2764)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.60/0.79 % (2765)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.60/0.79 % (2766)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.60/0.80 % (2759)Instruction limit reached!
% 0.60/0.80 % (2759)------------------------------
% 0.60/0.80 % (2759)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80 % (2759)Termination reason: Unknown
% 0.60/0.80 % (2759)Termination phase: Saturation
% 0.60/0.80
% 0.60/0.80 % (2759)Memory used [KB]: 1122
% 0.60/0.80 % (2759)Time elapsed: 0.019 s
% 0.60/0.80 % (2759)Instructions burned: 35 (million)
% 0.60/0.80 % (2759)------------------------------
% 0.60/0.80 % (2759)------------------------------
% 0.60/0.80 % (2762)Instruction limit reached!
% 0.60/0.80 % (2762)------------------------------
% 0.60/0.80 % (2762)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80 % (2762)Termination reason: Unknown
% 0.60/0.80 % (2762)Termination phase: Saturation
% 0.60/0.80 % (2763)Instruction limit reached!
% 0.60/0.80 % (2763)------------------------------
% 0.60/0.80 % (2763)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80 % (2763)Termination reason: Unknown
% 0.60/0.80 % (2763)Termination phase: Saturation
% 0.60/0.80
% 0.60/0.80 % (2763)Memory used [KB]: 1120
% 0.60/0.80 % (2763)Time elapsed: 0.019 s
% 0.60/0.80 % (2763)Instructions burned: 35 (million)
% 0.60/0.80 % (2763)------------------------------
% 0.60/0.80 % (2763)------------------------------
% 0.60/0.80
% 0.60/0.80 % (2762)Memory used [KB]: 1201
% 0.60/0.80 % (2762)Time elapsed: 0.019 s
% 0.60/0.80 % (2762)Instructions burned: 34 (million)
% 0.60/0.80 % (2762)------------------------------
% 0.60/0.80 % (2762)------------------------------
% 0.62/0.81 % (2767)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.62/0.81 % (2769)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/208Mi)
% 0.62/0.81 % (2768)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.62/0.81 % (2761)First to succeed.
% 0.62/0.81 % (2761)Refutation found. Thanks to Tanya!
% 0.62/0.81 % SZS status Theorem for Vampire---4
% 0.62/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.81 % (2761)------------------------------
% 0.62/0.81 % (2761)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.81 % (2761)Termination reason: Refutation
% 0.62/0.81
% 0.62/0.81 % (2761)Memory used [KB]: 1242
% 0.62/0.81 % (2761)Time elapsed: 0.024 s
% 0.62/0.81 % (2761)Instructions burned: 43 (million)
% 0.62/0.81 % (2761)------------------------------
% 0.62/0.81 % (2761)------------------------------
% 0.62/0.81 % (2754)Success in time 0.495 s
% 0.62/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------