TSTP Solution File: DAT081_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT081_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 : n005.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:47 EDT 2024
% Result : Theorem 0.57s 0.75s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 34 ( 9 unt; 15 typ; 0 def)
% Number of atoms : 72 ( 40 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 81 ( 28 ~; 24 |; 24 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 36 ( 0 atm; 0 fun; 0 num; 36 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 21 ( 12 >; 9 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 2 con; 0-2 aty)
% Number of variables : 67 ( 41 !; 26 ?; 67 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
list: $tType ).
tff(func_def_0,type,
nil: list ).
tff(func_def_1,type,
cons: ( $int * list ) > list ).
tff(func_def_2,type,
head: list > $int ).
tff(func_def_3,type,
tail: list > list ).
tff(func_def_5,type,
length: list > $int ).
tff(func_def_8,type,
count: ( $int * list ) > $int ).
tff(func_def_9,type,
append: ( list * list ) > list ).
tff(func_def_11,type,
sK0: $int ).
tff(func_def_12,type,
sK1: ( $int * list ) > $int ).
tff(func_def_13,type,
sK2: ( $int * list ) > list ).
tff(func_def_14,type,
sK3: ( $int * list ) > $int ).
tff(func_def_15,type,
sK4: ( $int * list ) > list ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(f74,plain,
$false,
inference(unit_resulting_resolution,[],[f44,f45,f45,f48]) ).
tff(f48,plain,
! [X0: $int,X1: list] :
( ( cons(sK3(X0,X1),sK4(X0,X1)) = X1 )
| ( cons(sK1(X0,X1),sK2(X0,X1)) = X1 )
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
tff(f43,plain,
! [X0: $int,X1: list] :
( ( in(X0,X1)
| ( ! [X2: $int,X3: list] :
( ~ in(X0,X3)
| ( cons(X2,X3) != X1 ) )
& ! [X4: $int,X5: list] :
( ( X0 != X4 )
| ( cons(X4,X5) != X1 ) ) ) )
& ( ( in(X0,sK2(X0,X1))
& ( cons(sK1(X0,X1),sK2(X0,X1)) = X1 ) )
| ( ( sK3(X0,X1) = X0 )
& ( cons(sK3(X0,X1),sK4(X0,X1)) = X1 ) )
| ~ in(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f40,f42,f41]) ).
tff(f41,plain,
! [X0: $int,X1: list] :
( ? [X6: $int,X7: list] :
( in(X0,X7)
& ( cons(X6,X7) = X1 ) )
=> ( in(X0,sK2(X0,X1))
& ( cons(sK1(X0,X1),sK2(X0,X1)) = X1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f42,plain,
! [X0: $int,X1: list] :
( ? [X8: $int,X9: list] :
( ( X0 = X8 )
& ( cons(X8,X9) = X1 ) )
=> ( ( sK3(X0,X1) = X0 )
& ( cons(sK3(X0,X1),sK4(X0,X1)) = X1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f40,plain,
! [X0: $int,X1: list] :
( ( in(X0,X1)
| ( ! [X2: $int,X3: list] :
( ~ in(X0,X3)
| ( cons(X2,X3) != X1 ) )
& ! [X4: $int,X5: list] :
( ( X0 != X4 )
| ( cons(X4,X5) != X1 ) ) ) )
& ( ? [X6: $int,X7: list] :
( in(X0,X7)
& ( cons(X6,X7) = X1 ) )
| ? [X8: $int,X9: list] :
( ( X0 = X8 )
& ( cons(X8,X9) = X1 ) )
| ~ in(X0,X1) ) ),
inference(rectify,[],[f39]) ).
tff(f39,plain,
! [X0: $int,X1: list] :
( ( in(X0,X1)
| ( ! [X2: $int,X3: list] :
( ~ in(X0,X3)
| ( cons(X2,X3) != X1 ) )
& ! [X4: $int,X5: list] :
( ( X0 != X4 )
| ( cons(X4,X5) != X1 ) ) ) )
& ( ? [X2: $int,X3: list] :
( in(X0,X3)
& ( cons(X2,X3) = X1 ) )
| ? [X4: $int,X5: list] :
( ( X0 = X4 )
& ( cons(X4,X5) = X1 ) )
| ~ in(X0,X1) ) ),
inference(flattening,[],[f38]) ).
tff(f38,plain,
! [X0: $int,X1: list] :
( ( in(X0,X1)
| ( ! [X2: $int,X3: list] :
( ~ in(X0,X3)
| ( cons(X2,X3) != X1 ) )
& ! [X4: $int,X5: list] :
( ( X0 != X4 )
| ( cons(X4,X5) != X1 ) ) ) )
& ( ? [X2: $int,X3: list] :
( in(X0,X3)
& ( cons(X2,X3) = X1 ) )
| ? [X4: $int,X5: list] :
( ( X0 = X4 )
& ( cons(X4,X5) = X1 ) )
| ~ in(X0,X1) ) ),
inference(nnf_transformation,[],[f33]) ).
tff(f33,plain,
! [X0: $int,X1: list] :
( in(X0,X1)
<=> ( ? [X2: $int,X3: list] :
( in(X0,X3)
& ( cons(X2,X3) = X1 ) )
| ? [X4: $int,X5: list] :
( ( X0 = X4 )
& ( cons(X4,X5) = X1 ) ) ) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X2: $int,X1: list] :
( in(X2,X1)
<=> ( ? [X3: $int,X4: list] :
( in(X2,X4)
& ( cons(X3,X4) = X1 ) )
| ? [X3: $int,X4: list] :
( ( X2 = X3 )
& ( cons(X3,X4) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LjDqaNBvrd/Vampire---4.8_25105',in_conv) ).
tff(f45,plain,
! [X0: $int,X1: list] : ( cons(X0,X1) != nil ),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
! [X0: $int,X1: list] : ( cons(X0,X1) != nil ),
file('/export/starexec/sandbox2/tmp/tmp.LjDqaNBvrd/Vampire---4.8_25105',l4) ).
tff(f44,plain,
in(sK0,nil),
inference(cnf_transformation,[],[f36]) ).
tff(f36,plain,
in(sK0,nil),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f34,f35]) ).
tff(f35,plain,
( ? [X0: $int] : in(X0,nil)
=> in(sK0,nil) ),
introduced(choice_axiom,[]) ).
tff(f34,plain,
? [X0: $int] : in(X0,nil),
inference(ennf_transformation,[],[f31]) ).
tff(f31,plain,
~ ! [X0: $int] : ~ in(X0,nil),
inference(rectify,[],[f16]) ).
tff(f16,negated_conjecture,
~ ! [X7: $int] : ~ in(X7,nil),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
! [X7: $int] : ~ in(X7,nil),
file('/export/starexec/sandbox2/tmp/tmp.LjDqaNBvrd/Vampire---4.8_25105',c) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : DAT081_1 : TPTP v8.1.2. Released v6.1.0.
% 0.05/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.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 16:29:56 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 This is a TF0_THM_EQU_ARI problem
% 0.14/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.LjDqaNBvrd/Vampire---4.8_25105
% 0.57/0.74 % (25309)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 (2996ds/34Mi)
% 0.57/0.74 % (25316)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 (2996ds/56Mi)
% 0.57/0.74 % (25316)Refutation not found, incomplete strategy% (25316)------------------------------
% 0.57/0.74 % (25316)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.74 % (25316)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.74
% 0.57/0.74 % (25316)Memory used [KB]: 1040
% 0.57/0.74 % (25316)Time elapsed: 0.002 s
% 0.57/0.74 % (25316)Instructions burned: 3 (million)
% 0.57/0.74 % (25316)------------------------------
% 0.57/0.74 % (25316)------------------------------
% 0.57/0.74 % (25311)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.57/0.74 % (25310)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 (2996ds/51Mi)
% 0.57/0.74 % (25312)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.74 % (25313)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 (2996ds/34Mi)
% 0.57/0.74 % (25314)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.74 % (25309)Refutation not found, incomplete strategy% (25309)------------------------------
% 0.57/0.74 % (25309)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.74 % (25315)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 (2996ds/83Mi)
% 0.57/0.74 % (25309)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.74
% 0.57/0.74 % (25309)Memory used [KB]: 1060
% 0.57/0.74 % (25309)Time elapsed: 0.003 s
% 0.57/0.74 % (25309)Instructions burned: 4 (million)
% 0.57/0.74 % (25309)------------------------------
% 0.57/0.74 % (25309)------------------------------
% 0.57/0.75 % (25314)Refutation not found, incomplete strategy% (25314)------------------------------
% 0.57/0.75 % (25314)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75 % (25314)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (25314)Memory used [KB]: 1024
% 0.57/0.75 % (25314)Time elapsed: 0.003 s
% 0.57/0.75 % (25314)Instructions burned: 3 (million)
% 0.57/0.75 % (25314)------------------------------
% 0.57/0.75 % (25314)------------------------------
% 0.57/0.75 % (25312)First to succeed.
% 0.57/0.75 % (25319)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 (2996ds/55Mi)
% 0.57/0.75 % (25320)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 (2996ds/50Mi)
% 0.57/0.75 % (25315)Also succeeded, but the first one will report.
% 0.57/0.75 % (25312)Refutation found. Thanks to Tanya!
% 0.57/0.75 % SZS status Theorem for Vampire---4
% 0.57/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.75 % (25312)------------------------------
% 0.57/0.75 % (25312)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75 % (25312)Termination reason: Refutation
% 0.57/0.75
% 0.57/0.75 % (25312)Memory used [KB]: 1052
% 0.57/0.75 % (25312)Time elapsed: 0.004 s
% 0.57/0.75 % (25312)Instructions burned: 5 (million)
% 0.57/0.75 % (25312)------------------------------
% 0.57/0.75 % (25312)------------------------------
% 0.57/0.75 % (25271)Success in time 0.384 s
% 0.57/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------