%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM290+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:18:15 PM UTC 2026
% Result : Theorem 0.38s 0.48s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 18 unt; 2 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 52 ( 26 ~; 21 |; 2 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn2) ).
fof(f4,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn3) ).
fof(f268,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less23) ).
fof(f281,axiom,
! [X0,X1,X2,X3] :
( ( rdn_translate(X0,rdn_pos(X2))
& rdn_translate(X1,rdn_pos(X3))
& rdn_positive_less(X2,X3) )
=> less(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_pos_pos) ).
fof(f402,conjecture,
less(n2,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n2_less_n3) ).
fof(f403,negated_conjecture,
~ less(n2,n3),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f404,plain,
~ less(n2,n3),
inference(flattening,[],[f403]) ).
fof(f414,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_translate(X0,rdn_pos(X2))
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_positive_less(X2,X3) ),
inference(ennf_transformation,[],[f281]) ).
fof(f415,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_translate(X0,rdn_pos(X2))
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_positive_less(X2,X3) ),
inference(flattening,[],[f414]) ).
fof(f456,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f3]) ).
fof(f457,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(cnf_transformation,[],[f4]) ).
fof(f721,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf_transformation,[],[f268]) ).
fof(f734,plain,
! [X2,X3,X0,X1] :
( less(X0,X1)
| ~ rdn_translate(X0,rdn_pos(X2))
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_positive_less(X2,X3) ),
inference(cnf_transformation,[],[f415]) ).
fof(f858,plain,
~ less(n2,n3),
inference(cnf_transformation,[],[f404]) ).
fof(f871,plain,
~ rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(consistent_polarity_flipping,[],[f721]) ).
fof(f883,plain,
! [X2,X3,X0,X1] :
( ~ less(X0,X1)
| ~ rdn_translate(X0,rdn_pos(X2))
| ~ rdn_translate(X1,rdn_pos(X3))
| rdn_positive_less(X2,X3) ),
inference(consistent_polarity_flipping,[],[f734]) ).
fof(f997,plain,
less(n2,n3),
inference(consistent_polarity_flipping,[],[f858]) ).
fof(f1268,plain,
! [X0,X1] :
( rdn_positive_less(X0,X1)
| ~ rdn_translate(n3,rdn_pos(X1))
| ~ rdn_translate(n2,rdn_pos(X0)) ),
inference(resolution,[],[f883,f997]) ).
fof(f1273,plain,
( ~ rdn_translate(n3,rdn_pos(rdnn(n3)))
| ~ rdn_translate(n2,rdn_pos(rdnn(n2))) ),
inference(resolution,[],[f1268,f871]) ).
fof(f1344,definition,
( spl0_17
<=> rdn_translate(n2,rdn_pos(rdnn(n2))) ),
introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).
fof(f1346,plain,
( ~ rdn_translate(n2,rdn_pos(rdnn(n2)))
| spl0_17 ),
inference(avatar_component_clause,[],[f1344]) ).
fof(f1348,definition,
( spl0_18
<=> rdn_translate(n3,rdn_pos(rdnn(n3))) ),
introduced(definition,[new_symbols(definition,[spl0_18])],[avatar_definition]) ).
fof(f1350,plain,
( ~ rdn_translate(n3,rdn_pos(rdnn(n3)))
| spl0_18 ),
inference(avatar_component_clause,[],[f1348]) ).
fof(f1351,plain,
( ~ spl0_17
| ~ spl0_18 ),
inference(avatar_split_clause,[],[f1273,f1348,f1344]) ).
fof(f1372,plain,
( $false
| spl0_17 ),
inference(resolution,[],[f1346,f456]) ).
fof(f1373,plain,
spl0_17,
inference(avatar_contradiction_clause,[],[f1372]) ).
fof(f1374,plain,
( $false
| spl0_18 ),
inference(resolution,[],[f1350,f457]) ).
fof(f1375,plain,
spl0_18,
inference(avatar_contradiction_clause,[],[f1374]) ).
cnf(s9,plain,
( ~ spl0_17
| ~ spl0_18 ),
inference(sat_conversion,[],[f1351]) ).
cnf(s13,plain,
spl0_17,
inference(sat_conversion,[],[f1373]) ).
cnf(s14,plain,
spl0_18,
inference(sat_conversion,[],[f1375]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s9,s14,s13]) ).
fof(f1376,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM290+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n026.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 19:31:27 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 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.38/0.48 % (3160789)Will run a generic schedule for satisfiability detection.
% 0.38/0.48 % (3160795)% WARNING: option uhcvi not known.
% 0.38/0.48 % (3160795)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=91986814:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.38/0.48 % (3160794)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1604415904_2999 on theBenchmark for (2999ds/0Mi)
% 0.38/0.48 % (3160796)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2763256031:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.38/0.48 % (3160797)dis+10_1_sil=32000:sp=arity:random_seed=1959224586:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.38/0.48 % (3160799)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1252682349:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.38/0.48 % (3160800)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2091401570:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.38/0.48 % (3160798)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2736262764:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.38/0.48 % (3160800) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3160789-3160800"...
% 0.38/0.48 % (3160800)...printing done.
% 0.38/0.48 % (3160800)Refutation found. Thanks to Tanya!
% 0.38/0.48 % SZS status Theorem for theBenchmark
% 0.38/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.38/0.48 % (3160800)------------------------------
% 0.38/0.48 % (3160800)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.48 % (3160800)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.48 % (3160800)CaDiCaL version: 2.1.3
% 0.38/0.48 % (3160800)Termination reason: Refutation
% 0.38/0.48 % (3160800)Time elapsed: 0.023 s
% 0.38/0.48 % (3160800)Peak memory usage: 13 MB
% 0.38/0.48 % (3160800)Instructions burned: 43 (million)
% 0.38/0.48 % (3160789)Success in time 0.069 s
% 0.38/0.48 % Vampire exiting
%------------------------------------------------------------------------------