%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM022-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 12:17:50 PM UTC 2026
% Result : Unsatisfiable 0.07s 0.36s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 29 ( 9 unt; 2 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 51 ( 25 ~; 24 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( ~ less(X2,X0)
| ~ less(X0,X1)
| less(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-1.ax',transitivity_of_less) ).
fof(f2,axiom,
! [X2,X0,X1] :
( ~ equalish(add(successor(X0),X1),X2)
| less(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-1.ax',smaller_number) ).
fof(f3,axiom,
! [X0,X1] :
( equalish(add(successor(predecessor_of_1st_minus_2nd(X1,X0)),X0),X1)
| ~ less(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-1.ax',less_lemma) ).
fof(f4,axiom,
! [X0,X1] :
( ~ divides(X0,X1)
| less(X0,X1)
| equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-2.ax',divides_only_less_or_equal) ).
fof(f7,axiom,
! [X2,X0,X1] :
( ~ equalish(X2,X0)
| ~ equalish(X0,X1)
| equalish(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).
fof(f8,axiom,
less(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_less_than_b) ).
fof(f9,axiom,
divides(b,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_divides_d) ).
fof(f10,negated_conjecture,
~ less(a,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_less_than_d) ).
fof(f12,plain,
! [X0] :
( ~ less(b,X0)
| less(a,X0) ),
inference(resolution,[],[f1,f8]) ).
fof(f13,plain,
( less(b,d)
| equalish(b,d) ),
inference(resolution,[],[f4,f9]) ).
fof(f16,definition,
( spl0_1
<=> equalish(b,d) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f18,plain,
( equalish(b,d)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f16]) ).
fof(f20,definition,
( spl0_2
<=> less(b,d) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f22,plain,
( less(b,d)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f20]) ).
fof(f23,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f13,f20,f16]) ).
fof(f24,plain,
( less(a,d)
| ~ spl0_2 ),
inference(resolution,[],[f22,f12]) ).
fof(f27,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f24,f10]) ).
fof(f28,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f27]) ).
fof(f32,plain,
! [X2,X0,X1] :
( equalish(add(successor(predecessor_of_1st_minus_2nd(X1,X0)),X0),X2)
| ~ equalish(X1,X2)
| ~ less(X0,X1) ),
inference(resolution,[],[f3,f7]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ equalish(X0,X1)
| ~ less(X2,X0)
| less(X2,X1) ),
inference(resolution,[],[f32,f2]) ).
fof(f38,plain,
( ! [X0] :
( ~ less(X0,b)
| less(X0,d) )
| ~ spl0_1 ),
inference(resolution,[],[f35,f18]) ).
fof(f42,plain,
( less(a,d)
| ~ spl0_1 ),
inference(resolution,[],[f38,f8]) ).
fof(f43,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f42,f10]) ).
fof(f44,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f43]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f23]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f28]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f44]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f45,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM022-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.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Sun Sep 27 18:39:49 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.33 Running first-order model finding
% 0.07/0.33 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.07/0.36 % (2659249)Will run a generic schedule for satisfiability detection.
% 0.07/0.36 % (2659255)% WARNING: option uhcvi not known.
% 0.07/0.36 % (2659256)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3768864693:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.36 % (2659254)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1803531254_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.36 % (2659255)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2817734359:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.36 % (2659257)dis+10_1_sil=32000:sp=arity:random_seed=1629402426:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.36 % (2659258)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1768236369:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.36 % (2659259)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1743753860:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.36 % (2659260)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1245848694:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.36 % TRYING [1]
% 0.07/0.36 % TRYING [2]
% 0.07/0.36 % (2659257) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2659249-2659257"...
% 0.07/0.36 % TRYING [3]
% 0.07/0.36 % (2659259) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2659249-2659259"...
% 0.07/0.36 % (2659255) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2659249-2659255"...
% 0.07/0.36 % (2659257)...printing done.
% 0.07/0.36 % (2659259)...printing done.
% 0.07/0.36 % TRYING [4]
% 0.07/0.36 % (2659255)...printing done.
% 0.07/0.36 % (2659257)Refutation found. Thanks to Tanya!
% 0.07/0.36 % SZS status Unsatisfiable for theBenchmark
% 0.07/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.36 % (2659257)------------------------------
% 0.07/0.36 % (2659257)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.36 % (2659257)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.36 % (2659257)CaDiCaL version: 2.1.3
% 0.07/0.36 % (2659257)Termination reason: Refutation
% 0.07/0.36 % (2659257)Time elapsed: 0.001 s
% 0.07/0.36 % (2659257)Peak memory usage: 11 MB
% 0.07/0.36 % (2659257)Instructions burned: 1 (million)
% 0.07/0.36 % (2659249)Success in time 0.028 s
% 0.07/0.36 % Vampire exiting
%------------------------------------------------------------------------------