%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM843+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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 12:25:53 PM UTC 2026
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 20 unt; 1 def)
% Number of atoms : 67 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 49 ( 23 ~; 21 |; 0 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 34 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
greater(vd390,vd391),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(244, 394, 0)') ).
fof(f2,negated_conjecture,
~ greater(vd390,vd391),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,axiom,
~ leq(vd390,vd391),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conjunct2(243), 393, 0)') ).
fof(f21,axiom,
! [X0,X1] :
( geq(X0,X1)
=> leq(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(158, 0), 0)') ).
fof(f22,axiom,
! [X0,X1] :
( leq(X1,X0)
<=> ( less(X1,X0)
| X1 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 17), 1)') ).
fof(f23,axiom,
! [X0,X1] :
( geq(X1,X0)
<=> ( greater(X1,X0)
| X1 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 16), 1)') ).
fof(f24,axiom,
! [X0,X1] :
( less(X0,X1)
=> greater(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).
fof(f26,axiom,
! [X0,X1] :
( X0 = X1
| greater(X0,X1)
| less(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof(f48,plain,
~ greater(vd390,vd391),
inference(flattening,[],[f2]) ).
fof(f67,plain,
! [X0,X1] :
( leq(X1,X0)
| ~ geq(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f68,plain,
! [X0,X1] :
( greater(X1,X0)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f77,plain,
~ greater(vd390,vd391),
inference(cnf_transformation,[],[f48]) ).
fof(f78,plain,
~ leq(vd390,vd391),
inference(cnf_transformation,[],[f3]) ).
fof(f98,plain,
! [X0,X1] :
( ~ geq(X0,X1)
| leq(X1,X0) ),
inference(cnf_transformation,[],[f67]) ).
fof(f100,plain,
! [X0,X1] :
( X0 != X1
| leq(X1,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f104,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| geq(X1,X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f105,plain,
! [X0,X1] :
( ~ less(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[],[f68]) ).
fof(f107,plain,
! [X0,X1] :
( less(X0,X1)
| greater(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f26]) ).
fof(f141,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f100]) ).
fof(f150,plain,
greater(vd390,vd391),
inference(consistent_polarity_flipping,[],[f77]) ).
fof(f151,plain,
leq(vd390,vd391),
inference(consistent_polarity_flipping,[],[f78]) ).
fof(f169,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| geq(X0,X1) ),
inference(consistent_polarity_flipping,[],[f98]) ).
fof(f171,plain,
! [X1] : ~ leq(X1,X1),
inference(consistent_polarity_flipping,[],[f141]) ).
fof(f173,plain,
! [X0,X1] :
( ~ geq(X1,X0)
| greater(X1,X0) ),
inference(consistent_polarity_flipping,[],[f104]) ).
fof(f176,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f105]) ).
fof(f178,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ greater(X0,X1)
| X0 = X1 ),
inference(consistent_polarity_flipping,[],[f107]) ).
fof(f186,plain,
geq(vd391,vd390),
inference(resolution,[],[f169,f151]) ).
fof(f189,plain,
greater(vd391,vd390),
inference(resolution,[],[f173,f186]) ).
fof(f190,plain,
less(vd391,vd390),
inference(resolution,[],[f176,f150]) ).
fof(f258,definition,
( spl4_2
<=> vd390 = vd391 ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f260,plain,
( vd390 = vd391
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f263,plain,
( leq(vd390,vd390)
| ~ spl4_2 ),
inference(superposition,[],[f151,f260]) ).
fof(f271,plain,
( $false
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f263,f171]) ).
fof(f272,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f271]) ).
fof(f292,plain,
( ~ greater(vd391,vd390)
| vd390 = vd391 ),
inference(resolution,[],[f178,f190]) ).
fof(f293,plain,
vd390 = vd391,
inference(forward_subsumption_resolution,[],[f292,f189]) ).
fof(f295,plain,
spl4_2,
inference(avatar_split_clause,[],[f293,f258]) ).
cnf(s3,plain,
~ spl4_2,
inference(sat_conversion,[],[f272]) ).
cnf(s6,plain,
spl4_2,
inference(sat_conversion,[],[f295]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s3,s6]) ).
fof(f296,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM843+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n017.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 21:25:20 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.42 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.18/0.47 % (2953595)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (2953606)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4193914985:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.47 % (2953601)% WARNING: option uhcvi not known.
% 0.18/0.47 % (2953602)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1085199572:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.47 % (2953600)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3854496135_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.47 % (2953601)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1475758317:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.47 % (2953605)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2658408937:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.47 % (2953603)dis+10_1_sil=32000:sp=arity:random_seed=2916517743:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.47 % (2953604)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1385906247:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.47 % TRYING [1]
% 0.18/0.47 % TRYING [2]
% 0.18/0.47 % (2953600) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2953595-2953600"...
% 0.18/0.47 % (2953601) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2953595-2953601"...
% 0.18/0.47 % (2953604) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2953595-2953604"...
% 0.18/0.47 % (2953605) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2953595-2953605"...
% 0.18/0.47 % (2953601)...printing done.
% 0.18/0.47 % (2953604)...printing done.
% 0.18/0.47 % (2953605)...printing done.
% 0.18/0.47 % (2953601)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Theorem for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (2953601)------------------------------
% 0.18/0.47 % (2953601)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (2953601)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (2953601)CaDiCaL version: 2.1.3
% 0.18/0.47 % (2953601)Termination reason: Refutation
% 0.18/0.47 % (2953601)Time elapsed: 0.005 s
% 0.18/0.47 % (2953601)Peak memory usage: 12 MB
% 0.18/0.47 % (2953601)Instructions burned: 6 (million)
% 0.18/0.47 % (2953595)Success in time 0.041 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------