TSTP Solution File: DAT025_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT025_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 : n021.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.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 56 ( 13 unt; 7 typ; 0 def)
% Number of atoms : 114 ( 10 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 115 ( 50 ~; 29 |; 12 &)
% ( 12 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 128 ( 29 atm; 3 fun; 59 num; 37 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 9 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 5 usr; 6 con; 0-2 aty)
% Number of variables : 48 ( 44 !; 4 ?; 48 :)
% 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_8,type,
sK0: collection ).
tff(func_def_9,type,
sK1: $int ).
tff(pred_def_1,type,
in: ( $int * collection ) > $o ).
tff(f1373,plain,
$false,
inference(avatar_sat_refutation,[],[f64,f101,f1283,f1352,f1372]) ).
tff(f1372,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f1371]) ).
tff(f1371,plain,
( $false
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f1366,f1140]) ).
tff(f1140,plain,
! [X0: $int,X1: $int] : ~ in(0,remove(X0,remove(X1,sK0))),
inference(unit_resulting_resolution,[],[f1139,f32]) ).
tff(f32,plain,
! [X2: $int,X0: $int,X1: collection] :
( ~ in(X0,remove(X2,X1))
| in(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tff(f22,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.zfW2npAi07/Vampire---4.8_12522',ax5) ).
tff(f1139,plain,
! [X0: $int] : ~ in(0,remove(X0,sK0)),
inference(unit_resulting_resolution,[],[f1132,f32]) ).
tff(f1132,plain,
~ in(0,sK0),
inference(unit_resulting_resolution,[],[f35,f29]) ).
tff(f29,plain,
! [X1: $int] :
( in(X1,remove(0,remove(1,sK0)))
| ~ in(X1,sK0) ),
inference(cnf_transformation,[],[f25]) ).
tff(f25,plain,
? [X0: collection] :
( ? [X3: $int] :
( $less(X3,2)
& in(X3,X0) )
& ! [X1: $int] :
( in(X1,X0)
<=> in(X1,remove(0,remove(1,X0))) )
& ! [X2: $int] :
( ~ $less(X2,0)
| ~ in(X2,X0) ) ),
inference(flattening,[],[f24]) ).
tff(f24,plain,
? [X0: collection] :
( ? [X3: $int] :
( $less(X3,2)
& in(X3,X0) )
& ! [X1: $int] :
( in(X1,X0)
<=> in(X1,remove(0,remove(1,X0))) )
& ! [X2: $int] :
( ~ $less(X2,0)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f21]) ).
tff(f21,plain,
~ ! [X0: collection] :
( ( ! [X1: $int] :
( in(X1,X0)
<=> in(X1,remove(0,remove(1,X0))) )
& ! [X2: $int] :
( in(X2,X0)
=> ~ $less(X2,0) ) )
=> ! [X3: $int] :
( in(X3,X0)
=> ~ $less(X3,2) ) ),
inference(rectify,[],[f8]) ).
tff(f8,plain,
~ ! [X0: collection] :
( ( ! [X2: $int] :
( in(X2,X0)
<=> in(X2,remove(0,remove(1,X0))) )
& ! [X1: $int] :
( in(X1,X0)
=> ~ $less(X1,0) ) )
=> ! [X3: $int] :
( in(X3,X0)
=> ~ $less(X3,2) ) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,negated_conjecture,
~ ! [X0: collection] :
( ( ! [X2: $int] :
( in(X2,X0)
<=> in(X2,remove(0,remove(1,X0))) )
& ! [X1: $int] :
( in(X1,X0)
=> $greatereq(X1,0) ) )
=> ! [X3: $int] :
( in(X3,X0)
=> $greatereq(X3,2) ) ),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
! [X0: collection] :
( ( ! [X2: $int] :
( in(X2,X0)
<=> in(X2,remove(0,remove(1,X0))) )
& ! [X1: $int] :
( in(X1,X0)
=> $greatereq(X1,0) ) )
=> ! [X3: $int] :
( in(X3,X0)
=> $greatereq(X3,2) ) ),
file('/export/starexec/sandbox/tmp/tmp.zfW2npAi07/Vampire---4.8_12522',co1) ).
tff(f35,plain,
! [X2: $int,X1: collection] : ~ in(X2,remove(X2,X1)),
inference(equality_resolution,[],[f33]) ).
tff(f33,plain,
! [X2: $int,X0: $int,X1: collection] :
( ~ in(X0,remove(X2,X1))
| ( X0 != X2 ) ),
inference(cnf_transformation,[],[f22]) ).
tff(f1366,plain,
( in(0,remove(0,remove(1,sK0)))
| ~ spl2_1 ),
inference(superposition,[],[f1129,f58]) ).
tff(f58,plain,
( ( 0 = sK1 )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f56]) ).
tff(f56,plain,
( spl2_1
<=> ( 0 = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
tff(f1129,plain,
in(sK1,remove(0,remove(1,sK0))),
inference(unit_resulting_resolution,[],[f26,f29]) ).
tff(f26,plain,
in(sK1,sK0),
inference(cnf_transformation,[],[f25]) ).
tff(f1352,plain,
~ spl2_4,
inference(avatar_contradiction_clause,[],[f1351]) ).
tff(f1351,plain,
( $false
| ~ spl2_4 ),
inference(subsumption_resolution,[],[f1350,f27]) ).
tff(f27,plain,
$less(sK1,2),
inference(cnf_transformation,[],[f25]) ).
tff(f1350,plain,
( ~ $less(sK1,2)
| ~ spl2_4 ),
inference(evaluation,[],[f1338]) ).
tff(f1338,plain,
( ~ $less(sK1,$sum(1,1))
| ~ spl2_4 ),
inference(unit_resulting_resolution,[],[f99,f20]) ).
tff(f20,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(theory_axiom_161,[]) ).
tff(f99,plain,
( $less(1,sK1)
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f97]) ).
tff(f97,plain,
( spl2_4
<=> $less(1,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
tff(f1283,plain,
~ spl2_3,
inference(avatar_contradiction_clause,[],[f1282]) ).
tff(f1282,plain,
( $false
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f1266,f116]) ).
tff(f116,plain,
( in(1,sK0)
| ~ spl2_3 ),
inference(superposition,[],[f26,f95]) ).
tff(f95,plain,
( ( 1 = sK1 )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f93]) ).
tff(f93,plain,
( spl2_3
<=> ( 1 = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
tff(f1266,plain,
~ in(1,sK0),
inference(resolution,[],[f1136,f35]) ).
tff(f1136,plain,
! [X0: $int] :
( in(X0,remove(1,sK0))
| ~ in(X0,sK0) ),
inference(resolution,[],[f29,f32]) ).
tff(f101,plain,
( spl2_3
| spl2_4
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f91,f60,f97,f93]) ).
tff(f60,plain,
( spl2_2
<=> $less(0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f91,plain,
( $less(1,sK1)
| ( 1 = sK1 )
| ~ spl2_2 ),
inference(resolution,[],[f80,f16]) ).
tff(f16,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_144,[]) ).
tff(f80,plain,
( ~ $less(sK1,1)
| ~ spl2_2 ),
inference(evaluation,[],[f72]) ).
tff(f72,plain,
( ~ $less(sK1,$sum(0,1))
| ~ spl2_2 ),
inference(unit_resulting_resolution,[],[f62,f20]) ).
tff(f62,plain,
( $less(0,sK1)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f60]) ).
tff(f64,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f53,f60,f56]) ).
tff(f53,plain,
( $less(0,sK1)
| ( 0 = sK1 ) ),
inference(resolution,[],[f44,f16]) ).
tff(f44,plain,
~ $less(sK1,0),
inference(unit_resulting_resolution,[],[f26,f30]) ).
tff(f30,plain,
! [X2: $int] :
( ~ in(X2,sK0)
| ~ $less(X2,0) ),
inference(cnf_transformation,[],[f25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : DAT025_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.15 % 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.16/0.37 % Computer : n021.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Apr 30 16:37:11 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.zfW2npAi07/Vampire---4.8_12522
% 0.56/0.76 % (12777)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.56/0.76 % (12771)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.56/0.76 % (12773)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.56/0.76 % (12772)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.56/0.76 % (12774)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.56/0.76 % (12775)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.56/0.76 % (12776)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.56/0.76 % (12778)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.60/0.77 % (12777)First to succeed.
% 0.60/0.77 % (12777)Refutation found. Thanks to Tanya!
% 0.60/0.77 % SZS status Theorem for Vampire---4
% 0.60/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.77 % (12777)------------------------------
% 0.60/0.77 % (12777)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.77 % (12777)Termination reason: Refutation
% 0.60/0.77
% 0.60/0.77 % (12777)Memory used [KB]: 1160
% 0.60/0.77 % (12777)Time elapsed: 0.013 s
% 0.60/0.77 % (12777)Instructions burned: 33 (million)
% 0.60/0.77 % (12777)------------------------------
% 0.60/0.77 % (12777)------------------------------
% 0.60/0.77 % (12767)Success in time 0.382 s
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------