%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN121-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 : 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:06:49 PM UTC 2026
% Result : Unsatisfiable 0.34s 0.46s
% Output : Refutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 52 ( 17 unt; 6 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 111 ( 57 ~; 48 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 7 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 43 ( 0 sgn 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
n0(e,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_11) ).
fof(f14,axiom,
! [X0] : p0(b,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
fof(f17,axiom,
! [X0] : q0(X0,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
fof(f19,axiom,
! [X0,X1] : m0(X0,d,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
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(f169,axiom,
! [X0,X1] :
( l2(X0,X1)
| ~ s1(X0)
| ~ n0(e,X1)
| ~ l2(X1,X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_133) ).
fof(f369,negated_conjecture,
~ l2(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f447,definition,
( spl0_12
<=> ! [X0] : s1(X0) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f448,plain,
( ! [X0] : s1(X0)
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f447]) ).
fof(f450,definition,
( spl0_13
<=> ! [X0] : ~ p0(X0,X0) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f451,plain,
( ! [X0] : ~ p0(X0,X0)
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f450]) ).
fof(f452,plain,
s1(b),
inference(resolution,[],[f163,f14]) ).
fof(f453,plain,
( $false
| ~ spl0_13 ),
inference(resolution,[],[f451,f14]) ).
fof(f454,plain,
~ spl0_13,
inference(avatar_contradiction_clause,[],[f453]) ).
fof(f1072,definition,
( spl0_89
<=> ! [X2] : ~ s1(X2) ),
introduced(definition,[new_symbols(definition,[spl0_89])],[avatar_definition]) ).
fof(f1073,plain,
( ! [X2] : ~ s1(X2)
| ~ spl0_89 ),
inference(avatar_component_clause,[],[f1072]) ).
fof(f1075,definition,
( spl0_90
<=> ! [X0,X1] :
( s1(X0)
| ~ q0(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_90])],[avatar_definition]) ).
fof(f1076,plain,
( ! [X0,X1] :
( ~ q0(X0,X1)
| s1(X0) )
| ~ spl0_90 ),
inference(avatar_component_clause,[],[f1075]) ).
fof(f1077,plain,
( spl0_89
| spl0_90 ),
inference(avatar_split_clause,[],[f164,f1075,f1072]) ).
fof(f1078,plain,
( $false
| ~ spl0_89 ),
inference(resolution,[],[f1073,f452]) ).
fof(f1079,plain,
~ spl0_89,
inference(avatar_contradiction_clause,[],[f1078]) ).
fof(f1082,plain,
( ! [X0] : s1(X0)
| ~ spl0_90 ),
inference(resolution,[],[f1076,f17]) ).
fof(f1091,plain,
( spl0_12
| ~ spl0_90 ),
inference(avatar_split_clause,[],[f1082,f1075,f447]) ).
fof(f1962,plain,
( ! [X0,X1] :
( ~ l2(X1,X1)
| ~ n0(e,X1)
| l2(X0,X1) )
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[],[f169,f448]) ).
fof(f1964,plain,
( ! [X2,X3,X0,X1] :
( l2(X0,X0)
| ~ p0(X1,X1)
| ~ m0(X3,X2,X0) )
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[],[f171,f448]) ).
fof(f1998,definition,
( spl0_179
<=> ! [X0] : l2(X0,X0) ),
introduced(definition,[new_symbols(definition,[spl0_179])],[avatar_definition]) ).
fof(f1999,plain,
( ! [X0] : l2(X0,X0)
| ~ spl0_179 ),
inference(avatar_component_clause,[],[f1998]) ).
fof(f2001,definition,
( spl0_180
<=> ! [X2,X0,X3] :
( l2(X0,X0)
| ~ m0(X3,X2,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_180])],[avatar_definition]) ).
fof(f2002,plain,
( ! [X2,X3,X0] :
( ~ m0(X3,X2,X0)
| l2(X0,X0) )
| ~ spl0_180 ),
inference(avatar_component_clause,[],[f2001]) ).
fof(f2003,plain,
( spl0_13
| spl0_180
| ~ spl0_12 ),
inference(avatar_split_clause,[],[f1964,f447,f2001,f450]) ).
fof(f2005,plain,
( ! [X0,X1] :
( ~ n0(e,X0)
| l2(X1,X0) )
| ~ spl0_12
| ~ spl0_179 ),
inference(resolution,[],[f1999,f1962]) ).
fof(f2007,plain,
( ! [X0] : l2(X0,b)
| ~ spl0_12
| ~ spl0_179 ),
inference(resolution,[],[f2005,f11]) ).
fof(f2009,plain,
( $false
| ~ spl0_12
| ~ spl0_179 ),
inference(resolution,[],[f2007,f369]) ).
fof(f2011,plain,
( ~ spl0_12
| ~ spl0_179 ),
inference(avatar_contradiction_clause,[],[f2009]) ).
fof(f2012,plain,
( ! [X0] : l2(X0,X0)
| ~ spl0_180 ),
inference(resolution,[],[f2002,f19]) ).
fof(f2022,plain,
( spl0_179
| ~ spl0_180 ),
inference(avatar_split_clause,[],[f2012,f2001,f1998]) ).
cnf(s452,plain,
~ spl0_13,
inference(sat_conversion,[],[f454]) ).
cnf(s957,plain,
( spl0_89
| spl0_90 ),
inference(sat_conversion,[],[f1077]) ).
cnf(s961,plain,
~ spl0_89,
inference(sat_conversion,[],[f1079]) ).
cnf(s975,plain,
( spl0_12
| ~ spl0_90 ),
inference(sat_conversion,[],[f1091]) ).
cnf(s1667,plain,
( ~ spl0_12
| spl0_13
| spl0_180 ),
inference(sat_conversion,[],[f2003]) ).
cnf(s1677,plain,
( ~ spl0_12
| ~ spl0_179 ),
inference(sat_conversion,[],[f2011]) ).
cnf(s1690,plain,
( spl0_179
| ~ spl0_180 ),
inference(sat_conversion,[],[f2022]) ).
cnf(s1696,plain,
spl0_90,
inference(rat,[],[s957,s961]) ).
cnf(s1697,plain,
spl0_12,
inference(rat,[],[s975,s1696]) ).
cnf(s1699,plain,
~ spl0_179,
inference(rat,[],[s1677,s1697]) ).
cnf(s1700,plain,
~ spl0_180,
inference(rat,[],[s1690,s1699]) ).
cnf(s1701,plain,
spl0_13,
inference(rat,[],[s1667,s1697,s1700]) ).
cnf(s1714,plain,
$false,
inference(rat,[],[s452,s1701]) ).
fof(f2023,plain,
$false,
inference(avatar_sat_refutation,[],[s1714]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN121-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.31 % Computer : n006.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8046.5625MB
% 0.12/0.31 % OS : Linux 6.8.0-71-generic
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Mon Sep 28 15:35:55 UTC 2026
% 0.30/0.31 % CPUTime :
% 0.30/0.31 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.30/0.37 Running first-order model finding
% 0.30/0.37 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.34/0.46 % (4060383)Will run a generic schedule for satisfiability detection.
% 0.34/0.46 % (4060390)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2611303055:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.34/0.46 % (4060389)% WARNING: option uhcvi not known.
% 0.34/0.46 % (4060391)dis+10_1_sil=32000:sp=arity:random_seed=2088823527:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.34/0.46 % (4060388)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3287268293_2999 on theBenchmark for (2999ds/0Mi)
% 0.34/0.46 % (4060389)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4018490487:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.34/0.46 % (4060392)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1743725815:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.34/0.46 % (4060394)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2279416784:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.34/0.46 % (4060393)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1029809755:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.34/0.46 % (4060390) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4060383-4060390"...
% 0.34/0.46 % (4060390)...printing done.
% 0.34/0.46 % (4060390)Refutation found. Thanks to Tanya!
% 0.34/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.34/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.34/0.46 % (4060390)------------------------------
% 0.34/0.46 % (4060390)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.46 % (4060390)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.46 % (4060390)CaDiCaL version: 2.1.3
% 0.34/0.46 % (4060390)Termination reason: Refutation
% 0.34/0.46 % (4060390)Time elapsed: 0.029 s
% 0.34/0.46 % (4060390)Peak memory usage: 13 MB
% 0.34/0.46 % (4060390)Instructions burned: 46 (million)
% 0.34/0.46 % (4060383)Success in time 0.074 s
% 0.34/0.46 % Vampire exiting
%------------------------------------------------------------------------------