%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV371+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:21:06 PM UTC 2026
% Result : Theorem 0.20s 0.26s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 51 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 46 ( 21 ~; 15 |; 4 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 51 ( 48 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,axiom,
! [X0] : removemin_cpq_res(X0) = findmin_cpq_res(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax53) ).
fof(f58,axiom,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
<=> ( contains_pq(X0,X1)
& issmallestelement_pq(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax58) ).
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/benchmark/theBenchmark.p',l7_l8) ).
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/benchmark/theBenchmark.p',l7_lX) ).
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/benchmark/theBenchmark.p',l7_co) ).
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,[status(cth)],[f65]) ).
fof(f75,plain,
! [X0,X1] :
( ( contains_pq(X0,X1)
& issmallestelement_pq(X0,X1) )
=> pi_sharp_find_min(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f58]) ).
fof(f117,plain,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
| ~ contains_pq(X0,X1)
| ~ issmallestelement_pq(X0,X1) ),
inference(ennf_transformation,[],[f75]) ).
fof(f118,plain,
! [X0,X1] :
( pi_sharp_find_min(X0,X1)
| ~ contains_pq(X0,X1)
| ~ issmallestelement_pq(X0,X1) ),
inference(flattening,[],[f117]) ).
fof(f119,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(f120,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(f121,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(f136,plain,
( ~ pi_sharp_find_min(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4)))
& phi(findmin_cpq_eff(triple(sK2,sK3,sK4))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f121]) ).
fof(f200,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f53]) ).
fof(f203,plain,
! [X0,X1] :
( ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1)
| pi_sharp_find_min(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f208,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,[],[f119]) ).
fof(f209,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,[],[f120]) ).
fof(f210,plain,
phi(findmin_cpq_eff(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f136]) ).
fof(f211,plain,
~ pi_sharp_find_min(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f136]) ).
fof(f216,plain,
! [X2,X0,X1] :
( contains_pq(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2)))
| ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(definition_unfolding,[],[f208,f200]) ).
fof(f217,plain,
! [X2,X0,X1] :
( issmallestelement_pq(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2)))
| ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(definition_unfolding,[],[f209,f200]) ).
fof(f218,plain,
~ pi_sharp_find_min(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4))),
inference(definition_unfolding,[],[f211,f200]) ).
fof(f344,plain,
! [X2,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| ~ contains_pq(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2)))
| pi_sharp_find_min(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))) ),
inference(resolution,[],[f217,f203]) ).
fof(f349,plain,
! [X2,X0,X1] :
( pi_sharp_find_min(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2)))
| ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(forward_subsumption_resolution,[],[f344,f216]) ).
fof(f736,plain,
~ phi(findmin_cpq_eff(triple(sK2,sK3,sK4))),
inference(resolution,[],[f349,f218]) ).
fof(f744,plain,
$false,
inference(forward_subsumption_resolution,[],[f736,f210]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV371+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n011.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 10:45:00 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.26 % (3312794)Will run a generic schedule for satisfiability detection.
% 0.20/0.26 % (3312802)dis+10_1_sil=32000:sp=arity:random_seed=1297096536:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.26 % (3312800)% WARNING: option uhcvi not known.
% 0.20/0.26 % (3312799)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2587577087_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.26 % (3312800)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3848231034:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.26 % (3312801)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=868511923:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.26 % (3312803)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2761926467:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.26 % (3312804)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2136255049:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.26 % (3312805)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4200291831:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.26 % (3312802) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3312794-3312802"...
% 0.20/0.26 % (3312802)...printing done.
% 0.20/0.26 % (3312802)Refutation found. Thanks to Tanya!
% 0.20/0.26 % SZS status Theorem for theBenchmark
% 0.20/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.26 % (3312802)------------------------------
% 0.20/0.26 % (3312802)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.26 % (3312802)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.26 % (3312802)CaDiCaL version: 2.1.3
% 0.20/0.26 % (3312802)Termination reason: Refutation
% 0.20/0.26 % (3312802)Time elapsed: 0.011 s
% 0.20/0.26 % (3312802)Peak memory usage: 12 MB
% 0.20/0.26 % (3312802)Instructions burned: 31 (million)
% 0.20/0.26 % (3312794)Success in time 0.04 s
% 0.20/0.26 % Vampire exiting
%------------------------------------------------------------------------------