%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN141-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:06:52 PM UTC 2026
% Result : Unsatisfiable 0.21s 0.31s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 26
% Syntax : Number of formulae : 78 ( 24 unt; 8 def)
% Number of atoms : 148 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 140 ( 70 ~; 62 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 23 ( 22 usr; 9 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 46 ( 0 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
n0(d,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_3) ).
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(f18,axiom,
p0(c,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_18) ).
fof(f27,axiom,
m0(e,b,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_27) ).
fof(f30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
fof(f34,axiom,
n0(c,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
fof(f39,axiom,
! [X0,X1] :
( ~ n0(X1,X0)
| k1(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
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(f123,axiom,
! [X0,X1] :
( ~ p0(X1,X0)
| p1(X0,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).
fof(f175,axiom,
! [X2,X0,X1] :
( ~ p1(X1,X2,X0)
| n2(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).
fof(f212,axiom,
! [X0] :
( p2(X0,X0,X0)
| ~ n2(X0)
| ~ k1(e) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_174) ).
fof(f224,axiom,
! [X0,X1] :
( q2(X0,X0,X1)
| ~ l1(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_186) ).
fof(f278,axiom,
! [X2,X0,X1] :
( ~ p2(X1,X2,X0)
| n3(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_240) ).
fof(f293,axiom,
! [X2,X0,X1] :
( ~ q2(X2,X0,X1)
| q3(X0,X1)
| ~ n0(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_255) ).
fof(f312,axiom,
( k4(c)
| ~ n0(c,d)
| ~ q3(e,b)
| ~ n3(e) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_274) ).
fof(f342,axiom,
! [X0] :
( m5(X0,X0)
| ~ k4(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_304) ).
fof(f369,negated_conjecture,
! [X0] : ~ m5(c,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f415,plain,
k1(e),
inference(resolution,[],[f39,f3]) ).
fof(f460,plain,
~ k4(c),
inference(resolution,[],[f342,f369]) ).
fof(f485,definition,
( spl0_20
<=> ! [X0] : ~ r0(X0) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
fof(f486,plain,
( ! [X0] : ~ r0(X0)
| ~ spl0_20 ),
inference(avatar_component_clause,[],[f485]) ).
fof(f487,plain,
( $false
| ~ spl0_20 ),
inference(resolution,[],[f486,f9]) ).
fof(f490,plain,
~ spl0_20,
inference(avatar_contradiction_clause,[],[f487]) ).
fof(f492,definition,
( spl0_21
<=> ! [X0] : p1(X0,X0,X0) ),
introduced(definition,[new_symbols(definition,[spl0_21])],[avatar_definition]) ).
fof(f493,plain,
( ! [X0] : p1(X0,X0,X0)
| ~ spl0_21 ),
inference(avatar_component_clause,[],[f492]) ).
fof(f507,definition,
( spl0_23
<=> ! [X0] : n2(X0) ),
introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).
fof(f508,plain,
( ! [X0] : n2(X0)
| ~ spl0_23 ),
inference(avatar_component_clause,[],[f507]) ).
fof(f556,definition,
( spl0_31
<=> ! [X0] : n3(X0) ),
introduced(definition,[new_symbols(definition,[spl0_31])],[avatar_definition]) ).
fof(f557,plain,
( ! [X0] : n3(X0)
| ~ spl0_31 ),
inference(avatar_component_clause,[],[f556]) ).
fof(f568,definition,
( spl0_33
<=> ! [X0] : p2(X0,X0,X0) ),
introduced(definition,[new_symbols(definition,[spl0_33])],[avatar_definition]) ).
fof(f569,plain,
( ! [X0] : p2(X0,X0,X0)
| ~ spl0_33 ),
inference(avatar_component_clause,[],[f568]) ).
fof(f646,plain,
( ! [X0] : n2(X0)
| ~ spl0_21 ),
inference(resolution,[],[f493,f175]) ).
fof(f941,plain,
! [X0] :
( p2(X0,X0,X0)
| ~ n2(X0) ),
inference(forward_subsumption_resolution,[],[f212,f415]) ).
fof(f964,plain,
( ! [X0] : n3(X0)
| ~ spl0_33 ),
inference(resolution,[],[f569,f278]) ).
fof(f1033,plain,
( spl0_23
| ~ spl0_21 ),
inference(avatar_split_clause,[],[f646,f492,f507]) ).
fof(f1069,plain,
! [X0] : p1(X0,X0,X0),
inference(resolution,[],[f123,f14]) ).
fof(f1071,plain,
spl0_21,
inference(avatar_split_clause,[],[f1069,f492]) ).
fof(f1385,plain,
! [X0,X1] :
( ~ l1(X1,X0)
| ~ n0(X0,X0)
| q3(X0,X1) ),
inference(resolution,[],[f293,f224]) ).
fof(f1388,plain,
( ~ n0(c,d)
| ~ q3(e,b)
| ~ n3(e) ),
inference(forward_subsumption_resolution,[],[f312,f460]) ).
fof(f1389,plain,
( ~ q3(e,b)
| ~ n3(e) ),
inference(forward_subsumption_resolution,[],[f1388,f34]) ).
fof(f1393,plain,
( spl0_31
| ~ spl0_33 ),
inference(avatar_split_clause,[],[f964,f568,f556]) ).
fof(f1396,definition,
( spl0_125
<=> n3(e) ),
introduced(definition,[new_symbols(definition,[spl0_125])],[avatar_definition]) ).
fof(f1398,plain,
( ~ n3(e)
| spl0_125 ),
inference(avatar_component_clause,[],[f1396]) ).
fof(f1400,definition,
( spl0_126
<=> q3(e,b) ),
introduced(definition,[new_symbols(definition,[spl0_126])],[avatar_definition]) ).
fof(f1402,plain,
( ~ q3(e,b)
| spl0_126 ),
inference(avatar_component_clause,[],[f1400]) ).
fof(f1403,plain,
( ~ spl0_125
| ~ spl0_126 ),
inference(avatar_split_clause,[],[f1389,f1400,f1396]) ).
fof(f1404,plain,
( $false
| ~ spl0_31
| spl0_125 ),
inference(resolution,[],[f557,f1398]) ).
fof(f1405,plain,
( ~ spl0_31
| spl0_125 ),
inference(avatar_contradiction_clause,[],[f1404]) ).
fof(f1413,plain,
( ! [X0] : p2(X0,X0,X0)
| ~ spl0_23 ),
inference(forward_subsumption_resolution,[],[f941,f508]) ).
fof(f1420,plain,
( spl0_33
| ~ spl0_23 ),
inference(avatar_split_clause,[],[f1413,f507,f568]) ).
fof(f1916,definition,
( spl0_176
<=> ! [X2,X0,X1] :
( l1(X0,X1)
| ~ m0(X1,X0,X2)
| ~ p0(X2,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_176])],[avatar_definition]) ).
fof(f1917,plain,
( ! [X2,X0,X1] :
( ~ m0(X1,X0,X2)
| l1(X0,X1)
| ~ p0(X2,X0) )
| ~ spl0_176 ),
inference(avatar_component_clause,[],[f1916]) ).
fof(f1918,plain,
( spl0_20
| spl0_176 ),
inference(avatar_split_clause,[],[f41,f1916,f485]) ).
fof(f1961,plain,
( l1(b,e)
| ~ p0(c,b)
| ~ spl0_176 ),
inference(resolution,[],[f1917,f27]) ).
fof(f1967,plain,
( l1(b,e)
| ~ spl0_176 ),
inference(forward_subsumption_resolution,[],[f1961,f18]) ).
fof(f1968,plain,
( ~ n0(e,e)
| q3(e,b)
| ~ spl0_176 ),
inference(resolution,[],[f1967,f1385]) ).
fof(f1970,plain,
( q3(e,b)
| ~ spl0_176 ),
inference(forward_subsumption_resolution,[],[f1968,f30]) ).
fof(f1971,plain,
( $false
| spl0_126
| ~ spl0_176 ),
inference(forward_subsumption_resolution,[],[f1970,f1402]) ).
fof(f1972,plain,
( spl0_126
| ~ spl0_176 ),
inference(avatar_contradiction_clause,[],[f1971]) ).
cnf(s488,plain,
~ spl0_20,
inference(sat_conversion,[],[f490]) ).
cnf(s937,plain,
( ~ spl0_21
| spl0_23 ),
inference(sat_conversion,[],[f1033]) ).
cnf(s974,plain,
spl0_21,
inference(sat_conversion,[],[f1071]) ).
cnf(s1203,plain,
( spl0_31
| ~ spl0_33 ),
inference(sat_conversion,[],[f1393]) ).
cnf(s1211,plain,
( ~ spl0_125
| ~ spl0_126 ),
inference(sat_conversion,[],[f1403]) ).
cnf(s1215,plain,
( ~ spl0_31
| spl0_125 ),
inference(sat_conversion,[],[f1405]) ).
cnf(s1267,plain,
( ~ spl0_23
| spl0_33 ),
inference(sat_conversion,[],[f1420]) ).
cnf(s1628,plain,
( spl0_20
| spl0_176 ),
inference(sat_conversion,[],[f1918]) ).
cnf(s1669,plain,
( spl0_126
| ~ spl0_176 ),
inference(sat_conversion,[],[f1972]) ).
cnf(s1674,plain,
spl0_23,
inference(rat,[],[s937,s974]) ).
cnf(s1677,plain,
spl0_33,
inference(rat,[],[s1267,s1674]) ).
cnf(s1680,plain,
spl0_31,
inference(rat,[],[s1203,s1677]) ).
cnf(s1681,plain,
spl0_125,
inference(rat,[],[s1215,s1680]) ).
cnf(s1683,plain,
~ spl0_126,
inference(rat,[],[s1211,s1681]) ).
cnf(s1684,plain,
~ spl0_176,
inference(rat,[],[s1669,s1683]) ).
cnf(s1686,plain,
spl0_20,
inference(rat,[],[s1628,s1684]) ).
cnf(s1695,plain,
$false,
inference(rat,[],[s488,s1686]) ).
fof(f1973,plain,
$false,
inference(avatar_sat_refutation,[],[s1695]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN141-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n010.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 15:37:02 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.21/0.31 % (2013611)Will run a generic schedule for satisfiability detection.
% 0.21/0.31 % (2013620)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3631245618:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.31 % (2013617)% WARNING: option uhcvi not known.
% 0.21/0.31 % (2013616)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2745102183_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.31 % (2013618)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4238904181:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.31 % (2013617)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2232348247:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.31 % (2013619)dis+10_1_sil=32000:sp=arity:random_seed=4117078093:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.31 % (2013621)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4048815008:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.31 % (2013622)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1238717032:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.31 % Detected minimum model sizes of [1]
% 0.21/0.31 % Detected maximum model sizes of [5]
% 0.21/0.31 % TRYING [1]
% 0.21/0.31 % TRYING [2]
% 0.21/0.31 % TRYING [3]
% 0.21/0.31 % (2013618) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2013611-2013618"...
% 0.21/0.31 % (2013618)...printing done.
% 0.21/0.31 % (2013618)Refutation found. Thanks to Tanya!
% 0.21/0.31 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.31 % (2013618)------------------------------
% 0.21/0.31 % (2013618)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.31 % (2013618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.31 % (2013618)CaDiCaL version: 2.1.3
% 0.21/0.31 % (2013618)Termination reason: Refutation
% 0.21/0.31 % (2013618)Time elapsed: 0.031 s
% 0.21/0.31 % (2013618)Peak memory usage: 13 MB
% 0.21/0.31 % (2013618)Instructions burned: 44 (million)
% 0.21/0.31 % (2013611)Success in time 0.08 s
% 0.21/0.31 % Vampire exiting
%------------------------------------------------------------------------------