%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL076-3 : 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 : n010.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:34 AM UTC 2026
% Result : Unsatisfiable 0.23s 0.49s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 13 unt; 1 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 13 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 33 !; 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',cn_18) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_35) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_49) ).
fof(f5,axiom,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_40) ).
fof(f32,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f4,f1]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),not(X2))))
| is_a_theorem(implies(X0,implies(X2,X1))) ),
inference(resolution,[],[f5,f4]) ).
fof(f76,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f3,f1]) ).
fof(f80,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[],[f40,f2]) ).
fof(f92,plain,
! [X0,X1] : is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
inference(resolution,[],[f80,f40]) ).
fof(f131,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f76,f1]) ).
fof(f304,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(not(X0)),X1))
| is_a_theorem(implies(not(not(X0)),X0)) ),
inference(resolution,[],[f131,f92]) ).
fof(f858,definition,
( spl0_27
<=> ! [X0] : is_a_theorem(implies(not(not(X0)),X0)) ),
introduced(definition,[new_symbols(definition,[spl0_27])],[avatar_definition]) ).
fof(f859,plain,
( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
| ~ spl0_27 ),
inference(avatar_component_clause,[],[f858]) ).
fof(f861,plain,
! [X0] : is_a_theorem(implies(not(not(X0)),X0)),
inference(resolution,[],[f304,f92]) ).
fof(f935,plain,
( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
| ~ spl0_27 ),
inference(resolution,[],[f859,f32]) ).
fof(f963,plain,
( $false
| ~ spl0_27 ),
inference(resolution,[],[f935,f6]) ).
fof(f964,plain,
~ spl0_27,
inference(avatar_contradiction_clause,[],[f963]) ).
fof(f966,plain,
spl0_27,
inference(avatar_split_clause,[],[f861,f858]) ).
cnf(s612,plain,
~ spl0_27,
inference(sat_conversion,[],[f964]) ).
cnf(s632,plain,
spl0_27,
inference(sat_conversion,[],[f966]) ).
cnf(s633,plain,
$false,
inference(rat,[],[s612,s632]) ).
fof(f967,plain,
$false,
inference(avatar_sat_refutation,[],[s633]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL076-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.42 % Computer : n010.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Sun Sep 27 15:21:02 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.46 Running first-order model finding
% 0.16/0.46 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.23/0.49 % (1082858)Will run a generic schedule for satisfiability detection.
% 0.23/0.49 % (1082865)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3139821464:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.23/0.49 % (1082864)% WARNING: option uhcvi not known.
% 0.23/0.49 % (1082864)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=310228983:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.23/0.49 % (1082863)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3955719077_3000 on theBenchmark for (3000ds/0Mi)
% 0.23/0.49 % (1082866)dis+10_1_sil=32000:sp=arity:random_seed=2596989186:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.23/0.49 % (1082867)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3205462710:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.23/0.49 % (1082868)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3259113599:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.23/0.49 % (1082869)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3740183615:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.23/0.49 % (1082865) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1082858-1082865"...
% 0.23/0.49 % TRYING [1]
% 0.23/0.49 % TRYING [2]
% 0.23/0.49 % (1082865)...printing done.
% 0.23/0.49 % TRYING [3]
% 0.23/0.49 % (1082865)Refutation found. Thanks to Tanya!
% 0.23/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.23/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.49 % (1082865)------------------------------
% 0.23/0.49 % (1082865)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.49 % (1082865)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.49 % (1082865)CaDiCaL version: 2.1.3
% 0.23/0.49 % (1082865)Termination reason: Refutation
% 0.23/0.49 % (1082865)Time elapsed: 0.009 s
% 0.23/0.49 % (1082865)Peak memory usage: 12 MB
% 0.23/0.49 % (1082865)Instructions burned: 23 (million)
% 0.23/0.49 % (1082858)Success in time 0.023 s
% 0.23/0.49 % Vampire exiting
%------------------------------------------------------------------------------