%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n009.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:05 PM UTC 2026
% Result : Theorem 2.72s 1.15s
% Output : Refutation 2.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 16 unt; 2 def)
% Number of atoms : 64 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 56 ( 27 ~; 17 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 32 ( 0 sgn 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/theBenchmark.p',ax52) ).
fof(f41,axiom,
! [X0] : removemin_cpq_res(X0) = findmin_cpq_res(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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(f54,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(f55,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,[],[f54]) ).
fof(f56,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(f57,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,[],[f56]) ).
fof(f87,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)],[f57]) ).
fof(f91,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,[],[f55]) ).
fof(f92,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f87]) ).
fof(f93,plain,
ok(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f87]) ).
fof(f94,plain,
check_cpq(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f87]) ).
fof(f101,plain,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
inference(cnf_transformation,[],[f40]) ).
fof(f130,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f41]) ).
fof(f134,plain,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),removemin_cpq_res(X0)),
inference(definition_unfolding,[],[f101,f130]) ).
fof(f135,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,[],[f91,f134,f134]) ).
fof(f136,plain,
check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
inference(definition_unfolding,[],[f94,f134]) ).
fof(f137,plain,
ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
inference(definition_unfolding,[],[f93,f134]) ).
fof(f168,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,[],[f135,f137]) ).
fof(f170,definition,
( spl4_1
<=> check_cpq(triple(sK0,sK1,sK2)) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f171,plain,
( check_cpq(triple(sK0,sK1,sK2))
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f170]) ).
fof(f173,definition,
( spl4_2
<=> check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f174,plain,
( ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2))))
| spl4_2 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f175,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f168,f173,f170]) ).
fof(f176,plain,
( $false
| spl4_2 ),
inference(resolution,[],[f174,f136]) ).
fof(f177,plain,
spl4_2,
inference(avatar_contradiction_clause,[],[f176]) ).
fof(f178,plain,
( $false
| ~ spl4_1 ),
inference(resolution,[],[f171,f92]) ).
fof(f179,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f178]) ).
cnf(s1,plain,
( spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f175]) ).
cnf(s2,plain,
spl4_2,
inference(sat_conversion,[],[f177]) ).
cnf(s3,plain,
~ spl4_1,
inference(sat_conversion,[],[f179]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f180,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----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 THM
% 0.07/0.18 % Computer : n009.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 10:48:15 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running first-order theorem proving
% 0.07/0.22 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.72/1.15 % (2948135)Detected formulas, will run a generic FOF schedule.
% 2.72/1.15 % (2948146)dis-21_1_sil=8000:lcm=predicate:random_seed=2559914099: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.72/1.15 % (2948146)First to succeed.
% 2.72/1.15 % (2948146)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2948135"
% 2.72/1.15 % (2948142)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=2223248452:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.72/1.15 % (2948145)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4100894410:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.72/1.15 % (2948140)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=3832623672:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.72/1.15 % (2948144)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2751884866:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.72/1.15 % (2948141)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=2766719537:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.72/1.15 % (2948143)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1639107949:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.72/1.15 % (2948143)Also succeeded, but the first one will report.
% 2.72/1.15 % (2948145)Also succeeded, but the first one will report.
% 2.72/1.15 % (2948144)Also succeeded, but the first one will report.
% 2.72/1.15 % (2948146)Refutation found. Thanks to Tanya!
% 2.72/1.15 % SZS status Theorem for theBenchmark
% 2.72/1.15 % SZS output start Proof for theBenchmark
% See solution above
% 2.72/1.15 % (2948146)------------------------------
% 2.72/1.15 % (2948146)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.15 % (2948146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.15 % (2948146)CaDiCaL version: 2.1.3
% 2.72/1.15 % (2948146)Termination reason: Refutation
% 2.72/1.15 % (2948146)Time elapsed: 0.002 s
% 2.72/1.15 % (2948146)Peak memory usage: 89 MB
% 2.72/1.15 % (2948146)Instructions burned: 4 (million)
% 2.72/1.15 % (2948146)------------------------------
% 2.72/1.15 % (2948146)------------------------------
% 2.72/1.15 % (2948135)Success in time 0.292 s
% 2.72/1.15 % Vampire exiting
%------------------------------------------------------------------------------