%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM839+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 : n015.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:51 PM UTC 2026
% Result : Theorem 0.16s 5.49s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 15 unt; 2 def)
% Number of atoms : 58 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 25 ~; 20 |; 0 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
greater(vd328,vd329),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conseq(204), 332, 0)') ).
fof(f2,negated_conjecture,
~ greater(vd328,vd329),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,axiom,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(antec(204), 331, 0)') ).
fof(f4,axiom,
! [X0,X1,X2] :
( less(X0,X1)
=> less(vplus(X0,X2),vplus(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 0)') ).
fof(f17,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(f19,axiom,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ less(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 2)') ).
fof(f20,axiom,
! [X0,X1] :
( X0 != X1
| ~ greater(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 3)') ).
fof(f39,plain,
~ greater(vd328,vd329),
inference(flattening,[],[f2]) ).
fof(f40,plain,
! [X0,X1,X2] :
( less(vplus(X0,X2),vplus(X1,X2))
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f59,plain,
~ greater(vd328,vd329),
inference(cnf_transformation,[],[f39]) ).
fof(f60,plain,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(cnf_transformation,[],[f3]) ).
fof(f61,plain,
! [X2,X0,X1] :
( ~ less(X0,X1)
| less(vplus(X0,X2),vplus(X1,X2)) ),
inference(cnf_transformation,[],[f40]) ).
fof(f79,plain,
! [X0,X1] :
( less(X0,X1)
| greater(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f17]) ).
fof(f81,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f82,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f20]) ).
fof(f116,plain,
! [X1] : ~ greater(X1,X1),
inference(equality_resolution,[],[f82]) ).
fof(f122,plain,
! [X2,X0,X1] :
( ~ less(vplus(X0,X2),vplus(X1,X2))
| less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f61]) ).
fof(f135,plain,
! [X0,X1] :
( greater(X0,X1)
| ~ less(X0,X1)
| X0 = X1 ),
inference(consistent_polarity_flipping,[],[f79]) ).
fof(f137,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f81]) ).
fof(f149,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(resolution,[],[f60,f137]) ).
fof(f200,plain,
( ~ less(vd328,vd329)
| vd328 = vd329 ),
inference(resolution,[],[f135,f59]) ).
fof(f205,definition,
( spl4_1
<=> vd328 = vd329 ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f207,plain,
( vd328 = vd329
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f205]) ).
fof(f209,definition,
( spl4_2
<=> less(vd328,vd329) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f212,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f200,f209,f205]) ).
fof(f393,plain,
less(vd328,vd329),
inference(resolution,[],[f149,f122]) ).
fof(f398,plain,
spl4_2,
inference(avatar_split_clause,[],[f393,f209]) ).
fof(f400,plain,
( greater(vplus(vd328,vd330),vplus(vd328,vd330))
| ~ spl4_1 ),
inference(superposition,[],[f60,f207]) ).
fof(f407,plain,
( $false
| ~ spl4_1 ),
inference(forward_subsumption_resolution,[],[f400,f116]) ).
fof(f408,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f407]) ).
cnf(s1,plain,
( spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f212]) ).
cnf(s4,plain,
spl4_2,
inference(sat_conversion,[],[f398]) ).
cnf(s5,plain,
~ spl4_1,
inference(sat_conversion,[],[f408]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s4,s5]) ).
fof(f409,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM839+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.12/5.39 % Computer : n015.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Sun Sep 27 21:32:07 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/5.42 Running first-order model finding
% 0.16/5.43 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/5.49 % (2022281)Will run a generic schedule for satisfiability detection.
% 0.16/5.49 % (2022286)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1464204156_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/5.49 % TRYING [1]
% 0.16/5.49 % TRYING [2]
% 0.16/5.49 % TRYING [3]
% 0.16/5.49 % TRYING [4]
% 0.16/5.49 % (2022287)% WARNING: option uhcvi not known.
% 0.16/5.49 % (2022287)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1544970702:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/5.49 % (2022289)dis+10_1_sil=32000:sp=arity:random_seed=3697872047:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/5.49 % (2022288)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=887364963:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/5.49 % (2022290)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1938379225:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/5.49 % (2022291)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2259373318:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/5.49 % TRYING [5]
% 0.16/5.49 % (2022292)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1114733098:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/5.49 % (2022287) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2022281-2022287"...
% 0.16/5.49 % (2022287)...printing done.
% 0.16/5.49 % TRYING [6]
% 0.16/5.49 % (2022287)Refutation found. Thanks to Tanya!
% 0.16/5.49 % SZS status Theorem for theBenchmark
% 0.16/5.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/5.49 % (2022287)------------------------------
% 0.16/5.49 % (2022287)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/5.49 % (2022287)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/5.49 % (2022287)CaDiCaL version: 2.1.3
% 0.16/5.49 % (2022287)Termination reason: Refutation
% 0.16/5.49 % (2022287)Time elapsed: 0.010 s
% 0.16/5.49 % (2022287)Peak memory usage: 12 MB
% 0.16/5.49 % (2022287)Instructions burned: 13 (million)
% 0.16/5.49 % (2022281)Success in time 0.054 s
% 0.16/5.49 % Vampire exiting
%------------------------------------------------------------------------------