%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV008-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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.09s 0.15s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of formulae : 60 ( 19 unt; 6 def)
% Number of atoms : 121 ( 12 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 112 ( 51 ~; 55 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X2,X0,X1] :
( ~ less_than(X2,X1)
| ~ less_than(X0,X2)
| less_than(X0,X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWV001-0.ax',all_related) ).
fof(f9,axiom,
! [X0] : ~ less_than(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',x_not_less_than_x) ).
fof(f15,negated_conjecture,
~ less_than(n,l),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
fof(f16,negated_conjecture,
less_than(one,l),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
fof(f17,negated_conjecture,
less_than(a(l),a(predecessor(l))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
fof(f18,negated_conjecture,
! [X0] :
( less_than(X0,n)
| less_than(n,X0)
| ~ less_than(one,n)
| ~ less_than(a(X0),a(predecessor(n))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
fof(f19,negated_conjecture,
! [X0] :
( ~ less_than(a(X0),a(predecessor(X0)))
| ~ less_than(X0,n)
| ~ less_than(one,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
fof(f23,definition,
( spl0_1
<=> less_than(one,n) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f25,plain,
( ~ less_than(one,n)
| spl0_1 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f27,definition,
( spl0_2
<=> ! [X0] :
( less_than(X0,n)
| ~ less_than(a(X0),a(predecessor(n)))
| less_than(n,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f28,plain,
( ! [X0] :
( ~ less_than(a(X0),a(predecessor(n)))
| less_than(X0,n)
| less_than(n,X0) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f29,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f18,f27,f23]) ).
fof(f30,plain,
( ~ less_than(l,n)
| ~ less_than(one,l) ),
inference(resolution,[],[f19,f17]) ).
fof(f31,plain,
~ less_than(l,n),
inference(forward_subsumption_resolution,[],[f30,f16]) ).
fof(f48,plain,
! [X0] :
( ~ less_than(X0,one)
| less_than(X0,l) ),
inference(resolution,[],[f7,f16]) ).
fof(f49,plain,
! [X0] :
( ~ less_than(X0,a(l))
| less_than(X0,a(predecessor(l))) ),
inference(resolution,[],[f7,f17]) ).
fof(f55,plain,
( less_than(n,one)
| n = one
| spl0_1 ),
inference(resolution,[],[f8,f25]) ).
fof(f61,plain,
( less_than(n,l)
| n = l ),
inference(resolution,[],[f8,f31]) ).
fof(f67,definition,
( spl0_3
<=> n = one ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f69,plain,
( n = one
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f71,definition,
( spl0_4
<=> less_than(n,one) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f73,plain,
( less_than(n,one)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f75,plain,
n = l,
inference(forward_subsumption_resolution,[],[f61,f15]) ).
fof(f76,plain,
( spl0_3
| spl0_4
| spl0_1 ),
inference(avatar_split_clause,[],[f55,f23,f71,f67]) ).
fof(f81,plain,
( less_than(n,l)
| ~ spl0_3 ),
inference(superposition,[],[f16,f69]) ).
fof(f82,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f81,f15]) ).
fof(f83,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f82]) ).
fof(f84,plain,
( less_than(n,l)
| ~ spl0_4 ),
inference(resolution,[],[f73,f48]) ).
fof(f87,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f84,f15]) ).
fof(f88,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f87]) ).
fof(f92,plain,
( ! [X0] :
( less_than(a(predecessor(n)),a(X0))
| less_than(n,X0)
| less_than(X0,n)
| a(X0) = a(predecessor(n)) )
| ~ spl0_2 ),
inference(resolution,[],[f28,f8]) ).
fof(f96,plain,
less_than(a(n),a(predecessor(n))),
inference(superposition,[],[f17,f75]) ).
fof(f103,plain,
! [X0] :
( ~ less_than(X0,a(n))
| less_than(X0,a(predecessor(l))) ),
inference(forward_demodulation,[],[f49,f75]) ).
fof(f104,plain,
! [X0] :
( less_than(X0,a(predecessor(n)))
| ~ less_than(X0,a(n)) ),
inference(forward_demodulation,[],[f103,f75]) ).
fof(f106,plain,
~ less_than(a(predecessor(n)),a(n)),
inference(resolution,[],[f104,f9]) ).
fof(f144,plain,
( less_than(n,n)
| less_than(n,n)
| a(predecessor(n)) = a(n)
| ~ spl0_2 ),
inference(resolution,[],[f106,f92]) ).
fof(f147,plain,
( less_than(n,n)
| a(predecessor(n)) = a(n)
| ~ spl0_2 ),
inference(duplicate_literal_removal,[],[f144]) ).
fof(f149,definition,
( spl0_9
<=> a(predecessor(n)) = a(n) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f151,plain,
( a(predecessor(n)) = a(n)
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f149]) ).
fof(f153,definition,
( spl0_10
<=> less_than(a(n),a(predecessor(n))) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f155,plain,
( less_than(a(n),a(predecessor(n)))
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f153]) ).
fof(f158,plain,
( a(predecessor(n)) = a(n)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f147,f9]) ).
fof(f159,plain,
( spl0_9
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f158,f27,f149]) ).
fof(f165,plain,
spl0_10,
inference(avatar_split_clause,[],[f96,f153]) ).
fof(f181,plain,
( less_than(a(n),a(n))
| ~ spl0_9
| ~ spl0_10 ),
inference(forward_demodulation,[],[f155,f151]) ).
fof(f182,plain,
( $false
| ~ spl0_9
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f181,f9]) ).
fof(f183,plain,
( ~ spl0_9
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[],[f182]) ).
cnf(s1,plain,
( ~ spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f29]) ).
cnf(s3,plain,
( spl0_1
| spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f76]) ).
cnf(s4,plain,
~ spl0_3,
inference(sat_conversion,[],[f83]) ).
cnf(s5,plain,
~ spl0_4,
inference(sat_conversion,[],[f88]) ).
cnf(s10,plain,
( ~ spl0_2
| spl0_9 ),
inference(sat_conversion,[],[f159]) ).
cnf(s11,plain,
spl0_10,
inference(sat_conversion,[],[f165]) ).
cnf(s12,plain,
( ~ spl0_9
| ~ spl0_10 ),
inference(sat_conversion,[],[f183]) ).
cnf(s13,plain,
~ spl0_9,
inference(rat,[],[s12,s11]) ).
cnf(s14,plain,
~ spl0_2,
inference(rat,[],[s10,s13]) ).
cnf(s15,plain,
spl0_1,
inference(rat,[],[s3,s5,s4]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s1,s14,s15]) ).
fof(f184,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV008-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Mon Sep 28 09:42:10 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.13 Running first-order model finding
% 0.09/0.13 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.09/0.15 % (3268184)Will run a generic schedule for satisfiability detection.
% 0.09/0.15 % (3268190)% WARNING: option uhcvi not known.
% 0.09/0.15 % (3268189)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2476004426_3000 on theBenchmark for (3000ds/0Mi)
% 0.09/0.15 % (3268190)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3973007065:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.09/0.15 % (3268192)dis+10_1_sil=32000:sp=arity:random_seed=3969898345:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.09/0.15 % (3268194)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2532571709:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.09/0.15 % (3268191)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=458732818:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.09/0.15 % (3268195)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1331046843:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.09/0.15 % (3268193)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1586832531:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.09/0.15 % TRYING [1]
% 0.09/0.15 % TRYING [2]
% 0.09/0.15 % TRYING [3]
% 0.09/0.15 % TRYING [4]
% 0.09/0.15 % TRYING [5]
% 0.09/0.15 % (3268192) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3268184-3268192"...
% 0.09/0.15 % TRYING [6]
% 0.09/0.15 % (3268192)...printing done.
% 0.09/0.15 % (3268194) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3268184-3268194"...
% 0.09/0.15 % (3268192)Refutation found. Thanks to Tanya!
% 0.09/0.15 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.15 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.15 % (3268192)------------------------------
% 0.09/0.15 % (3268192)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.15 % (3268192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.15 % (3268192)CaDiCaL version: 2.1.3
% 0.09/0.15 % (3268192)Termination reason: Refutation
% 0.09/0.15 % (3268192)Time elapsed: 0.003 s
% 0.09/0.15 % (3268192)Peak memory usage: 12 MB
% 0.09/0.15 % (3268192)Instructions burned: 6 (million)
% 0.09/0.15 % (3268184)Success in time 0.016 s
% 0.09/0.15 % Vampire exiting
%------------------------------------------------------------------------------