TSTP Solution File: SWV417+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV417+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 : n007.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:33 EDT 2024
% Result : Theorem 0.63s 0.80s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 4 unt; 1 typ; 0 def)
% Number of atoms : 314 ( 13 equ)
% Maximal formula atoms : 8 ( 10 avg)
% Number of connectives : 101 ( 43 ~; 31 |; 18 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 226 ( 226 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 16 ( 14 usr; 4 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 62 ( 50 !; 11 ?; 22 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_20,type,
sQ5_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f155,plain,
$false,
inference(subsumption_resolution,[],[f154,f97]) ).
tff(f97,plain,
phi(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f84]) ).
tff(f84,plain,
( ! [X3] :
( ( findmin_cpq_res(triple(sK0,sK1,sK2)) != findmin_pq_res(i(triple(sK0,sK1,sK2)),X3) )
| ~ pi_sharp_find_min(i(triple(sK0,sK1,sK2)),X3) )
& phi(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& pi_find_min(triple(sK0,sK1,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f75,f83]) ).
tff(f83,plain,
( ? [X0,X1,X2] :
( ! [X3] :
( ( findmin_cpq_res(triple(X0,X1,X2)) != findmin_pq_res(i(triple(X0,X1,X2)),X3) )
| ~ pi_sharp_find_min(i(triple(X0,X1,X2)),X3) )
& phi(findmin_cpq_eff(triple(X0,X1,X2)))
& pi_find_min(triple(X0,X1,X2)) )
=> ( ! [X3] :
( ( findmin_cpq_res(triple(sK0,sK1,sK2)) != findmin_pq_res(i(triple(sK0,sK1,sK2)),X3) )
| ~ pi_sharp_find_min(i(triple(sK0,sK1,sK2)),X3) )
& phi(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& pi_find_min(triple(sK0,sK1,sK2)) ) ),
introduced(choice_axiom,[]) ).
tff(f75,plain,
? [X0,X1,X2] :
( ! [X3] :
( ( findmin_cpq_res(triple(X0,X1,X2)) != findmin_pq_res(i(triple(X0,X1,X2)),X3) )
| ~ pi_sharp_find_min(i(triple(X0,X1,X2)),X3) )
& phi(findmin_cpq_eff(triple(X0,X1,X2)))
& pi_find_min(triple(X0,X1,X2)) ),
inference(flattening,[],[f74]) ).
tff(f74,plain,
? [X0,X1,X2] :
( ! [X3] :
( ( findmin_cpq_res(triple(X0,X1,X2)) != findmin_pq_res(i(triple(X0,X1,X2)),X3) )
| ~ pi_sharp_find_min(i(triple(X0,X1,X2)),X3) )
& phi(findmin_cpq_eff(triple(X0,X1,X2)))
& pi_find_min(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f65]) ).
tff(f65,negated_conjecture,
~ ! [X0,X1,X2] :
( pi_find_min(triple(X0,X1,X2))
=> ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> ? [X3] :
( ( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pq_res(i(triple(X0,X1,X2)),X3) )
& pi_sharp_find_min(i(triple(X0,X1,X2)),X3) ) ) ),
inference(negated_conjecture,[],[f64]) ).
tff(f64,conjecture,
! [X0,X1,X2] :
( pi_find_min(triple(X0,X1,X2))
=> ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> ? [X3] :
( ( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pq_res(i(triple(X0,X1,X2)),X3) )
& pi_sharp_find_min(i(triple(X0,X1,X2)),X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.npbGMwkY1r/Vampire---4.8_22518',co4) ).
tff(f154,plain,
~ phi(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(resolution,[],[f95,f140]) ).
tff(f140,plain,
~ pi_sharp_find_min(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(subsumption_resolution,[],[f139,f101]) ).
tff(f101,plain,
! [X0: $i,X1: $i] :
( issmallestelement_pq(X0,X1)
| ~ pi_sharp_find_min(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
tff(f88,plain,
! [X0,X1] :
( ( pi_sharp_find_min(X0,X1)
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) )
& ( ( issmallestelement_pq(X0,X1)
& contains_pq(X0,X1) )
| ~ pi_sharp_find_min(X0,X1) ) ),
inference(flattening,[],[f87]) ).
tff(f87,plain,
! [X0,X1] :
( ( pi_sharp_find_min(X0,X1)
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) )
& ( ( issmallestelement_pq(X0,X1)
& contains_pq(X0,X1) )
| ~ pi_sharp_find_min(X0,X1) ) ),
inference(nnf_transformation,[],[f58]) ).
tff(f58,axiom,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
<=> ( issmallestelement_pq(X0,X1)
& contains_pq(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.npbGMwkY1r/Vampire---4.8_22518',ax58) ).
tff(f139,plain,
( ~ issmallestelement_pq(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2)))
| ~ pi_sharp_find_min(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))) ),
inference(subsumption_resolution,[],[f138,f100]) ).
tff(f100,plain,
! [X0: $i,X1: $i] :
( contains_pq(X0,X1)
| ~ pi_sharp_find_min(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
tff(f138,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)))
| ~ pi_sharp_find_min(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))) ),
inference(resolution,[],[f137,f121]) ).
tff(f121,plain,
! [X3: $i] :
( ~ sQ5_eqProxy($i,findmin_cpq_res(triple(sK0,sK1,sK2)),findmin_pq_res(i(triple(sK0,sK1,sK2)),X3))
| ~ pi_sharp_find_min(i(triple(sK0,sK1,sK2)),X3) ),
inference(equality_proxy_replacement,[],[f98,f120]) ).
tff(f120,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ5_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ5_eqProxy])]) ).
tff(f98,plain,
! [X3: $i] :
( ( findmin_cpq_res(triple(sK0,sK1,sK2)) != findmin_pq_res(i(triple(sK0,sK1,sK2)),X3) )
| ~ pi_sharp_find_min(i(triple(sK0,sK1,sK2)),X3) ),
inference(cnf_transformation,[],[f84]) ).
tff(f137,plain,
! [X0: $i,X1: $i] :
( sQ5_eqProxy($i,X1,findmin_pq_res(X0,X1))
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(forward_literal_rewriting,[],[f129,f131]) ).
tff(f131,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ5_eqProxy(X0,X2,X1)
| ~ sQ5_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f120]) ).
tff(f129,plain,
! [X0: $i,X1: $i] :
( sQ5_eqProxy($i,findmin_pq_res(X0,X1),X1)
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(equality_proxy_replacement,[],[f118,f120]) ).
tff(f118,plain,
! [X0: $i,X1: $i] :
( ( findmin_pq_res(X0,X1) = X1 )
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(cnf_transformation,[],[f82]) ).
tff(f82,plain,
! [X0,X1] :
( ( findmin_pq_res(X0,X1) = X1 )
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(flattening,[],[f81]) ).
tff(f81,plain,
! [X0,X1] :
( ( findmin_pq_res(X0,X1) = X1 )
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
tff(f14,axiom,
! [X0,X1] :
( ( issmallestelement_pq(X0,X1)
& contains_pq(X0,X1) )
=> ( findmin_pq_res(X0,X1) = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.npbGMwkY1r/Vampire---4.8_22518',ax14) ).
tff(f95,plain,
! [X2: $i,X0: $i,X1: $i] :
( 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(cnf_transformation,[],[f73]) ).
tff(f73,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,[],[f63]) ).
tff(f63,axiom,
! [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.npbGMwkY1r/Vampire---4.8_22518',main4_l7) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWV417+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/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.16/0.36 % Computer : n007.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 21:06:23 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/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.npbGMwkY1r/Vampire---4.8_22518
% 0.63/0.79 % (22686)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.63/0.79 % (22688)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.63/0.79 % (22687)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.63/0.79 % (22690)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.63/0.79 % (22689)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.63/0.79 % (22691)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.63/0.79 % (22692)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.63/0.79 % (22693)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.63/0.79 % (22686)First to succeed.
% 0.63/0.79 % (22691)Also succeeded, but the first one will report.
% 0.63/0.80 % (22689)Also succeeded, but the first one will report.
% 0.63/0.80 % (22693)Refutation not found, incomplete strategy% (22693)------------------------------
% 0.63/0.80 % (22693)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80 % (22693)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.80
% 0.63/0.80 % (22693)Memory used [KB]: 1085
% 0.63/0.80 % (22693)Time elapsed: 0.003 s
% 0.63/0.80 % (22693)Instructions burned: 3 (million)
% 0.63/0.80 % (22686)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22654"
% 0.63/0.80 % (22693)------------------------------
% 0.63/0.80 % (22693)------------------------------
% 0.63/0.80 % (22686)Refutation found. Thanks to Tanya!
% 0.63/0.80 % SZS status Theorem for Vampire---4
% 0.63/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.80 % (22686)------------------------------
% 0.63/0.80 % (22686)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80 % (22686)Termination reason: Refutation
% 0.63/0.80
% 0.63/0.80 % (22686)Memory used [KB]: 1110
% 0.63/0.80 % (22686)Time elapsed: 0.005 s
% 0.63/0.80 % (22686)Instructions burned: 5 (million)
% 0.63/0.80 % (22654)Success in time 0.426 s
% 0.63/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------