%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL011-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 : n013.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:25 AM UTC 2026
% Result : Unsatisfiable 0.57s 0.57s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 14 unt; 3 def)
% Number of atoms : 82 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 80 ( 43 ~; 34 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 77 ( 0 sgn 77 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X1,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yqj) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(a,c),equivalent(c,b)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_yqf) ).
fof(f8,definition,
( spl0_2
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f9,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f8]) ).
fof(f15,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f2,f9]) ).
fof(f16,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f15]) ).
fof(f19,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f2,f1]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X2,X0))
| ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[],[f19,f1]) ).
fof(f39,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X0)),X3))
| is_a_theorem(equivalent(X3,equivalent(X1,X2))) ),
inference(resolution,[],[f23,f2]) ).
fof(f40,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| is_a_theorem(equivalent(X2,equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X3,X0)) ),
inference(resolution,[],[f23,f19]) ).
fof(f47,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X3,X1),X0)),equivalent(X2,X3))),
inference(resolution,[],[f39,f2]) ).
fof(f48,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),X0)) ),
inference(resolution,[],[f39,f19]) ).
fof(f60,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X0)),equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X3,X1)) ),
inference(resolution,[],[f40,f2]) ).
fof(f68,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X3,X1),X0)))
| is_a_theorem(equivalent(X2,X3)) ),
inference(resolution,[],[f47,f1]) ).
fof(f72,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X3)))
| is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X3,X1))) ),
inference(resolution,[],[f48,f39]) ).
fof(f124,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X2,X1),X2))
| is_a_theorem(equivalent(equivalent(X0,X1),X0)) ),
inference(resolution,[],[f68,f48]) ).
fof(f125,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X1,X2)))
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f68,f19]) ).
fof(f142,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X1)),X0))
| ~ is_a_theorem(equivalent(X2,X2)) ),
inference(resolution,[],[f124,f60]) ).
fof(f160,plain,
! [X0,X1] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X0,X1)))),
inference(resolution,[],[f125,f2]) ).
fof(f177,plain,
! [X0,X1] :
( is_a_theorem(equivalent(X1,equivalent(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f160,f1]) ).
fof(f184,plain,
! [X0,X1] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f177,f1]) ).
fof(f253,definition,
( spl0_26
<=> ! [X2] : ~ is_a_theorem(equivalent(X2,X2)) ),
introduced(definition,[new_symbols(definition,[spl0_26])],[avatar_definition]) ).
fof(f254,plain,
( ! [X2] : ~ is_a_theorem(equivalent(X2,X2))
| ~ spl0_26 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f256,definition,
( spl0_27
<=> ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X1)),X0)) ),
introduced(definition,[new_symbols(definition,[spl0_27])],[avatar_definition]) ).
fof(f257,plain,
( ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X1)),X0))
| ~ spl0_27 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f258,plain,
( spl0_26
| spl0_27 ),
inference(avatar_split_clause,[],[f142,f256,f253]) ).
fof(f263,plain,
( ! [X0] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X0) )
| ~ spl0_26 ),
inference(resolution,[],[f254,f184]) ).
fof(f264,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_26 ),
inference(duplicate_literal_removal,[],[f263]) ).
fof(f265,plain,
( spl0_2
| ~ spl0_26 ),
inference(avatar_split_clause,[],[f264,f253,f8]) ).
fof(f268,plain,
( ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0)))
| ~ spl0_27 ),
inference(resolution,[],[f257,f39]) ).
fof(f276,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(X1,X0)) )
| ~ spl0_27 ),
inference(resolution,[],[f268,f1]) ).
fof(f403,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X1),equivalent(equivalent(X2,X0),X2))),
inference(resolution,[],[f72,f2]) ).
fof(f811,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X1,X2)),equivalent(X0,X2))),
inference(resolution,[],[f403,f72]) ).
fof(f908,plain,
( ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X2,X1))))
| ~ spl0_27 ),
inference(resolution,[],[f811,f276]) ).
fof(f9019,plain,
( $false
| ~ spl0_27 ),
inference(resolution,[],[f908,f3]) ).
fof(f9081,plain,
~ spl0_27,
inference(avatar_contradiction_clause,[],[f9019]) ).
cnf(s11,plain,
~ spl0_2,
inference(sat_conversion,[],[f16]) ).
cnf(s215,plain,
( spl0_26
| spl0_27 ),
inference(sat_conversion,[],[f258]) ).
cnf(s222,plain,
( spl0_2
| ~ spl0_26 ),
inference(sat_conversion,[],[f265]) ).
cnf(s6039,plain,
~ spl0_27,
inference(sat_conversion,[],[f9081]) ).
cnf(s6067,plain,
spl0_26,
inference(rat,[],[s215,s6039]) ).
cnf(s6068,plain,
spl0_2,
inference(rat,[],[s222,s6067]) ).
cnf(s6075,plain,
$false,
inference(rat,[],[s11,s6068]) ).
fof(f9082,plain,
$false,
inference(avatar_sat_refutation,[],[s6075]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL011-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37 % Computer : n013.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 15:16:36 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.57/0.57 % (336356)Will run a generic schedule for satisfiability detection.
% 0.57/0.57 % (336363)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1721943023:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.57/0.57 % (336362)% WARNING: option uhcvi not known.
% 0.57/0.57 % (336361)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=28043761_2999 on theBenchmark for (2999ds/0Mi)
% 0.57/0.57 % (336362)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2705549309:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.57/0.57 % (336364)dis+10_1_sil=32000:sp=arity:random_seed=2530203478:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.57/0.57 % (336365)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2193220056:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.57/0.57 % (336366)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1919935244:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.57/0.57 % (336367)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2167019209:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.57/0.57 % TRYING [1]
% 0.57/0.57 % TRYING [2]
% 0.57/0.57 % TRYING [3]
% 0.57/0.57 % TRYING [4]
% 0.57/0.57 % (336365)Instruction limit reached!
% 0.57/0.57 % (336365)------------------------------
% 0.57/0.57 % (336365)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.57/0.57 % (336365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.57/0.57 % (336365)CaDiCaL version: 2.1.3
% 0.57/0.57 % (336365)Termination reason: Instruction limit
% 0.57/0.57 % (336365)Termination phase: Saturation
% 0.57/0.57 % (336365)Time elapsed: 0.061 s
% 0.57/0.57 % (336365)Peak memory usage: 11 MB
% 0.57/0.57 % (336365)Instructions burned: 116 (million)
% 0.57/0.57 % (336364)Instruction limit reached!
% 0.57/0.57 % (336364)------------------------------
% 0.57/0.57 % (336364)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.57/0.57 % (336364)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.57/0.57 % (336364)CaDiCaL version: 2.1.3
% 0.57/0.57 % (336364)Termination reason: Instruction limit
% 0.57/0.57 % (336364)Termination phase: Saturation
% 0.57/0.57 % (336364)Time elapsed: 0.062 s
% 0.57/0.57 % (336364)Peak memory usage: 11 MB
% 0.57/0.57 % (336364)Instructions burned: 103 (million)
% 0.57/0.57 % (336376)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=777364556:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.57/0.57 % (336375)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3398167163:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.57/0.57 % TRYING [1]
% 0.57/0.57 % TRYING [2]
% 0.57/0.57 % TRYING [3]
% 0.57/0.57 % (336366)Instruction limit reached!
% 0.57/0.57 % (336366)------------------------------
% 0.57/0.57 % (336366)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.57/0.57 % (336366)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.57/0.57 % (336366)CaDiCaL version: 2.1.3
% 0.57/0.57 % (336366)Termination reason: Instruction limit
% 0.57/0.57 % (336366)Termination phase: Saturation
% 0.57/0.57 % (336366)Time elapsed: 0.086 s
% 0.57/0.57 % (336366)Peak memory usage: 12 MB
% 0.57/0.57 % (336366)Instructions burned: 132 (million)
% 0.57/0.57 % TRYING [4]
% 0.57/0.57 % (336367)Instruction limit reached!
% 0.57/0.57 % (336367)------------------------------
% 0.57/0.57 % (336367)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.57/0.57 % (336367)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.57/0.57 % (336367)CaDiCaL version: 2.1.3
% 0.57/0.57 % (336367)Termination reason: Instruction limit
% 0.57/0.57 % (336367)Termination phase: Saturation
% 0.57/0.57 % (336367)Time elapsed: 0.101 s
% 0.57/0.57 % (336367)Peak memory usage: 12 MB
% 0.57/0.57 % (336367)Instructions burned: 160 (million)
% 0.57/0.57 % (336379)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2055990353:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.57/0.57 % (336380)ott-21_1_sil=16000:fs=off:random_seed=3865313701:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.57/0.57 % (336363) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-336356-336363"...
% 0.57/0.57 % (336363)...printing done.
% 0.57/0.57 % (336363)Refutation found. Thanks to Tanya!
% 0.57/0.57 % SZS status Unsatisfiable for theBenchmark
% 0.57/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.57 % (336363)------------------------------
% 0.57/0.57 % (336363)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.57/0.57 % (336363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.57/0.57 % (336363)CaDiCaL version: 2.1.3
% 0.57/0.57 % (336363)Termination reason: Refutation
% 0.57/0.57 % (336363)Time elapsed: 0.138 s
% 0.57/0.57 % (336363)Peak memory usage: 15 MB
% 0.57/0.57 % (336363)Instructions burned: 489 (million)
% 0.57/0.57 % (336356)Success in time 0.167 s
% 0.57/0.57 % Vampire exiting
%------------------------------------------------------------------------------