%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV373+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:09:03 PM UTC 2026
% Result : Theorem 2.84s 1.16s
% Output : Refutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 13 unt; 3 def)
% Number of atoms : 95 ( 27 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 86 ( 39 ~; 27 |; 9 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 70 ( 2 sgn 67 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f27,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax39) ).
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax40) ).
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/theBenchmark.p',ax47) ).
fof(f39,axiom,
! [X0,X1,X2,X3] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax51) ).
fof(f42,axiom,
! [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',l9_l10) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ contains_cpq(triple(X0,X1,X2),findmin_cpq_res(triple(X0,X1,X2)))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l9_co) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ contains_cpq(triple(X0,X1,X2),findmin_cpq_res(triple(X0,X1,X2)))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f46,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f45]) ).
fof(f47,plain,
! [X0,X1,X2] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
inference(rectify,[],[f39]) ).
fof(f50,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(f52,plain,
! [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)) )
| ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f42]) ).
fof(f53,plain,
? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ contains_cpq(triple(X0,X1,X2),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f44]) ).
fof(f59,plain,
! [X0,X1,X2] :
( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
| create_slb = X1 ),
inference(ennf_transformation,[],[f47]) ).
fof(f62,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,[],[f50]) ).
fof(f63,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,[],[f62]) ).
fof(f64,plain,
( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ contains_cpq(triple(sK0,sK1,sK2),findmin_cpq_res(triple(sK0,sK1,sK2))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f53]) ).
fof(f67,plain,
! [X0,X1,X2,X3] :
( ( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) )
& ( contains_slb(X1,X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f70,plain,
! [X2,X0,X1] :
( create_slb != X1
| ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f52]) ).
fof(f71,plain,
~ contains_cpq(triple(sK0,sK1,sK2),findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f64]) ).
fof(f72,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f64]) ).
fof(f83,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f46]) ).
fof(f84,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(cnf_transformation,[],[f59]) ).
fof(f86,plain,
! [X2,X0,X1] :
( 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(cnf_transformation,[],[f63]) ).
fof(f88,plain,
! [X2,X3,X0,X1] :
( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f67]) ).
fof(f89,definition,
~ sP3(create_slb),
introduced(definition,[new_symbols(definition,[sP3])],[inequality_splitting_name_introduction]) ).
fof(f90,plain,
! [X2,X0,X1] :
( ~ ok(findmin_cpq_eff(triple(X0,X1,X2)))
| sP3(X1) ),
inference(inequality_splitting,[],[f70,f89]) ).
fof(f92,plain,
( ok(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
| create_slb = sK1
| contains_slb(sK1,findmin_pqp_res(sK0)) ),
inference(superposition,[],[f72,f86]) ).
fof(f99,definition,
( spl4_2
<=> contains_slb(sK1,findmin_pqp_res(sK0)) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f100,plain,
( contains_slb(sK1,findmin_pqp_res(sK0))
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f103,definition,
( spl4_3
<=> create_slb = sK1 ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
fof(f105,plain,
( create_slb = sK1
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f103]) ).
fof(f111,plain,
( create_slb = sK1
| contains_slb(sK1,findmin_pqp_res(sK0)) ),
inference(forward_subsumption_resolution,[],[f92,f83]) ).
fof(f112,plain,
( spl4_2
| spl4_3 ),
inference(avatar_split_clause,[],[f111,f103,f99]) ).
fof(f113,plain,
~ contains_slb(sK1,findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(resolution,[],[f71,f88]) ).
fof(f121,plain,
sP3(sK1),
inference(resolution,[],[f90,f72]) ).
fof(f128,plain,
( ~ contains_slb(sK1,findmin_pqp_res(sK0))
| create_slb = sK1 ),
inference(superposition,[],[f113,f84]) ).
fof(f129,plain,
( create_slb = sK1
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f128,f100]) ).
fof(f130,plain,
( spl4_3
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f129,f99,f103]) ).
fof(f141,plain,
( sP3(create_slb)
| ~ spl4_3 ),
inference(superposition,[],[f121,f105]) ).
fof(f142,plain,
( $false
| ~ spl4_3 ),
inference(forward_subsumption_resolution,[],[f141,f89]) ).
fof(f143,plain,
~ spl4_3,
inference(avatar_contradiction_clause,[],[f142]) ).
cnf(s2,plain,
( spl4_2
| spl4_3 ),
inference(sat_conversion,[],[f112]) ).
cnf(s4,plain,
( ~ spl4_2
| spl4_3 ),
inference(sat_conversion,[],[f130]) ).
cnf(s5,plain,
~ spl4_3,
inference(sat_conversion,[],[f143]) ).
cnf(s8,plain,
~ spl4_2,
inference(rat,[],[s4,s5]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s2,s5,s8]) ).
fof(f148,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV373+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.17 % Computer : n003.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Mon Sep 28 10:47:57 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.20 Running first-order theorem proving
% 0.06/0.20 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.84/1.16 % (1506063)Detected formulas, will run a generic FOF schedule.
% 2.84/1.16 % (1506071)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=303797603:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.84/1.16 % (1506071)First to succeed.
% 2.84/1.16 % (1506071)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1506063"
% 2.84/1.16 % (1506068)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1143211567:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.84/1.16 % (1506072)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1087039938:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.84/1.16 % (1506073)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1168520852:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.84/1.16 % (1506069)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1811623022:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.84/1.16 % (1506074)dis-21_1_sil=8000:lcm=predicate:random_seed=867367390:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.84/1.16 % (1506070)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1629144824:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.84/1.16 % (1506072)Also succeeded, but the first one will report.
% 2.84/1.16 % (1506074)Refutation not found, incomplete strategy
% 2.84/1.16 % (1506074)------------------------------
% 2.84/1.16 % (1506074)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.84/1.16 % (1506074)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/1.16 % (1506074)CaDiCaL version: 2.1.3
% 2.84/1.16 % (1506074)Termination reason: Refutation not found, incomplete strategy
% 2.84/1.16 % (1506074)Time elapsed: 0.003 s
% 2.84/1.16 % (1506074)Peak memory usage: 88 MB
% 2.84/1.16 % (1506074)Instructions burned: 3 (million)
% 2.84/1.16 % (1506073)Also succeeded, but the first one will report.
% 2.84/1.16 % (1506071)Refutation found. Thanks to Tanya!
% 2.84/1.16 % SZS status Theorem for theBenchmark
% 2.84/1.16 % SZS output start Proof for theBenchmark
% See solution above
% 2.84/1.16 % (1506071)------------------------------
% 2.84/1.16 % (1506071)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.84/1.16 % (1506071)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/1.16 % (1506071)CaDiCaL version: 2.1.3
% 2.84/1.16 % (1506071)Termination reason: Refutation
% 2.84/1.16 % (1506071)Time elapsed: 0.003 s
% 2.84/1.16 % (1506071)Peak memory usage: 89 MB
% 2.84/1.16 % (1506071)Instructions burned: 4 (million)
% 2.84/1.16 % (1506071)------------------------------
% 2.84/1.16 % (1506071)------------------------------
% 2.84/1.16 % (1506063)Success in time 0.314 s
% 2.84/1.16 % Vampire exiting
%------------------------------------------------------------------------------