%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n004.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:37:55 AM UTC 2026
% Result : Unsatisfiable 3.56s 1.27s
% Output : Refutation 3.56s
% 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(f69,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(f71,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f69,f2]) ).
fof(f72,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f71]) ).
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(f82,plain,
( r != r
| ~ member(pair(p,ap_contractE_sk3q(combK,p,r)),contract)
| ~ spl0_1 ),
inference(superposition,[],[f39,f79]) ).
fof(f95,plain,
( ~ member(pair(p,ap_contractE_sk3q(combK,p,r)),contract)
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f82]) ).
fof(f129,plain,
( ~ ap_contractE_c4(combK,p,r)
| ~ spl0_1 ),
inference(resolution,[],[f95,f31]) ).
fof(f130,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f129,f58]) ).
fof(f131,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f130]) ).
cnf(s1,plain,
( spl0_1
| spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f67]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f72]) ).
cnf(s3,plain,
~ spl0_3,
inference(sat_conversion,[],[f78]) ).
cnf(s9,plain,
~ spl0_1,
inference(sat_conversion,[],[f131]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s1,s3,s2,s9]) ).
fof(f132,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL091-1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n004.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 21:35:22 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.56/1.27 % (813210)Input is clausal, will run a generic CNF schedule.
% 3.56/1.27 % (813221)dis-21_1_sil=8000:lcm=predicate:random_seed=863351953:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.56/1.27 % (813216)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3586644511:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.56/1.27 % (813218)lrs+10_1_sil=8000:sp=occurrence:random_seed=1919354311:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.56/1.27 % (813219)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3907082863:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.56/1.27 % (813215)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=4089269795:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.56/1.27 % (813220)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=505134415:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.56/1.27 % (813217)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3518785028:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.56/1.27 % (813219)Refutation not found, incomplete strategy
% 3.56/1.27 % (813219)------------------------------
% 3.56/1.27 % (813219)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.56/1.27 % (813219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.56/1.27 % (813219)CaDiCaL version: 2.1.3
% 3.56/1.27 % (813219)Termination reason: Refutation not found, incomplete strategy
% 3.56/1.27 % (813219)Time elapsed: 0.002 s
% 3.56/1.27 % (813219)Peak memory usage: 88 MB
% 3.56/1.27 % (813219)Instructions burned: 1 (million)
% 3.56/1.27 % (813221)Instruction limit reached!
% 3.56/1.27 % (813221)------------------------------
% 3.56/1.27 % (813221)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.56/1.27 % (813221)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.56/1.27 % (813221)CaDiCaL version: 2.1.3
% 3.56/1.27 % (813221)Termination reason: Instruction limit
% 3.56/1.27 % (813221)Termination phase: Saturation
% 3.56/1.27 % (813221)Time elapsed: 0.038 s
% 3.56/1.27 % (813221)Peak memory usage: 89 MB
% 3.56/1.27 % (813221)Instructions burned: 117 (million)
% 3.56/1.27 % (813218)First to succeed.
% 3.56/1.27 % (813218)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-813210"
% 3.56/1.27 % (813220)Also succeeded, but the first one will report.
% 3.56/1.27 % (813229)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=3824581171:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.56/1.27 % (813229)Refutation not found, incomplete strategy
% 3.56/1.27 % (813229)------------------------------
% 3.56/1.27 % (813229)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.56/1.27 % (813229)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.56/1.27 % (813229)CaDiCaL version: 2.1.3
% 3.56/1.27 % (813229)Termination reason: Refutation not found, incomplete strategy
% 3.56/1.27 % (813229)Time elapsed: 0.002 s
% 3.56/1.27 % (813229)Peak memory usage: 88 MB
% 3.56/1.27 % (813229)Instructions burned: 5 (million)
% 3.56/1.27 % (813219)------------------------------
% 3.56/1.27 % (813219)------------------------------
% 3.56/1.27 % (813218)Refutation found. Thanks to Tanya!
% 3.56/1.27 % SZS status Unsatisfiable for theBenchmark
% 3.56/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 3.56/1.27 % (813218)------------------------------
% 3.56/1.27 % (813218)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.56/1.27 % (813218)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.56/1.27 % (813218)CaDiCaL version: 2.1.3
% 3.56/1.27 % (813218)Termination reason: Refutation
% 3.56/1.27 % (813218)Time elapsed: 0.005 s
% 3.56/1.27 % (813218)Peak memory usage: 89 MB
% 3.56/1.27 % (813218)Instructions burned: 5 (million)
% 3.56/1.27 % (813218)------------------------------
% 3.56/1.27 % (813218)------------------------------
% 3.56/1.27 % (813210)Success in time 0.415 s
% 3.56/1.27 % Vampire exiting
%------------------------------------------------------------------------------