%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL066-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 : 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 11:57:33 AM UTC 2026
% Result : Unsatisfiable 0.43s 0.51s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 13 unt; 2 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 31 ~; 25 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 50 !; 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,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_3) ).
fof(f6,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f2]) ).
fof(f7,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f4,f1]) ).
fof(f10,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(f13,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,[],[f10,f1]) ).
fof(f26,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),not(X1)),X1))
| is_a_theorem(implies(implies(not(X0),not(X1)),X0)) ),
inference(resolution,[],[f13,f4]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f13,f6]) ).
fof(f38,definition,
( spl0_3
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f39,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f45,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f30,f2]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X2),not(X1))))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f30,f4]) ).
fof(f56,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),implies(not(implies(not(X0),X1)),X1)))
| is_a_theorem(implies(implies(not(X0),not(implies(not(X0),X1))),X0)) ),
inference(resolution,[],[f26,f10]) ).
fof(f58,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),not(X1)),X0))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f26,f6]) ).
fof(f75,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(not(X2),not(X0))))
| is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f58,f30]) ).
fof(f131,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[],[f46,f2]) ).
fof(f134,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X0,not(X1))) ),
inference(resolution,[],[f46,f45]) ).
fof(f230,plain,
! [X0] : is_a_theorem(implies(implies(not(X0),not(implies(not(X0),not(X0)))),X0)),
inference(resolution,[],[f56,f2]) ).
fof(f278,plain,
~ is_a_theorem(implies(a,not(not(a)))),
inference(resolution,[],[f134,f5]) ).
fof(f539,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(X0)),X0))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f75,f131]) ).
fof(f559,definition,
( spl0_14
<=> ! [X0] : is_a_theorem(implies(not(not(X0)),X0)) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f560,plain,
( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f559]) ).
fof(f561,plain,
( spl0_3
| spl0_14 ),
inference(avatar_split_clause,[],[f539,f559,f38]) ).
fof(f568,plain,
( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
| ~ spl0_14 ),
inference(resolution,[],[f560,f7]) ).
fof(f623,plain,
( $false
| ~ spl0_14 ),
inference(resolution,[],[f568,f278]) ).
fof(f624,plain,
~ spl0_14,
inference(avatar_contradiction_clause,[],[f623]) ).
fof(f627,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f39,f230]) ).
fof(f669,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f627]) ).
cnf(s18,plain,
( spl0_3
| spl0_14 ),
inference(sat_conversion,[],[f561]) ).
cnf(s21,plain,
~ spl0_14,
inference(sat_conversion,[],[f624]) ).
cnf(s34,plain,
~ spl0_3,
inference(sat_conversion,[],[f669]) ).
cnf(s37,plain,
$false,
inference(rat,[],[s18,s21,s34]) ).
fof(f671,plain,
$false,
inference(avatar_sat_refutation,[],[s37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL066-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40 % Computer : n004.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Sun Sep 27 15:20:22 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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.43/0.51 % (3652907)Will run a generic schedule for satisfiability detection.
% 0.43/0.51 % (3652914)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3075192327:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.43/0.51 % (3652913)% WARNING: option uhcvi not known.
% 0.43/0.51 % (3652912)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1956407470_2999 on theBenchmark for (2999ds/0Mi)
% 0.43/0.51 % (3652913)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2590243919:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.43/0.51 % (3652915)dis+10_1_sil=32000:sp=arity:random_seed=2983677643:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.43/0.51 % (3652916)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4171183411:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.43/0.51 % (3652918)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1947821787:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.43/0.51 % (3652917)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=590770452:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.43/0.51 % TRYING [1]
% 0.43/0.51 % TRYING [2]
% 0.43/0.51 % TRYING [3]
% 0.43/0.51 % TRYING [4]
% 0.43/0.51 % (3652917) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3652907-3652917"...
% 0.43/0.51 % (3652915) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3652907-3652915"...
% 0.43/0.51 % (3652915)...printing done.
% 0.43/0.51 % (3652917)...printing done.
% 0.43/0.51 % (3652915)Refutation found. Thanks to Tanya!
% 0.43/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.43/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.43/0.51 % (3652915)------------------------------
% 0.43/0.51 % (3652915)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.43/0.51 % (3652915)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.43/0.51 % (3652915)CaDiCaL version: 2.1.3
% 0.43/0.51 % (3652915)Termination reason: Refutation
% 0.43/0.51 % (3652915)Time elapsed: 0.014 s
% 0.43/0.51 % (3652915)Peak memory usage: 11 MB
% 0.43/0.51 % (3652915)Instructions burned: 19 (million)
% 0.43/0.51 % (3652907)Success in time 0.062 s
% 0.43/0.51 % Vampire exiting
%------------------------------------------------------------------------------