%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN219-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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 02:07:03 PM UTC 2026
% Result : Unsatisfiable 0.22s 0.28s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 49 ( 16 unt; 6 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 121 ( 61 ~; 54 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 7 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 39 ( 0 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
n0(e,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_11) ).
fof(f14,axiom,
! [X0] : p0(b,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
fof(f17,axiom,
! [X0] : q0(X0,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
fof(f19,axiom,
! [X0,X1] : m0(X0,d,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
fof(f163,axiom,
! [X0] :
( ~ p0(X0,X0)
| s1(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
fof(f164,axiom,
! [X2,X0,X1] :
( s1(X0)
| ~ q0(X0,X1)
| ~ s1(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_126) ).
fof(f169,axiom,
! [X0,X1] :
( l2(X0,X1)
| ~ s1(X0)
| ~ n0(e,X1)
| ~ l2(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_131) ).
fof(f171,axiom,
! [X2,X3,X0,X1] :
( l2(X0,X0)
| ~ p0(X1,X1)
| ~ s1(X2)
| ~ m0(X3,X2,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_133) ).
fof(f369,negated_conjecture,
~ l2(e,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f602,definition,
( spl0_60
<=> ! [X1] : ~ s1(X1) ),
introduced(definition,[new_symbols(definition,[spl0_60])],[avatar_definition]) ).
fof(f603,plain,
( ! [X1] : ~ s1(X1)
| ~ spl0_60 ),
inference(avatar_component_clause,[],[f602]) ).
fof(f822,definition,
( spl0_115
<=> l2(e,b) ),
introduced(definition,[new_symbols(definition,[spl0_115])],[avatar_definition]) ).
fof(f824,plain,
( ~ l2(e,b)
| spl0_115 ),
inference(avatar_component_clause,[],[f822]) ).
fof(f1141,definition,
( spl0_194
<=> ! [X1] : ~ p0(X1,X1) ),
introduced(definition,[new_symbols(definition,[spl0_194])],[avatar_definition]) ).
fof(f1142,plain,
( ! [X1] : ~ p0(X1,X1)
| ~ spl0_194 ),
inference(avatar_component_clause,[],[f1141]) ).
fof(f1144,definition,
( spl0_195
<=> ! [X2,X0,X3] :
( l2(X0,X0)
| ~ s1(X2)
| ~ m0(X3,X2,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_195])],[avatar_definition]) ).
fof(f1145,plain,
( ! [X2,X3,X0] :
( l2(X0,X0)
| ~ s1(X2)
| ~ m0(X3,X2,X0) )
| ~ spl0_195 ),
inference(avatar_component_clause,[],[f1144]) ).
fof(f1146,plain,
( spl0_194
| spl0_195 ),
inference(avatar_split_clause,[],[f171,f1144,f1141]) ).
fof(f1157,definition,
( spl0_198
<=> ! [X0,X1] :
( s1(X0)
| ~ q0(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_198])],[avatar_definition]) ).
fof(f1158,plain,
( ! [X0,X1] :
( ~ q0(X0,X1)
| s1(X0) )
| ~ spl0_198 ),
inference(avatar_component_clause,[],[f1157]) ).
fof(f1159,plain,
( spl0_60
| spl0_198 ),
inference(avatar_split_clause,[],[f164,f1157,f602]) ).
fof(f1336,definition,
( spl0_241
<=> n0(e,b) ),
introduced(definition,[new_symbols(definition,[spl0_241])],[avatar_definition]) ).
fof(f1337,plain,
( n0(e,b)
| ~ spl0_241 ),
inference(avatar_component_clause,[],[f1336]) ).
fof(f1563,plain,
spl0_241,
inference(avatar_split_clause,[],[f11,f1336]) ).
fof(f1569,plain,
~ spl0_115,
inference(avatar_split_clause,[],[f369,f822]) ).
fof(f1578,plain,
( $false
| ~ spl0_194 ),
inference(resolution,[],[f1142,f14]) ).
fof(f1579,plain,
~ spl0_194,
inference(avatar_contradiction_clause,[],[f1578]) ).
fof(f1652,plain,
( ! [X0] : ~ p0(X0,X0)
| ~ spl0_60 ),
inference(forward_subsumption_resolution,[],[f163,f603]) ).
fof(f1653,plain,
( spl0_194
| ~ spl0_60 ),
inference(avatar_split_clause,[],[f1652,f602,f1141]) ).
fof(f1661,plain,
( ! [X0] : s1(X0)
| ~ spl0_198 ),
inference(resolution,[],[f1158,f17]) ).
fof(f1827,plain,
( ! [X2,X3,X0] :
( ~ m0(X3,X2,X0)
| l2(X0,X0) )
| ~ spl0_195
| ~ spl0_198 ),
inference(forward_subsumption_resolution,[],[f1145,f1661]) ).
fof(f1970,plain,
( ! [X0] : l2(X0,X0)
| ~ spl0_195
| ~ spl0_198 ),
inference(resolution,[],[f1827,f19]) ).
fof(f2710,plain,
( ! [X0,X1] :
( l2(X0,X1)
| ~ n0(e,X1)
| ~ l2(X1,X1) )
| ~ spl0_198 ),
inference(forward_subsumption_resolution,[],[f169,f1661]) ).
fof(f2711,plain,
( ! [X0,X1] :
( ~ n0(e,X1)
| l2(X0,X1) )
| ~ spl0_195
| ~ spl0_198 ),
inference(forward_subsumption_resolution,[],[f2710,f1970]) ).
fof(f2713,plain,
( ! [X0] : l2(X0,b)
| ~ spl0_195
| ~ spl0_198
| ~ spl0_241 ),
inference(resolution,[],[f2711,f1337]) ).
fof(f2756,plain,
( $false
| spl0_115
| ~ spl0_195
| ~ spl0_198
| ~ spl0_241 ),
inference(resolution,[],[f2713,f824]) ).
fof(f2759,plain,
( spl0_115
| ~ spl0_195
| ~ spl0_198
| ~ spl0_241 ),
inference(avatar_contradiction_clause,[],[f2756]) ).
cnf(s89,plain,
( spl0_194
| spl0_195 ),
inference(sat_conversion,[],[f1146]) ).
cnf(s91,plain,
( spl0_60
| spl0_198 ),
inference(sat_conversion,[],[f1159]) ).
cnf(s163,plain,
spl0_241,
inference(sat_conversion,[],[f1563]) ).
cnf(s169,plain,
~ spl0_115,
inference(sat_conversion,[],[f1569]) ).
cnf(s174,plain,
~ spl0_194,
inference(sat_conversion,[],[f1579]) ).
cnf(s210,plain,
( ~ spl0_60
| spl0_194 ),
inference(sat_conversion,[],[f1653]) ).
cnf(s377,plain,
( spl0_115
| ~ spl0_195
| ~ spl0_198
| ~ spl0_241 ),
inference(sat_conversion,[],[f2759]) ).
cnf(s386,plain,
~ spl0_60,
inference(rat,[],[s210,s174]) ).
cnf(s459,plain,
spl0_198,
inference(rat,[],[s91,s386]) ).
cnf(s463,plain,
~ spl0_195,
inference(rat,[],[s377,s163,s169,s459]) ).
cnf(s466,plain,
$false,
inference(rat,[],[s89,s463,s174]) ).
fof(f2761,plain,
$false,
inference(avatar_sat_refutation,[],[s466]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN219-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n018.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 15:40:55 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.22/0.28 % (3494083)Will run a generic schedule for satisfiability detection.
% 0.22/0.28 % (3494091)dis+10_1_sil=32000:sp=arity:random_seed=3925221586:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.28 % (3494089)% WARNING: option uhcvi not known.
% 0.22/0.28 % (3494089)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3273876324:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.28 % (3494088)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=733390106_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.28 % (3494090)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4089178434:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.28 % (3494092)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=599788623:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.28 % (3494093)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1461045464:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.28 % (3494094)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1608298328:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.28 % (3494091) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3494083-3494091"...
% 0.22/0.28 % (3494091)...printing done.
% 0.22/0.28 % (3494091)Refutation found. Thanks to Tanya!
% 0.22/0.28 % SZS status Unsatisfiable for theBenchmark
% 0.22/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.28 % (3494091)------------------------------
% 0.22/0.28 % (3494091)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.28 % (3494091)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.28 % (3494091)CaDiCaL version: 2.1.3
% 0.22/0.28 % (3494091)Termination reason: Refutation
% 0.22/0.28 % (3494091)Time elapsed: 0.014 s
% 0.22/0.28 % (3494091)Peak memory usage: 13 MB
% 0.22/0.28 % (3494091)Instructions burned: 36 (million)
% 0.22/0.28 % (3494083)Success in time 0.05 s
% 0.22/0.28 % Vampire exiting
%------------------------------------------------------------------------------