TSTP Solution File: DAT028_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT028_1 : TPTP v8.2.0. 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 : n020.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 : Mon May 20 19:49:21 EDT 2024
% Result : Theorem 0.71s 0.87s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 16
% Syntax : Number of formulae : 40 ( 14 unt; 9 typ; 0 def)
% Number of atoms : 106 ( 2 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 111 ( 36 ~; 20 |; 36 &)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 145 ( 53 atm; 3 fun; 38 num; 51 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 : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 67 ( 43 !; 24 ?; 67 :)
% 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_7,type,
sK0: collection ).
tff(func_def_8,type,
sK1: collection ).
tff(func_def_9,type,
sK2: $int ).
tff(func_def_10,type,
sK3: $int > $int ).
tff(pred_def_1,type,
in: ( $int * collection ) > $o ).
tff(f170,plain,
$false,
inference(subsumption_resolution,[],[f139,f135]) ).
tff(f135,plain,
$less(sK3(1),1),
inference(backward_demodulation,[],[f39,f125]) ).
tff(f125,plain,
1 = sK2,
inference(unit_resulting_resolution,[],[f33,f74,f16]) ).
tff(f16,plain,
! [X0: $int,X1: $int] :
( ( X0 = X1 )
| $less(X1,X0)
| $less(X0,X1) ),
introduced(theory_axiom_144,[]) ).
tff(f74,plain,
~ $less(sK2,1),
inference(evaluation,[],[f73]) ).
tff(f73,plain,
~ $less(sK2,$sum(0,1)),
inference(unit_resulting_resolution,[],[f51,f20]) ).
tff(f20,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(theory_axiom_161,[]) ).
tff(f51,plain,
$less(0,sK2),
inference(unit_resulting_resolution,[],[f37,f39,f15]) ).
tff(f15,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(theory_axiom_143,[]) ).
tff(f37,plain,
$less(0,sK3(sK2)),
inference(unit_resulting_resolution,[],[f35,f29]) ).
tff(f29,plain,
! [X5: $int] :
( ~ in(X5,sK1)
| $less(0,X5) ),
inference(cnf_transformation,[],[f28]) ).
tff(f28,plain,
( ~ $less(1,sK2)
& in(sK2,sK0)
& ! [X3: $int] :
( ( $less(sK3(X3),X3)
& in(sK3(X3),sK1) )
| ~ in(X3,sK0) )
& ! [X5: $int] :
( $less(0,X5)
| ~ in(X5,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f24,f27,f26,f25]) ).
tff(f25,plain,
( ? [X0: collection,X1: collection] :
( ? [X2: $int] :
( ~ $less(1,X2)
& in(X2,X0) )
& ! [X3: $int] :
( ? [X4: $int] :
( $less(X4,X3)
& in(X4,X1) )
| ~ in(X3,X0) )
& ! [X5: $int] :
( $less(0,X5)
| ~ in(X5,X1) ) )
=> ( ? [X2: $int] :
( ~ $less(1,X2)
& in(X2,sK0) )
& ! [X3: $int] :
( ? [X4: $int] :
( $less(X4,X3)
& in(X4,sK1) )
| ~ in(X3,sK0) )
& ! [X5: $int] :
( $less(0,X5)
| ~ in(X5,sK1) ) ) ),
introduced(choice_axiom,[]) ).
tff(f26,plain,
( ? [X2: $int] :
( ~ $less(1,X2)
& in(X2,sK0) )
=> ( ~ $less(1,sK2)
& in(sK2,sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f27,plain,
! [X3: $int] :
( ? [X4: $int] :
( $less(X4,X3)
& in(X4,sK1) )
=> ( $less(sK3(X3),X3)
& in(sK3(X3),sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f24,plain,
? [X0: collection,X1: collection] :
( ? [X2: $int] :
( ~ $less(1,X2)
& in(X2,X0) )
& ! [X3: $int] :
( ? [X4: $int] :
( $less(X4,X3)
& in(X4,X1) )
| ~ in(X3,X0) )
& ! [X5: $int] :
( $less(0,X5)
| ~ in(X5,X1) ) ),
inference(rectify,[],[f23]) ).
tff(f23,plain,
? [X0: collection,X1: collection] :
( ? [X5: $int] :
( ~ $less(1,X5)
& in(X5,X0) )
& ! [X2: $int] :
( ? [X3: $int] :
( $less(X3,X2)
& in(X3,X1) )
| ~ in(X2,X0) )
& ! [X4: $int] :
( $less(0,X4)
| ~ in(X4,X1) ) ),
inference(flattening,[],[f22]) ).
tff(f22,plain,
? [X0: collection,X1: collection] :
( ? [X5: $int] :
( ~ $less(1,X5)
& in(X5,X0) )
& ! [X2: $int] :
( ? [X3: $int] :
( $less(X3,X2)
& in(X3,X1) )
| ~ in(X2,X0) )
& ! [X4: $int] :
( $less(0,X4)
| ~ in(X4,X1) ) ),
inference(ennf_transformation,[],[f21]) ).
tff(f21,plain,
~ ! [X0: collection,X1: collection] :
( ( ! [X2: $int] :
( in(X2,X0)
=> ? [X3: $int] :
( $less(X3,X2)
& in(X3,X1) ) )
& ! [X4: $int] :
( in(X4,X1)
=> $less(0,X4) ) )
=> ! [X5: $int] :
( in(X5,X0)
=> $less(1,X5) ) ),
inference(rectify,[],[f8]) ).
tff(f8,plain,
~ ! [X0: collection,X1: collection] :
( ( ! [X3: $int] :
( in(X3,X0)
=> ? [X4: $int] :
( $less(X4,X3)
& in(X4,X1) ) )
& ! [X2: $int] :
( in(X2,X1)
=> $less(0,X2) ) )
=> ! [X5: $int] :
( in(X5,X0)
=> $less(1,X5) ) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,negated_conjecture,
~ ! [X0: collection,X1: collection] :
( ( ! [X3: $int] :
( in(X3,X0)
=> ? [X4: $int] :
( $greater(X3,X4)
& in(X4,X1) ) )
& ! [X2: $int] :
( in(X2,X1)
=> $greater(X2,0) ) )
=> ! [X5: $int] :
( in(X5,X0)
=> $greater(X5,1) ) ),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
! [X0: collection,X1: collection] :
( ( ! [X3: $int] :
( in(X3,X0)
=> ? [X4: $int] :
( $greater(X3,X4)
& in(X4,X1) ) )
& ! [X2: $int] :
( in(X2,X1)
=> $greater(X2,0) ) )
=> ! [X5: $int] :
( in(X5,X0)
=> $greater(X5,1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f35,plain,
in(sK3(sK2),sK1),
inference(unit_resulting_resolution,[],[f32,f30]) ).
tff(f30,plain,
! [X3: $int] :
( in(sK3(X3),sK1)
| ~ in(X3,sK0) ),
inference(cnf_transformation,[],[f28]) ).
tff(f32,plain,
in(sK2,sK0),
inference(cnf_transformation,[],[f28]) ).
tff(f33,plain,
~ $less(1,sK2),
inference(cnf_transformation,[],[f28]) ).
tff(f39,plain,
$less(sK3(sK2),sK2),
inference(unit_resulting_resolution,[],[f32,f31]) ).
tff(f31,plain,
! [X3: $int] :
( $less(sK3(X3),X3)
| ~ in(X3,sK0) ),
inference(cnf_transformation,[],[f28]) ).
tff(f139,plain,
~ $less(sK3(1),1),
inference(backward_demodulation,[],[f50,f125]) ).
tff(f50,plain,
~ $less(sK3(sK2),1),
inference(evaluation,[],[f49]) ).
tff(f49,plain,
~ $less(sK3(sK2),$sum(0,1)),
inference(unit_resulting_resolution,[],[f37,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT028_1 : TPTP v8.2.0. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 23:43:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TF0_THM_EQU_ARI problem
% 0.15/0.36 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/benchmark/theBenchmark.p
% 0.71/0.87 % (5858)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 theBenchmark for (2994ds/51Mi)
% 0.71/0.87 % (5857)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 theBenchmark for (2994ds/34Mi)
% 0.71/0.87 % (5859)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.71/0.87 % (5860)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.71/0.87 % (5861)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 theBenchmark for (2994ds/34Mi)
% 0.71/0.87 % (5863)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 theBenchmark for (2994ds/83Mi)
% 0.71/0.87 % (5862)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.71/0.87 % (5864)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2994ds/56Mi)
% 0.71/0.87 % (5860)First to succeed.
% 0.71/0.87 % (5860)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5808"
% 0.71/0.87 % (5860)Refutation found. Thanks to Tanya!
% 0.71/0.87 % SZS status Theorem for theBenchmark
% 0.71/0.87 % SZS output start Proof for theBenchmark
% See solution above
% 0.71/0.88 % (5860)------------------------------
% 0.71/0.88 % (5860)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.88 % (5860)Termination reason: Refutation
% 0.71/0.88
% 0.71/0.88 % (5860)Memory used [KB]: 1081
% 0.71/0.88 % (5860)Time elapsed: 0.007 s
% 0.71/0.88 % (5860)Instructions burned: 8 (million)
% 0.71/0.88 % (5808)Success in time 0.507 s
% 0.71/0.88 % Vampire---4.8 exiting
%------------------------------------------------------------------------------