TSTP Solution File: DAT022_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT022_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 : n017.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:35 EDT 2024
% Result : Theorem 0.61s 0.79s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 38 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 107 ( 27 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 116 ( 39 ~; 29 |; 33 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 113 ( 23 atm; 0 fun; 49 num; 41 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 6 usr; 7 con; 0-2 aty)
% Number of variables : 65 ( 51 !; 14 ?; 65 :)
% 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_9,type,
sK0: collection ).
tff(func_def_10,type,
sK1: collection ).
tff(func_def_11,type,
sK2: $int ).
tff(pred_def_1,type,
in: ( $int * collection ) > $o ).
tff(f109,plain,
$false,
inference(evaluation,[],[f101]) ).
tff(f101,plain,
~ $less(0,2),
inference(superposition,[],[f38,f97]) ).
tff(f97,plain,
2 = sK2,
inference(subsumption_resolution,[],[f95,f37]) ).
tff(f37,plain,
in(sK2,sK0),
inference(cnf_transformation,[],[f30]) ).
tff(f30,plain,
( ~ $less(0,sK2)
& in(sK2,sK0)
& ( sK0 = add(2,remove(7,sK1)) )
& ! [X3: $int] :
( $less(0,X3)
| ~ in(X3,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f27,f29,f28]) ).
tff(f28,plain,
( ? [X0: collection,X1: collection] :
( ? [X2: $int] :
( ~ $less(0,X2)
& in(X2,X0) )
& ( add(2,remove(7,X1)) = X0 )
& ! [X3: $int] :
( $less(0,X3)
| ~ in(X3,X1) ) )
=> ( ? [X2: $int] :
( ~ $less(0,X2)
& in(X2,sK0) )
& ( sK0 = add(2,remove(7,sK1)) )
& ! [X3: $int] :
( $less(0,X3)
| ~ in(X3,sK1) ) ) ),
introduced(choice_axiom,[]) ).
tff(f29,plain,
( ? [X2: $int] :
( ~ $less(0,X2)
& in(X2,sK0) )
=> ( ~ $less(0,sK2)
& in(sK2,sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f27,plain,
? [X0: collection,X1: collection] :
( ? [X2: $int] :
( ~ $less(0,X2)
& in(X2,X0) )
& ( add(2,remove(7,X1)) = X0 )
& ! [X3: $int] :
( $less(0,X3)
| ~ in(X3,X1) ) ),
inference(rectify,[],[f26]) ).
tff(f26,plain,
? [X0: collection,X1: collection] :
( ? [X3: $int] :
( ~ $less(0,X3)
& in(X3,X0) )
& ( add(2,remove(7,X1)) = X0 )
& ! [X2: $int] :
( $less(0,X2)
| ~ in(X2,X1) ) ),
inference(flattening,[],[f25]) ).
tff(f25,plain,
? [X0: collection,X1: collection] :
( ? [X3: $int] :
( ~ $less(0,X3)
& in(X3,X0) )
& ( add(2,remove(7,X1)) = X0 )
& ! [X2: $int] :
( $less(0,X2)
| ~ in(X2,X1) ) ),
inference(ennf_transformation,[],[f8]) ).
tff(f8,plain,
~ ! [X0: collection,X1: collection] :
( ( ( add(2,remove(7,X1)) = X0 )
& ! [X2: $int] :
( in(X2,X1)
=> $less(0,X2) ) )
=> ! [X3: $int] :
( in(X3,X0)
=> $less(0,X3) ) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,negated_conjecture,
~ ! [X0: collection,X1: collection] :
( ( ( add(2,remove(7,X1)) = X0 )
& ! [X2: $int] :
( in(X2,X1)
=> $greater(X2,0) ) )
=> ! [X3: $int] :
( in(X3,X0)
=> $greater(X3,0) ) ),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
! [X0: collection,X1: collection] :
( ( ( add(2,remove(7,X1)) = X0 )
& ! [X2: $int] :
( in(X2,X1)
=> $greater(X2,0) ) )
=> ! [X3: $int] :
( in(X3,X0)
=> $greater(X3,0) ) ),
file('/export/starexec/sandbox/tmp/tmp.YKje3LBAx1/Vampire---4.8_30933',co1) ).
tff(f95,plain,
( ( 2 = sK2 )
| ~ in(sK2,sK0) ),
inference(resolution,[],[f90,f60]) ).
tff(f60,plain,
~ in(sK2,sK1),
inference(resolution,[],[f35,f38]) ).
tff(f35,plain,
! [X3: $int] :
( $less(0,X3)
| ~ in(X3,sK1) ),
inference(cnf_transformation,[],[f30]) ).
tff(f90,plain,
! [X0: $int] :
( in(X0,sK1)
| ( 2 = X0 )
| ~ in(X0,sK0) ),
inference(resolution,[],[f71,f44]) ).
tff(f44,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/tmp/tmp.YKje3LBAx1/Vampire---4.8_30933',ax5) ).
tff(f71,plain,
! [X0: $int] :
( in(X0,remove(7,sK1))
| ~ in(X0,sK0)
| ( 2 = X0 ) ),
inference(superposition,[],[f41,f36]) ).
tff(f36,plain,
sK0 = add(2,remove(7,sK1)),
inference(cnf_transformation,[],[f30]) ).
tff(f41,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/tmp/tmp.YKje3LBAx1/Vampire---4.8_30933',ax4) ).
tff(f38,plain,
~ $less(0,sK2),
inference(cnf_transformation,[],[f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : DAT022_1 : TPTP v8.1.2. Released v5.0.0.
% 0.04/0.10 % 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.09/0.30 % Computer : n017.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Apr 30 16:04:49 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a TF0_THM_EQU_ARI problem
% 0.09/0.30 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.YKje3LBAx1/Vampire---4.8_30933
% 0.61/0.78 % (31044)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.78 % (31046)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.78 % (31047)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.78 % (31048)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.78 % (31045)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.78 % (31049)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.78 % (31050)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.78 % (31051)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 % (31049)First to succeed.
% 0.61/0.79 % (31050)Also succeeded, but the first one will report.
% 0.61/0.79 % (31049)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 % (31049)------------------------------
% 0.61/0.79 % (31049)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.79 % (31049)Termination reason: Refutation
% 0.61/0.79
% 0.61/0.79 % (31049)Memory used [KB]: 1062
% 0.61/0.79 % (31049)Time elapsed: 0.005 s
% 0.61/0.79 % (31049)Instructions burned: 6 (million)
% 0.61/0.79 % (31049)------------------------------
% 0.61/0.79 % (31049)------------------------------
% 0.61/0.79 % (31040)Success in time 0.479 s
% 0.61/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------