%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM298+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 : 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:18:16 PM UTC 2026
% Result : Theorem 0.17s 0.52s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 14 unt; 0 def)
% Number of atoms : 50 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 49 ( 24 ~; 17 |; 6 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 33 ( 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn2) ).
fof(f130,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn2) ).
fof(f282,axiom,
! [X0,X1,X2,X3] :
( ( rdn_translate(X0,rdn_neg(X2))
& rdn_translate(X1,rdn_pos(X3)) )
=> less(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_pos) ).
fof(f284,axiom,
! [X0,X1] :
( less(X0,X1)
<=> ( ~ less(X1,X0)
& X1 != X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_property) ).
fof(f402,conjecture,
~ less(n2,nn2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n2_not_less_nn2) ).
fof(f403,negated_conjecture,
~ ~ less(n2,nn2),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f404,plain,
less(n2,nn2),
inference(flattening,[],[f403]) ).
fof(f416,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_translate(X0,rdn_neg(X2))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
inference(ennf_transformation,[],[f282]) ).
fof(f417,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_translate(X0,rdn_neg(X2))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
inference(flattening,[],[f416]) ).
fof(f451,plain,
! [X0,X1] :
( ( less(X0,X1)
| less(X1,X0)
| X0 = X1 )
& ( ( ~ less(X1,X0)
& X1 != X0 )
| ~ less(X0,X1) ) ),
inference(nnf_transformation,[],[f284]) ).
fof(f452,plain,
! [X0,X1] :
( ( less(X0,X1)
| less(X1,X0)
| X0 = X1 )
& ( ( ~ less(X1,X0)
& X1 != X0 )
| ~ less(X0,X1) ) ),
inference(flattening,[],[f451]) ).
fof(f456,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f3]) ).
fof(f583,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f130]) ).
fof(f735,plain,
! [X2,X3,X0,X1] :
( less(X0,X1)
| ~ rdn_translate(X0,rdn_neg(X2))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
inference(cnf_transformation,[],[f417]) ).
fof(f738,plain,
! [X0,X1] :
( ~ less(X1,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f452]) ).
fof(f858,plain,
less(n2,nn2),
inference(cnf_transformation,[],[f404]) ).
fof(f862,plain,
~ rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(consistent_polarity_flipping,[],[f456]) ).
fof(f989,plain,
~ rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(consistent_polarity_flipping,[],[f583]) ).
fof(f1141,plain,
! [X2,X3,X0,X1] :
( rdn_translate(X1,rdn_pos(X3))
| rdn_translate(X0,rdn_neg(X2))
| ~ less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f735]) ).
fof(f1144,plain,
! [X0,X1] :
( less(X1,X0)
| less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f738]) ).
fof(f1264,plain,
~ less(n2,nn2),
inference(consistent_polarity_flipping,[],[f858]) ).
fof(f1265,plain,
less(nn2,n2),
inference(resolution,[],[f1144,f1264]) ).
fof(f1274,plain,
! [X0,X1] :
( ~ less(X0,n2)
| rdn_translate(X0,rdn_neg(X1)) ),
inference(resolution,[],[f1141,f862]) ).
fof(f1406,plain,
! [X0] : rdn_translate(nn2,rdn_neg(X0)),
inference(resolution,[],[f1274,f1265]) ).
fof(f1407,plain,
$false,
inference(resolution,[],[f1406,f989]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM298+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 % Computer : n015.cluster.edu
% 0.11/0.41 % Model : x86_64 x86_64
% 0.11/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.41 % Memory : 8046.5625MB
% 0.11/0.41 % OS : Linux 6.8.0-71-generic
% 0.11/0.41 % CPULimit : 300
% 0.11/0.41 % WCLimit : 300
% 0.11/0.41 % DateTime : Sun Sep 27 19:32:31 UTC 2026
% 0.11/0.41 % CPUTime :
% 0.11/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.44 Running first-order model finding
% 0.11/0.44 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.17/0.52 % (1964249)Will run a generic schedule for satisfiability detection.
% 0.17/0.52 % (1964255)% WARNING: option uhcvi not known.
% 0.17/0.52 % (1964255)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3861608838:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.52 % (1964254)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=236587255_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.52 % (1964258)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2043434450:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.52 % (1964256)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2838022571:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.52 % (1964257)dis+10_1_sil=32000:sp=arity:random_seed=4064866635:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.52 % (1964259)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2227234586:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.52 % (1964260)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=286860295:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.52 % (1964260) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1964249-1964260"...
% 0.17/0.52 % (1964260)...printing done.
% 0.17/0.52 % (1964260)Refutation found. Thanks to Tanya!
% 0.17/0.52 % SZS status Theorem for theBenchmark
% 0.17/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.52 % (1964260)------------------------------
% 0.17/0.52 % (1964260)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.52 % (1964260)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.52 % (1964260)CaDiCaL version: 2.1.3
% 0.17/0.52 % (1964260)Termination reason: Refutation
% 0.17/0.52 % (1964260)Time elapsed: 0.019 s
% 0.17/0.52 % (1964260)Peak memory usage: 13 MB
% 0.17/0.52 % (1964260)Instructions burned: 38 (million)
% 0.17/0.52 % (1964249)Success in time 0.067 s
% 0.17/0.52 % Vampire exiting
%------------------------------------------------------------------------------