%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYN191-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 01:49:52 PM UTC 2026
% Result : Unsatisfiable 2.08s 0.67s
% Output : Refutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 22
% Syntax : Number of formulae : 73 ( 21 unt; 8 def)
% Number of atoms : 155 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 170 ( 88 ~; 74 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 18 ( 17 usr; 9 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 74 ( 0 sgn 74 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
r0(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(f10,axiom,
p0(b,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
fof(f12,axiom,
! [X0] : m0(a,X0,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).
fof(f14,axiom,
! [X0] : p0(b,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).
fof(f19,axiom,
! [X0,X1] : m0(X0,d,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_19) ).
fof(f20,axiom,
l0(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_20) ).
fof(f41,axiom,
! [X2,X3,X0,X1] :
( l1(X0,X1)
| ~ p0(X2,X0)
| ~ r0(X3)
| ~ m0(X1,X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_003) ).
fof(f45,axiom,
! [X2,X0,X1] :
( ~ p0(X2,X1)
| m1(X0,X1,X0)
| ~ r0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_007) ).
fof(f102,axiom,
! [X2,X0,X1] :
( p1(X0,X0,X0)
| ~ m0(X1,X2,b)
| ~ l0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_064) ).
fof(f120,axiom,
! [X2,X3,X0,X1] :
( ~ p1(X2,X0,X3)
| ~ m0(X2,X0,X3)
| p1(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_082) ).
fof(f184,axiom,
! [X2,X3,X0,X1] :
( ~ p2(X0,X1,X0)
| ~ p1(X0,X2,X3)
| ~ l1(X2,X3)
| p2(X0,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_146) ).
fof(f214,axiom,
! [X0,X1] :
( ~ m1(X1,X0,X1)
| p2(X0,X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_176) ).
fof(f305,axiom,
! [X2,X0,X1] :
( ~ p2(X0,X2,X1)
| r3(X0,X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_267) ).
fof(f369,negated_conjecture,
~ r3(c,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f371,definition,
( spl0_1
<=> ! [X3] : ~ r0(X3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f372,plain,
( ! [X3] : ~ r0(X3)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f371]) ).
fof(f374,definition,
( spl0_2
<=> ! [X2,X0,X1] :
( l1(X0,X1)
| ~ m0(X1,X0,X2)
| ~ p0(X2,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f375,plain,
( ! [X2,X0,X1] :
( ~ m0(X1,X0,X2)
| l1(X0,X1)
| ~ p0(X2,X0) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f374]) ).
fof(f376,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f41,f374,f371]) ).
fof(f424,definition,
( spl0_14
<=> ! [X2,X1] : ~ m0(X1,X2,b) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f425,plain,
( ! [X2,X1] : ~ m0(X1,X2,b)
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f424]) ).
fof(f427,definition,
( spl0_15
<=> ! [X0] :
( p1(X0,X0,X0)
| ~ l0(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
fof(f428,plain,
( ! [X0] :
( p1(X0,X0,X0)
| ~ l0(X0) )
| ~ spl0_15 ),
inference(avatar_component_clause,[],[f427]) ).
fof(f429,plain,
( spl0_14
| spl0_15 ),
inference(avatar_split_clause,[],[f102,f427,f424]) ).
fof(f591,plain,
( $false
| ~ spl0_14 ),
inference(resolution,[],[f425,f19]) ).
fof(f592,plain,
~ spl0_14,
inference(avatar_contradiction_clause,[],[f591]) ).
fof(f751,plain,
! [X0,X1] :
( m1(X0,X1,X0)
| ~ r0(X0) ),
inference(resolution,[],[f45,f14]) ).
fof(f767,plain,
( ! [X0,X1] :
( l1(d,X0)
| ~ p0(X1,d) )
| ~ spl0_2 ),
inference(resolution,[],[f375,f19]) ).
fof(f829,definition,
( spl0_63
<=> ! [X1] : ~ p0(X1,d) ),
introduced(definition,[new_symbols(definition,[spl0_63])],[avatar_definition]) ).
fof(f830,plain,
( ! [X1] : ~ p0(X1,d)
| ~ spl0_63 ),
inference(avatar_component_clause,[],[f829]) ).
fof(f832,definition,
( spl0_64
<=> ! [X0] : l1(d,X0) ),
introduced(definition,[new_symbols(definition,[spl0_64])],[avatar_definition]) ).
fof(f833,plain,
( ! [X0] : l1(d,X0)
| ~ spl0_64 ),
inference(avatar_component_clause,[],[f832]) ).
fof(f835,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f372,f9]) ).
fof(f838,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f835]) ).
fof(f839,plain,
( spl0_63
| spl0_64
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f767,f374,f832,f829]) ).
fof(f885,plain,
( ! [X0,X1] :
( ~ m0(X0,X0,X0)
| p1(X0,X1,X0)
| ~ l0(X0) )
| ~ spl0_15 ),
inference(resolution,[],[f120,f428]) ).
fof(f902,plain,
( $false
| ~ spl0_63 ),
inference(resolution,[],[f830,f10]) ).
fof(f905,plain,
~ spl0_63,
inference(avatar_contradiction_clause,[],[f902]) ).
fof(f1099,plain,
! [X0,X1] :
( p2(X1,X0,X1)
| ~ r0(X0) ),
inference(resolution,[],[f751,f214]) ).
fof(f1147,plain,
! [X2,X3,X0,X1] :
( ~ p1(X1,X2,X3)
| ~ r0(X0)
| ~ l1(X2,X3)
| p2(X1,X0,X0) ),
inference(resolution,[],[f1099,f184]) ).
fof(f1253,plain,
( ! [X0] :
( p1(a,X0,a)
| ~ l0(a) )
| ~ spl0_15 ),
inference(resolution,[],[f885,f12]) ).
fof(f1254,plain,
( ! [X0] : p1(a,X0,a)
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f1253,f20]) ).
fof(f1269,plain,
( ! [X0,X1] :
( ~ m0(a,X0,a)
| p1(X0,X1,a) )
| ~ spl0_15 ),
inference(resolution,[],[f1254,f120]) ).
fof(f1270,plain,
( ! [X0,X1] : p1(X0,X1,a)
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f1269,f12]) ).
fof(f1488,plain,
( ! [X2,X0,X1] :
( ~ r0(X0)
| ~ l1(X1,a)
| p2(X2,X0,X0) )
| ~ spl0_15 ),
inference(resolution,[],[f1147,f1270]) ).
fof(f1498,definition,
( spl0_110
<=> ! [X1] : ~ l1(X1,a) ),
introduced(definition,[new_symbols(definition,[spl0_110])],[avatar_definition]) ).
fof(f1499,plain,
( ! [X1] : ~ l1(X1,a)
| ~ spl0_110 ),
inference(avatar_component_clause,[],[f1498]) ).
fof(f1519,definition,
( spl0_115
<=> ! [X2,X0] :
( ~ r0(X0)
| p2(X2,X0,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_115])],[avatar_definition]) ).
fof(f1520,plain,
( ! [X2,X0] :
( p2(X2,X0,X0)
| ~ r0(X0) )
| ~ spl0_115 ),
inference(avatar_component_clause,[],[f1519]) ).
fof(f1521,plain,
( spl0_110
| spl0_115
| ~ spl0_15 ),
inference(avatar_split_clause,[],[f1488,f427,f1519,f1498]) ).
fof(f1523,plain,
( $false
| ~ spl0_64
| ~ spl0_110 ),
inference(resolution,[],[f1499,f833]) ).
fof(f1524,plain,
( ~ spl0_64
| ~ spl0_110 ),
inference(avatar_contradiction_clause,[],[f1523]) ).
fof(f1572,plain,
( ! [X0,X1] :
( r3(X1,X0,X1)
| ~ r0(X0) )
| ~ spl0_115 ),
inference(resolution,[],[f1520,f305]) ).
fof(f1670,plain,
( ~ r0(b)
| ~ spl0_115 ),
inference(resolution,[],[f1572,f369]) ).
fof(f1674,plain,
( $false
| ~ spl0_115 ),
inference(forward_subsumption_resolution,[],[f1670,f9]) ).
fof(f1675,plain,
~ spl0_115,
inference(avatar_contradiction_clause,[],[f1674]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f376]) ).
cnf(s7,plain,
( spl0_14
| spl0_15 ),
inference(sat_conversion,[],[f429]) ).
cnf(s29,plain,
~ spl0_14,
inference(sat_conversion,[],[f592]) ).
cnf(s50,plain,
~ spl0_1,
inference(sat_conversion,[],[f838]) ).
cnf(s51,plain,
( ~ spl0_2
| spl0_63
| spl0_64 ),
inference(sat_conversion,[],[f839]) ).
cnf(s60,plain,
~ spl0_63,
inference(sat_conversion,[],[f905]) ).
cnf(s98,plain,
( ~ spl0_15
| spl0_110
| spl0_115 ),
inference(sat_conversion,[],[f1521]) ).
cnf(s99,plain,
( ~ spl0_64
| ~ spl0_110 ),
inference(sat_conversion,[],[f1524]) ).
cnf(s103,plain,
~ spl0_115,
inference(sat_conversion,[],[f1675]) ).
cnf(s104,plain,
( ~ spl0_15
| spl0_110 ),
inference(rat,[],[s98,s103]) ).
cnf(s108,plain,
( ~ spl0_2
| spl0_64 ),
inference(rat,[],[s51,s60]) ).
cnf(s116,plain,
spl0_15,
inference(rat,[],[s7,s29]) ).
cnf(s118,plain,
spl0_110,
inference(rat,[],[s104,s116]) ).
cnf(s121,plain,
~ spl0_64,
inference(rat,[],[s99,s118]) ).
cnf(s122,plain,
~ spl0_2,
inference(rat,[],[s108,s121]) ).
cnf(s126,plain,
$false,
inference(rat,[],[s1,s122,s50]) ).
fof(f1676,plain,
$false,
inference(avatar_sat_refutation,[],[s126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN191-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Mon Sep 28 15:37:34 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.12 Running first-order theorem proving
% 0.08/0.12 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.08/0.67 % (3460146)Input is clausal, will run a generic CNF schedule.
% 2.08/0.67 % (3460154)lrs+10_1_sil=8000:sp=occurrence:random_seed=3507392884:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.08/0.67 % (3460156)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=978619026:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.08/0.67 % (3460151)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=4273083833:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.08/0.67 % (3460155)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3635175537:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.08/0.67 % (3460153)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2302488113:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.08/0.67 % (3460152)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2305482902:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.08/0.67 % (3460157)dis-21_1_sil=8000:lcm=predicate:random_seed=3357052946:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.08/0.67 % (3460154)First to succeed.
% 2.08/0.67 % (3460154)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3460146"
% 2.08/0.67 % (3460155)Also succeeded, but the first one will report.
% 2.08/0.67 % (3460156)Also succeeded, but the first one will report.
% 2.08/0.67 % (3460157)Instruction limit reached!
% 2.08/0.67 % (3460157)------------------------------
% 2.08/0.67 % (3460157)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.08/0.67 % (3460157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3460157)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3460157)Termination reason: Instruction limit
% 2.08/0.67 % (3460157)Termination phase: Saturation
% 2.08/0.67 % (3460157)Time elapsed: 0.038 s
% 2.08/0.67 % (3460157)Peak memory usage: 89 MB
% 2.08/0.67 % (3460157)Instructions burned: 122 (million)
% 2.08/0.67 % (3460165)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=1001923615:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 2.08/0.67 % (3460165)Refutation not found, incomplete strategy
% 2.08/0.67 % (3460165)------------------------------
% 2.08/0.67 % (3460165)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.08/0.67 % (3460165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3460165)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3460165)Termination reason: Refutation not found, incomplete strategy
% 2.08/0.67 % (3460165)Time elapsed: 0.001 s
% 2.08/0.67 % (3460165)Peak memory usage: 87 MB
% 2.08/0.67 % (3460165)Instructions burned: 1 (million)
% 2.08/0.67 % (3460154)Refutation found. Thanks to Tanya!
% 2.08/0.67 % SZS status Unsatisfiable for theBenchmark
% 2.08/0.67 % SZS output start Proof for theBenchmark
% See solution above
% 2.08/0.67 % (3460154)------------------------------
% 2.08/0.67 % (3460154)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.08/0.67 % (3460154)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3460154)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3460154)Termination reason: Refutation
% 2.08/0.67 % (3460154)Time elapsed: 0.009 s
% 2.08/0.67 % (3460154)Peak memory usage: 90 MB
% 2.08/0.67 % (3460154)Instructions burned: 23 (million)
% 2.08/0.67 % (3460154)------------------------------
% 2.08/0.67 % (3460154)------------------------------
% 2.08/0.67 % (3460146)Success in time 0.275 s
% 2.08/0.67 % Vampire exiting
%------------------------------------------------------------------------------