TSTP Solution File: SWV371+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV371+1 : TPTP v8.1.2. Released v3.3.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 : n006.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 : Sun May 5 10:29:21 EDT 2024
% Result : Theorem 0.60s 0.75s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 5 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 57 ( 24 ~; 18 |; 6 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 40 ( 34 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f110,plain,
$false,
inference(avatar_sat_refutation,[],[f102,f105,f109]) ).
fof(f109,plain,
spl4_2,
inference(avatar_contradiction_clause,[],[f108]) ).
fof(f108,plain,
( $false
| spl4_2 ),
inference(subsumption_resolution,[],[f106,f84]) ).
fof(f84,plain,
phi(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f77]) ).
fof(f77,plain,
( ~ pi_sharp_find_min(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2)))
& phi(findmin_cpq_eff(triple(sK0,sK1,sK2))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f70,f76]) ).
fof(f76,plain,
( ? [X0,X1,X2] :
( ~ pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
& phi(findmin_cpq_eff(triple(X0,X1,X2))) )
=> ( ~ pi_sharp_find_min(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2)))
& phi(findmin_cpq_eff(triple(sK0,sK1,sK2))) ) ),
introduced(choice_axiom,[]) ).
fof(f70,plain,
? [X0,X1,X2] :
( ~ pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
& phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f66]) ).
fof(f66,negated_conjecture,
~ ! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(negated_conjecture,[],[f65]) ).
fof(f65,conjecture,
! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.dQnP4T03w8/Vampire---4.8_29768',l7_co) ).
fof(f106,plain,
( ~ phi(findmin_cpq_eff(triple(sK0,sK1,sK2)))
| spl4_2 ),
inference(resolution,[],[f83,f101]) ).
fof(f101,plain,
( ~ issmallestelement_pq(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2)))
| spl4_2 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f99,plain,
( spl4_2
<=> issmallestelement_pq(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f83,plain,
! [X2,X0,X1] :
( issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
| ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f69]) ).
fof(f69,plain,
! [X0,X1,X2] :
( issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
| ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f64]) ).
fof(f64,axiom,
! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.dQnP4T03w8/Vampire---4.8_29768',l7_lX) ).
fof(f105,plain,
spl4_1,
inference(avatar_contradiction_clause,[],[f104]) ).
fof(f104,plain,
( $false
| spl4_1 ),
inference(subsumption_resolution,[],[f103,f84]) ).
fof(f103,plain,
( ~ phi(findmin_cpq_eff(triple(sK0,sK1,sK2)))
| spl4_1 ),
inference(resolution,[],[f82,f97]) ).
fof(f97,plain,
( ~ contains_pq(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2)))
| spl4_1 ),
inference(avatar_component_clause,[],[f95]) ).
fof(f95,plain,
( spl4_1
<=> contains_pq(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f82,plain,
! [X2,X0,X1] :
( contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
| ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f68]) ).
fof(f68,plain,
! [X0,X1,X2] :
( contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
| ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f63]) ).
fof(f63,axiom,
! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.dQnP4T03w8/Vampire---4.8_29768',l7_l8) ).
fof(f102,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f93,f99,f95]) ).
fof(f93,plain,
( ~ issmallestelement_pq(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2)))
| ~ contains_pq(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))) ),
inference(resolution,[],[f85,f89]) ).
fof(f89,plain,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(flattening,[],[f72]) ).
fof(f72,plain,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(ennf_transformation,[],[f67]) ).
fof(f67,plain,
! [X0,X1] :
( ( issmallestelement_pq(X0,X1)
& contains_pq(X0,X1) )
=> pi_sharp_find_min(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f58]) ).
fof(f58,axiom,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
<=> ( issmallestelement_pq(X0,X1)
& contains_pq(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.dQnP4T03w8/Vampire---4.8_29768',ax58) ).
fof(f85,plain,
~ pi_sharp_find_min(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV371+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.14 % 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.15/0.35 % Computer : n006.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 : Fri May 3 20:54:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35 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.dQnP4T03w8/Vampire---4.8_29768
% 0.53/0.75 % (29932)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.53/0.75 % (29935)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.53/0.75 % (29930)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.53/0.75 % (29933)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.53/0.75 % (29931)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.53/0.75 % (29936)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.53/0.75 % (29934)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.53/0.75 % (29937)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.75 % (29935)First to succeed.
% 0.60/0.75 % (29935)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29906"
% 0.60/0.75 % (29933)Also succeeded, but the first one will report.
% 0.60/0.75 % (29937)Also succeeded, but the first one will report.
% 0.60/0.75 % (29935)Refutation found. Thanks to Tanya!
% 0.60/0.75 % SZS status Theorem for Vampire---4
% 0.60/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.75 % (29935)------------------------------
% 0.60/0.75 % (29935)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.75 % (29935)Termination reason: Refutation
% 0.60/0.75
% 0.60/0.75 % (29935)Memory used [KB]: 1112
% 0.60/0.75 % (29935)Time elapsed: 0.004 s
% 0.60/0.75 % (29935)Instructions burned: 3 (million)
% 0.60/0.75 % (29906)Success in time 0.395 s
% 0.60/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------