%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL112-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:41 AM UTC 2026
% Result : Unsatisfiable 0.59s 0.58s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 14 unt; 2 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 47 ( 25 ~; 20 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 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 : 42 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_1) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_2) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_3) ).
fof(f5,axiom,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_5) ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_29) ).
fof(f7,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f2]) ).
fof(f8,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f5,f1]) ).
fof(f11,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f3,f1]) ).
fof(f12,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X1))
| is_a_theorem(implies(implies(X1,X0),X0)) ),
inference(resolution,[],[f4,f1]) ).
fof(f14,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f11,f1]) ).
fof(f26,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f12,f7]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),not(X2))))
| is_a_theorem(implies(X0,implies(X2,X1))) ),
inference(resolution,[],[f14,f5]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f14,f26]) ).
fof(f87,definition,
( spl0_5
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f88,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f87]) ).
fof(f93,plain,
( $false
| ~ spl0_5 ),
inference(resolution,[],[f88,f2]) ).
fof(f107,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f93]) ).
fof(f108,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[],[f30,f2]) ).
fof(f131,plain,
! [X0,X1] : is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
inference(resolution,[],[f108,f30]) ).
fof(f179,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(X0)),X0))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f131,f36]) ).
fof(f187,definition,
( spl0_7
<=> ! [X0] : is_a_theorem(implies(not(not(X0)),X0)) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f188,plain,
( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f187]) ).
fof(f189,plain,
( spl0_5
| spl0_7 ),
inference(avatar_split_clause,[],[f179,f187,f87]) ).
fof(f199,plain,
( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
| ~ spl0_7 ),
inference(resolution,[],[f188,f8]) ).
fof(f214,plain,
( $false
| ~ spl0_7 ),
inference(resolution,[],[f199,f6]) ).
fof(f215,plain,
~ spl0_7,
inference(avatar_contradiction_clause,[],[f214]) ).
cnf(s7,plain,
~ spl0_5,
inference(sat_conversion,[],[f107]) ).
cnf(s8,plain,
( spl0_5
| spl0_7 ),
inference(sat_conversion,[],[f189]) ).
cnf(s9,plain,
~ spl0_7,
inference(sat_conversion,[],[f215]) ).
cnf(s10,plain,
spl0_5,
inference(rat,[],[s8,s9]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s7,s10]) ).
fof(f216,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL112-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.20/0.46 % Computer : n002.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Sun Sep 27 15:25:06 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.52 Running first-order model finding
% 0.24/0.52 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.59/0.58 % (3666742)Will run a generic schedule for satisfiability detection.
% 0.59/0.58 % (3666749)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1010603994:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.59/0.58 % (3666748)% WARNING: option uhcvi not known.
% 0.59/0.58 % (3666753)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2766650789:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.59/0.58 % (3666751)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1895057227:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.59/0.58 % (3666747)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3786224157_3000 on theBenchmark for (3000ds/0Mi)
% 0.59/0.58 % (3666748)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3739812379:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.59/0.58 % (3666750)dis+10_1_sil=32000:sp=arity:random_seed=2195857385:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.59/0.58 % (3666752)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2849642176:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.59/0.58 % TRYING [1]
% 0.59/0.58 % TRYING [2]
% 0.59/0.58 % TRYING [3]
% 0.59/0.58 % (3666750) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3666742-3666750"...
% 0.59/0.58 % (3666750)...printing done.
% 0.59/0.58 % TRYING [4]
% 0.59/0.58 % (3666750)Refutation found. Thanks to Tanya!
% 0.59/0.58 % SZS status Unsatisfiable for theBenchmark
% 0.59/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.59/0.58 % (3666750)------------------------------
% 0.59/0.58 % (3666750)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.58 % (3666750)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.58 % (3666750)CaDiCaL version: 2.1.3
% 0.59/0.58 % (3666750)Termination reason: Refutation
% 0.59/0.58 % (3666750)Time elapsed: 0.008 s
% 0.59/0.58 % (3666750)Peak memory usage: 11 MB
% 0.59/0.58 % (3666750)Instructions burned: 6 (million)
% 0.59/0.58 % (3666742)Success in time 0.048 s
% 0.59/0.58 % Vampire exiting
%------------------------------------------------------------------------------