%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV372+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:06 PM UTC 2026
% Result : Theorem 0.18s 0.29s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 65 ( 16 unt; 3 def)
% Number of atoms : 124 ( 34 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 104 ( 45 ~; 43 |; 3 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 101 ( 2 sgn 98 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f39,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax39) ).
fof(f40,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(f46,axiom,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax46) ).
fof(f47,axiom,
! [X0,X1,X2,X3] :
( ( X1 != create_slb
& ~ contains_slb(X1,findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(f51,axiom,
! [X0,X1,X2,X3] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(f53,axiom,
! [X0] : removemin_cpq_res(X0) = findmin_cpq_res(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax53) ).
fof(f63,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_pq(i(triple(X0,X1,X2)),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8_li56) ).
fof(f65,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ phi(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8_lX) ).
fof(f66,conjecture,
! [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',l8_co) ).
fof(f67,negated_conjecture,
~ ! [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))) ),
inference(negated_conjecture,[status(cth)],[f66]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ( X1 != create_slb
& ~ contains_slb(X1,findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f47]) ).
fof(f71,plain,
! [X0,X1,X2] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
inference(rectify,[],[f51]) ).
fof(f107,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(ennf_transformation,[],[f68]) ).
fof(f108,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(flattening,[],[f107]) ).
fof(f113,plain,
! [X0,X1,X2] :
( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
| create_slb = X1 ),
inference(ennf_transformation,[],[f71]) ).
fof(f115,plain,
! [X0,X1,X2] :
( ~ phi(triple(X0,X1,X2))
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f65]) ).
fof(f116,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,[],[f67]) ).
fof(f164,plain,
! [X2,X3,X0,X1] :
( ~ contains_slb(X1,X3)
| contains_cpq(triple(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f39]) ).
fof(f166,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f40]) ).
fof(f172,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f46]) ).
fof(f173,plain,
! [X2,X0,X1] :
( contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(cnf_transformation,[],[f108]) ).
fof(f177,plain,
! [X2,X0,X1] :
( create_slb = X1
| findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f113]) ).
fof(f179,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f53]) ).
fof(f187,plain,
! [X2,X3,X0,X1] :
( contains_pq(i(triple(X0,X1,X2)),X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f63]) ).
fof(f189,plain,
! [X2,X0,X1] :
( ok(triple(X0,X1,X2))
| ~ phi(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f115]) ).
fof(f190,plain,
phi(findmin_cpq_eff(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f116]) ).
fof(f191,plain,
~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f116]) ).
fof(f195,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = removemin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(definition_unfolding,[],[f177,f179]) ).
fof(f197,plain,
~ contains_pq(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4))),
inference(definition_unfolding,[],[f191,f179]) ).
fof(f218,plain,
! [X2,X3,X0,X1] :
( ~ contains_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(consistent_polarity_flipping,[],[f164]) ).
fof(f219,plain,
! [X0,X1] : ok(triple(X0,X1,bad)),
inference(consistent_polarity_flipping,[],[f166]) ).
fof(f224,plain,
! [X2,X0,X1] :
( ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(consistent_polarity_flipping,[],[f173]) ).
fof(f231,plain,
! [X2,X3,X0,X1] :
( contains_pq(i(triple(X0,X1,X2)),X3)
| contains_cpq(triple(X0,X1,X2),X3) ),
inference(consistent_polarity_flipping,[],[f187]) ).
fof(f234,plain,
! [X2,X0,X1] :
( ~ phi(triple(X0,X1,X2))
| ~ ok(triple(X0,X1,X2)) ),
inference(consistent_polarity_flipping,[],[f189]) ).
fof(f303,plain,
( ~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2))
| create_slb = sK3 ),
inference(superposition,[],[f197,f195]) ).
fof(f306,definition,
( spl5_1
<=> create_slb = sK3 ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f308,plain,
( create_slb = sK3
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f306]) ).
fof(f310,definition,
( spl5_2
<=> contains_pq(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f312,plain,
( ~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2))
| spl5_2 ),
inference(avatar_component_clause,[],[f310]) ).
fof(f313,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f303,f310,f306]) ).
fof(f322,plain,
( contains_cpq(triple(sK2,sK3,sK4),findmin_pqp_res(sK2))
| spl5_2 ),
inference(resolution,[],[f312,f231]) ).
fof(f327,plain,
( contains_slb(sK3,findmin_pqp_res(sK2))
| spl5_2 ),
inference(resolution,[],[f322,f218]) ).
fof(f389,plain,
( ! [X0] :
( create_slb = sK3
| findmin_cpq_eff(triple(sK2,sK3,X0)) = triple(sK2,update_slb(sK3,findmin_pqp_res(sK2)),bad) )
| spl5_2 ),
inference(resolution,[],[f224,f327]) ).
fof(f392,definition,
( spl5_5
<=> ! [X0] : findmin_cpq_eff(triple(sK2,sK3,X0)) = triple(sK2,update_slb(sK3,findmin_pqp_res(sK2)),bad) ),
introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition]) ).
fof(f393,plain,
( ! [X0] : findmin_cpq_eff(triple(sK2,sK3,X0)) = triple(sK2,update_slb(sK3,findmin_pqp_res(sK2)),bad)
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f392]) ).
fof(f394,plain,
( spl5_5
| spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f389,f310,f306,f392]) ).
fof(f401,plain,
( ! [X0,X1] : findmin_cpq_eff(triple(sK2,sK3,X0)) = findmin_cpq_eff(triple(sK2,sK3,X1))
| ~ spl5_5 ),
inference(superposition,[],[f393,f393]) ).
fof(f404,plain,
( ! [X0] : ok(findmin_cpq_eff(triple(sK2,sK3,X0)))
| ~ spl5_5 ),
inference(superposition,[],[f219,f393]) ).
fof(f411,plain,
( ! [X0] :
( ~ phi(findmin_cpq_eff(triple(sK2,sK3,X0)))
| ~ ok(findmin_cpq_eff(triple(sK2,sK3,X0))) )
| ~ spl5_5 ),
inference(superposition,[],[f234,f393]) ).
fof(f420,plain,
( phi(findmin_cpq_eff(triple(sK2,create_slb,sK4)))
| ~ spl5_1 ),
inference(superposition,[],[f190,f308]) ).
fof(f435,plain,
( phi(triple(sK2,create_slb,bad))
| ~ spl5_1 ),
inference(forward_demodulation,[],[f420,f172]) ).
fof(f443,plain,
( ~ ok(triple(sK2,create_slb,bad))
| ~ spl5_1 ),
inference(resolution,[],[f435,f234]) ).
fof(f444,plain,
( $false
| ~ spl5_1 ),
inference(forward_subsumption_resolution,[],[f443,f219]) ).
fof(f445,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f444]) ).
fof(f479,plain,
( ! [X0] : phi(findmin_cpq_eff(triple(sK2,sK3,X0)))
| ~ spl5_5 ),
inference(superposition,[],[f190,f401]) ).
fof(f509,plain,
( ! [X0] : ~ ok(findmin_cpq_eff(triple(sK2,sK3,X0)))
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f411,f479]) ).
fof(f510,plain,
( $false
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f509,f404]) ).
fof(f511,plain,
~ spl5_5,
inference(avatar_contradiction_clause,[],[f510]) ).
cnf(s1,plain,
( spl5_1
| ~ spl5_2 ),
inference(sat_conversion,[],[f313]) ).
cnf(s3,plain,
( spl5_1
| spl5_2
| spl5_5 ),
inference(sat_conversion,[],[f394]) ).
cnf(s5,plain,
~ spl5_1,
inference(sat_conversion,[],[f445]) ).
cnf(s7,plain,
~ spl5_5,
inference(sat_conversion,[],[f511]) ).
cnf(s8,plain,
spl5_2,
inference(rat,[],[s3,s7,s5]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s8,s5]) ).
fof(f512,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV372+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.09/0.19 % Computer : n002.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 10:47:37 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.29 % (273465)Will run a generic schedule for satisfiability detection.
% 0.18/0.29 % (273472)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=749146128:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.29 % (273471)% WARNING: option uhcvi not known.
% 0.18/0.29 % (273471)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3442839599:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.29 % (273470)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1913204761_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.29 % (273473)dis+10_1_sil=32000:sp=arity:random_seed=3111522136:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.29 % (273476)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=702266492:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.29 % (273474)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1034436936:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.29 % (273475)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2620213554:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.29 % TRYING [1]
% 0.18/0.29 % TRYING [2]
% 0.18/0.29 % TRYING [3]
% 0.18/0.29 % (273471) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-273465-273471"...
% 0.18/0.29 % (273473) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-273465-273473"...
% 0.18/0.29 % (273471)...printing done.
% 0.18/0.29 % (273473)...printing done.
% 0.18/0.29 % (273471)Refutation found. Thanks to Tanya!
% 0.18/0.29 % SZS status Theorem for theBenchmark
% 0.18/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.29 % (273471)------------------------------
% 0.18/0.29 % (273471)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.29 % (273471)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.29 % (273471)CaDiCaL version: 2.1.3
% 0.18/0.29 % (273471)Termination reason: Refutation
% 0.18/0.29 % (273471)Time elapsed: 0.016 s
% 0.18/0.29 % (273471)Peak memory usage: 13 MB
% 0.18/0.29 % (273471)Instructions burned: 20 (million)
% 0.18/0.29 % (273465)Success in time 0.056 s
% 0.18/0.29 % Vampire exiting
%------------------------------------------------------------------------------