%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV389+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 : 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:21:08 PM UTC 2026
% Result : Theorem 0.11s 0.25s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 12 unt; 0 def)
% Number of atoms : 44 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 20 ~; 11 |; 7 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 32 ( 26 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f40,axiom,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax52) ).
fof(f41,axiom,
! [X0] : removemin_cpq_res(X0) = findmin_cpq_res(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax53) ).
fof(f42,axiom,
! [X0,X1,X2] :
( ( check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
& ok(removemin_cpq_eff(triple(X0,X1,X2))) )
=> check_cpq(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_l40) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ ok(removemin_cpq_eff(triple(X0,X1,X2))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_co) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ ok(removemin_cpq_eff(triple(X0,X1,X2))) ) ),
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f83,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ ok(removemin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f42]) ).
fof(f84,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ ok(removemin_cpq_eff(triple(X0,X1,X2))) ),
inference(flattening,[],[f83]) ).
fof(f85,plain,
? [X0,X1,X2] :
( check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
& ok(removemin_cpq_eff(triple(X0,X1,X2)))
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f44]) ).
fof(f86,plain,
? [X0,X1,X2] :
( check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
& ok(removemin_cpq_eff(triple(X0,X1,X2)))
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(flattening,[],[f85]) ).
fof(f93,plain,
( check_cpq(removemin_cpq_eff(triple(sK0,sK1,sK2)))
& ok(removemin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ check_cpq(triple(sK0,sK1,sK2)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f86]) ).
fof(f140,plain,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
inference(cnf_transformation,[],[f40]) ).
fof(f141,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f41]) ).
fof(f142,plain,
! [X2,X0,X1] :
( check_cpq(triple(X0,X1,X2))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ ok(removemin_cpq_eff(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f84]) ).
fof(f143,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f93]) ).
fof(f144,plain,
ok(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f93]) ).
fof(f145,plain,
check_cpq(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f93]) ).
fof(f146,plain,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),removemin_cpq_res(X0)),
inference(definition_unfolding,[],[f140,f141]) ).
fof(f150,plain,
! [X2,X0,X1] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))))
| check_cpq(triple(X0,X1,X2)) ),
inference(definition_unfolding,[],[f142,f146,f146]) ).
fof(f151,plain,
check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
inference(definition_unfolding,[],[f145,f146]) ).
fof(f152,plain,
ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
inference(definition_unfolding,[],[f144,f146]) ).
fof(f404,plain,
( ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2))))
| check_cpq(triple(sK0,sK1,sK2)) ),
inference(resolution,[],[f150,f152]) ).
fof(f410,plain,
check_cpq(triple(sK0,sK1,sK2)),
inference(forward_subsumption_resolution,[],[f404,f151]) ).
fof(f411,plain,
$false,
inference(forward_subsumption_resolution,[],[f410,f143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV389+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.18 % Computer : n003.cluster.edu
% 0.11/0.18 % Model : x86_64 x86_64
% 0.11/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18 % Memory : 8046.5625MB
% 0.11/0.18 % OS : Linux 6.8.0-71-generic
% 0.11/0.18 % CPULimit : 300
% 0.11/0.18 % WCLimit : 300
% 0.11/0.18 % DateTime : Mon Sep 28 10:49:57 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.21 Running first-order model finding
% 0.11/0.21 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.11/0.25 % (1508348)Will run a generic schedule for satisfiability detection.
% 0.11/0.25 % (1508358)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2656550715:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.25 % (1508354)% WARNING: option uhcvi not known.
% 0.11/0.25 % (1508358) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1508348-1508358"...
% 0.11/0.25 % (1508358)...printing done.
% 0.11/0.25 % (1508353)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2034432828_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.25 % (1508356)dis+10_1_sil=32000:sp=arity:random_seed=1847800154:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.25 % (1508355)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2989961724:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.25 % (1508358)Refutation found. Thanks to Tanya!
% 0.11/0.25 % SZS status Theorem for theBenchmark
% 0.11/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.25 % (1508358)------------------------------
% 0.11/0.25 % (1508358)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.25 % (1508358)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.25 % (1508358)CaDiCaL version: 2.1.3
% 0.11/0.25 % (1508358)Termination reason: Refutation
% 0.11/0.25 % (1508358)Time elapsed: 0.006 s
% 0.11/0.25 % (1508358)Peak memory usage: 11 MB
% 0.11/0.25 % (1508358)Instructions burned: 16 (million)
% 0.11/0.25 % (1508348)Success in time 0.03 s
% 0.11/0.25 % Vampire exiting
%------------------------------------------------------------------------------