%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL071-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 : 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 11:57:33 AM UTC 2026
% Result : Unsatisfiable 2.05s 0.87s
% Output : Refutation 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 7
% Syntax : Number of formulae : 69 ( 17 unt; 2 def)
% Number of atoms : 160 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 187 ( 96 ~; 89 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 146 ( 0 sgn 146 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_19) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X0),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_37) ).
fof(f4,axiom,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),X2)),implies(X0,implies(implies(X3,X2),implies(implies(X1,X3),X2))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_60) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_2) ).
fof(f6,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f2,f1]) ).
fof(f7,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(resolution,[],[f6,f2]) ).
fof(f8,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X0)))),
inference(resolution,[],[f7,f6]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(not(X0),X2)) ),
inference(resolution,[],[f3,f1]) ).
fof(f23,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),implies(X1,X2))),
inference(resolution,[],[f22,f2]) ).
fof(f29,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),implies(not(X0),X2))),
inference(resolution,[],[f22,f3]) ).
fof(f37,definition,
( spl0_1
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f38,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f43,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f38,f2]) ).
fof(f56,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f43]) ).
fof(f125,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(not(X0),X1),implies(X2,implies(implies(X3,X1),implies(implies(X0,X3),X1))))),
inference(resolution,[],[f4,f6]) ).
fof(f126,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(implies(X3,X2),implies(implies(X1,X3),X2))))
| ~ is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(resolution,[],[f4,f1]) ).
fof(f153,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X2,implies(implies(X3,X1),implies(implies(X0,X3),X1))))
| ~ is_a_theorem(implies(not(X0),X1)) ),
inference(resolution,[],[f125,f1]) ).
fof(f191,definition,
( spl0_9
<=> ! [X0,X1,X3] :
( ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(implies(implies(X3,X1),implies(implies(X0,X3),X1))) ) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f192,plain,
( ! [X3,X0,X1] :
( is_a_theorem(implies(implies(X3,X1),implies(implies(X0,X3),X1)))
| ~ is_a_theorem(implies(not(X0),X1)) )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f191]) ).
fof(f196,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X2),X1))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(not(X0),X1)) )
| ~ spl0_9 ),
inference(resolution,[],[f192,f1]) ).
fof(f436,plain,
( ~ is_a_theorem(implies(a,a))
| ~ is_a_theorem(implies(not(not(a)),a))
| ~ spl0_9 ),
inference(resolution,[],[f196,f5]) ).
fof(f437,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(X2),X1))
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(X1) )
| ~ spl0_9 ),
inference(resolution,[],[f196,f1]) ).
fof(f441,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X3,X1),X0))
| ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) )
| ~ spl0_9 ),
inference(resolution,[],[f437,f23]) ).
fof(f470,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) )
| ~ spl0_9 ),
inference(resolution,[],[f441,f2]) ).
fof(f489,plain,
( ! [X0] : is_a_theorem(implies(X0,X0))
| ~ spl0_9 ),
inference(resolution,[],[f470,f2]) ).
fof(f511,plain,
( ! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1)))
| ~ spl0_9 ),
inference(resolution,[],[f489,f22]) ).
fof(f517,plain,
( ~ is_a_theorem(implies(not(not(a)),a))
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f436,f489]) ).
fof(f519,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(implies(X1,X2)) )
| ~ spl0_9 ),
inference(resolution,[],[f511,f437]) ).
fof(f567,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl0_9 ),
inference(resolution,[],[f519,f8]) ).
fof(f579,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) )
| ~ spl0_9 ),
inference(resolution,[],[f519,f489]) ).
fof(f599,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X2,X1)) )
| ~ spl0_9 ),
inference(resolution,[],[f567,f519]) ).
fof(f600,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X2,X1)) )
| ~ spl0_9 ),
inference(resolution,[],[f567,f1]) ).
fof(f625,plain,
( ! [X0] :
( is_a_theorem(implies(implies(X0,X0),X0))
| ~ is_a_theorem(implies(not(X0),X0)) )
| ~ spl0_9 ),
inference(resolution,[],[f579,f192]) ).
fof(f672,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| ~ is_a_theorem(implies(X0,X0))
| is_a_theorem(implies(X1,X0)) )
| ~ spl0_9 ),
inference(resolution,[],[f625,f600]) ).
fof(f673,plain,
( ! [X0] :
( ~ is_a_theorem(implies(not(X0),X0))
| ~ is_a_theorem(implies(X0,X0))
| is_a_theorem(X0) )
| ~ spl0_9 ),
inference(resolution,[],[f625,f1]) ).
fof(f681,plain,
( ! [X0] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(X0) )
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f673,f489]) ).
fof(f682,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(implies(X1,X0)) )
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f672,f489]) ).
fof(f689,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(not(implies(X0,X1)),X1))
| is_a_theorem(implies(X0,X1)) )
| ~ spl0_9 ),
inference(resolution,[],[f681,f567]) ).
fof(f693,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X1)))
| ~ spl0_9 ),
inference(resolution,[],[f682,f23]) ).
fof(f713,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X0),implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) )
| ~ spl0_9 ),
inference(resolution,[],[f693,f441]) ).
fof(f724,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ spl0_9 ),
inference(resolution,[],[f689,f29]) ).
fof(f1019,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(X0,X1),implies(not(X2),X3)))
| is_a_theorem(implies(not(X0),implies(implies(X4,X3),implies(implies(X2,X4),X3)))) ),
inference(resolution,[],[f126,f22]) ).
fof(f1777,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X0),X1))
| is_a_theorem(implies(X2,X1)) )
| ~ spl0_9 ),
inference(resolution,[],[f599,f693]) ).
fof(f1828,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1))))
| ~ spl0_9 ),
inference(resolution,[],[f1777,f2]) ).
fof(f2457,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),implies(implies(X2,X3),implies(implies(X0,X2),X3)))),
inference(resolution,[],[f1019,f3]) ).
fof(f3783,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(implies(X0,X1),X0),X1)))
| ~ spl0_9 ),
inference(resolution,[],[f2457,f681]) ).
fof(f3784,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(implies(X0,X1),X2))))
| ~ spl0_9 ),
inference(resolution,[],[f2457,f689]) ).
fof(f4120,plain,
( ! [X0,X1] :
( is_a_theorem(implies(implies(implies(X0,X1),X0),X1))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl0_9 ),
inference(resolution,[],[f3783,f1]) ).
fof(f4366,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(implies(X2,X2),X0),X1)))
| ~ spl0_9 ),
inference(resolution,[],[f3784,f713]) ).
fof(f4385,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) )
| ~ spl0_9 ),
inference(resolution,[],[f4120,f1]) ).
fof(f4819,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X1),X2),X2)))
| ~ spl0_9 ),
inference(resolution,[],[f4366,f1777]) ).
fof(f5215,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,X0)),X2))
| is_a_theorem(X2) )
| ~ spl0_9 ),
inference(resolution,[],[f4385,f1828]) ).
fof(f5243,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(implies(implies(X0,X0),X1),X1),X2))
| is_a_theorem(X2) )
| ~ spl0_9 ),
inference(resolution,[],[f4385,f4819]) ).
fof(f8433,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X2)
| is_a_theorem(implies(implies(X3,X1),implies(implies(X0,X3),X1))) ),
inference(resolution,[],[f153,f1]) ).
fof(f8464,plain,
( spl0_1
| spl0_9 ),
inference(avatar_split_clause,[],[f8433,f191,f37]) ).
fof(f9774,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X0),implies(implies(X1,X1),X2)),X2))
| ~ spl0_9 ),
inference(resolution,[],[f5243,f4366]) ).
fof(f13741,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X0),implies(implies(X1,X1),X2)))
| is_a_theorem(X2) )
| ~ spl0_9 ),
inference(resolution,[],[f9774,f1]) ).
fof(f17956,plain,
( ! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(implies(not(X0),X1)) )
| ~ spl0_9 ),
inference(resolution,[],[f13741,f153]) ).
fof(f18418,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),implies(X1,X0)))
| is_a_theorem(implies(X1,X0)) )
| ~ spl0_9 ),
inference(resolution,[],[f17956,f5215]) ).
fof(f19401,plain,
( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
| ~ spl0_9 ),
inference(resolution,[],[f18418,f724]) ).
fof(f19470,plain,
( $false
| ~ spl0_9 ),
inference(resolution,[],[f19401,f517]) ).
fof(f19471,plain,
~ spl0_9,
inference(avatar_contradiction_clause,[],[f19470]) ).
cnf(s8,plain,
~ spl0_1,
inference(sat_conversion,[],[f56]) ).
cnf(s293,plain,
( spl0_1
| spl0_9 ),
inference(sat_conversion,[],[f8464]) ).
cnf(s562,plain,
~ spl0_9,
inference(sat_conversion,[],[f19471]) ).
cnf(s567,plain,
spl0_1,
inference(rat,[],[s293,s562]) ).
cnf(s569,plain,
$false,
inference(rat,[],[s8,s567]) ).
fof(f19472,plain,
$false,
inference(avatar_sat_refutation,[],[s569]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL071-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n026.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 15:23:26 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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
% 2.05/0.87 % (2984738)Will run a generic schedule for satisfiability detection.
% 2.05/0.87 % (2984746)dis+10_1_sil=32000:sp=arity:random_seed=2356959758:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.05/0.87 % (2984744)% WARNING: option uhcvi not known.
% 2.05/0.87 % (2984743)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3250071845_2999 on theBenchmark for (2999ds/0Mi)
% 2.05/0.87 % (2984744)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=852271194:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.05/0.87 % (2984745)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2621239088:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.05/0.87 % (2984747)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4099703226:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.05/0.87 % (2984748)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=265855138:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.05/0.87 % (2984749)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2582394315:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.05/0.87 % TRYING [1]
% 2.05/0.87 % TRYING [2]
% 2.05/0.87 % TRYING [3]
% 2.05/0.87 % TRYING [4]
% 2.05/0.87 % (2984746)Instruction limit reached!
% 2.05/0.87 % (2984746)------------------------------
% 2.05/0.87 % (2984746)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.87 % (2984746)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.87 % (2984746)CaDiCaL version: 2.1.3
% 2.05/0.87 % (2984746)Termination reason: Instruction limit
% 2.05/0.87 % (2984746)Termination phase: Saturation
% 2.05/0.87 % (2984746)Time elapsed: 0.037 s
% 2.05/0.87 % (2984746)Peak memory usage: 12 MB
% 2.05/0.87 % (2984746)Instructions burned: 105 (million)
% 2.05/0.87 % (2984757)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2536855374:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.05/0.87 % TRYING [1]
% 2.05/0.87 % TRYING [2]
% 2.05/0.87 % TRYING [3]
% 2.05/0.87 % TRYING [4]
% 2.05/0.87 % TRYING [5]
% 2.05/0.87 % TRYING [5]
% 2.05/0.87 % (2984747)Instruction limit reached!
% 2.05/0.87 % (2984747)------------------------------
% 2.05/0.87 % (2984747)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.87 % (2984747)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.87 % (2984747)CaDiCaL version: 2.1.3
% 2.05/0.87 % (2984747)Termination reason: Instruction limit
% 2.05/0.87 % (2984747)Termination phase: Saturation
% 2.05/0.87 % (2984747)Time elapsed: 0.069 s
% 2.05/0.87 % (2984747)Peak memory usage: 11 MB
% 2.05/0.87 % (2984747)Instructions burned: 117 (million)
% 2.05/0.87 % (2984749)Instruction limit reached!
% 2.05/0.87 % (2984749)------------------------------
% 2.05/0.87 % (2984749)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.87 % (2984749)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.87 % (2984749)CaDiCaL version: 2.1.3
% 2.05/0.87 % (2984749)Termination reason: Instruction limit
% 2.05/0.87 % (2984749)Termination phase: Saturation
% 2.05/0.87 % (2984749)Time elapsed: 0.080 s
% 2.05/0.87 % (2984749)Peak memory usage: 12 MB
% 2.05/0.87 % (2984749)Instructions burned: 159 (million)
% 2.05/0.87 % (2984748)Instruction limit reached!
% 2.05/0.87 % (2984748)------------------------------
% 2.05/0.87 % (2984748)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.87 % (2984748)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.87 % (2984748)CaDiCaL version: 2.1.3
% 2.05/0.87 % (2984748)Termination reason: Instruction limit
% 2.05/0.87 % (2984748)Termination phase: Saturation
% 2.05/0.87 % (2984748)Time elapsed: 0.082 s
% 2.05/0.87 % (2984748)Peak memory usage: 13 MB
% 2.05/0.87 % (2984748)Instructions burned: 132 (million)
% 2.05/0.87 % (2984759)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1068405972:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.05/0.87 % (2984760)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1527917338:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.05/0.87 % (2984761)ott-21_1_sil=16000:fs=off:random_seed=3291196469:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.05/0.87 % (2984759)Instruction limit reached!
% 2.05/0.87 % (2984759)------------------------------
% 2.05/0.87 % (2984759)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.87 % (2984759)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.87 % (2984759)CaDiCaL version: 2.1.3
% 2.05/0.87 % (2984759)Termination reason: Instruction limit
% 2.05/0.87 % (2984759)Termination phase: Saturation
% 2.05/0.87 % (2984759)Time elapsed: 0.082 s
% 2.05/0.87 % (2984759)Peak memory usage: 12 MB
% 2.05/0.87 % (2984759)Instructions burned: 133 (million)
% 2.05/0.87 % (2984765)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3362405697:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.05/0.87 % (2984761)Instruction limit reached!
% 2.05/0.87 % (2984761)------------------------------
% 2.05/0.87 % (2984761)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.87 % (2984761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.87 % (2984761)CaDiCaL version: 2.1.3
% 2.05/0.87 % (2984761)Termination reason: Instruction limit
% 2.05/0.87 % (2984761)Termination phase: Saturation
% 2.05/0.87 % (2984761)Time elapsed: 0.098 s
% 2.05/0.87 % (2984761)Peak memory usage: 12 MB
% 2.05/0.87 % (2984761)Instructions burned: 180 (million)
% 2.05/0.87 % TRYING [6]
% 2.05/0.87 % (2984767)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1002460539:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.05/0.87 % TRYING [1]
% 2.05/0.87 % TRYING [2]
% 2.05/0.87 % TRYING [3]
% 2.05/0.87 % TRYING [4]
% 2.05/0.87 % (2984757)Instruction limit reached!
% 2.05/0.87 % (2984757)------------------------------
% 2.05/0.87 % (2984757)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.87 % (2984757)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.87 % (2984757)CaDiCaL version: 2.1.3
% 2.05/0.87 % (2984757)Termination reason: Instruction limit
% 2.05/0.87 % (2984757)Termination phase: Finite model building SAT solving
% 2.05/0.87 % (2984757)Time elapsed: 0.215 s
% 2.05/0.87 % (2984757)Peak memory usage: 18 MB
% 2.05/0.87 % (2984757)Instructions burned: 714 (million)
% 2.05/0.87 % TRYING [5]
% 2.05/0.87 % (2984769)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2667179484:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.05/0.87 % TRYING [6]
% 2.05/0.87 % (2984760) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2984738-2984760"...
% 2.05/0.87 % (2984760)...printing done.
% 2.05/0.87 % (2984760)Refutation found. Thanks to Tanya!
% 2.05/0.87 % SZS status Unsatisfiable for theBenchmark
% 2.05/0.87 % SZS output start Proof for theBenchmark
% See solution above
% 2.05/0.87 % (2984760)------------------------------
% 2.05/0.87 % (2984760)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.87 % (2984760)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.87 % (2984760)CaDiCaL version: 2.1.3
% 2.05/0.87 % (2984760)Termination reason: Refutation
% 2.05/0.87 % (2984760)Time elapsed: 0.316 s
% 2.05/0.87 % (2984760)Peak memory usage: 17 MB
% 2.05/0.87 % (2984760)Instructions burned: 518 (million)
% 2.05/0.87 % (2984738)Success in time 0.459 s
% 2.05/0.87 % Vampire exiting
%------------------------------------------------------------------------------