%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS010-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:05 AM UTC 2026
% Result : Unsatisfiable 0.03s 0.39s
% Output : Refutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 68 ( 4 unt; 0 def)
% Number of atoms : 256 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 360 ( 172 ~; 188 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 75 ( 75 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f2,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f3,axiom,
! [X0] :
( ~ a(X0)
| d(X0)
| c(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f6,axiom,
! [X2,X0,X1] :
( ~ r(X2,X1)
| ~ e(X2)
| ~ r(X2,X0)
| equalish(X0,X1)
| ~ c(X0)
| ~ c(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
fof(f7,axiom,
! [X0] :
( ~ e(X0)
| r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
fof(f8,axiom,
! [X0,X1] :
( ~ r(X1,X0)
| ~ e(X1)
| a(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
fof(f19,axiom,
! [X0] :
( ~ equalish(u2r2(X0),u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_19) ).
fof(f20,axiom,
! [X0] :
( ~ equalish(u2r3(X0),u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_20) ).
fof(f21,axiom,
! [X0] :
( ~ equalish(u2r3(X0),u2r2(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_21) ).
fof(f22,axiom,
! [X0] :
( r(X0,u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_22) ).
fof(f23,axiom,
! [X0] :
( r(X0,u2r2(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_23) ).
fof(f24,axiom,
! [X0] :
( r(X0,u2r3(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_24) ).
fof(f31,axiom,
! [X2,X0,X1] :
( ~ r(X0,X2)
| equalish(X1,X2)
| ~ r(X0,X1)
| f(X0)
| ~ d(X1)
| ~ d(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_31) ).
fof(f37,plain,
! [X0] :
( ~ e(X0)
| a(u2r2(X0))
| ~ r3least(X0) ),
inference(resolution,[],[f8,f23]) ).
fof(f38,plain,
! [X0] :
( ~ e(X0)
| a(u2r1(X0))
| ~ r3least(X0) ),
inference(resolution,[],[f8,f22]) ).
fof(f39,plain,
! [X0] :
( ~ e(X0)
| a(u2r3(X0))
| ~ r3least(X0) ),
inference(resolution,[],[f8,f24]) ).
fof(f42,plain,
! [X0] :
( a(u2r3(X0))
| ~ e(X0) ),
inference(forward_subsumption_resolution,[],[f39,f7]) ).
fof(f43,plain,
! [X0] :
( a(u2r1(X0))
| ~ e(X0) ),
inference(forward_subsumption_resolution,[],[f38,f7]) ).
fof(f44,plain,
! [X0] :
( a(u2r2(X0))
| ~ e(X0) ),
inference(forward_subsumption_resolution,[],[f37,f7]) ).
fof(f45,plain,
! [X0] :
( d(u2r3(X0))
| ~ e(X0)
| c(u2r3(X0)) ),
inference(resolution,[],[f42,f3]) ).
fof(f46,plain,
! [X0] :
( d(u2r1(X0))
| ~ e(X0)
| c(u2r1(X0)) ),
inference(resolution,[],[f43,f3]) ).
fof(f47,plain,
! [X0] :
( d(u2r2(X0))
| ~ e(X0)
| c(u2r2(X0)) ),
inference(resolution,[],[f44,f3]) ).
fof(f66,plain,
! [X0,X1] :
( ~ e(X0)
| ~ r(X0,X1)
| equalish(X1,u2r2(X0))
| ~ c(X1)
| ~ c(u2r2(X0))
| ~ r3least(X0) ),
inference(resolution,[],[f6,f23]) ).
fof(f67,plain,
! [X0,X1] :
( ~ e(X0)
| ~ r(X0,X1)
| equalish(X1,u2r1(X0))
| ~ c(X1)
| ~ c(u2r1(X0))
| ~ r3least(X0) ),
inference(resolution,[],[f6,f22]) ).
fof(f72,plain,
! [X0,X1] :
( equalish(X1,u2r1(X0))
| ~ r(X0,X1)
| ~ e(X0)
| ~ c(X1)
| ~ c(u2r1(X0)) ),
inference(forward_subsumption_resolution,[],[f67,f7]) ).
fof(f73,plain,
! [X0,X1] :
( equalish(X1,u2r2(X0))
| ~ r(X0,X1)
| ~ e(X0)
| ~ c(X1)
| ~ c(u2r2(X0)) ),
inference(forward_subsumption_resolution,[],[f66,f7]) ).
fof(f80,plain,
! [X0,X1] :
( equalish(X0,u2r2(X1))
| ~ r(X1,X0)
| f(X1)
| ~ d(X0)
| ~ d(u2r2(X1))
| ~ r3least(X1) ),
inference(resolution,[],[f31,f23]) ).
fof(f81,plain,
! [X0,X1] :
( equalish(X0,u2r1(X1))
| ~ r(X1,X0)
| f(X1)
| ~ d(X0)
| ~ d(u2r1(X1))
| ~ r3least(X1) ),
inference(resolution,[],[f31,f22]) ).
fof(f85,plain,
! [X0] :
( ~ r(X0,u2r2(X0))
| ~ e(X0)
| ~ c(u2r2(X0))
| ~ c(u2r1(X0))
| ~ r3least(X0) ),
inference(resolution,[],[f72,f19]) ).
fof(f86,plain,
! [X0] :
( ~ r(X0,u2r3(X0))
| ~ e(X0)
| ~ c(u2r3(X0))
| ~ c(u2r1(X0))
| ~ r3least(X0) ),
inference(resolution,[],[f72,f20]) ).
fof(f87,plain,
! [X0] :
( ~ e(X0)
| ~ c(u2r3(X0))
| ~ c(u2r1(X0))
| ~ r3least(X0) ),
inference(forward_subsumption_resolution,[],[f86,f24]) ).
fof(f88,plain,
! [X0] :
( ~ e(X0)
| ~ c(u2r2(X0))
| ~ c(u2r1(X0))
| ~ r3least(X0) ),
inference(forward_subsumption_resolution,[],[f85,f23]) ).
fof(f89,plain,
! [X0] :
( ~ c(u2r3(X0))
| ~ e(X0)
| ~ c(u2r1(X0)) ),
inference(forward_subsumption_resolution,[],[f87,f7]) ).
fof(f90,plain,
! [X0] :
( ~ c(u2r1(X0))
| ~ c(u2r2(X0))
| ~ e(X0) ),
inference(forward_subsumption_resolution,[],[f88,f7]) ).
fof(f102,plain,
! [X0] :
( ~ r(X0,u2r3(X0))
| ~ e(X0)
| ~ c(u2r3(X0))
| ~ c(u2r2(X0))
| ~ r3least(X0) ),
inference(resolution,[],[f73,f21]) ).
fof(f103,plain,
! [X0] :
( ~ e(X0)
| ~ c(u2r3(X0))
| ~ c(u2r2(X0))
| ~ r3least(X0) ),
inference(forward_subsumption_resolution,[],[f102,f24]) ).
fof(f104,plain,
! [X0] :
( ~ c(u2r3(X0))
| ~ e(X0)
| ~ c(u2r2(X0)) ),
inference(forward_subsumption_resolution,[],[f103,f7]) ).
fof(f108,plain,
! [X0] :
( ~ r(X0,u2r3(X0))
| f(X0)
| ~ d(u2r3(X0))
| ~ d(u2r2(X0))
| ~ r3least(X0)
| ~ r3least(X0) ),
inference(resolution,[],[f80,f21]) ).
fof(f109,plain,
! [X0] :
( ~ r(X0,u2r3(X0))
| f(X0)
| ~ d(u2r3(X0))
| ~ d(u2r2(X0))
| ~ r3least(X0) ),
inference(duplicate_literal_removal,[],[f108]) ).
fof(f110,plain,
! [X0] :
( ~ d(u2r3(X0))
| f(X0)
| ~ d(u2r2(X0))
| ~ r3least(X0) ),
inference(forward_subsumption_resolution,[],[f109,f24]) ).
fof(f111,plain,
! [X0] :
( f(X0)
| ~ d(u2r2(X0))
| ~ r3least(X0)
| ~ e(X0)
| c(u2r3(X0)) ),
inference(resolution,[],[f110,f45]) ).
fof(f112,plain,
! [X0] :
( ~ d(u2r2(X0))
| f(X0)
| ~ e(X0)
| c(u2r3(X0)) ),
inference(forward_subsumption_resolution,[],[f111,f7]) ).
fof(f113,plain,
! [X0] :
( ~ r(X0,u2r2(X0))
| f(X0)
| ~ d(u2r2(X0))
| ~ d(u2r1(X0))
| ~ r3least(X0)
| ~ r3least(X0) ),
inference(resolution,[],[f81,f19]) ).
fof(f114,plain,
! [X0] :
( ~ r(X0,u2r3(X0))
| f(X0)
| ~ d(u2r3(X0))
| ~ d(u2r1(X0))
| ~ r3least(X0)
| ~ r3least(X0) ),
inference(resolution,[],[f81,f20]) ).
fof(f115,plain,
! [X0] :
( ~ r(X0,u2r3(X0))
| f(X0)
| ~ d(u2r3(X0))
| ~ d(u2r1(X0))
| ~ r3least(X0) ),
inference(duplicate_literal_removal,[],[f114]) ).
fof(f116,plain,
! [X0] :
( ~ r(X0,u2r2(X0))
| f(X0)
| ~ d(u2r2(X0))
| ~ d(u2r1(X0))
| ~ r3least(X0) ),
inference(duplicate_literal_removal,[],[f113]) ).
fof(f117,plain,
! [X0] :
( ~ d(u2r3(X0))
| f(X0)
| ~ d(u2r1(X0))
| ~ r3least(X0) ),
inference(forward_subsumption_resolution,[],[f115,f24]) ).
fof(f118,plain,
! [X0] :
( ~ d(u2r1(X0))
| ~ d(u2r2(X0))
| f(X0)
| ~ r3least(X0) ),
inference(forward_subsumption_resolution,[],[f116,f23]) ).
fof(f119,plain,
! [X0] :
( f(X0)
| ~ d(u2r1(X0))
| ~ r3least(X0)
| ~ e(X0)
| c(u2r3(X0)) ),
inference(resolution,[],[f117,f45]) ).
fof(f120,plain,
! [X0] :
( ~ d(u2r1(X0))
| f(X0)
| ~ e(X0)
| c(u2r3(X0)) ),
inference(forward_subsumption_resolution,[],[f119,f7]) ).
fof(f121,plain,
! [X0] :
( ~ d(u2r2(X0))
| f(X0)
| ~ r3least(X0)
| ~ e(X0)
| c(u2r1(X0)) ),
inference(resolution,[],[f118,f46]) ).
fof(f122,plain,
! [X0] :
( ~ d(u2r2(X0))
| f(X0)
| ~ e(X0)
| c(u2r1(X0)) ),
inference(forward_subsumption_resolution,[],[f121,f7]) ).
fof(f123,plain,
! [X0] :
( f(X0)
| ~ e(X0)
| c(u2r3(X0))
| ~ e(X0)
| c(u2r2(X0)) ),
inference(resolution,[],[f112,f47]) ).
fof(f124,plain,
! [X0] :
( c(u2r3(X0))
| ~ e(X0)
| f(X0)
| c(u2r2(X0)) ),
inference(duplicate_literal_removal,[],[f123]) ).
fof(f125,plain,
! [X0] :
( f(X0)
| ~ e(X0)
| c(u2r3(X0))
| ~ e(X0)
| c(u2r1(X0)) ),
inference(resolution,[],[f120,f46]) ).
fof(f126,plain,
! [X0] :
( f(X0)
| ~ e(X0)
| c(u2r3(X0))
| c(u2r1(X0)) ),
inference(duplicate_literal_removal,[],[f125]) ).
fof(f127,plain,
! [X0] :
( f(X0)
| ~ e(X0)
| c(u2r1(X0))
| ~ e(X0)
| c(u2r2(X0)) ),
inference(resolution,[],[f122,f47]) ).
fof(f128,plain,
! [X0] :
( f(X0)
| ~ e(X0)
| c(u2r1(X0))
| c(u2r2(X0)) ),
inference(duplicate_literal_removal,[],[f127]) ).
fof(f136,plain,
! [X0] :
( ~ e(X0)
| f(X0)
| c(u2r2(X0))
| ~ e(X0)
| ~ c(u2r1(X0)) ),
inference(resolution,[],[f124,f89]) ).
fof(f138,plain,
! [X0] :
( ~ e(X0)
| f(X0)
| c(u2r2(X0))
| ~ c(u2r1(X0)) ),
inference(duplicate_literal_removal,[],[f136]) ).
fof(f140,plain,
! [X0] :
( ~ c(u2r1(X0))
| f(X0)
| ~ e(X0) ),
inference(forward_subsumption_resolution,[],[f138,f90]) ).
fof(f168,plain,
! [X0] :
( c(u2r3(X0))
| ~ e(X0)
| f(X0) ),
inference(forward_subsumption_resolution,[],[f126,f140]) ).
fof(f176,plain,
! [X0] :
( ~ e(X0)
| f(X0)
| ~ e(X0)
| ~ c(u2r2(X0)) ),
inference(resolution,[],[f168,f104]) ).
fof(f180,plain,
! [X0] :
( ~ c(u2r2(X0))
| f(X0)
| ~ e(X0) ),
inference(duplicate_literal_removal,[],[f176]) ).
fof(f194,plain,
! [X0] :
( f(X0)
| ~ e(X0)
| c(u2r2(X0)) ),
inference(forward_subsumption_resolution,[],[f128,f140]) ).
fof(f195,plain,
! [X0] :
( ~ e(X0)
| f(X0) ),
inference(forward_subsumption_resolution,[],[f194,f180]) ).
fof(f196,plain,
f(exist),
inference(resolution,[],[f195,f1]) ).
fof(f197,plain,
$false,
inference(forward_subsumption_resolution,[],[f196,f2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : KRS010-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.03/0.34 % Computer : n012.cluster.edu
% 0.03/0.34 % Model : x86_64 x86_64
% 0.03/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.34 % Memory : 8046.5625MB
% 0.03/0.34 % OS : Linux 6.8.0-71-generic
% 0.03/0.34 % CPULimit : 300
% 0.03/0.34 % WCLimit : 300
% 0.03/0.34 % DateTime : Sun Sep 27 13:14:50 UTC 2026
% 0.03/0.34 % CPUTime :
% 0.03/0.34 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.03/0.36 Running first-order model finding
% 0.03/0.36 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.03/0.39 % (2385454)Will run a generic schedule for satisfiability detection.
% 0.03/0.39 % (2385460)% WARNING: option uhcvi not known.
% 0.03/0.39 % (2385463)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=439126544:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.03/0.39 % (2385461)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2010079718:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.03/0.39 % (2385462)dis+10_1_sil=32000:sp=arity:random_seed=4246638048:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.03/0.39 % (2385460)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3919300633:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.03/0.39 % (2385464)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1915784334:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.03/0.39 % (2385465)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=831510:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.03/0.39 % (2385459)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1875029550_2999 on theBenchmark for (2999ds/0Mi)
% 0.03/0.39 % TRYING [1]
% 0.03/0.39 % (2385462) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2385454-2385462"...
% 0.03/0.39 % (2385464) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2385454-2385464"...
% 0.03/0.39 % TRYING [2]
% 0.03/0.39 % TRYING [3]
% 0.03/0.39 % TRYING [4]
% 0.03/0.39 % (2385460) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2385454-2385460"...
% 0.03/0.39 % (2385462)...printing done.
% 0.03/0.39 % (2385464)...printing done.
% 0.03/0.39 % (2385465) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2385454-2385465"...
% 0.03/0.39 % (2385462)Refutation found. Thanks to Tanya!
% 0.03/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.03/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.03/0.39 % (2385462)------------------------------
% 0.03/0.39 % (2385462)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.03/0.39 % (2385462)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.03/0.39 % (2385462)CaDiCaL version: 2.1.3
% 0.03/0.39 % (2385462)Termination reason: Refutation
% 0.03/0.39 % (2385462)Time elapsed: 0.002 s
% 0.03/0.39 % (2385462)Peak memory usage: 11 MB
% 0.03/0.39 % (2385462)Instructions burned: 7 (million)
% 0.03/0.39 % (2385454)Success in time 0.024 s
% 0.03/0.39 % Vampire exiting
%------------------------------------------------------------------------------