%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN210-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 : 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 02:07:01 PM UTC 2026
% Result : Unsatisfiable 0.35s 0.44s
% Output : Refutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of formulae : 57 ( 16 unt; 6 def)
% Number of atoms : 118 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 125 ( 64 ~; 55 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 7 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0] : p0(b,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
fof(f19,axiom,
! [X0,X1] : m0(X0,d,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
fof(f26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
fof(f29,axiom,
q0(d,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_29) ).
fof(f40,axiom,
! [X0,X1] :
( ~ n0(X1,X0)
| l1(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
fof(f163,axiom,
! [X0] :
( s1(X0)
| ~ p0(X0,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(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(f284,axiom,
! [X0] :
( p3(X0,X0,X0)
| ~ l2(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_246) ).
fof(f337,axiom,
! [X2,X3,X0,X1] :
( s4(X0)
| ~ p3(X1,X2,X3)
| ~ l1(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_299) ).
fof(f369,negated_conjecture,
~ s4(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f543,definition,
( spl0_45
<=> ! [X1] : ~ s1(X1) ),
introduced(definition,[new_symbols(definition,[spl0_45])],[avatar_definition]) ).
fof(f544,plain,
( ! [X1] : ~ s1(X1)
| ~ spl0_45 ),
inference(avatar_component_clause,[],[f543]) ).
fof(f787,definition,
( spl0_106
<=> s1(d) ),
introduced(definition,[new_symbols(definition,[spl0_106])],[avatar_definition]) ).
fof(f788,plain,
( s1(d)
| ~ spl0_106 ),
inference(avatar_component_clause,[],[f787]) ).
fof(f789,plain,
( ~ s1(d)
| spl0_106 ),
inference(avatar_component_clause,[],[f787]) ).
fof(f1006,definition,
( spl0_161
<=> ! [X1] : ~ p0(X1,X1) ),
introduced(definition,[new_symbols(definition,[spl0_161])],[avatar_definition]) ).
fof(f1007,plain,
( ! [X1] : ~ p0(X1,X1)
| ~ spl0_161 ),
inference(avatar_component_clause,[],[f1006]) ).
fof(f1009,definition,
( spl0_162
<=> ! [X2,X0,X3] :
( l2(X0,X0)
| ~ s1(X2)
| ~ m0(X3,X2,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_162])],[avatar_definition]) ).
fof(f1010,plain,
( ! [X2,X3,X0] :
( ~ s1(X2)
| l2(X0,X0)
| ~ m0(X3,X2,X0) )
| ~ spl0_162 ),
inference(avatar_component_clause,[],[f1009]) ).
fof(f1011,plain,
( spl0_161
| spl0_162 ),
inference(avatar_split_clause,[],[f171,f1009,f1006]) ).
fof(f1022,definition,
( spl0_165
<=> ! [X0,X1] :
( s1(X0)
| ~ q0(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_165])],[avatar_definition]) ).
fof(f1023,plain,
( ! [X0,X1] :
( s1(X0)
| ~ q0(X0,X1) )
| ~ spl0_165 ),
inference(avatar_component_clause,[],[f1022]) ).
fof(f1024,plain,
( spl0_45
| spl0_165 ),
inference(avatar_split_clause,[],[f164,f1022,f543]) ).
fof(f1263,definition,
( spl0_224
<=> l1(c,c) ),
introduced(definition,[new_symbols(definition,[spl0_224])],[avatar_definition]) ).
fof(f1264,plain,
( l1(c,c)
| ~ spl0_224 ),
inference(avatar_component_clause,[],[f1263]) ).
fof(f1265,plain,
( ~ l1(c,c)
| spl0_224 ),
inference(avatar_component_clause,[],[f1263]) ).
fof(f1321,plain,
( $false
| ~ spl0_161 ),
inference(resolution,[],[f1007,f14]) ).
fof(f1322,plain,
~ spl0_161,
inference(avatar_contradiction_clause,[],[f1321]) ).
fof(f1357,plain,
( ! [X0] : ~ p0(X0,X0)
| ~ spl0_45 ),
inference(resolution,[],[f163,f544]) ).
fof(f1358,plain,
( spl0_161
| ~ spl0_45 ),
inference(avatar_split_clause,[],[f1357,f543,f1006]) ).
fof(f1380,plain,
( ! [X0] : ~ q0(d,X0)
| spl0_106
| ~ spl0_165 ),
inference(resolution,[],[f1023,f789]) ).
fof(f1382,plain,
( $false
| spl0_106
| ~ spl0_165 ),
inference(resolution,[],[f1380,f29]) ).
fof(f1387,plain,
( spl0_106
| ~ spl0_165 ),
inference(avatar_contradiction_clause,[],[f1382]) ).
fof(f1401,plain,
l1(c,c),
inference(resolution,[],[f40,f26]) ).
fof(f1425,plain,
( $false
| spl0_224 ),
inference(forward_subsumption_resolution,[],[f1401,f1265]) ).
fof(f1426,plain,
spl0_224,
inference(avatar_contradiction_clause,[],[f1425]) ).
fof(f1873,plain,
! [X2,X0,X1] :
( ~ p3(X0,X1,X2)
| ~ l1(c,X1) ),
inference(resolution,[],[f337,f369]) ).
fof(f1898,plain,
( ! [X0,X1] :
( l2(X0,X0)
| ~ m0(X1,d,X0) )
| ~ spl0_106
| ~ spl0_162 ),
inference(resolution,[],[f1010,f788]) ).
fof(f1901,plain,
( ! [X0] : l2(X0,X0)
| ~ spl0_106
| ~ spl0_162 ),
inference(forward_subsumption_resolution,[],[f1898,f19]) ).
fof(f2018,plain,
! [X0] :
( ~ l1(c,X0)
| ~ l2(X0,X0) ),
inference(resolution,[],[f1873,f284]) ).
fof(f2019,plain,
( ! [X0] : ~ l1(c,X0)
| ~ spl0_106
| ~ spl0_162 ),
inference(forward_subsumption_resolution,[],[f2018,f1901]) ).
fof(f2024,plain,
( $false
| ~ spl0_106
| ~ spl0_162
| ~ spl0_224 ),
inference(resolution,[],[f2019,f1264]) ).
fof(f2025,plain,
( ~ spl0_106
| ~ spl0_162
| ~ spl0_224 ),
inference(avatar_contradiction_clause,[],[f2024]) ).
cnf(s75,plain,
( spl0_161
| spl0_162 ),
inference(sat_conversion,[],[f1011]) ).
cnf(s77,plain,
( spl0_45
| spl0_165 ),
inference(sat_conversion,[],[f1024]) ).
cnf(s146,plain,
~ spl0_161,
inference(sat_conversion,[],[f1322]) ).
cnf(s161,plain,
( ~ spl0_45
| spl0_161 ),
inference(sat_conversion,[],[f1358]) ).
cnf(s172,plain,
( spl0_106
| ~ spl0_165 ),
inference(sat_conversion,[],[f1387]) ).
cnf(s186,plain,
spl0_224,
inference(sat_conversion,[],[f1426]) ).
cnf(s251,plain,
( ~ spl0_106
| ~ spl0_162
| ~ spl0_224 ),
inference(sat_conversion,[],[f2025]) ).
cnf(s256,plain,
~ spl0_45,
inference(rat,[],[s161,s146]) ).
cnf(s312,plain,
spl0_165,
inference(rat,[],[s77,s256]) ).
cnf(s314,plain,
spl0_106,
inference(rat,[],[s172,s312]) ).
cnf(s315,plain,
~ spl0_162,
inference(rat,[],[s251,s186,s314]) ).
cnf(s318,plain,
$false,
inference(rat,[],[s75,s315,s146]) ).
fof(f2026,plain,
$false,
inference(avatar_sat_refutation,[],[s318]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN210-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.29 % Computer : n006.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8046.5625MB
% 0.11/0.29 % OS : Linux 6.8.0-71-generic
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Mon Sep 28 15:37:55 UTC 2026
% 0.11/0.29 % CPUTime :
% 0.11/0.29 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.30/0.35 Running first-order model finding
% 0.30/0.35 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.35/0.44 % (4067243)Will run a generic schedule for satisfiability detection.
% 0.35/0.44 % (4067252)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3705247573:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.35/0.44 % (4067249)% WARNING: option uhcvi not known.
% 0.35/0.44 % (4067248)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1235594828_2999 on theBenchmark for (2999ds/0Mi)
% 0.35/0.44 % (4067250)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=868089583:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.35/0.44 % (4067249)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1202998742:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.35/0.44 % (4067251)dis+10_1_sil=32000:sp=arity:random_seed=2922172597:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.35/0.44 % (4067253)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3142124920:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.35/0.44 % (4067254)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3564709554:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.35/0.44 % (4067252) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4067243-4067252"...
% 0.35/0.44 % (4067252)...printing done.
% 0.35/0.44 % (4067252)Refutation found. Thanks to Tanya!
% 0.35/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.35/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.35/0.44 % (4067252)------------------------------
% 0.35/0.44 % (4067252)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.44 % (4067252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.44 % (4067252)CaDiCaL version: 2.1.3
% 0.35/0.44 % (4067252)Termination reason: Refutation
% 0.35/0.44 % (4067252)Time elapsed: 0.025 s
% 0.35/0.44 % (4067252)Peak memory usage: 13 MB
% 0.35/0.44 % (4067252)Instructions burned: 46 (million)
% 0.35/0.44 % (4067243)Success in time 0.077 s
% 0.35/0.44 % Vampire exiting
%------------------------------------------------------------------------------