%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWX224+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:46:47 PM UTC 2026
% Result : Theorem 0.40s 0.38s
% Output : Refutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 17 unt; 1 def)
% Number of atoms : 82 ( 17 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 81 ( 39 ~; 29 |; 7 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 95 ( 0 sgn 93 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f25,axiom,
! [X0,X1] : index(cons(X0,X1),zero) = just(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_025) ).
fof(f26,axiom,
! [X0,X1,X2] : index(cons(X0,X1),suc(X2)) = index(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_026) ).
fof(f27,axiom,
! [X0,X1,X2,X3,X4] :
( tc(X0,app(X2,X3,X4),X1)
<=> ( tc(X0,X2,arr(X4,X1))
& tc(X0,X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_027) ).
fof(f29,axiom,
! [X0,X1,X2,X3] :
( tc(X0,lam(X1),arr(X2,X3))
<=> tc(cons(X2,X0),X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_029) ).
fof(f31,axiom,
! [X0,X1,X2,X3] :
( index(X0,X2) = just(X3)
=> ( tc(X0,var(X2),X1)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_031) ).
fof(f32,conjecture,
? [X0] : tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_032) ).
fof(f33,negated_conjecture,
~ ? [X0] : tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b))),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f36,plain,
! [X0,X1,X2,X3] :
( ( tc(X0,var(X2),X1)
<=> X3 = X1 )
| index(X0,X2) != just(X3) ),
inference(ennf_transformation,[],[f31]) ).
fof(f37,plain,
! [X0] : ~ tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b))),
inference(ennf_transformation,[],[f33]) ).
fof(f38,plain,
! [X0,X1,X2,X3,X4] :
( ( tc(X0,app(X2,X3,X4),X1)
| ~ tc(X0,X2,arr(X4,X1))
| ~ tc(X0,X3,X4) )
& ( ( tc(X0,X2,arr(X4,X1))
& tc(X0,X3,X4) )
| ~ tc(X0,app(X2,X3,X4),X1) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f39,plain,
! [X0,X1,X2,X3,X4] :
( ( tc(X0,app(X2,X3,X4),X1)
| ~ tc(X0,X2,arr(X4,X1))
| ~ tc(X0,X3,X4) )
& ( ( tc(X0,X2,arr(X4,X1))
& tc(X0,X3,X4) )
| ~ tc(X0,app(X2,X3,X4),X1) ) ),
inference(flattening,[],[f38]) ).
fof(f40,plain,
! [X0,X1,X2,X3] :
( ( tc(X0,lam(X1),arr(X2,X3))
| ~ tc(cons(X2,X0),X1,X3) )
& ( tc(cons(X2,X0),X1,X3)
| ~ tc(X0,lam(X1),arr(X2,X3)) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f41,plain,
! [X0,X1,X2,X3] :
( ( ( tc(X0,var(X2),X1)
| X1 != X3 )
& ( X3 = X1
| ~ tc(X0,var(X2),X1) ) )
| index(X0,X2) != just(X3) ),
inference(nnf_transformation,[],[f36]) ).
fof(f66,plain,
! [X0,X1] : just(X0) = index(cons(X0,X1),zero),
inference(cnf_transformation,[],[f25]) ).
fof(f67,plain,
! [X2,X0,X1] : index(cons(X0,X1),suc(X2)) = index(X1,X2),
inference(cnf_transformation,[],[f26]) ).
fof(f70,plain,
! [X2,X3,X0,X1,X4] :
( tc(X0,app(X2,X3,X4),X1)
| ~ tc(X0,X2,arr(X4,X1))
| ~ tc(X0,X3,X4) ),
inference(cnf_transformation,[],[f39]) ).
fof(f73,plain,
! [X2,X3,X0,X1] :
( tc(X0,lam(X1),arr(X2,X3))
| ~ tc(cons(X2,X0),X1,X3) ),
inference(cnf_transformation,[],[f40]) ).
fof(f76,plain,
! [X2,X3,X0,X1] :
( tc(X0,var(X2),X1)
| X1 != X3
| index(X0,X2) != just(X3) ),
inference(cnf_transformation,[],[f41]) ).
fof(f77,plain,
! [X0] : ~ tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b))),
inference(cnf_transformation,[],[f37]) ).
fof(f78,plain,
! [X2,X3,X0] :
( index(X0,X2) != just(X3)
| tc(X0,var(X2),X3) ),
inference(equality_resolution,[],[f76]) ).
fof(f84,plain,
! [X2,X0,X1] :
( just(X0) != just(X2)
| tc(cons(X0,X1),var(zero),X2) ),
inference(superposition,[],[f78,f66]) ).
fof(f85,plain,
! [X2,X3,X0,X1] :
( just(X3) != index(X0,X1)
| tc(cons(X2,X0),var(suc(X1)),X3) ),
inference(superposition,[],[f78,f67]) ).
fof(f86,plain,
! [X0,X1] : tc(cons(X0,X1),var(zero),X0),
inference(equality_resolution,[],[f84]) ).
fof(f87,plain,
! [X0] : ~ tc(cons(arr(a,arr(a,b)),nil),X0,arr(a,b)),
inference(resolution,[],[f73,f77]) ).
fof(f94,plain,
! [X0] : ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,b),
inference(resolution,[],[f87,f73]) ).
fof(f99,plain,
! [X2,X0,X1] :
( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,arr(X1,b))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X2,X1) ),
inference(resolution,[],[f94,f70]) ).
fof(f112,plain,
! [X2,X3,X0,X1] :
( just(X0) != just(X1)
| tc(cons(X3,cons(X0,X2)),var(suc(zero)),X1) ),
inference(superposition,[],[f85,f66]) ).
fof(f133,plain,
! [X2,X0,X1] : tc(cons(X0,cons(X1,X2)),var(suc(zero)),X1),
inference(equality_resolution,[],[f112]) ).
fof(f156,plain,
! [X2,X3,X0,X1,X4] :
( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X2,arr(X3,arr(X1,b)))
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,X1)
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X4,X3) ),
inference(resolution,[],[f99,f70]) ).
fof(f249,plain,
! [X0,X1] :
( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,a)
| ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,a) ),
inference(resolution,[],[f156,f133]) ).
fof(f253,definition,
( spl0_3
<=> ! [X1] : ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,a) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f254,plain,
( ! [X1] : ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,a)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f255,plain,
( spl0_3
| spl0_3 ),
inference(avatar_split_clause,[],[f249,f253,f253]) ).
fof(f256,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f254,f86]) ).
fof(f258,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f256]) ).
cnf(s3,plain,
( spl0_3
| spl0_3 ),
inference(sat_conversion,[],[f255]) ).
cnf(s4,plain,
spl0_3,
inference(rat,[],[s3]) ).
cnf(s5,plain,
~ spl0_3,
inference(sat_conversion,[],[f258]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s4,s5]) ).
fof(f259,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWX224+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.26 % Computer : n026.cluster.edu
% 0.11/0.26 % Model : x86_64 x86_64
% 0.11/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.26 % Memory : 8046.5625MB
% 0.11/0.26 % OS : Linux 6.8.0-71-generic
% 0.11/0.26 % CPULimit : 300
% 0.11/0.26 % WCLimit : 300
% 0.11/0.26 % DateTime : Mon Sep 28 15:15:56 UTC 2026
% 0.11/0.27 % CPUTime :
% 0.11/0.27 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.28/0.32 Running first-order model finding
% 0.28/0.32 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.40/0.38 % (3928927)Will run a generic schedule for satisfiability detection.
% 0.40/0.38 % (3928934)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1197880783:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.40/0.38 % (3928933)% WARNING: option uhcvi not known.
% 0.40/0.38 % (3928935)dis+10_1_sil=32000:sp=arity:random_seed=1126106076:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.40/0.38 % (3928932)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3235249238_2999 on theBenchmark for (2999ds/0Mi)
% 0.40/0.38 % (3928933)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3375511792:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.40/0.38 % (3928936)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1869764146:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.40/0.38 % (3928937)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2265286792:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.40/0.38 % (3928938)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3231993529:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.40/0.38 % Detected minimum model sizes of [3]
% 0.40/0.38 % Detected maximum model sizes of [max]
% 0.40/0.38 % TRYING [3]
% 0.40/0.38 % (3928935) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3928927-3928935"...
% 0.40/0.38 % TRYING [4]
% 0.40/0.38 % (3928935)...printing done.
% 0.40/0.38 % (3928935)Refutation found. Thanks to Tanya!
% 0.40/0.38 % SZS status Theorem for theBenchmark
% 0.40/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.40/0.38 % (3928935)------------------------------
% 0.40/0.38 % (3928935)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.40/0.38 % (3928935)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.40/0.38 % (3928935)CaDiCaL version: 2.1.3
% 0.40/0.38 % (3928935)Termination reason: Refutation
% 0.40/0.38 % (3928935)Time elapsed: 0.021 s
% 0.40/0.38 % (3928935)Peak memory usage: 12 MB
% 0.40/0.38 % (3928935)Instructions burned: 18 (million)
% 0.40/0.38 % (3928927)Success in time 0.054 s
% 0.40/0.38 % Vampire exiting
%------------------------------------------------------------------------------