%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN204-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 : n001.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.20s 0.33s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 46 ( 17 unt; 1 def)
% Number of atoms : 100 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 111 ( 57 ~; 53 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 2 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 51 ( 0 sgn 51 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
fof(f14,axiom,
! [X0] : p0(b,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
fof(f19,axiom,
! [X0,X1] : m0(X0,d,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
fof(f20,axiom,
l0(a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
fof(f32,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
fof(f37,axiom,
n0(b,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
fof(f40,axiom,
! [X0,X1] :
( ~ n0(X1,X0)
| l1(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
fof(f88,axiom,
! [X0,X1] :
( n1(X0,X1,X0)
| ~ s0(b)
| ~ l0(X0)
| ~ p0(b,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_050) ).
fof(f92,axiom,
! [X2,X0,X1] :
( ~ n1(X0,X1,X0)
| ~ l0(X2)
| ~ l1(X2,X0)
| n1(X0,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_054) ).
fof(f123,axiom,
! [X0,X1] :
( ~ p0(X1,X0)
| p1(X0,X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
fof(f163,axiom,
! [X0] :
( ~ p0(X0,X0)
| s1(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
fof(f215,axiom,
! [X0,X1] :
( q2(X0,X1,X1)
| ~ k0(X1)
| ~ p1(X0,X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_177) ).
fof(f219,axiom,
! [X0] :
( q2(X0,X0,X0)
| ~ p1(X0,X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_181) ).
fof(f220,axiom,
! [X2,X0,X1] :
( ~ q2(X1,X2,X0)
| ~ p1(X0,X0,X2)
| ~ n1(X1,X0,X2)
| q2(X0,X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_182) ).
fof(f227,axiom,
! [X0] :
( s2(X0)
| ~ q2(b,X0,b)
| ~ s1(b) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_189) ).
fof(f311,axiom,
! [X2,X3,X0,X1] :
( ~ q2(X2,X0,X2)
| s3(X0,X1)
| ~ s2(X0)
| ~ m0(X2,X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_273) ).
fof(f369,negated_conjecture,
~ s3(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f451,plain,
s1(b),
inference(resolution,[],[f163,f14]) ).
fof(f469,plain,
l1(a,a),
inference(resolution,[],[f40,f37]) ).
fof(f483,definition,
( spl0_19
<=> ! [X0] : p1(X0,X0,X0) ),
introduced(definition,[new_symbols(definition,[spl0_19])],[avatar_definition]) ).
fof(f484,plain,
( ! [X0] : p1(X0,X0,X0)
| ~ spl0_19 ),
inference(avatar_component_clause,[],[f483]) ).
fof(f1015,plain,
! [X0] :
( ~ q2(b,X0,b)
| s2(X0) ),
inference(global_subsumption,[],[f227,f451]) ).
fof(f1131,plain,
! [X0] : p1(X0,X0,X0),
inference(resolution,[],[f123,f14]) ).
fof(f1133,plain,
spl0_19,
inference(avatar_split_clause,[],[f1131,f483]) ).
fof(f1332,plain,
( ! [X0,X1] :
( q2(X0,X1,X1)
| ~ k0(X1) )
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f215,f484]) ).
fof(f1364,plain,
( ! [X0] : q2(X0,X0,X0)
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f219,f484]) ).
fof(f2067,plain,
( ! [X2,X0,X1] :
( ~ m0(X0,X2,X1)
| ~ s2(X0)
| s3(X0,X1) )
| ~ spl0_19 ),
inference(resolution,[],[f311,f1364]) ).
fof(f2086,plain,
( ! [X0,X1] :
( s3(X0,X1)
| ~ s2(X0) )
| ~ spl0_19 ),
inference(resolution,[],[f2067,f19]) ).
fof(f2101,plain,
( ~ s2(a)
| ~ spl0_19 ),
inference(resolution,[],[f2086,f369]) ).
fof(f2243,plain,
! [X0,X1] :
( n1(X0,X1,X0)
| ~ l0(X0)
| ~ p0(b,X1) ),
inference(forward_subsumption_resolution,[],[f88,f5]) ).
fof(f2245,plain,
! [X0,X1] :
( n1(X0,X1,X0)
| ~ l0(X0) ),
inference(forward_subsumption_resolution,[],[f2243,f14]) ).
fof(f2344,plain,
( ! [X0,X1] :
( ~ p1(X0,X0,X0)
| ~ n1(X1,X0,X0)
| q2(X0,X1,X0)
| ~ k0(X0) )
| ~ spl0_19 ),
inference(resolution,[],[f220,f1332]) ).
fof(f2349,plain,
( ! [X0,X1] :
( ~ n1(X1,X0,X0)
| q2(X0,X1,X0)
| ~ k0(X0) )
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f2344,f484]) ).
fof(f2863,plain,
! [X2,X0,X1] :
( ~ l1(X0,X1)
| ~ l0(X0)
| n1(X1,X2,X2)
| ~ l0(X1) ),
inference(resolution,[],[f92,f2245]) ).
fof(f2956,plain,
! [X0] :
( ~ l0(a)
| n1(a,X0,X0)
| ~ l0(a) ),
inference(resolution,[],[f2863,f469]) ).
fof(f2963,plain,
! [X0] :
( ~ l0(a)
| n1(a,X0,X0) ),
inference(duplicate_literal_removal,[],[f2956]) ).
fof(f2969,plain,
! [X0] : n1(a,X0,X0),
inference(forward_subsumption_resolution,[],[f2963,f20]) ).
fof(f2977,plain,
( ! [X0] :
( q2(X0,a,X0)
| ~ k0(X0) )
| ~ spl0_19 ),
inference(resolution,[],[f2969,f2349]) ).
fof(f2987,plain,
( ~ k0(b)
| s2(a)
| ~ spl0_19 ),
inference(resolution,[],[f2977,f1015]) ).
fof(f2992,plain,
( s2(a)
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f2987,f32]) ).
fof(f2993,plain,
( $false
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f2992,f2101]) ).
fof(f2994,plain,
~ spl0_19,
inference(avatar_contradiction_clause,[],[f2993]) ).
cnf(s1026,plain,
spl0_19,
inference(sat_conversion,[],[f1133]) ).
cnf(s2242,plain,
~ spl0_19,
inference(sat_conversion,[],[f2994]) ).
cnf(s2245,plain,
$false,
inference(rat,[],[s1026,s2242]) ).
fof(f2995,plain,
$false,
inference(avatar_sat_refutation,[],[s2245]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN204-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 % Computer : n001.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 15:44:18 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/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.20/0.33 % (441382)Will run a generic schedule for satisfiability detection.
% 0.20/0.33 % (441397)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=754242899:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.33 % (441394)% WARNING: option uhcvi not known.
% 0.20/0.33 % (441396)dis+10_1_sil=32000:sp=arity:random_seed=672633198:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.33 % (441393)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=166966069_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.33 % (441394)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1513435882:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.33 % (441395)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3822712848:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.33 % (441398)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3561546007:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.33 % (441399)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2244450940:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.33 % Detected minimum model sizes of [1]
% 0.20/0.33 % Detected maximum model sizes of [5]
% 0.20/0.33 % TRYING [1]
% 0.20/0.33 % TRYING [2]
% 0.20/0.33 % TRYING [3]
% 0.20/0.33 % (441397)Instruction limit reached!
% 0.20/0.33 % (441397)------------------------------
% 0.20/0.33 % (441397)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.33 % (441397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.33 % (441397)CaDiCaL version: 2.1.3
% 0.20/0.33 % (441397)Termination reason: Instruction limit
% 0.20/0.33 % (441397)Termination phase: Saturation
% 0.20/0.33 % (441397)Time elapsed: 0.040 s
% 0.20/0.33 % (441397)Peak memory usage: 13 MB
% 0.20/0.33 % (441397)Instructions burned: 116 (million)
% 0.20/0.33 % TRYING [4]
% 0.20/0.33 % (441407)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3544407080:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.33 % (441395) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-441382-441395"...
% 0.20/0.33 % (441395)...printing done.
% 0.20/0.33 % (441395)Refutation found. Thanks to Tanya!
% 0.20/0.33 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.33 % (441395)------------------------------
% 0.20/0.33 % (441395)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.33 % (441395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.33 % (441395)CaDiCaL version: 2.1.3
% 0.20/0.33 % (441395)Termination reason: Refutation
% 0.20/0.33 % (441395)Time elapsed: 0.049 s
% 0.20/0.33 % (441395)Peak memory usage: 14 MB
% 0.20/0.33 % (441395)Instructions burned: 72 (million)
% 0.20/0.33 % (441382)Success in time 0.098 s
% 0.20/0.33 % Vampire exiting
%------------------------------------------------------------------------------