%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COL091-1 : TPTP v9.3.1. Released v2.7.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 09:38:26 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.16s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 42 ( 12 unt; 3 def)
% Number of atoms : 81 ( 13 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 77 ( 38 ~; 36 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 34 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : combK != comb_app(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_app) ).
fof(f15,axiom,
! [X2,X0,X1] :
( ~ member(pair(comb_app(X0,X1),X2),contract)
| ap_contractE_c1(X0,X1,X2)
| ap_contractE_c2(X0,X1,X2)
| ap_contractE_c3(X0,X1,X2)
| ap_contractE_c4(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE1) ).
fof(f18,axiom,
! [X2,X0,X1] :
( ~ ap_contractE_c1(X0,X1,X2)
| X0 = comb_app(combK,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE4) ).
fof(f19,plain,
! [X2,X0,X1] :
( ~ ap_contractE_c1(X0,X1,X2)
| comb_app(combK,X2) = X0 ),
inference(reorient_equations,[],[f18]) ).
fof(f25,axiom,
! [X2,X0,X1] :
( ~ ap_contractE_c2(X0,X1,X2)
| X0 = comb_app(comb_app(combS,ap_contractE_sk1p(X0,X1,X2)),ap_contractE_sk1q(X0,X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE9) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ ap_contractE_c2(X0,X1,X2)
| comb_app(comb_app(combS,ap_contractE_sk1p(X0,X1,X2)),ap_contractE_sk1q(X0,X1,X2)) = X0 ),
inference(reorient_equations,[],[f25]) ).
fof(f27,axiom,
! [X2,X0,X1] :
( member(pair(X0,ap_contractE_sk2q(X0,X1,X2)),contract)
| ~ ap_contractE_c3(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE10) ).
fof(f31,axiom,
! [X2,X0,X1] :
( member(pair(X1,ap_contractE_sk3q(X0,X1,X2)),contract)
| ~ ap_contractE_c4(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE13) ).
fof(f33,axiom,
! [X2,X0,X1] :
( ~ ap_contractE_c4(X0,X1,X2)
| X2 = comb_app(X0,ap_contractE_sk3q(X0,X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_contractE15) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ ap_contractE_c4(X0,X1,X2)
| comb_app(X0,ap_contractE_sk3q(X0,X1,X2)) = X2 ),
inference(reorient_equations,[],[f33]) ).
fof(f35,axiom,
! [X0] : ~ member(pair(combK,X0),contract),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_contractE) ).
fof(f37,axiom,
member(pair(comb_app(combK,p),r),contract),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k1_contractD_h1) ).
fof(f38,negated_conjecture,
! [X0] :
( r != comb_app(combK,X0)
| ~ member(pair(p,X0),contract) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k1_contractD_c1) ).
fof(f39,plain,
! [X0] :
( comb_app(combK,X0) != r
| ~ member(pair(p,X0),contract) ),
inference(reorient_equations,[],[f38]) ).
fof(f46,plain,
! [X0,X1] : ~ ap_contractE_c3(combK,X0,X1),
inference(resolution,[],[f27,f35]) ).
fof(f50,plain,
( ap_contractE_c1(combK,p,r)
| ap_contractE_c2(combK,p,r)
| ap_contractE_c3(combK,p,r)
| ap_contractE_c4(combK,p,r) ),
inference(resolution,[],[f15,f37]) ).
fof(f54,plain,
( ap_contractE_c1(combK,p,r)
| ap_contractE_c2(combK,p,r)
| ap_contractE_c4(combK,p,r) ),
inference(forward_subsumption_resolution,[],[f50,f46]) ).
fof(f56,definition,
( spl0_1
<=> ap_contractE_c4(combK,p,r) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f58,plain,
( ap_contractE_c4(combK,p,r)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f60,definition,
( spl0_2
<=> ap_contractE_c2(combK,p,r) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f62,plain,
( ap_contractE_c2(combK,p,r)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f64,definition,
( spl0_3
<=> ap_contractE_c1(combK,p,r) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f66,plain,
( ap_contractE_c1(combK,p,r)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f67,plain,
( spl0_1
| spl0_2
| spl0_3 ),
inference(avatar_split_clause,[],[f54,f64,f60,f56]) ).
fof(f70,plain,
( combK = comb_app(comb_app(combS,ap_contractE_sk1p(combK,p,r)),ap_contractE_sk1q(combK,p,r))
| ~ spl0_2 ),
inference(resolution,[],[f62,f26]) ).
fof(f72,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f70,f2]) ).
fof(f73,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f72]) ).
fof(f74,plain,
( combK = comb_app(combK,r)
| ~ spl0_3 ),
inference(resolution,[],[f66,f19]) ).
fof(f77,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f74,f2]) ).
fof(f78,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f77]) ).
fof(f79,plain,
( r = comb_app(combK,ap_contractE_sk3q(combK,p,r))
| ~ spl0_1 ),
inference(resolution,[],[f58,f34]) ).
fof(f89,plain,
( r != r
| ~ member(pair(p,ap_contractE_sk3q(combK,p,r)),contract)
| ~ spl0_1 ),
inference(superposition,[],[f39,f79]) ).
fof(f102,plain,
( ~ member(pair(p,ap_contractE_sk3q(combK,p,r)),contract)
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f89]) ).
fof(f139,plain,
( ~ ap_contractE_c4(combK,p,r)
| ~ spl0_1 ),
inference(resolution,[],[f102,f31]) ).
fof(f140,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f139,f58]) ).
fof(f141,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f140]) ).
cnf(s1,plain,
( spl0_1
| spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f67]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f73]) ).
cnf(s3,plain,
~ spl0_3,
inference(sat_conversion,[],[f78]) ).
cnf(s10,plain,
~ spl0_1,
inference(sat_conversion,[],[f141]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s1,s3,s2,s10]) ).
fof(f142,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : COL091-1 : TPTP v9.3.1. Released v2.7.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 21:35:04 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.13 Running first-order model finding
% 0.08/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.08/0.16 % (3807449)Will run a generic schedule for satisfiability detection.
% 0.08/0.16 % (3807455)% WARNING: option uhcvi not known.
% 0.08/0.16 % (3807458)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2741869612:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.16 % (3807454)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1382080579_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.16 % (3807457)dis+10_1_sil=32000:sp=arity:random_seed=804857669:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.16 % (3807456)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1446182172:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.16 % (3807455)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=730782805:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.16 % (3807459)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2222572034:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.16 % (3807460)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3627542337:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.16 % TRYING [1]
% 0.08/0.16 % TRYING [2]
% 0.08/0.16 % (3807457) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3807449-3807457"...
% 0.08/0.16 % TRYING [3]
% 0.08/0.16 % (3807455) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3807449-3807455"...
% 0.08/0.16 % (3807457)...printing done.
% 0.08/0.16 % (3807459) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3807449-3807459"...
% 0.08/0.16 % (3807457)Refutation found. Thanks to Tanya!
% 0.08/0.16 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.16 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.16 % (3807457)------------------------------
% 0.08/0.16 % (3807457)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.16 % (3807457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.16 % (3807457)CaDiCaL version: 2.1.3
% 0.08/0.16 % (3807457)Termination reason: Refutation
% 0.08/0.16 % (3807457)Time elapsed: 0.002 s
% 0.08/0.16 % (3807457)Peak memory usage: 12 MB
% 0.08/0.16 % (3807457)Instructions burned: 5 (million)
% 0.08/0.16 % (3807449)Success in time 0.029 s
% 0.08/0.16 % Vampire exiting
%------------------------------------------------------------------------------