%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM295+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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.50s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 14 unt; 2 def)
% Number of atoms : 66 ( 8 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 66 ( 33 ~; 23 |; 6 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 51 ( 0 sgn 47 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
rdn_translate(n0,rdn_pos(rdnn(n0))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdn0) ).
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/sandbox2/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/sandbox2/benchmark/Axioms/NUM005+1.ax',less_property) ).
fof(f402,conjecture,
? [X0,X1] : less(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',something_less_something) ).
fof(f403,negated_conjecture,
~ ? [X0,X1] : less(X0,X1),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f415,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(f416,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_translate(X0,rdn_neg(X2))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
inference(flattening,[],[f415]) ).
fof(f450,plain,
! [X0,X1] : ~ less(X0,X1),
inference(ennf_transformation,[],[f403]) ).
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(f454,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(cnf_transformation,[],[f1]) ).
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,[],[f416]) ).
fof(f739,plain,
! [X0,X1] :
( less(X0,X1)
| less(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f452]) ).
fof(f858,plain,
! [X0,X1] : ~ less(X0,X1),
inference(cnf_transformation,[],[f450]) ).
fof(f860,plain,
! [X0,X1] :
( less(X1,X0)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f739,f858]) ).
fof(f862,plain,
! [X2,X3,X0,X1] :
( ~ rdn_translate(X0,rdn_neg(X2))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
inference(forward_subsumption_resolution,[],[f735,f858]) ).
fof(f864,plain,
! [X0,X1] : X0 = X1,
inference(forward_subsumption_resolution,[],[f860,f858]) ).
fof(f866,definition,
( spl0_1
<=> ! [X1,X3] : ~ rdn_translate(X1,rdn_pos(X3)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f867,plain,
( ! [X3,X1] : ~ rdn_translate(X1,rdn_pos(X3))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f866]) ).
fof(f869,definition,
( spl0_2
<=> ! [X2,X0] : ~ rdn_translate(X0,rdn_neg(X2)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f870,plain,
( ! [X2,X0] : ~ rdn_translate(X0,rdn_neg(X2))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f869]) ).
fof(f871,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f862,f869,f866]) ).
fof(f873,plain,
( ! [X0,X1] : ~ rdn_translate(X1,X0)
| ~ spl0_2 ),
inference(superposition,[],[f870,f864]) ).
fof(f911,plain,
! [X0] : rdn_translate(X0,rdn_pos(rdnn(X0))),
inference(superposition,[],[f454,f864]) ).
fof(f928,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f911,f873]) ).
fof(f929,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f928]) ).
fof(f932,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f911,f867]) ).
fof(f933,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f932]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f871]) ).
cnf(s8,plain,
~ spl0_2,
inference(sat_conversion,[],[f929]) ).
cnf(s10,plain,
~ spl0_1,
inference(sat_conversion,[],[f933]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s1,s8,s10]) ).
fof(f934,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM295+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 % Computer : n013.cluster.edu
% 0.11/0.40 % Model : x86_64 x86_64
% 0.11/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40 % Memory : 8046.5625MB
% 0.11/0.40 % 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:28:37 UTC 2026
% 0.11/0.41 % CPUTime :
% 0.11/0.41 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.44 Running first-order model finding
% 0.11/0.44 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.17/0.50 % (505104)Will run a generic schedule for satisfiability detection.
% 0.17/0.50 % (505114)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1138803258:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.50 % (505110)% WARNING: option uhcvi not known.
% 0.17/0.50 % (505114) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-505104-505114"...
% 0.17/0.50 % (505114)...printing done.
% 0.17/0.50 % (505114)Refutation found. Thanks to Tanya!
% 0.17/0.50 % SZS status Theorem for theBenchmark
% 0.17/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.50 % (505114)------------------------------
% 0.17/0.50 % (505114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.50 % (505114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.50 % (505114)CaDiCaL version: 2.1.3
% 0.17/0.50 % (505114)Termination reason: Refutation
% 0.17/0.50 % (505114)Time elapsed: 0.005 s
% 0.17/0.50 % (505114)Peak memory usage: 12 MB
% 0.17/0.50 % (505114)Instructions burned: 14 (million)
% 0.17/0.50 % (505104)Success in time 0.047 s
% 0.17/0.50 % Vampire exiting
%------------------------------------------------------------------------------