%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN301-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 : n009.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:14 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.29s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 50 ( 16 unt; 4 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 109 ( 54 ~; 51 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 5 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 54 ( 0 sgn 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0] : p0(b,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
fof(f17,axiom,
! [X0] : q0(X0,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
fof(f19,axiom,
! [X0,X1] : m0(X0,d,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
fof(f37,axiom,
n0(b,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
fof(f40,axiom,
! [X0,X1] :
( l1(X0,X0)
| ~ n0(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
fof(f163,axiom,
! [X0] :
( ~ p0(X0,X0)
| s1(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] :
( ~ l2(X0,X0)
| p3(X0,X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_246) ).
fof(f337,axiom,
! [X2,X3,X0,X1] :
( ~ p3(X1,X2,X3)
| s4(X0)
| ~ l1(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_299) ).
fof(f369,negated_conjecture,
~ s4(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f382,plain,
! [X0] : ~ q0(X0,d),
inference(consistent_polarity_flipping,[],[f17]) ).
fof(f383,plain,
! [X0,X1] : ~ m0(X0,d,X1),
inference(consistent_polarity_flipping,[],[f19]) ).
fof(f398,plain,
~ n0(b,a),
inference(consistent_polarity_flipping,[],[f37]) ).
fof(f401,plain,
! [X0,X1] :
( l1(X0,X0)
| n0(X1,X0) ),
inference(consistent_polarity_flipping,[],[f40]) ).
fof(f516,plain,
! [X2,X0,X1] :
( s1(X0)
| q0(X0,X1)
| ~ s1(X2) ),
inference(consistent_polarity_flipping,[],[f164]) ).
fof(f521,plain,
! [X2,X3,X0,X1] :
( l2(X0,X0)
| ~ p0(X1,X1)
| ~ s1(X2)
| m0(X3,X2,X0) ),
inference(consistent_polarity_flipping,[],[f171]) ).
fof(f899,definition,
( spl0_60
<=> ! [X1] : ~ s1(X1) ),
introduced(definition,[new_symbols(definition,[spl0_60])],[avatar_definition]) ).
fof(f900,plain,
( ! [X1] : ~ s1(X1)
| ~ spl0_60 ),
inference(avatar_component_clause,[],[f899]) ).
fof(f1438,definition,
( spl0_194
<=> ! [X1] : ~ p0(X1,X1) ),
introduced(definition,[new_symbols(definition,[spl0_194])],[avatar_definition]) ).
fof(f1439,plain,
( ! [X1] : ~ p0(X1,X1)
| ~ spl0_194 ),
inference(avatar_component_clause,[],[f1438]) ).
fof(f1441,definition,
( spl0_195
<=> ! [X2,X0,X3] :
( l2(X0,X0)
| ~ s1(X2)
| m0(X3,X2,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_195])],[avatar_definition]) ).
fof(f1442,plain,
( ! [X2,X3,X0] :
( l2(X0,X0)
| ~ s1(X2)
| m0(X3,X2,X0) )
| ~ spl0_195 ),
inference(avatar_component_clause,[],[f1441]) ).
fof(f1443,plain,
( spl0_194
| spl0_195 ),
inference(avatar_split_clause,[],[f521,f1441,f1438]) ).
fof(f1454,definition,
( spl0_198
<=> ! [X0,X1] :
( s1(X0)
| q0(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_198])],[avatar_definition]) ).
fof(f1455,plain,
( ! [X0,X1] :
( q0(X0,X1)
| s1(X0) )
| ~ spl0_198 ),
inference(avatar_component_clause,[],[f1454]) ).
fof(f1456,plain,
( spl0_60
| spl0_198 ),
inference(avatar_split_clause,[],[f516,f1454,f899]) ).
fof(f1880,plain,
( $false
| ~ spl0_194 ),
inference(resolution,[],[f1439,f14]) ).
fof(f1881,plain,
~ spl0_194,
inference(avatar_contradiction_clause,[],[f1880]) ).
fof(f1908,plain,
( ! [X0] : ~ p0(X0,X0)
| ~ spl0_60 ),
inference(forward_subsumption_resolution,[],[f163,f900]) ).
fof(f1909,plain,
( spl0_194
| ~ spl0_60 ),
inference(avatar_split_clause,[],[f1908,f899,f1438]) ).
fof(f1965,plain,
( ! [X0] : s1(X0)
| ~ spl0_198 ),
inference(resolution,[],[f1455,f382]) ).
fof(f2023,plain,
l1(a,a),
inference(resolution,[],[f401,f398]) ).
fof(f2082,plain,
( ! [X2,X3,X0] :
( l2(X0,X0)
| m0(X3,X2,X0) )
| ~ spl0_195
| ~ spl0_198 ),
inference(forward_subsumption_resolution,[],[f1442,f1965]) ).
fof(f2159,plain,
( ! [X1] : l2(X1,X1)
| ~ spl0_195
| ~ spl0_198 ),
inference(resolution,[],[f2082,f383]) ).
fof(f2227,plain,
( ! [X0] : p3(X0,X0,X0)
| ~ spl0_195
| ~ spl0_198 ),
inference(backward_subsumption_resolution,[],[f284,f2159]) ).
fof(f2413,plain,
( ! [X0,X1] :
( ~ l1(X0,X1)
| s4(X0) )
| ~ spl0_195
| ~ spl0_198 ),
inference(resolution,[],[f337,f2227]) ).
fof(f2789,plain,
( s4(a)
| ~ spl0_195
| ~ spl0_198 ),
inference(resolution,[],[f2413,f2023]) ).
fof(f2792,plain,
( $false
| ~ spl0_195
| ~ spl0_198 ),
inference(forward_subsumption_resolution,[],[f2789,f369]) ).
fof(f2793,plain,
( ~ spl0_195
| ~ spl0_198 ),
inference(avatar_contradiction_clause,[],[f2792]) ).
cnf(s89,plain,
( spl0_194
| spl0_195 ),
inference(sat_conversion,[],[f1443]) ).
cnf(s91,plain,
( spl0_60
| spl0_198 ),
inference(sat_conversion,[],[f1456]) ).
cnf(s176,plain,
~ spl0_194,
inference(sat_conversion,[],[f1881]) ).
cnf(s189,plain,
( ~ spl0_60
| spl0_194 ),
inference(sat_conversion,[],[f1909]) ).
cnf(s360,plain,
( ~ spl0_195
| ~ spl0_198 ),
inference(sat_conversion,[],[f2793]) ).
cnf(s368,plain,
~ spl0_60,
inference(rat,[],[s189,s176]) ).
cnf(s437,plain,
spl0_198,
inference(rat,[],[s91,s368]) ).
cnf(s438,plain,
~ spl0_195,
inference(rat,[],[s360,s437]) ).
cnf(s444,plain,
$false,
inference(rat,[],[s89,s438,s176]) ).
fof(f2796,plain,
$false,
inference(avatar_sat_refutation,[],[s444]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN301-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.19 % Computer : n009.cluster.edu
% 0.11/0.19 % Model : x86_64 x86_64
% 0.11/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19 % Memory : 8046.5625MB
% 0.11/0.19 % OS : Linux 6.8.0-71-generic
% 0.11/0.19 % CPULimit : 300
% 0.11/0.19 % WCLimit : 300
% 0.11/0.19 % DateTime : Mon Sep 28 15:41:00 UTC 2026
% 0.11/0.19 % CPUTime :
% 0.11/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.22 Running first-order model finding
% 0.11/0.22 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.11/0.29 % (3171017)Will run a generic schedule for satisfiability detection.
% 0.11/0.29 % (3171023)% WARNING: option uhcvi not known.
% 0.11/0.29 % (3171023)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1265733111:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.29 % (3171022)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=576251920_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.29 % (3171024)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3635348314:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.29 % (3171025)dis+10_1_sil=32000:sp=arity:random_seed=2127497805:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.29 % (3171026)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3113733374:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.29 % (3171028)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4124448881:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.29 % (3171023) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3171017-3171023"...
% 0.11/0.29 % (3171023)...printing done.
% 0.11/0.29 % (3171023)Refutation found. Thanks to Tanya!
% 0.11/0.29 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.29 % (3171023)------------------------------
% 0.11/0.29 % (3171023)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.29 % (3171023)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.29 % (3171023)CaDiCaL version: 2.1.3
% 0.11/0.29 % (3171023)Termination reason: Refutation
% 0.11/0.29 % (3171023)Time elapsed: 0.016 s
% 0.11/0.29 % (3171023)Peak memory usage: 13 MB
% 0.11/0.29 % (3171023)Instructions burned: 38 (million)
% 0.11/0.29 % (3171017)Success in time 0.059 s
% 0.11/0.29 % Vampire exiting
%------------------------------------------------------------------------------