%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN179-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 : n008.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:06:57 PM UTC 2026
% Result : Unsatisfiable 0.27s 0.37s
% Output : Refutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 23
% Syntax : Number of formulae : 71 ( 22 unt; 8 def)
% Number of atoms : 144 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 148 ( 75 ~; 65 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 21 ( 20 usr; 9 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 53 ( 0 sgn 53 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
s0(d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
fof(f9,axiom,
r0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
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(f30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
fof(f36,axiom,
q0(a,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_36) ).
fof(f41,axiom,
! [X2,X3,X0,X1] :
( l1(X0,X1)
| ~ p0(X2,X0)
| ~ r0(X3)
| ~ m0(X1,X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_003) ).
fof(f97,axiom,
! [X2,X3,X0,X1] :
( ~ m0(X2,X3,X3)
| n1(X0,X0,X1)
| ~ m0(X1,X2,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_059) ).
fof(f163,axiom,
! [X0] :
( ~ p0(X0,X0)
| s1(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(f224,axiom,
! [X0,X1] :
( ~ l1(X1,X0)
| q2(X0,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_186) ).
fof(f228,axiom,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_190) ).
fof(f293,axiom,
! [X2,X0,X1] :
( ~ n0(X2,X0)
| ~ q2(X2,X0,X1)
| q3(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_255) ).
fof(f295,axiom,
! [X2,X0,X1] :
( ~ s2(X0)
| ~ n1(X2,X0,X1)
| q3(X0,X1)
| ~ q3(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_257) ).
fof(f369,negated_conjecture,
! [X0] : ~ q3(d,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f595,definition,
( spl0_58
<=> ! [X1] : ~ s1(X1) ),
introduced(definition,[new_symbols(definition,[spl0_58])],[avatar_definition]) ).
fof(f596,plain,
( ! [X1] : ~ s1(X1)
| ~ spl0_58 ),
inference(avatar_component_clause,[],[f595]) ).
fof(f703,definition,
( spl0_85
<=> r0(b) ),
introduced(definition,[new_symbols(definition,[spl0_85])],[avatar_definition]) ).
fof(f704,plain,
( r0(b)
| ~ spl0_85 ),
inference(avatar_component_clause,[],[f703]) ).
fof(f711,definition,
( spl0_87
<=> s2(d) ),
introduced(definition,[new_symbols(definition,[spl0_87])],[avatar_definition]) ).
fof(f712,plain,
( s2(d)
| ~ spl0_87 ),
inference(avatar_component_clause,[],[f711]) ).
fof(f865,definition,
( spl0_125
<=> s0(d) ),
introduced(definition,[new_symbols(definition,[spl0_125])],[avatar_definition]) ).
fof(f869,definition,
( spl0_126
<=> s1(a) ),
introduced(definition,[new_symbols(definition,[spl0_126])],[avatar_definition]) ).
fof(f871,plain,
( ~ s1(a)
| spl0_126 ),
inference(avatar_component_clause,[],[f869]) ).
fof(f872,plain,
( ~ spl0_125
| ~ spl0_126
| spl0_87 ),
inference(avatar_split_clause,[],[f228,f711,f869,f865]) ).
fof(f1137,definition,
( spl0_193
<=> ! [X0,X1] :
( s1(X0)
| ~ q0(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_193])],[avatar_definition]) ).
fof(f1138,plain,
( ! [X0,X1] :
( ~ q0(X0,X1)
| s1(X0) )
| ~ spl0_193 ),
inference(avatar_component_clause,[],[f1137]) ).
fof(f1139,plain,
( spl0_58
| spl0_193 ),
inference(avatar_split_clause,[],[f164,f1137,f595]) ).
fof(f1176,definition,
( spl0_202
<=> ! [X2] : ~ r0(X2) ),
introduced(definition,[new_symbols(definition,[spl0_202])],[avatar_definition]) ).
fof(f1177,plain,
( ! [X2] : ~ r0(X2)
| ~ spl0_202 ),
inference(avatar_component_clause,[],[f1176]) ).
fof(f1485,definition,
( spl0_277
<=> ! [X2,X0,X1] :
( l1(X0,X1)
| ~ m0(X1,X0,X2)
| ~ p0(X2,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_277])],[avatar_definition]) ).
fof(f1486,plain,
( ! [X2,X0,X1] :
( ~ p0(X2,X0)
| ~ m0(X1,X0,X2)
| l1(X0,X1) )
| ~ spl0_277 ),
inference(avatar_component_clause,[],[f1485]) ).
fof(f1487,plain,
( spl0_202
| spl0_277 ),
inference(avatar_split_clause,[],[f41,f1485,f1176]) ).
fof(f1498,plain,
spl0_85,
inference(avatar_split_clause,[],[f9,f703]) ).
fof(f1501,plain,
spl0_125,
inference(avatar_split_clause,[],[f1,f865]) ).
fof(f1523,plain,
( $false
| ~ spl0_85
| ~ spl0_202 ),
inference(resolution,[],[f1177,f704]) ).
fof(f1526,plain,
( ~ spl0_85
| ~ spl0_202 ),
inference(avatar_contradiction_clause,[],[f1523]) ).
fof(f1579,plain,
s1(b),
inference(resolution,[],[f163,f14]) ).
fof(f1580,plain,
( $false
| ~ spl0_58 ),
inference(forward_subsumption_resolution,[],[f1579,f596]) ).
fof(f1581,plain,
~ spl0_58,
inference(avatar_contradiction_clause,[],[f1580]) ).
fof(f1589,plain,
( s1(a)
| ~ spl0_193 ),
inference(resolution,[],[f1138,f36]) ).
fof(f1592,plain,
( $false
| spl0_126
| ~ spl0_193 ),
inference(forward_subsumption_resolution,[],[f1589,f871]) ).
fof(f1593,plain,
( spl0_126
| ~ spl0_193 ),
inference(avatar_contradiction_clause,[],[f1592]) ).
fof(f2539,plain,
! [X0] :
( ~ q2(e,e,X0)
| q3(e,X0) ),
inference(resolution,[],[f293,f30]) ).
fof(f2573,plain,
( ! [X0,X1] :
( ~ m0(X0,X1,b)
| l1(X1,X0) )
| ~ spl0_277 ),
inference(resolution,[],[f1486,f14]) ).
fof(f2799,plain,
! [X2,X0,X1] :
( ~ m0(X1,X2,X0)
| n1(X0,X0,X1) ),
inference(resolution,[],[f97,f19]) ).
fof(f3012,plain,
( ! [X0,X1] :
( ~ n1(X0,d,X1)
| q3(d,X1)
| ~ q3(X1,d) )
| ~ spl0_87 ),
inference(resolution,[],[f295,f712]) ).
fof(f3014,plain,
( ! [X0,X1] :
( ~ q3(X1,d)
| ~ n1(X0,d,X1) )
| ~ spl0_87 ),
inference(forward_subsumption_resolution,[],[f3012,f369]) ).
fof(f3459,plain,
( ! [X0] : l1(d,X0)
| ~ spl0_277 ),
inference(resolution,[],[f2573,f19]) ).
fof(f3466,plain,
( ! [X0] : q2(X0,X0,d)
| ~ spl0_277 ),
inference(resolution,[],[f3459,f224]) ).
fof(f3493,plain,
( q3(e,d)
| ~ spl0_277 ),
inference(resolution,[],[f3466,f2539]) ).
fof(f3496,plain,
( ! [X0] : ~ n1(X0,d,e)
| ~ spl0_87
| ~ spl0_277 ),
inference(resolution,[],[f3493,f3014]) ).
fof(f3649,plain,
! [X0,X1] : n1(X0,X0,X1),
inference(resolution,[],[f2799,f19]) ).
fof(f3660,plain,
( $false
| ~ spl0_87
| ~ spl0_277 ),
inference(resolution,[],[f3649,f3496]) ).
fof(f3665,plain,
( ~ spl0_87
| ~ spl0_277 ),
inference(avatar_contradiction_clause,[],[f3660]) ).
cnf(s57,plain,
( spl0_87
| ~ spl0_125
| ~ spl0_126 ),
inference(sat_conversion,[],[f872]) ).
cnf(s88,plain,
( spl0_58
| spl0_193 ),
inference(sat_conversion,[],[f1139]) ).
cnf(s142,plain,
( spl0_202
| spl0_277 ),
inference(sat_conversion,[],[f1487]) ).
cnf(s153,plain,
spl0_85,
inference(sat_conversion,[],[f1498]) ).
cnf(s156,plain,
spl0_125,
inference(sat_conversion,[],[f1501]) ).
cnf(s167,plain,
( ~ spl0_85
| ~ spl0_202 ),
inference(sat_conversion,[],[f1526]) ).
cnf(s189,plain,
~ spl0_58,
inference(sat_conversion,[],[f1581]) ).
cnf(s191,plain,
( spl0_126
| ~ spl0_193 ),
inference(sat_conversion,[],[f1593]) ).
cnf(s382,plain,
( ~ spl0_87
| ~ spl0_277 ),
inference(sat_conversion,[],[f3665]) ).
cnf(s403,plain,
~ spl0_202,
inference(rat,[],[s167,s153]) ).
cnf(s410,plain,
spl0_277,
inference(rat,[],[s142,s403]) ).
cnf(s411,plain,
~ spl0_87,
inference(rat,[],[s382,s410]) ).
cnf(s494,plain,
spl0_193,
inference(rat,[],[s88,s189]) ).
cnf(s497,plain,
spl0_126,
inference(rat,[],[s191,s494]) ).
cnf(s538,plain,
$false,
inference(rat,[],[s57,s497,s156,s411]) ).
fof(f3666,plain,
$false,
inference(avatar_sat_refutation,[],[s538]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYN179-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.26 % Computer : n008.cluster.edu
% 0.11/0.26 % Model : x86_64 x86_64
% 0.11/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.26 % Memory : 8046.5625MB
% 0.11/0.26 % OS : Linux 6.8.0-71-generic
% 0.11/0.26 % CPULimit : 300
% 0.11/0.26 % WCLimit : 300
% 0.11/0.26 % DateTime : Mon Sep 28 15:38:25 UTC 2026
% 0.11/0.26 % CPUTime :
% 0.11/0.26 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.27/0.29 Running first-order model finding
% 0.27/0.29 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.27/0.37 % (2350498)Will run a generic schedule for satisfiability detection.
% 0.27/0.37 % (2350507)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=554943053:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.27/0.37 % (2350504)% WARNING: option uhcvi not known.
% 0.27/0.37 % (2350503)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1381189012_2999 on theBenchmark for (2999ds/0Mi)
% 0.27/0.37 % (2350506)dis+10_1_sil=32000:sp=arity:random_seed=3174161868:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.27/0.37 % (2350504)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=310447609:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.27/0.37 % (2350505)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=77276132:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.27/0.37 % (2350508)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3104707281:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.27/0.37 % (2350509)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1970352685:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.27/0.37 % Detected minimum model sizes of [1]
% 0.27/0.37 % Detected maximum model sizes of [5]
% 0.27/0.37 % TRYING [1]
% 0.27/0.37 % TRYING [2]
% 0.27/0.37 % (2350507)Instruction limit reached!
% 0.27/0.37 % (2350507)------------------------------
% 0.27/0.37 % (2350507)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.37 % (2350507)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.37 % (2350507)CaDiCaL version: 2.1.3
% 0.27/0.37 % (2350507)Termination reason: Instruction limit
% 0.27/0.37 % (2350507)Termination phase: Saturation
% 0.27/0.37 % (2350507)Time elapsed: 0.032 s
% 0.27/0.37 % (2350507)Peak memory usage: 12 MB
% 0.27/0.37 % (2350507)Instructions burned: 116 (million)
% 0.27/0.37 % TRYING [3]
% 0.27/0.37 % (2350503) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2350498-2350503"...
% 0.27/0.37 % (2350517)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3202141630:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.27/0.37 % (2350508) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2350498-2350508"...
% 0.27/0.37 % (2350508)...printing done.
% 0.27/0.37 % (2350505) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2350498-2350505"...
% 0.27/0.37 % (2350508)Refutation found. Thanks to Tanya!
% 0.27/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.27/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.27/0.37 % (2350508)------------------------------
% 0.27/0.37 % (2350508)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.37 % (2350508)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.37 % (2350508)CaDiCaL version: 2.1.3
% 0.27/0.37 % (2350508)Termination reason: Refutation
% 0.27/0.37 % (2350508)Time elapsed: 0.037 s
% 0.27/0.37 % (2350508)Peak memory usage: 14 MB
% 0.27/0.37 % (2350508)Instructions burned: 54 (million)
% 0.27/0.37 % (2350498)Success in time 0.069 s
% 0.27/0.37 % Vampire exiting
%------------------------------------------------------------------------------