%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM841+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:52 PM UTC 2026
% Result : Theorem 0.21s 0.47s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 47 ( 24 unt; 2 def)
% Number of atoms : 77 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 61 ( 31 ~; 25 |; 1 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
greater(vplus(vd344,vd347),vplus(vd345,vd348)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(214, 352, 0)') ).
fof(f2,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f4,axiom,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(213, 351, 1)') ).
fof(f6,axiom,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(212, 350, 0)') ).
fof(f18,axiom,
! [X0,X1,X2] :
( ( less(X1,X2)
& less(X0,X1) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(168, 0), 0)') ).
fof(f24,axiom,
! [X0,X1] :
( greater(X0,X1)
=> less(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).
fof(f25,axiom,
! [X0,X1] :
( X0 = X1
| greater(X0,X1)
| less(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof(f27,axiom,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ less(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 2)') ).
fof(f37,axiom,
! [X0,X1] : vplus(X1,X0) = vplus(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof(f47,plain,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(flattening,[],[f2]) ).
fof(f57,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f58,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(flattening,[],[f57]) ).
fof(f62,plain,
! [X0,X1] :
( less(X1,X0)
| ~ greater(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f70,plain,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(cnf_transformation,[],[f47]) ).
fof(f72,plain,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
inference(cnf_transformation,[],[f4]) ).
fof(f74,plain,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
inference(cnf_transformation,[],[f6]) ).
fof(f87,plain,
! [X2,X0,X1] :
( ~ less(X0,X1)
| ~ less(X1,X2)
| less(X0,X2) ),
inference(cnf_transformation,[],[f58]) ).
fof(f97,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| less(X1,X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f98,plain,
! [X0,X1] :
( greater(X0,X1)
| less(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f25]) ).
fof(f100,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f112,plain,
! [X0,X1] : vplus(X0,X1) = vplus(X1,X0),
inference(cnf_transformation,[],[f37]) ).
fof(f142,plain,
greater(vplus(vd347,vd344),vplus(vd345,vd347)),
inference(forward_demodulation,[],[f74,f112]) ).
fof(f143,plain,
greater(vplus(vd347,vd345),vplus(vd345,vd348)),
inference(forward_demodulation,[],[f72,f112]) ).
fof(f144,plain,
~ greater(vplus(vd347,vd344),vplus(vd345,vd348)),
inference(forward_demodulation,[],[f70,f112]) ).
fof(f145,plain,
greater(vplus(vd345,vd347),vplus(vd345,vd348)),
inference(forward_demodulation,[],[f143,f112]) ).
fof(f181,plain,
~ less(vplus(vd347,vd344),vplus(vd345,vd347)),
inference(resolution,[],[f142,f100]) ).
fof(f182,plain,
less(vplus(vd345,vd347),vplus(vd347,vd344)),
inference(resolution,[],[f142,f97]) ).
fof(f187,plain,
~ less(vplus(vd345,vd347),vplus(vd345,vd348)),
inference(resolution,[],[f145,f100]) ).
fof(f188,plain,
less(vplus(vd345,vd348),vplus(vd345,vd347)),
inference(resolution,[],[f145,f97]) ).
fof(f263,plain,
( less(vplus(vd347,vd344),vplus(vd345,vd348))
| vplus(vd345,vd348) = vplus(vd347,vd344) ),
inference(resolution,[],[f98,f144]) ).
fof(f268,definition,
( spl4_1
<=> vplus(vd345,vd348) = vplus(vd347,vd344) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f270,plain,
( vplus(vd345,vd348) = vplus(vd347,vd344)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f272,definition,
( spl4_2
<=> less(vplus(vd347,vd344),vplus(vd345,vd348)) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f274,plain,
( less(vplus(vd347,vd344),vplus(vd345,vd348))
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f275,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f263,f272,f268]) ).
fof(f277,plain,
( ! [X0] :
( ~ less(X0,vplus(vd347,vd344))
| less(X0,vplus(vd345,vd348)) )
| ~ spl4_2 ),
inference(resolution,[],[f274,f87]) ).
fof(f713,plain,
( less(vplus(vd345,vd347),vplus(vd345,vd348))
| ~ spl4_2 ),
inference(resolution,[],[f182,f277]) ).
fof(f719,plain,
( $false
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f713,f187]) ).
fof(f720,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f719]) ).
fof(f725,plain,
( ~ less(vplus(vd345,vd348),vplus(vd345,vd347))
| ~ spl4_1 ),
inference(superposition,[],[f181,f270]) ).
fof(f753,plain,
( $false
| ~ spl4_1 ),
inference(forward_subsumption_resolution,[],[f725,f188]) ).
fof(f754,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f753]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f275]) ).
cnf(s3,plain,
~ spl4_2,
inference(sat_conversion,[],[f720]) ).
cnf(s5,plain,
~ spl4_1,
inference(sat_conversion,[],[f754]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s3,s5]) ).
fof(f755,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM841+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n001.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 21:35:18 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 % (3975596)Will run a generic schedule for satisfiability detection.
% 0.21/0.47 % (3975606)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1557466116:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.47 % (3975601)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3051808385_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.47 % (3975603)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3233783916:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.47 % (3975604)dis+10_1_sil=32000:sp=arity:random_seed=945738844:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.47 % (3975605)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1173417797:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.47 % (3975607)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2346955278:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.47 % TRYING [1]
% 0.21/0.47 % TRYING [2]
% 0.21/0.47 % (3975602)% WARNING: option uhcvi not known.
% 0.21/0.47 % TRYING [3]
% 0.21/0.47 % TRYING [4]
% 0.21/0.47 % (3975602)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3231492211:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.47 % TRYING [5]
% 0.21/0.47 % (3975605) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3975596-3975605"...
% 0.21/0.47 % (3975605)...printing done.
% 0.21/0.47 % (3975605)Refutation found. Thanks to Tanya!
% 0.21/0.47 % SZS status Theorem for theBenchmark
% 0.21/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.47 % (3975605)------------------------------
% 0.21/0.47 % (3975605)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.47 % (3975605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.47 % (3975605)CaDiCaL version: 2.1.3
% 0.21/0.47 % (3975605)Termination reason: Refutation
% 0.21/0.47 % (3975605)Time elapsed: 0.022 s
% 0.21/0.47 % (3975605)Peak memory usage: 12 MB
% 0.21/0.47 % (3975605)Instructions burned: 33 (million)
% 0.21/0.47 % (3975596)Success in time 0.058 s
% 0.21/0.47 % Vampire exiting
%------------------------------------------------------------------------------