%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV373+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 : n013.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.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 16 unt; 1 def)
% Number of atoms : 56 ( 18 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 46 ( 24 ~; 10 |; 5 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 46 ( 1 sgn 43 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] : ~ contains_slb(create_slb,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax20) ).
fof(f27,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(f39,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(f41,axiom,
! [X0] : removemin_cpq_res(X0) = findmin_cpq_res(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax53) ).
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/sandbox2/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/sandbox2/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(f48,plain,
! [X0,X1,X2] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
inference(rectify,[],[f39]) ).
fof(f78,plain,
! [X0,X1,X2] :
( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
| create_slb = X1 ),
inference(ennf_transformation,[],[f48]) ).
fof(f79,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(f80,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(f88,plain,
! [X0] : ~ contains_slb(create_slb,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f113,plain,
! [X2,X3,X0,X1] :
( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f27]) ).
fof(f126,plain,
! [X2,X0,X1] :
( create_slb = X1
| findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f78]) ).
fof(f128,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f41]) ).
fof(f130,plain,
! [X2,X0,X1] :
( ~ ok(findmin_cpq_eff(triple(X0,X1,X2)))
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(cnf_transformation,[],[f79]) ).
fof(f132,plain,
~ contains_cpq(triple(sK0,sK1,sK2),findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f80]) ).
fof(f133,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f80]) ).
fof(f137,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = removemin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(definition_unfolding,[],[f126,f128]) ).
fof(f138,plain,
~ contains_cpq(triple(sK0,sK1,sK2),removemin_cpq_res(triple(sK0,sK1,sK2))),
inference(definition_unfolding,[],[f132,f128]) ).
fof(f166,plain,
~ contains_slb(sK1,removemin_cpq_res(triple(sK0,sK1,sK2))),
inference(resolution,[],[f113,f138]) ).
fof(f168,plain,
contains_slb(sK1,findmin_pqp_res(sK0)),
inference(resolution,[],[f130,f133]) ).
fof(f241,plain,
( ~ contains_slb(sK1,findmin_pqp_res(sK0))
| create_slb = sK1 ),
inference(superposition,[],[f166,f137]) ).
fof(f245,definition,
( spl3_1
<=> create_slb = sK1 ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f247,plain,
( create_slb = sK1
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f253,plain,
create_slb = sK1,
inference(forward_subsumption_resolution,[],[f241,f168]) ).
fof(f254,plain,
spl3_1,
inference(avatar_split_clause,[],[f253,f245]) ).
fof(f255,plain,
( contains_slb(create_slb,findmin_pqp_res(sK0))
| ~ spl3_1 ),
inference(superposition,[],[f168,f247]) ).
fof(f262,plain,
( $false
| ~ spl3_1 ),
inference(forward_subsumption_resolution,[],[f255,f88]) ).
fof(f263,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f262]) ).
cnf(s2,plain,
spl3_1,
inference(sat_conversion,[],[f254]) ).
cnf(s4,plain,
~ spl3_1,
inference(sat_conversion,[],[f263]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s2,s4]) ).
fof(f264,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV373+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 : n013.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:45:36 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.19/0.27 % (1090200)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (1090209)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1462555194:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.27 % (1090209) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1090200-1090209"...
% 0.19/0.27 % (1090206)% WARNING: option uhcvi not known.
% 0.19/0.27 % (1090209)...printing done.
% 0.19/0.27 % (1090209)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27 % (1090209)------------------------------
% 0.19/0.27 % (1090209)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (1090209)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (1090209)CaDiCaL version: 2.1.3
% 0.19/0.27 % (1090209)Termination reason: Refutation
% 0.19/0.27 % (1090209)Time elapsed: 0.004 s
% 0.19/0.27 % (1090209)Peak memory usage: 12 MB
% 0.19/0.27 % (1090209)Instructions burned: 8 (million)
% 0.19/0.27 % (1090200)Success in time 0.032 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------