%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV007-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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 01:19:57 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 27 ( 11 unt; 2 def)
% Number of atoms : 47 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 17 ~; 18 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 11 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] : less_than(X0,successor(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',less_than_successor) ).
fof(f7,axiom,
! [X2,X0,X1] :
( ~ less_than(X2,X1)
| ~ less_than(X0,X2)
| less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',transitivity_of_less_than) ).
fof(f8,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',all_related) ).
fof(f10,axiom,
! [X0,X1] :
( ~ less_than(X1,X0)
| ~ less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',anti_symmetry_of_less_than) ).
fof(f18,negated_conjecture,
~ less_than(n,m),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f19,negated_conjecture,
less_than(i,m),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
fof(f22,negated_conjecture,
less_than(a(m),a(k)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
fof(f25,negated_conjecture,
! [X0] :
( ~ less_than(a(X0),a(k))
| ~ less_than(X0,successor(n))
| less_than(X0,i) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
fof(f28,plain,
( ~ less_than(m,successor(n))
| less_than(m,i) ),
inference(resolution,[],[f25,f22]) ).
fof(f30,definition,
( spl0_1
<=> less_than(m,i) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f34,definition,
( spl0_2
<=> less_than(m,successor(n)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f36,plain,
( ~ less_than(m,successor(n))
| spl0_2 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f37,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f28,f34,f30]) ).
fof(f45,plain,
~ less_than(m,i),
inference(resolution,[],[f10,f19]) ).
fof(f47,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f45,f30]) ).
fof(f54,plain,
! [X0,X1] :
( less_than(X0,successor(X1))
| ~ less_than(X0,X1) ),
inference(resolution,[],[f7,f6]) ).
fof(f162,plain,
( ~ less_than(m,n)
| spl0_2 ),
inference(resolution,[],[f54,f36]) ).
fof(f165,plain,
( less_than(n,m)
| n = m
| spl0_2 ),
inference(resolution,[],[f162,f8]) ).
fof(f166,plain,
( n = m
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f165,f18]) ).
fof(f177,plain,
( ~ less_than(n,successor(n))
| spl0_2 ),
inference(superposition,[],[f36,f166]) ).
fof(f185,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f177,f6]) ).
fof(f186,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f185]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f37]) ).
cnf(s2,plain,
~ spl0_1,
inference(sat_conversion,[],[f47]) ).
cnf(s8,plain,
spl0_2,
inference(sat_conversion,[],[f186]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s8,s2]) ).
fof(f187,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV007-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20 % Computer : n017.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Mon Sep 28 09:37:36 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23 Running first-order model finding
% 0.10/0.23 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.20/0.29 % (3437466)Will run a generic schedule for satisfiability detection.
% 0.20/0.29 % (3437471)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3188966118_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29 % TRYING [1]
% 0.20/0.29 % TRYING [2]
% 0.20/0.29 % TRYING [3]
% 0.20/0.29 % TRYING [4]
% 0.20/0.29 % TRYING [5]
% 0.20/0.29 % TRYING [6]
% 0.20/0.29 % (3437472)% WARNING: option uhcvi not known.
% 0.20/0.29 % TRYING [7]
% 0.20/0.29 % (3437477)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3987072589:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29 % (3437472)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2324532938:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29 % (3437473)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4119399654:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29 % (3437474)dis+10_1_sil=32000:sp=arity:random_seed=3224505:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29 % (3437475)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2606674787:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29 % (3437476)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2688695169:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29 % TRYING [8]
% 0.20/0.29 % (3437474) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3437466-3437474"...
% 0.20/0.29 % (3437474)...printing done.
% 0.20/0.29 % (3437472) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3437466-3437472"...
% 0.20/0.29 % (3437474)Refutation found. Thanks to Tanya!
% 0.20/0.29 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.29 % (3437474)------------------------------
% 0.20/0.29 % (3437474)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (3437474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (3437474)CaDiCaL version: 2.1.3
% 0.20/0.29 % (3437474)Termination reason: Refutation
% 0.20/0.29 % (3437474)Time elapsed: 0.005 s
% 0.20/0.29 % (3437474)Peak memory usage: 12 MB
% 0.20/0.29 % (3437474)Instructions burned: 5 (million)
% 0.20/0.29 % (3437466)Success in time 0.046 s
% 0.20/0.29 % Vampire exiting
%------------------------------------------------------------------------------