%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN194-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 : n026.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:59 PM UTC 2026
% Result : Unsatisfiable 0.21s 0.30s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of formulae : 52 ( 15 unt; 4 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 94 ( 48 ~; 42 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 5 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(f3,axiom,
n0(d,e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_3) ).
fof(f14,axiom,
! [X0] : p0(b,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
fof(f26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
fof(f32,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
fof(f39,axiom,
! [X0,X1] :
( ~ n0(X1,X0)
| k1(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
fof(f40,axiom,
! [X0,X1] :
( ~ n0(X1,X0)
| l1(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
fof(f123,axiom,
! [X0,X1] :
( ~ p0(X1,X0)
| p1(X0,X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
fof(f175,axiom,
! [X2,X0,X1] :
( ~ p1(X1,X2,X0)
| n2(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
fof(f212,axiom,
! [X0] :
( p2(X0,X0,X0)
| ~ n2(X0)
| ~ k1(e) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_174) ).
fof(f278,axiom,
! [X2,X0,X1] :
( ~ p2(X1,X2,X0)
| n3(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_240) ).
fof(f282,axiom,
! [X0] :
( p3(X0,X0,X0)
| ~ n2(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_244) ).
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(f365,axiom,
! [X0,X1] :
( r5(X0,X1)
| ~ s4(X0)
| ~ k0(b)
| ~ n3(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_327) ).
fof(f369,negated_conjecture,
~ r5(c,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f413,plain,
k1(e),
inference(resolution,[],[f39,f3]) ).
fof(f472,plain,
l1(c,c),
inference(resolution,[],[f40,f26]) ).
fof(f490,definition,
( spl0_21
<=> ! [X0] : p1(X0,X0,X0) ),
introduced(definition,[new_symbols(definition,[spl0_21])],[avatar_definition]) ).
fof(f491,plain,
( ! [X0] : p1(X0,X0,X0)
| ~ spl0_21 ),
inference(avatar_component_clause,[],[f490]) ).
fof(f505,definition,
( spl0_23
<=> ! [X0] : n2(X0) ),
introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).
fof(f506,plain,
( ! [X0] : n2(X0)
| ~ spl0_23 ),
inference(avatar_component_clause,[],[f505]) ).
fof(f554,definition,
( spl0_31
<=> ! [X0] : n3(X0) ),
introduced(definition,[new_symbols(definition,[spl0_31])],[avatar_definition]) ).
fof(f555,plain,
( ! [X0] : n3(X0)
| ~ spl0_31 ),
inference(avatar_component_clause,[],[f554]) ).
fof(f566,definition,
( spl0_33
<=> ! [X0] : p2(X0,X0,X0) ),
introduced(definition,[new_symbols(definition,[spl0_33])],[avatar_definition]) ).
fof(f567,plain,
( ! [X0] : p2(X0,X0,X0)
| ~ spl0_33 ),
inference(avatar_component_clause,[],[f566]) ).
fof(f644,plain,
( ! [X0] : n2(X0)
| ~ spl0_21 ),
inference(resolution,[],[f491,f175]) ).
fof(f932,plain,
! [X0] :
( p2(X0,X0,X0)
| ~ n2(X0) ),
inference(forward_subsumption_resolution,[],[f212,f413]) ).
fof(f951,plain,
( ! [X0] : p2(X0,X0,X0)
| ~ spl0_23 ),
inference(forward_subsumption_resolution,[],[f932,f506]) ).
fof(f1028,plain,
( spl0_33
| ~ spl0_23 ),
inference(avatar_split_clause,[],[f951,f505,f566]) ).
fof(f1030,plain,
! [X0] :
( p3(X0,X0,X0)
| ~ n2(X0) ),
inference(global_subsumption,[],[f282]) ).
fof(f1032,plain,
( spl0_23
| ~ spl0_21 ),
inference(avatar_split_clause,[],[f644,f490,f505]) ).
fof(f1043,plain,
( ! [X0] : n3(X0)
| ~ spl0_33 ),
inference(resolution,[],[f567,f278]) ).
fof(f1180,plain,
! [X0] : p1(X0,X0,X0),
inference(resolution,[],[f123,f14]) ).
fof(f1182,plain,
spl0_21,
inference(avatar_split_clause,[],[f1180,f490]) ).
fof(f1199,plain,
! [X0,X1] :
( s4(X0)
| ~ l1(X0,X1)
| ~ n2(X1) ),
inference(resolution,[],[f337,f1030]) ).
fof(f1200,plain,
( ! [X0,X1] :
( ~ l1(X0,X1)
| s4(X0) )
| ~ spl0_23 ),
inference(forward_subsumption_resolution,[],[f1199,f506]) ).
fof(f1213,plain,
! [X0,X1] :
( r5(X0,X1)
| ~ s4(X0)
| ~ n3(X1) ),
inference(forward_subsumption_resolution,[],[f365,f32]) ).
fof(f1218,plain,
( spl0_31
| ~ spl0_33 ),
inference(avatar_split_clause,[],[f1043,f566,f554]) ).
fof(f1219,plain,
( ! [X0,X1] :
( r5(X0,X1)
| ~ s4(X0) )
| ~ spl0_31 ),
inference(forward_subsumption_resolution,[],[f1213,f555]) ).
fof(f1223,plain,
( ~ s4(c)
| ~ spl0_31 ),
inference(resolution,[],[f1219,f369]) ).
fof(f1232,plain,
( s4(c)
| ~ spl0_23 ),
inference(resolution,[],[f1200,f472]) ).
fof(f1233,plain,
( $false
| ~ spl0_23
| ~ spl0_31 ),
inference(forward_subsumption_resolution,[],[f1232,f1223]) ).
fof(f1234,plain,
( ~ spl0_23
| ~ spl0_31 ),
inference(avatar_contradiction_clause,[],[f1233]) ).
cnf(s953,plain,
( ~ spl0_23
| spl0_33 ),
inference(sat_conversion,[],[f1028]) ).
cnf(s970,plain,
( ~ spl0_21
| spl0_23 ),
inference(sat_conversion,[],[f1032]) ).
cnf(s1109,plain,
spl0_21,
inference(sat_conversion,[],[f1182]) ).
cnf(s1157,plain,
( spl0_31
| ~ spl0_33 ),
inference(sat_conversion,[],[f1218]) ).
cnf(s1176,plain,
( ~ spl0_23
| ~ spl0_31 ),
inference(sat_conversion,[],[f1234]) ).
cnf(s1182,plain,
spl0_23,
inference(rat,[],[s970,s1109]) ).
cnf(s1183,plain,
~ spl0_31,
inference(rat,[],[s1176,s1182]) ).
cnf(s1184,plain,
~ spl0_33,
inference(rat,[],[s1157,s1183]) ).
cnf(s1185,plain,
$false,
inference(rat,[],[s953,s1184,s1182]) ).
fof(f1235,plain,
$false,
inference(avatar_sat_refutation,[],[s1185]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN194-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.09/0.19 % Computer : n026.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 15:40:41 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.21/0.30 % (3953754)Will run a generic schedule for satisfiability detection.
% 0.21/0.30 % (3953759)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3054998964_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.30 % (3953760)% WARNING: option uhcvi not known.
% 0.21/0.30 % (3953761)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1834946212:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.30 % (3953760)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4113061664:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.30 % (3953762)dis+10_1_sil=32000:sp=arity:random_seed=3492306617:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.30 % (3953763)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3951107289:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.30 % (3953764)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3481737696:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.30 % Detected minimum model sizes of [1]
% 0.21/0.30 % Detected maximum model sizes of [5]
% 0.21/0.30 % TRYING [1]
% 0.21/0.30 % TRYING [2]
% 0.21/0.30 % TRYING [3]
% 0.21/0.30 % TRYING [4]
% 0.21/0.30 % (3953765)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3110381677:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.30 % (3953761) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3953754-3953761"...
% 0.21/0.30 % (3953764) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3953754-3953764"...
% 0.21/0.30 % (3953762) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3953754-3953762"...
% 0.21/0.30 % (3953761)...printing done.
% 0.21/0.30 % (3953762)...printing done.
% 0.21/0.30 % (3953764)...printing done.
% 0.21/0.30 % TRYING [5]
% 0.21/0.30 % (3953761)Refutation found. Thanks to Tanya!
% 0.21/0.30 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.30 % (3953761)------------------------------
% 0.21/0.30 % (3953761)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30 % (3953761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30 % (3953761)CaDiCaL version: 2.1.3
% 0.21/0.30 % (3953761)Termination reason: Refutation
% 0.21/0.30 % (3953761)Time elapsed: 0.022 s
% 0.21/0.30 % (3953761)Peak memory usage: 13 MB
% 0.21/0.30 % (3953761)Instructions burned: 31 (million)
% 0.21/0.30 % (3953754)Success in time 0.064 s
% 0.21/0.30 % Vampire exiting
%------------------------------------------------------------------------------