%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN208-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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.36s 0.53s
% Output : Refutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of formulae : 56 ( 18 unt; 7 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 110 ( 59 ~; 44 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 8 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
s0(d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
fof(f14,axiom,
! [X0] : p0(b,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
fof(f19,axiom,
! [X0,X1] : m0(X0,d,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
fof(f36,axiom,
q0(a,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_36) ).
fof(f123,axiom,
! [X0,X1] :
( ~ p0(X1,X0)
| p1(X0,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).
fof(f163,axiom,
! [X0] :
( s1(X0)
| ~ p0(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).
fof(f164,axiom,
! [X2,X0,X1] :
( s1(X0)
| ~ q0(X0,X1)
| ~ s1(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_126) ).
fof(f219,axiom,
! [X0] :
( q2(X0,X0,X0)
| ~ p1(X0,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_181) ).
fof(f228,axiom,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_190) ).
fof(f311,axiom,
! [X2,X3,X0,X1] :
( s3(X0,X1)
| ~ q2(X2,X0,X2)
| ~ s2(X0)
| ~ m0(X2,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_273) ).
fof(f369,negated_conjecture,
~ s3(d,b),
file('/export/starexec/sandbox2/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(f647,definition,
( spl0_71
<=> s2(d) ),
introduced(definition,[new_symbols(definition,[spl0_71])],[avatar_definition]) ).
fof(f648,plain,
( s2(d)
| ~ spl0_71 ),
inference(avatar_component_clause,[],[f647]) ).
fof(f796,definition,
( spl0_108
<=> s0(d) ),
introduced(definition,[new_symbols(definition,[spl0_108])],[avatar_definition]) ).
fof(f800,definition,
( spl0_109
<=> s1(a) ),
introduced(definition,[new_symbols(definition,[spl0_109])],[avatar_definition]) ).
fof(f802,plain,
( ~ s1(a)
| spl0_109 ),
inference(avatar_component_clause,[],[f800]) ).
fof(f803,plain,
( ~ spl0_108
| ~ spl0_109
| spl0_71 ),
inference(avatar_split_clause,[],[f228,f647,f800,f796]) ).
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(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(f1293,plain,
spl0_108,
inference(avatar_split_clause,[],[f1,f796]) ).
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(f1381,plain,
( ! [X0] : ~ q0(a,X0)
| spl0_109
| ~ spl0_165 ),
inference(resolution,[],[f1023,f802]) ).
fof(f1388,plain,
( $false
| spl0_109
| ~ spl0_165 ),
inference(resolution,[],[f1381,f36]) ).
fof(f1391,plain,
( spl0_109
| ~ spl0_165 ),
inference(avatar_contradiction_clause,[],[f1388]) ).
fof(f1543,plain,
! [X0] : p1(X0,X0,X0),
inference(resolution,[],[f123,f14]) ).
fof(f2741,plain,
! [X0,X1] :
( ~ q2(X0,d,X0)
| ~ s2(d)
| ~ m0(X0,X1,b) ),
inference(resolution,[],[f311,f369]) ).
fof(f2751,plain,
( ! [X0,X1] :
( ~ q2(X0,d,X0)
| ~ m0(X0,X1,b) )
| ~ spl0_71 ),
inference(forward_subsumption_resolution,[],[f2741,f648]) ).
fof(f2757,plain,
( ! [X0] :
( ~ m0(d,X0,b)
| ~ p1(d,d,d) )
| ~ spl0_71 ),
inference(resolution,[],[f2751,f219]) ).
fof(f2758,plain,
( ! [X0] : ~ m0(d,X0,b)
| ~ spl0_71 ),
inference(forward_subsumption_resolution,[],[f2757,f1543]) ).
fof(f2763,definition,
( spl0_306
<=> ! [X0] : ~ m0(d,X0,b) ),
introduced(definition,[new_symbols(definition,[spl0_306])],[avatar_definition]) ).
fof(f2764,plain,
( ! [X0] : ~ m0(d,X0,b)
| ~ spl0_306 ),
inference(avatar_component_clause,[],[f2763]) ).
fof(f2773,plain,
( spl0_306
| ~ spl0_71 ),
inference(avatar_split_clause,[],[f2758,f647,f2763]) ).
fof(f2782,plain,
( $false
| ~ spl0_306 ),
inference(resolution,[],[f2764,f19]) ).
fof(f2783,plain,
~ spl0_306,
inference(avatar_contradiction_clause,[],[f2782]) ).
cnf(s49,plain,
( spl0_71
| ~ spl0_108
| ~ spl0_109 ),
inference(sat_conversion,[],[f803]) ).
cnf(s77,plain,
( spl0_45
| spl0_165 ),
inference(sat_conversion,[],[f1024]) ).
cnf(s133,plain,
spl0_108,
inference(sat_conversion,[],[f1293]) ).
cnf(s146,plain,
~ spl0_161,
inference(sat_conversion,[],[f1322]) ).
cnf(s161,plain,
( ~ spl0_45
| spl0_161 ),
inference(sat_conversion,[],[f1358]) ).
cnf(s174,plain,
( spl0_109
| ~ spl0_165 ),
inference(sat_conversion,[],[f1391]) ).
cnf(s318,plain,
( ~ spl0_71
| spl0_306 ),
inference(sat_conversion,[],[f2773]) ).
cnf(s322,plain,
~ spl0_306,
inference(sat_conversion,[],[f2783]) ).
cnf(s326,plain,
~ spl0_71,
inference(rat,[],[s318,s322]) ).
cnf(s334,plain,
~ spl0_45,
inference(rat,[],[s161,s146]) ).
cnf(s407,plain,
spl0_165,
inference(rat,[],[s77,s334]) ).
cnf(s408,plain,
spl0_109,
inference(rat,[],[s174,s407]) ).
cnf(s448,plain,
$false,
inference(rat,[],[s49,s408,s133,s326]) ).
fof(f2784,plain,
$false,
inference(avatar_sat_refutation,[],[s448]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN208-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.10 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.28/0.31 % Computer : n010.cluster.edu
% 0.28/0.31 % Model : x86_64 x86_64
% 0.28/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.28/0.31 % Memory : 8046.5625MB
% 0.28/0.31 % OS : Linux 6.8.0-71-generic
% 0.28/0.31 % CPULimit : 300
% 0.28/0.31 % WCLimit : 300
% 0.28/0.31 % DateTime : Mon Sep 28 15:38:47 UTC 2026
% 0.28/0.32 % CPUTime :
% 0.28/0.32 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.28/0.38 Running first-order model finding
% 0.28/0.38 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.36/0.53 % (2019175)Will run a generic schedule for satisfiability detection.
% 0.36/0.53 % (2019180)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=101891192_2999 on theBenchmark for (2999ds/0Mi)
% 0.36/0.53 % (2019181)% WARNING: option uhcvi not known.
% 0.36/0.53 % (2019183)dis+10_1_sil=32000:sp=arity:random_seed=2949932979:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.36/0.53 % (2019181)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2243998212:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.36/0.53 % (2019184)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=44046592:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.36/0.53 % (2019185)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2390216677:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.36/0.53 % (2019186)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=934132333:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.36/0.53 % Detected minimum model sizes of [1]
% 0.36/0.53 % Detected maximum model sizes of [5]
% 0.36/0.53 % TRYING [1]
% 0.36/0.53 % TRYING [2]
% 0.36/0.53 % TRYING [3]
% 0.36/0.53 % (2019182)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=958425237:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.36/0.53 % TRYING [4]
% 0.36/0.53 % TRYING [5]
% 0.36/0.53 % (2019184) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2019175-2019184"...
% 0.36/0.53 % (2019184)...printing done.
% 0.36/0.53 % (2019184)Refutation found. Thanks to Tanya!
% 0.36/0.53 % SZS status Unsatisfiable for theBenchmark
% 0.36/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.36/0.53 % (2019184)------------------------------
% 0.36/0.53 % (2019184)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.53 % (2019184)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.53 % (2019184)CaDiCaL version: 2.1.3
% 0.36/0.53 % (2019184)Termination reason: Refutation
% 0.36/0.53 % (2019184)Time elapsed: 0.066 s
% 0.36/0.53 % (2019184)Peak memory usage: 14 MB
% 0.36/0.53 % (2019184)Instructions burned: 62 (million)
% 0.36/0.53 % (2019175)Success in time 0.134 s
% 0.36/0.53 % Vampire exiting
%------------------------------------------------------------------------------