%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV374+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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.19s 0.28s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 72 ( 15 unt; 5 def)
% Number of atoms : 169 ( 39 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 159 ( 62 ~; 70 |; 13 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 80 ( 2 sgn 77 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(f34,axiom,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax46) ).
fof(f35,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/sandbox/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(f36,axiom,
! [X0,X1,X2,X3] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& strictly_less_than(findmin_pqp_res(X0),lookup_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/sandbox/benchmark/Axioms/SWV007+3.ax',ax48) ).
fof(f42,conjecture,
! [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
=> ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l10_co) ).
fof(f43,negated_conjecture,
~ ! [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
=> ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ) ),
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f44,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,[],[f35]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& strictly_less_than(findmin_pqp_res(X0),lookup_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,[],[f36]) ).
fof(f48,plain,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f51,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f52,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f51]) ).
fof(f71,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,[],[f44]) ).
fof(f72,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,[],[f71]) ).
fof(f73,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))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(ennf_transformation,[],[f45]) ).
fof(f74,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))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(flattening,[],[f73]) ).
fof(f78,plain,
? [X0,X1,X2] :
( ( create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) )
& ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f43]) ).
fof(f80,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f82,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
fof(f113,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f28]) ).
fof(f119,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f34]) ).
fof(f120,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,[],[f72]) ).
fof(f121,plain,
! [X2,X0,X1] :
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ 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,[],[f74]) ).
fof(f127,plain,
( ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| ~ contains_slb(sK1,findmin_pqp_res(sK0))
| create_slb = sK1 ),
inference(cnf_transformation,[],[f78]) ).
fof(f128,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f78]) ).
fof(f137,plain,
! [X0,X1] :
( ~ less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(consistent_polarity_flipping,[],[f80]) ).
fof(f139,plain,
! [X0,X1] :
( ~ less_than(X1,X0)
| less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(consistent_polarity_flipping,[],[f82]) ).
fof(f153,plain,
! [X0,X1] : ok(triple(X0,X1,bad)),
inference(consistent_polarity_flipping,[],[f113]) ).
fof(f157,plain,
~ ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(consistent_polarity_flipping,[],[f128]) ).
fof(f158,plain,
( less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| ~ contains_slb(sK1,findmin_pqp_res(sK0))
| create_slb = sK1 ),
inference(consistent_polarity_flipping,[],[f127]) ).
fof(f160,definition,
( spl3_1
<=> create_slb = sK1 ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f161,plain,
( create_slb != sK1
| spl3_1 ),
inference(avatar_component_clause,[],[f160]) ).
fof(f162,plain,
( create_slb = sK1
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f160]) ).
fof(f164,definition,
( spl3_2
<=> contains_slb(sK1,findmin_pqp_res(sK0)) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f166,plain,
( ~ contains_slb(sK1,findmin_pqp_res(sK0))
| spl3_2 ),
inference(avatar_component_clause,[],[f164]) ).
fof(f168,definition,
( spl3_3
<=> less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0)) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f170,plain,
( less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f168]) ).
fof(f171,plain,
( spl3_1
| ~ spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f158,f168,f164,f160]) ).
fof(f173,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f139,f137]) ).
fof(f224,plain,
( ! [X0] :
( create_slb = sK1
| findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) )
| spl3_2 ),
inference(resolution,[],[f120,f166]) ).
fof(f226,definition,
( spl3_6
<=> ! [X0] : findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) ),
introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition]) ).
fof(f227,plain,
( ! [X0] : findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f228,plain,
( spl3_6
| spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f224,f164,f160,f226]) ).
fof(f231,plain,
( ~ ok(findmin_cpq_eff(triple(sK0,create_slb,sK2)))
| ~ spl3_1 ),
inference(superposition,[],[f157,f162]) ).
fof(f233,plain,
( ~ ok(triple(sK0,create_slb,bad))
| ~ spl3_1 ),
inference(forward_demodulation,[],[f231,f119]) ).
fof(f234,plain,
( $false
| ~ spl3_1 ),
inference(forward_subsumption_resolution,[],[f233,f153]) ).
fof(f235,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f234]) ).
fof(f250,plain,
! [X2,X0,X1] :
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_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(forward_subsumption_resolution,[],[f121,f120]) ).
fof(f260,plain,
( ! [X0] : ok(findmin_cpq_eff(triple(sK0,sK1,X0)))
| ~ spl3_6 ),
inference(superposition,[],[f153,f227]) ).
fof(f280,plain,
( $false
| ~ spl3_6 ),
inference(backward_subsumption_resolution,[],[f157,f260]) ).
fof(f282,plain,
~ spl3_6,
inference(avatar_contradiction_clause,[],[f280]) ).
fof(f299,definition,
( spl3_10
<=> strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0))) ),
introduced(definition,[new_symbols(definition,[spl3_10])],[avatar_definition]) ).
fof(f300,plain,
( strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| ~ spl3_10 ),
inference(avatar_component_clause,[],[f299]) ).
fof(f301,plain,
( ~ strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| spl3_10 ),
inference(avatar_component_clause,[],[f299]) ).
fof(f307,plain,
( ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| spl3_10 ),
inference(resolution,[],[f301,f173]) ).
fof(f308,plain,
( $false
| ~ spl3_3
| spl3_10 ),
inference(forward_subsumption_resolution,[],[f307,f170]) ).
fof(f309,plain,
( ~ spl3_3
| spl3_10 ),
inference(avatar_contradiction_clause,[],[f308]) ).
fof(f311,plain,
( ! [X0] :
( create_slb = sK1
| findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) )
| ~ spl3_10 ),
inference(resolution,[],[f300,f250]) ).
fof(f316,plain,
( ! [X0] : findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)
| spl3_1
| ~ spl3_10 ),
inference(forward_subsumption_resolution,[],[f311,f161]) ).
fof(f333,plain,
( spl3_6
| spl3_1
| ~ spl3_10 ),
inference(avatar_split_clause,[],[f316,f299,f160,f226]) ).
cnf(s1,plain,
( spl3_1
| ~ spl3_2
| spl3_3 ),
inference(sat_conversion,[],[f171]) ).
cnf(s3,plain,
( spl3_1
| spl3_2
| spl3_6 ),
inference(sat_conversion,[],[f228]) ).
cnf(s4,plain,
~ spl3_1,
inference(sat_conversion,[],[f235]) ).
cnf(s6,plain,
~ spl3_6,
inference(sat_conversion,[],[f282]) ).
cnf(s9,plain,
( ~ spl3_3
| spl3_10 ),
inference(sat_conversion,[],[f309]) ).
cnf(s11,plain,
( spl3_1
| spl3_6
| ~ spl3_10 ),
inference(sat_conversion,[],[f333]) ).
cnf(s12,plain,
~ spl3_10,
inference(rat,[],[s11,s6,s4]) ).
cnf(s13,plain,
~ spl3_3,
inference(rat,[],[s9,s12]) ).
cnf(s14,plain,
spl3_2,
inference(rat,[],[s3,s6,s4]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s1,s13,s14,s4]) ).
fof(f334,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV374+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n007.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:43:56 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.28 % (2313048)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (2313055)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2654386971:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28 % (2313054)% WARNING: option uhcvi not known.
% 0.19/0.28 % (2313053)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3249845849_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.28 % (2313054)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=264353792:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.28 % (2313056)dis+10_1_sil=32000:sp=arity:random_seed=2144428486:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.28 % (2313057)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3205530184:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.28 % (2313058)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1543920824:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.28 % (2313059)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=868674566:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.28 % TRYING [1]
% 0.19/0.28 % TRYING [2]
% 0.19/0.28 % TRYING [3]
% 0.19/0.28 % (2313054) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2313048-2313054"...
% 0.19/0.28 % (2313054)...printing done.
% 0.19/0.28 % (2313054)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Theorem for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28 % (2313054)------------------------------
% 0.19/0.28 % (2313054)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (2313054)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (2313054)CaDiCaL version: 2.1.3
% 0.19/0.28 % (2313054)Termination reason: Refutation
% 0.19/0.28 % (2313054)Time elapsed: 0.012 s
% 0.19/0.28 % (2313054)Peak memory usage: 13 MB
% 0.19/0.28 % (2313054)Instructions burned: 15 (million)
% 0.19/0.28 % (2313048)Success in time 0.049 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------