TSTP Solution File: SWV371+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWV371+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n012.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:51:35 EDT 2024
% Result : Theorem 0.19s 0.40s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 47 ( 22 ~; 12 |; 6 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 40 ( 34 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1058,plain,
$false,
inference(resolution,[],[f1046,f140]) ).
fof(f140,plain,
phi(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f123]) ).
fof(f123,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])],[f77,f122]) ).
fof(f122,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(f77,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/sandbox/benchmark/theBenchmark.p',l7_co) ).
fof(f1046,plain,
~ phi(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(resolution,[],[f143,f614]) ).
fof(f614,plain,
~ contains_pq(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(resolution,[],[f605,f140]) ).
fof(f605,plain,
( ~ phi(findmin_cpq_eff(triple(sK0,sK1,sK2)))
| ~ contains_pq(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))) ),
inference(resolution,[],[f142,f224]) ).
fof(f224,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,[],[f172,f141]) ).
fof(f141,plain,
~ pi_sharp_find_min(i(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f123]) ).
fof(f172,plain,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(flattening,[],[f90]) ).
fof(f90,plain,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(ennf_transformation,[],[f75]) ).
fof(f75,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/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f142,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,[],[f78]) ).
fof(f78,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/sandbox/benchmark/theBenchmark.p',l7_lX) ).
fof(f143,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,[],[f79]) ).
fof(f79,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/sandbox/benchmark/theBenchmark.p',l7_l8) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV371+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 20:54:38 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % (16983)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.35 % (16986)WARNING: value z3 for option sas not known
% 0.19/0.36 % (16990)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.19/0.36 % (16986)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.19/0.36 % (16989)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.19/0.36 % (16987)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.19/0.36 % (16988)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.19/0.36 % (16985)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.19/0.36 % (16984)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.19/0.36 TRYING [1]
% 0.19/0.37 TRYING [2]
% 0.19/0.38 TRYING [3]
% 0.19/0.39 TRYING [1]
% 0.19/0.39 TRYING [2]
% 0.19/0.39 TRYING [1]
% 0.19/0.40 TRYING [2]
% 0.19/0.40 % (16989)First to succeed.
% 0.19/0.40 % (16989)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16983"
% 0.19/0.40 % (16989)Refutation found. Thanks to Tanya!
% 0.19/0.40 % SZS status Theorem for theBenchmark
% 0.19/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.40 % (16989)------------------------------
% 0.19/0.40 % (16989)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.19/0.40 % (16989)Termination reason: Refutation
% 0.19/0.40
% 0.19/0.40 % (16989)Memory used [KB]: 1317
% 0.19/0.40 % (16989)Time elapsed: 0.043 s
% 0.19/0.40 % (16989)Instructions burned: 88 (million)
% 0.19/0.40 % (16983)Success in time 0.061 s
%------------------------------------------------------------------------------