%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL064-2 : 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 : n006.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:32 AM UTC 2026
% Result : Unsatisfiable 0.52s 0.72s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 13 unt; 4 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 101 ( 50 ~; 47 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 74 !; 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,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_1) ).
fof(f9,definition,
( spl0_2
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f10,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f9]) ).
fof(f14,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f2]) ).
fof(f15,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f10,f2]) ).
fof(f16,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f15]) ).
fof(f36,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(f43,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,[],[f36,f1]) ).
fof(f57,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X0)) ),
inference(resolution,[],[f43,f2]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f43,f14]) ).
fof(f62,definition,
( spl0_7
<=> ! [X0] : is_a_theorem(implies(X0,X0)) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f63,plain,
( ! [X0] : is_a_theorem(implies(X0,X0))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f62]) ).
fof(f64,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f57,f2]) ).
fof(f71,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f58,f2]) ).
fof(f82,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(implies(X2,implies(X3,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f71,f58]) ).
fof(f277,plain,
spl0_7,
inference(avatar_split_clause,[],[f64,f62]) ).
fof(f283,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) )
| ~ spl0_7 ),
inference(resolution,[],[f63,f43]) ).
fof(f287,plain,
( ! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) )
| ~ spl0_7 ),
inference(resolution,[],[f283,f14]) ).
fof(f292,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X0,X2)))
| is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X0) )
| ~ spl0_7 ),
inference(resolution,[],[f287,f58]) ).
fof(f504,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X3,X0),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f82,f2]) ).
fof(f518,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(X2,implies(implies(X3,X0),implies(X3,X1))))),
inference(resolution,[],[f504,f3]) ).
fof(f520,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(X1,implies(X2,X3))))
| ~ is_a_theorem(implies(X2,implies(X0,X3))) ),
inference(resolution,[],[f504,f36]) ).
fof(f888,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1))))
| ~ is_a_theorem(X3) )
| ~ spl0_7 ),
inference(resolution,[],[f518,f292]) ).
fof(f900,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X1,implies(X0,X2)))
| ~ is_a_theorem(X3) )
| ~ spl0_7 ),
inference(resolution,[],[f520,f292]) ).
fof(f1424,definition,
( spl0_31
<=> ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))) ),
introduced(definition,[new_symbols(definition,[spl0_31])],[avatar_definition]) ).
fof(f1425,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1))))
| ~ spl0_31 ),
inference(avatar_component_clause,[],[f1424]) ).
fof(f1426,plain,
( spl0_2
| spl0_31
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f888,f62,f1424,f9]) ).
fof(f1565,definition,
( spl0_33
<=> ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X1,implies(X0,X2))) ) ),
introduced(definition,[new_symbols(definition,[spl0_33])],[avatar_definition]) ).
fof(f1566,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X1,implies(X0,X2))) )
| ~ spl0_33 ),
inference(avatar_component_clause,[],[f1565]) ).
fof(f1567,plain,
( spl0_2
| spl0_33
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f900,f62,f1565,f9]) ).
fof(f1595,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ spl0_31
| ~ spl0_33 ),
inference(resolution,[],[f1566,f1425]) ).
fof(f2767,plain,
( $false
| ~ spl0_31
| ~ spl0_33 ),
inference(resolution,[],[f1595,f4]) ).
fof(f2799,plain,
( ~ spl0_31
| ~ spl0_33 ),
inference(avatar_contradiction_clause,[],[f2767]) ).
cnf(s13,plain,
~ spl0_2,
inference(sat_conversion,[],[f16]) ).
cnf(s215,plain,
spl0_7,
inference(sat_conversion,[],[f277]) ).
cnf(s971,plain,
( spl0_2
| ~ spl0_7
| spl0_31 ),
inference(sat_conversion,[],[f1426]) ).
cnf(s1073,plain,
( spl0_2
| ~ spl0_7
| spl0_33 ),
inference(sat_conversion,[],[f1567]) ).
cnf(s1684,plain,
( ~ spl0_31
| ~ spl0_33 ),
inference(sat_conversion,[],[f2799]) ).
cnf(s1709,plain,
spl0_33,
inference(rat,[],[s1073,s215,s13]) ).
cnf(s1711,plain,
spl0_31,
inference(rat,[],[s971,s215,s13]) ).
cnf(s1719,plain,
$false,
inference(rat,[],[s1684,s1709,s1711]) ).
fof(f2800,plain,
$false,
inference(avatar_sat_refutation,[],[s1719]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL064-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.10 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.20/0.48 % Computer : n006.cluster.edu
% 0.20/0.48 % Model : x86_64 x86_64
% 0.20/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.48 % Memory : 8046.5625MB
% 0.20/0.48 % OS : Linux 6.8.0-71-generic
% 0.20/0.48 % CPULimit : 300
% 0.20/0.48 % WCLimit : 300
% 0.20/0.48 % DateTime : Sun Sep 27 15:19:56 UTC 2026
% 0.20/0.49 % CPUTime :
% 0.20/0.49 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.26/0.54 Running first-order model finding
% 0.26/0.54 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.52/0.72 % (3087375)Will run a generic schedule for satisfiability detection.
% 0.52/0.72 % (3087386)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=81990487:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.52/0.72 % (3087381)% WARNING: option uhcvi not known.
% 0.52/0.72 % (3087381)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2263581424:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.52/0.72 % (3087383)dis+10_1_sil=32000:sp=arity:random_seed=510072497:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.52/0.72 % (3087380)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3219688708_2999 on theBenchmark for (2999ds/0Mi)
% 0.52/0.72 % (3087384)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3658010503:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.52/0.72 % (3087382)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3495438035:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.52/0.72 % (3087385)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=45528131:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.52/0.72 % TRYING [1]
% 0.52/0.72 % TRYING [2]
% 0.52/0.72 % TRYING [3]
% 0.52/0.72 % TRYING [4]
% 0.52/0.72 % (3087386)Instruction limit reached!
% 0.52/0.72 % (3087386)------------------------------
% 0.52/0.72 % (3087386)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.72 % (3087386)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.72 % (3087386)CaDiCaL version: 2.1.3
% 0.52/0.72 % (3087386)Termination reason: Instruction limit
% 0.52/0.72 % (3087386)Termination phase: Saturation
% 0.52/0.72 % (3087386)Time elapsed: 0.081 s
% 0.52/0.72 % (3087386)Peak memory usage: 12 MB
% 0.52/0.72 % (3087386)Instructions burned: 161 (million)
% 0.52/0.72 % (3087383)Instruction limit reached!
% 0.52/0.72 % (3087383)------------------------------
% 0.52/0.72 % (3087383)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.72 % (3087383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.72 % (3087383)CaDiCaL version: 2.1.3
% 0.52/0.72 % (3087383)Termination reason: Instruction limit
% 0.52/0.72 % (3087383)Termination phase: Saturation
% 0.52/0.72 % (3087383)Time elapsed: 0.105 s
% 0.52/0.72 % (3087383)Peak memory usage: 11 MB
% 0.52/0.72 % (3087383)Instructions burned: 103 (million)
% 0.52/0.72 % (3087384)Instruction limit reached!
% 0.52/0.72 % (3087384)------------------------------
% 0.52/0.72 % (3087384)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.72 % (3087384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.72 % (3087384)CaDiCaL version: 2.1.3
% 0.52/0.72 % (3087384)Termination reason: Instruction limit
% 0.52/0.72 % (3087384)Termination phase: Saturation
% 0.52/0.72 % (3087384)Time elapsed: 0.110 s
% 0.52/0.72 % (3087384)Peak memory usage: 11 MB
% 0.52/0.72 % (3087384)Instructions burned: 117 (million)
% 0.52/0.72 % (3087394)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2896330617:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 0.52/0.72 % TRYING [1]
% 0.52/0.72 % TRYING [2]
% 0.52/0.72 % TRYING [3]
% 0.52/0.72 % (3087382) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3087375-3087382"...
% 0.52/0.72 % (3087382)...printing done.
% 0.52/0.72 % (3087382)Refutation found. Thanks to Tanya!
% 0.52/0.72 % SZS status Unsatisfiable for theBenchmark
% 0.52/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.72 % (3087382)------------------------------
% 0.52/0.72 % (3087382)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.72 % (3087382)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.72 % (3087382)CaDiCaL version: 2.1.3
% 0.52/0.72 % (3087382)Termination reason: Refutation
% 0.52/0.72 % (3087382)Time elapsed: 0.120 s
% 0.52/0.72 % (3087382)Peak memory usage: 13 MB
% 0.52/0.72 % (3087382)Instructions burned: 110 (million)
% 0.52/0.72 % (3087375)Success in time 0.17 s
% 0.52/0.72 % Vampire exiting
%------------------------------------------------------------------------------