%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS110+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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 11:42:18 AM UTC 2026
% Result : Unsatisfiable 0.16s 0.49s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 4 unt; 0 def)
% Number of atoms : 149 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 181 ( 68 ~; 62 |; 42 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 76 ( 57 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f25,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rs(X0,X1)
& ca_Ax2(X1) )
& ! [X1] :
( rs(X0,X1)
=> cpxcomp(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f26,axiom,
! [X0] :
( cp(X0)
<=> ~ ? [X1] : ra_Px1(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f27,axiom,
! [X0] :
( cpxcomp(X0)
<=> ? [X1] : ra_Px1(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f28,axiom,
! [X0] :
( ca_Ax2(X0)
<=> ( cp(X0)
& ? [X1] :
( rinvS(X0,X1)
& cp(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f35,axiom,
cUnsatisfiable(i2003_11_14_17_21_12565),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).
fof(f38,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rs(X0,X1)
& ca_Ax2(X1) )
& ! [X2] :
( rs(X0,X2)
=> cpxcomp(X2) ) ) ),
inference(rectify,[],[f25]) ).
fof(f83,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rs(X0,X1)
& ca_Ax2(X1) )
& ! [X2] :
( cpxcomp(X2)
| ~ rs(X0,X2) ) ) ),
inference(ennf_transformation,[],[f38]) ).
fof(f84,plain,
! [X0] :
( cp(X0)
<=> ! [X1] : ~ ra_Px1(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f94,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rs(X0,X1)
| ~ ca_Ax2(X1) )
| ? [X2] :
( ~ cpxcomp(X2)
& rs(X0,X2) ) )
& ( ( ? [X1] :
( rs(X0,X1)
& ca_Ax2(X1) )
& ! [X2] :
( cpxcomp(X2)
| ~ rs(X0,X2) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f95,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rs(X0,X1)
| ~ ca_Ax2(X1) )
| ? [X2] :
( ~ cpxcomp(X2)
& rs(X0,X2) ) )
& ( ( ? [X1] :
( rs(X0,X1)
& ca_Ax2(X1) )
& ! [X2] :
( cpxcomp(X2)
| ~ rs(X0,X2) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f94]) ).
fof(f96,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rs(X0,X1)
| ~ ca_Ax2(X1) )
| ? [X2] :
( ~ cpxcomp(X2)
& rs(X0,X2) ) )
& ( ( ? [X3] :
( rs(X0,X3)
& ca_Ax2(X3) )
& ! [X4] :
( cpxcomp(X4)
| ~ rs(X0,X4) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f95]) ).
fof(f97,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rs(X0,X1)
| ~ ca_Ax2(X1) )
| ( ~ cpxcomp(sK0(X0))
& rs(X0,sK0(X0)) ) )
& ( ( rs(X0,sK1(X0))
& ca_Ax2(sK1(X0))
& ! [X4] :
( cpxcomp(X4)
| ~ rs(X0,X4) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0(X0)),skolemize(X3,sK1(X0))],[f96]) ).
fof(f98,plain,
! [X0] :
( ( cp(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X1] : ~ ra_Px1(X0,X1)
| ~ cp(X0) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f99,plain,
! [X0] :
( ( cp(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X2] : ~ ra_Px1(X0,X2)
| ~ cp(X0) ) ),
inference(rectify,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ( cp(X0)
| ra_Px1(X0,sK2(X0)) )
& ( ! [X2] : ~ ra_Px1(X0,X2)
| ~ cp(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X1,sK2(X0))],[f99]) ).
fof(f101,plain,
! [X0] :
( ( cpxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ? [X1] : ra_Px1(X0,X1)
| ~ cpxcomp(X0) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f102,plain,
! [X0] :
( ( cpxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ? [X2] : ra_Px1(X0,X2)
| ~ cpxcomp(X0) ) ),
inference(rectify,[],[f101]) ).
fof(f103,plain,
! [X0] :
( ( cpxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ra_Px1(X0,sK3(X0))
| ~ cpxcomp(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0))],[f102]) ).
fof(f104,plain,
! [X0] :
( ( ca_Ax2(X0)
| ~ cp(X0)
| ! [X1] :
( ~ rinvS(X0,X1)
| ~ cp(X1) ) )
& ( ( cp(X0)
& ? [X1] :
( rinvS(X0,X1)
& cp(X1) ) )
| ~ ca_Ax2(X0) ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f105,plain,
! [X0] :
( ( ca_Ax2(X0)
| ~ cp(X0)
| ! [X1] :
( ~ rinvS(X0,X1)
| ~ cp(X1) ) )
& ( ( cp(X0)
& ? [X1] :
( rinvS(X0,X1)
& cp(X1) ) )
| ~ ca_Ax2(X0) ) ),
inference(flattening,[],[f104]) ).
fof(f106,plain,
! [X0] :
( ( ca_Ax2(X0)
| ~ cp(X0)
| ! [X1] :
( ~ rinvS(X0,X1)
| ~ cp(X1) ) )
& ( ( cp(X0)
& ? [X2] :
( rinvS(X0,X2)
& cp(X2) ) )
| ~ ca_Ax2(X0) ) ),
inference(rectify,[],[f105]) ).
fof(f107,plain,
! [X0] :
( ( ca_Ax2(X0)
| ~ cp(X0)
| ! [X1] :
( ~ rinvS(X0,X1)
| ~ cp(X1) ) )
& ( ( cp(X0)
& rinvS(X0,sK4(X0))
& cp(sK4(X0)) )
| ~ ca_Ax2(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0))],[f106]) ).
fof(f137,plain,
! [X0,X4] :
( ~ rs(X0,X4)
| cpxcomp(X4)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f138,plain,
! [X0] :
( ca_Ax2(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f139,plain,
! [X0] :
( rs(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f142,plain,
! [X2,X0] :
( ~ ra_Px1(X0,X2)
| ~ cp(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f144,plain,
! [X0] :
( ra_Px1(X0,sK3(X0))
| ~ cpxcomp(X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f148,plain,
! [X0] :
( ~ ca_Ax2(X0)
| cp(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f159,plain,
cUnsatisfiable(i2003_11_14_17_21_12565),
inference(cnf_transformation,[],[f35]) ).
fof(f185,plain,
! [X0] :
( cp(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f138,f148]) ).
fof(f189,plain,
! [X0] :
( ~ cpxcomp(X0)
| ~ cp(X0) ),
inference(resolution,[],[f144,f142]) ).
fof(f195,plain,
! [X0] :
( cpxcomp(sK1(X0))
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f137,f139]) ).
fof(f196,plain,
! [X0] :
( cpxcomp(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f195]) ).
fof(f197,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ cp(sK1(X0)) ),
inference(resolution,[],[f196,f189]) ).
fof(f198,plain,
! [X0] : ~ cUnsatisfiable(X0),
inference(forward_subsumption_resolution,[],[f197,f185]) ).
fof(f200,plain,
$false,
inference(resolution,[],[f198,f159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS110+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 % Computer : n020.cluster.edu
% 0.12/0.41 % Model : x86_64 x86_64
% 0.12/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.41 % Memory : 8046.5625MB
% 0.12/0.41 % OS : Linux 6.8.0-71-generic
% 0.12/0.41 % CPULimit : 300
% 0.12/0.41 % WCLimit : 300
% 0.12/0.41 % DateTime : Sun Sep 27 13:25:19 UTC 2026
% 0.12/0.41 % CPUTime :
% 0.12/0.41 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.44 Running first-order model finding
% 0.12/0.44 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.16/0.49 % (3381612)Will run a generic schedule for satisfiability detection.
% 0.16/0.49 % (3381617)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2392411623_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.49 % TRYING [1]
% 0.16/0.49 % TRYING [2]
% 0.16/0.49 % TRYING [3]
% 0.16/0.49 % TRYING [4]
% 0.16/0.49 % TRYING [5]
% 0.16/0.49 % TRYING [6]
% 0.16/0.49 % (3381618)% WARNING: option uhcvi not known.
% 0.16/0.49 % TRYING [7]
% 0.16/0.49 % TRYING [8]
% 0.16/0.49 % (3381619)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=312394349:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.49 % (3381618)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=654805352:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.49 % (3381623)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=273125614:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.49 % (3381620)dis+10_1_sil=32000:sp=arity:random_seed=4239390458:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.49 % (3381621)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2561339524:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.49 % (3381622)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2542776780:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.49 % TRYING [9]
% 0.16/0.49 % (3381620) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3381612-3381620"...
% 0.16/0.49 % (3381623) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3381612-3381623"...
% 0.16/0.49 % (3381618) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3381612-3381618"...
% 0.16/0.49 % (3381622) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3381612-3381622"...
% 0.16/0.49 % (3381621) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3381612-3381621"...
% 0.16/0.49 % TRYING [10]
% 0.16/0.49 % (3381620)...printing done.
% 0.16/0.49 % (3381623)...printing done.
% 0.16/0.49 % (3381618)...printing done.
% 0.16/0.49 % (3381621)...printing done.
% 0.16/0.49 % (3381622)...printing done.
% 0.16/0.49 % (3381620)Refutation found. Thanks to Tanya!
% 0.16/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.49 % (3381620)------------------------------
% 0.16/0.49 % (3381620)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.49 % (3381620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.49 % (3381620)CaDiCaL version: 2.1.3
% 0.16/0.49 % (3381620)Termination reason: Refutation
% 0.16/0.49 % (3381620)Time elapsed: 0.003 s
% 0.16/0.49 % (3381620)Peak memory usage: 11 MB
% 0.16/0.49 % (3381620)Instructions burned: 3 (million)
% 0.16/0.49 % (3381612)Success in time 0.036 s
% 0.16/0.49 % Vampire exiting
%------------------------------------------------------------------------------