%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL416-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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:58:36 AM UTC 2026
% Result : Unsatisfiable 0.74s 0.60s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 10 unt; 4 def)
% Number of atoms : 126 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 154 ( 76 ~; 74 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn 76 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xcb) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(a,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_reflexivity) ).
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(equivalent(X0,X1),equivalent(X2,X1)),X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f2,f1]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1)))
| ~ is_a_theorem(X0)
| is_a_theorem(X2) ),
inference(resolution,[],[f19,f1]) ).
fof(f38,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X1,X2)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f23,f2]) ).
fof(f43,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[],[f38,f1]) ).
fof(f57,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X2,X1),X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f43,f19]) ).
fof(f72,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),X0))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f57,f2]) ).
fof(f190,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X2),equivalent(X3,X2)),X3),X1))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f72,f43]) ).
fof(f386,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(X2,X0),X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X3),equivalent(X4,X3)),X4)) ),
inference(resolution,[],[f190,f57]) ).
fof(f390,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(X2,X0),X2)) ),
inference(forward_subsumption_resolution,[],[f386,f19]) ).
fof(f395,definition,
( spl0_23
<=> ! [X2,X0] :
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(equivalent(X2,X0),X2)) ) ),
introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).
fof(f396,plain,
( ! [X2,X0] :
( is_a_theorem(equivalent(equivalent(X2,X0),X2))
| ~ is_a_theorem(X0) )
| ~ spl0_23 ),
inference(avatar_component_clause,[],[f395]) ).
fof(f397,plain,
( spl0_2
| spl0_23 ),
inference(avatar_split_clause,[],[f390,f395,f8]) ).
fof(f400,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) )
| ~ spl0_23 ),
inference(resolution,[],[f396,f23]) ).
fof(f413,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),X2))
| is_a_theorem(X0) )
| ~ spl0_23 ),
inference(resolution,[],[f400,f2]) ).
fof(f417,plain,
( ! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X2,X0),X1))
| ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X2) )
| ~ spl0_23 ),
inference(resolution,[],[f400,f38]) ).
fof(f759,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X0)))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X2)
| is_a_theorem(X1) )
| ~ spl0_23 ),
inference(resolution,[],[f417,f23]) ).
fof(f766,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X0))
| ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(X2) )
| ~ spl0_23 ),
inference(resolution,[],[f417,f413]) ).
fof(f784,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X0)))
| ~ is_a_theorem(X2)
| is_a_theorem(X1) )
| ~ spl0_23 ),
inference(duplicate_literal_removal,[],[f759]) ).
fof(f791,definition,
( spl0_31
<=> ! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X0)))
| is_a_theorem(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_31])],[avatar_definition]) ).
fof(f792,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X0)))
| is_a_theorem(X1) )
| ~ spl0_31 ),
inference(avatar_component_clause,[],[f791]) ).
fof(f793,plain,
( spl0_2
| spl0_31
| ~ spl0_23 ),
inference(avatar_split_clause,[],[f784,f395,f791,f8]) ).
fof(f805,plain,
( ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1)))
| ~ spl0_31 ),
inference(resolution,[],[f792,f2]) ).
fof(f964,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),X2)))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) )
| ~ spl0_23 ),
inference(resolution,[],[f766,f19]) ).
fof(f1108,plain,
( ! [X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X1),X1))
| ~ is_a_theorem(X0) )
| ~ spl0_23
| ~ spl0_31 ),
inference(resolution,[],[f964,f805]) ).
fof(f1152,plain,
( ! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,X1)) )
| ~ spl0_23
| ~ spl0_31 ),
inference(resolution,[],[f1108,f43]) ).
fof(f1171,plain,
( ! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,X1)) )
| ~ spl0_23
| ~ spl0_31 ),
inference(duplicate_literal_removal,[],[f1152]) ).
fof(f1216,definition,
( spl0_37
<=> ! [X1] : is_a_theorem(equivalent(X1,X1)) ),
introduced(definition,[new_symbols(definition,[spl0_37])],[avatar_definition]) ).
fof(f1217,plain,
( ! [X1] : is_a_theorem(equivalent(X1,X1))
| ~ spl0_37 ),
inference(avatar_component_clause,[],[f1216]) ).
fof(f1218,plain,
( spl0_37
| spl0_2
| ~ spl0_23
| ~ spl0_31 ),
inference(avatar_split_clause,[],[f1171,f791,f395,f8,f1216]) ).
fof(f1219,plain,
( $false
| ~ spl0_37 ),
inference(resolution,[],[f1217,f3]) ).
fof(f1247,plain,
~ spl0_37,
inference(avatar_contradiction_clause,[],[f1219]) ).
cnf(s11,plain,
~ spl0_2,
inference(sat_conversion,[],[f16]) ).
cnf(s386,plain,
( spl0_2
| spl0_23 ),
inference(sat_conversion,[],[f397]) ).
cnf(s659,plain,
( spl0_2
| ~ spl0_23
| spl0_31 ),
inference(sat_conversion,[],[f793]) ).
cnf(s906,plain,
( spl0_2
| ~ spl0_23
| ~ spl0_31
| spl0_37 ),
inference(sat_conversion,[],[f1218]) ).
cnf(s909,plain,
~ spl0_37,
inference(sat_conversion,[],[f1247]) ).
cnf(s912,plain,
( spl0_2
| ~ spl0_23
| ~ spl0_31 ),
inference(rat,[],[s906,s909]) ).
cnf(s927,plain,
spl0_23,
inference(rat,[],[s386,s11]) ).
cnf(s934,plain,
~ spl0_31,
inference(rat,[],[s912,s11,s927]) ).
cnf(s937,plain,
$false,
inference(rat,[],[s659,s11,s934,s927]) ).
fof(f1248,plain,
$false,
inference(avatar_sat_refutation,[],[s937]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL416-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.17/0.43 % Computer : n015.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sun Sep 27 15:44:16 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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.74/0.60 % (1807142)Will run a generic schedule for satisfiability detection.
% 0.74/0.60 % (1807147)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3561971030_3000 on theBenchmark for (3000ds/0Mi)
% 0.74/0.60 % TRYING [1]
% 0.74/0.60 % TRYING [2]
% 0.74/0.60 % TRYING [3]
% 0.74/0.60 % TRYING [4]
% 0.74/0.60 % (1807153)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=767612331:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.74/0.60 % (1807148)% WARNING: option uhcvi not known.
% 0.74/0.60 % (1807150)dis+10_1_sil=32000:sp=arity:random_seed=563722945:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.74/0.60 % (1807149)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2134761811:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.74/0.60 % TRYING [5]
% 0.74/0.60 % (1807152)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3410617937:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.74/0.60 % (1807148)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=144092174:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.74/0.60 % (1807151)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1361952898:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.74/0.60 % (1807149) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1807142-1807149"...
% 0.74/0.60 % (1807149)...printing done.
% 0.74/0.60 % (1807149)Refutation found. Thanks to Tanya!
% 0.74/0.60 % SZS status Unsatisfiable for theBenchmark
% 0.74/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.74/0.60 % (1807149)------------------------------
% 0.74/0.60 % (1807149)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.74/0.60 % (1807149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.74/0.60 % (1807149)CaDiCaL version: 2.1.3
% 0.74/0.60 % (1807149)Termination reason: Refutation
% 0.74/0.60 % (1807149)Time elapsed: 0.061 s
% 0.74/0.60 % (1807149)Peak memory usage: 12 MB
% 0.74/0.60 % (1807149)Instructions burned: 59 (million)
% 0.74/0.60 % (1807142)Success in time 0.099 s
% 0.74/0.60 % Vampire exiting
%------------------------------------------------------------------------------