%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL077-2 : 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 : n007.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:35 AM UTC 2026
% Result : Unsatisfiable 0.67s 0.61s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 15 unt; 2 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 21 ~; 16 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 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 : 39 ( 0 sgn 39 !; 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,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',transitivity) ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_39) ).
fof(f12,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(f15,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(f30,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[],[f12,f2]) ).
fof(f31,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(not(X0)),not(not(X1))),implies(X0,X1))),
inference(resolution,[],[f12,f4]) ).
fof(f36,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X3,implies(X0,X1)))
| ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X3,implies(X0,X2))) ),
inference(resolution,[],[f15,f5]) ).
fof(f40,plain,
! [X0,X1] : is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
inference(resolution,[],[f30,f12]) ).
fof(f117,definition,
( spl0_3
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f118,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f148,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X1,implies(X0,X2))) ),
inference(resolution,[],[f36,f2]) ).
fof(f227,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f118,f31]) ).
fof(f251,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f227]) ).
fof(f454,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(not(X1)),X1))),
inference(resolution,[],[f148,f40]) ).
fof(f497,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(not(not(X1)),X1)) ),
inference(resolution,[],[f454,f1]) ).
fof(f514,definition,
( spl0_22
<=> ! [X1] : is_a_theorem(implies(not(not(X1)),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_22])],[avatar_definition]) ).
fof(f515,plain,
( ! [X1] : is_a_theorem(implies(not(not(X1)),X1))
| ~ spl0_22 ),
inference(avatar_component_clause,[],[f514]) ).
fof(f516,plain,
( spl0_22
| spl0_3 ),
inference(avatar_split_clause,[],[f497,f117,f514]) ).
fof(f541,plain,
( $false
| ~ spl0_22 ),
inference(resolution,[],[f515,f6]) ).
fof(f561,plain,
~ spl0_22,
inference(avatar_contradiction_clause,[],[f541]) ).
cnf(s17,plain,
~ spl0_3,
inference(sat_conversion,[],[f251]) ).
cnf(s41,plain,
( spl0_3
| spl0_22 ),
inference(sat_conversion,[],[f516]) ).
cnf(s43,plain,
~ spl0_22,
inference(sat_conversion,[],[f561]) ).
cnf(s44,plain,
spl0_3,
inference(rat,[],[s41,s43]) ).
cnf(s50,plain,
$false,
inference(rat,[],[s17,s44]) ).
fof(f562,plain,
$false,
inference(avatar_sat_refutation,[],[s50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL077-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.20/0.46 % Computer : n007.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:18:55 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.25/0.52 Running first-order model finding
% 0.25/0.52 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.67/0.61 % (1574254)Will run a generic schedule for satisfiability detection.
% 0.67/0.61 % (1574259)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=106003394_2999 on theBenchmark for (2999ds/0Mi)
% 0.67/0.61 % TRYING [1]
% 0.67/0.61 % TRYING [2]
% 0.67/0.61 % TRYING [3]
% 0.67/0.61 % TRYING [4]
% 0.67/0.61 % (1574260)% WARNING: option uhcvi not known.
% 0.67/0.61 % (1574263)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2545398882:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.67/0.61 % (1574265)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=599145991:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.67/0.61 % (1574261)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1553889535:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.67/0.61 % (1574262)dis+10_1_sil=32000:sp=arity:random_seed=2761298335:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.67/0.61 % (1574264)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=677067789:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.67/0.61 % (1574260)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=417447500:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.67/0.61 % TRYING [5]
% 0.67/0.61 % (1574262) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1574254-1574262"...
% 0.67/0.61 % (1574262)...printing done.
% 0.67/0.61 % (1574262)Refutation found. Thanks to Tanya!
% 0.67/0.61 % SZS status Unsatisfiable for theBenchmark
% 0.67/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 0.67/0.61 % (1574262)------------------------------
% 0.67/0.61 % (1574262)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.67/0.61 % (1574262)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.67/0.61 % (1574262)CaDiCaL version: 2.1.3
% 0.67/0.61 % (1574262)Termination reason: Refutation
% 0.67/0.61 % (1574262)Time elapsed: 0.016 s
% 0.67/0.61 % (1574262)Peak memory usage: 12 MB
% 0.67/0.61 % (1574262)Instructions burned: 14 (million)
% 0.67/0.61 % (1574254)Success in time 0.075 s
% 0.67/0.61 % Vampire exiting
%------------------------------------------------------------------------------