%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV417+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 : n002.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:12 PM UTC 2026
% Result : Theorem 0.18s 0.27s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 58 ( 15 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 53 ( 22 ~; 16 |; 8 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 46 ( 38 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0,X1] :
( ( contains_pq(X0,X1)
& issmallestelement_pq(X0,X1) )
=> findmin_pq_res(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+1.ax',ax14) ).
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)))
=> pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main4_l7) ).
fof(f64,conjecture,
! [X0,X1,X2] :
( pi_find_min(triple(X0,X1,X2))
=> ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> ? [X3] :
( pi_sharp_find_min(i(triple(X0,X1,X2)),X3)
& findmin_cpq_res(triple(X0,X1,X2)) = findmin_pq_res(i(triple(X0,X1,X2)),X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co4) ).
fof(f65,negated_conjecture,
~ ! [X0,X1,X2] :
( pi_find_min(triple(X0,X1,X2))
=> ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> ? [X3] :
( pi_sharp_find_min(i(triple(X0,X1,X2)),X3)
& findmin_cpq_res(triple(X0,X1,X2)) = findmin_pq_res(i(triple(X0,X1,X2)),X3) ) ) ),
inference(negated_conjecture,[status(cth)],[f64]) ).
fof(f81,plain,
! [X0,X1] :
( findmin_pq_res(X0,X1) = X1
| ~ contains_pq(X0,X1)
| ~ issmallestelement_pq(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f82,plain,
! [X0,X1] :
( findmin_pq_res(X0,X1) = X1
| ~ contains_pq(X0,X1)
| ~ issmallestelement_pq(X0,X1) ),
inference(flattening,[],[f81]) ).
fof(f113,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]) ).
fof(f114,plain,
? [X0,X1,X2] :
( ! [X3] :
( ~ pi_sharp_find_min(i(triple(X0,X1,X2)),X3)
| findmin_cpq_res(triple(X0,X1,X2)) != findmin_pq_res(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]) ).
fof(f115,plain,
? [X0,X1,X2] :
( ! [X3] :
( ~ pi_sharp_find_min(i(triple(X0,X1,X2)),X3)
| findmin_cpq_res(triple(X0,X1,X2)) != findmin_pq_res(i(triple(X0,X1,X2)),X3) )
& phi(findmin_cpq_eff(triple(X0,X1,X2)))
& pi_find_min(triple(X0,X1,X2)) ),
inference(flattening,[],[f114]) ).
fof(f133,plain,
! [X0,X1] :
( ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1)
| findmin_pq_res(X0,X1) = X1 ),
inference(cnf_transformation,[],[f82]) ).
fof(f179,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f53]) ).
fof(f182,plain,
! [X0,X1] :
( ~ pi_sharp_find_min(X0,X1)
| issmallestelement_pq(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f183,plain,
! [X0,X1] :
( ~ pi_sharp_find_min(X0,X1)
| contains_pq(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f190,plain,
! [X2,X0,X1] :
( ~ 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(cnf_transformation,[],[f113]) ).
fof(f191,plain,
! [X3] :
( findmin_cpq_res(triple(sK3,sK4,sK5)) != findmin_pq_res(i(triple(sK3,sK4,sK5)),X3)
| ~ pi_sharp_find_min(i(triple(sK3,sK4,sK5)),X3) ),
inference(cnf_transformation,[],[f115]) ).
fof(f193,plain,
phi(findmin_cpq_eff(triple(sK3,sK4,sK5))),
inference(cnf_transformation,[],[f115]) ).
fof(f198,plain,
! [X2,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| pi_sharp_find_min(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))) ),
inference(definition_unfolding,[],[f190,f179]) ).
fof(f199,plain,
! [X3] :
( ~ pi_sharp_find_min(i(triple(sK3,sK4,sK5)),X3)
| findmin_pq_res(i(triple(sK3,sK4,sK5)),X3) != removemin_cpq_res(triple(sK3,sK4,sK5)) ),
inference(definition_unfolding,[],[f191,f179]) ).
fof(f326,plain,
pi_sharp_find_min(i(triple(sK3,sK4,sK5)),removemin_cpq_res(triple(sK3,sK4,sK5))),
inference(resolution,[],[f198,f193]) ).
fof(f341,plain,
removemin_cpq_res(triple(sK3,sK4,sK5)) != findmin_pq_res(i(triple(sK3,sK4,sK5)),removemin_cpq_res(triple(sK3,sK4,sK5))),
inference(resolution,[],[f326,f199]) ).
fof(f342,plain,
contains_pq(i(triple(sK3,sK4,sK5)),removemin_cpq_res(triple(sK3,sK4,sK5))),
inference(resolution,[],[f326,f183]) ).
fof(f343,plain,
issmallestelement_pq(i(triple(sK3,sK4,sK5)),removemin_cpq_res(triple(sK3,sK4,sK5))),
inference(resolution,[],[f326,f182]) ).
fof(f487,plain,
( ~ contains_pq(i(triple(sK3,sK4,sK5)),removemin_cpq_res(triple(sK3,sK4,sK5)))
| removemin_cpq_res(triple(sK3,sK4,sK5)) = findmin_pq_res(i(triple(sK3,sK4,sK5)),removemin_cpq_res(triple(sK3,sK4,sK5))) ),
inference(resolution,[],[f343,f133]) ).
fof(f492,plain,
removemin_cpq_res(triple(sK3,sK4,sK5)) = findmin_pq_res(i(triple(sK3,sK4,sK5)),removemin_cpq_res(triple(sK3,sK4,sK5))),
inference(forward_subsumption_resolution,[],[f487,f342]) ).
fof(f495,plain,
$false,
inference(forward_subsumption_resolution,[],[f492,f341]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV417+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.07/0.18 % Computer : n002.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 10:54:07 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/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.18/0.27 % (278201)Will run a generic schedule for satisfiability detection.
% 0.18/0.27 % (278206)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2135887862_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.27 % (278207)% WARNING: option uhcvi not known.
% 0.18/0.27 % TRYING [1]
% 0.18/0.27 % TRYING [2]
% 0.18/0.27 % TRYING [3]
% 0.18/0.27 % (278207)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2222263722:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.27 % (278208)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2335101114:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.27 % (278209)dis+10_1_sil=32000:sp=arity:random_seed=2791391418:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.27 % (278210)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1621592867:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.27 % (278211)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1628394945:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.27 % (278212)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2783421752:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.27 % TRYING [4]
% 0.18/0.27 % (278210) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-278201-278210"...
% 0.18/0.27 % (278210)...printing done.
% 0.18/0.27 % (278211) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-278201-278211"...
% 0.18/0.27 % (278210)Refutation found. Thanks to Tanya!
% 0.18/0.27 % SZS status Theorem for theBenchmark
% 0.18/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.27 % (278210)------------------------------
% 0.18/0.27 % (278210)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.27 % (278210)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.27 % (278210)CaDiCaL version: 2.1.3
% 0.18/0.27 % (278210)Termination reason: Refutation
% 0.18/0.27 % (278210)Time elapsed: 0.013 s
% 0.18/0.27 % (278210)Peak memory usage: 12 MB
% 0.18/0.27 % (278210)Instructions burned: 19 (million)
% 0.18/0.27 % (278201)Success in time 0.053 s
% 0.18/0.27 % Vampire exiting
%------------------------------------------------------------------------------