%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PRO011+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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 12:30:37 PM UTC 2026
% Result : Theorem 0.10s 0.46s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 9 unt; 3 def)
% Number of atoms : 142 ( 7 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 144 ( 51 ~; 43 |; 36 &)
% ( 6 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 4 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn 46 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(f16,axiom,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ~ ? [X3] : min_precedes(X0,X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_15) ).
fof(f19,axiom,
! [X0,X1] :
( leaf_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& leaf(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_18) ).
fof(f33,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& next_subocc(X1,X2,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f46,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( occurrence_of(X3,tptp2)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( occurrence_of(X3,tptp2)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f67,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f68,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f67]) ).
fof(f77,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f96,plain,
! [X0] :
( ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& next_subocc(X1,X2,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f33]) ).
fof(f97,plain,
? [X0] :
( ! [X1,X2] :
( ~ leaf_occ(X2,X0)
| ( ? [X3] :
( occurrence_of(X3,tptp2)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| ( ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) ) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f110,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f68]) ).
fof(f122,plain,
! [X3,X0,X1] :
( ~ leaf(X0,X1)
| ~ min_precedes(X0,X3,X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f126,plain,
! [X0,X1] :
( leaf(X0,sK8(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f128,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| occurrence_of(X1,sK8(X0,X1)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f154,plain,
! [X0] :
( leaf_occ(sK14(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f96]) ).
fof(f180,plain,
! [X2,X1] :
( min_precedes(X1,sK16(X1),tptp0)
| min_precedes(X1,sK17(X1),tptp0)
| ~ leaf_occ(X2,sK15) ),
inference(cnf_transformation,[],[f97]) ).
fof(f187,plain,
occurrence_of(sK15,tptp0),
inference(cnf_transformation,[],[f97]) ).
fof(f204,definition,
( spl18_5
<=> ! [X2] : ~ leaf_occ(X2,sK15) ),
introduced(definition,[new_symbols(definition,[spl18_5])],[avatar_definition]) ).
fof(f205,plain,
( ! [X2] : ~ leaf_occ(X2,sK15)
| ~ spl18_5 ),
inference(avatar_component_clause,[],[f204]) ).
fof(f231,definition,
( spl18_12
<=> ! [X1] :
( min_precedes(X1,sK16(X1),tptp0)
| min_precedes(X1,sK17(X1),tptp0) ) ),
introduced(definition,[new_symbols(definition,[spl18_12])],[avatar_definition]) ).
fof(f232,plain,
( ! [X1] :
( min_precedes(X1,sK17(X1),tptp0)
| min_precedes(X1,sK16(X1),tptp0) )
| ~ spl18_12 ),
inference(avatar_component_clause,[],[f231]) ).
fof(f233,plain,
( spl18_5
| spl18_12 ),
inference(avatar_split_clause,[],[f180,f231,f204]) ).
fof(f270,plain,
( ~ occurrence_of(sK15,tptp0)
| ~ spl18_5 ),
inference(resolution,[],[f154,f205]) ).
fof(f271,plain,
( $false
| ~ spl18_5 ),
inference(forward_subsumption_resolution,[],[f270,f187]) ).
fof(f272,plain,
~ spl18_5,
inference(avatar_contradiction_clause,[],[f271]) ).
fof(f284,plain,
! [X2,X0,X1] :
( ~ leaf_occ(X0,X1)
| ~ min_precedes(X0,X2,sK8(X0,X1)) ),
inference(resolution,[],[f126,f122]) ).
fof(f286,plain,
! [X0] :
( occurrence_of(X0,sK8(sK14(X0),X0))
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f128,f154]) ).
fof(f304,plain,
! [X0] :
( ~ occurrence_of(sK15,X0)
| tptp0 = X0 ),
inference(resolution,[],[f110,f187]) ).
fof(f580,plain,
( ~ occurrence_of(sK15,tptp0)
| tptp0 = sK8(sK14(sK15),sK15) ),
inference(resolution,[],[f286,f304]) ).
fof(f589,plain,
tptp0 = sK8(sK14(sK15),sK15),
inference(forward_subsumption_resolution,[],[f580,f187]) ).
fof(f625,definition,
( spl18_25
<=> leaf_occ(sK14(sK15),sK15) ),
introduced(definition,[new_symbols(definition,[spl18_25])],[avatar_definition]) ).
fof(f626,plain,
( leaf_occ(sK14(sK15),sK15)
| ~ spl18_25 ),
inference(avatar_component_clause,[],[f625]) ).
fof(f627,plain,
( ~ leaf_occ(sK14(sK15),sK15)
| spl18_25 ),
inference(avatar_component_clause,[],[f625]) ).
fof(f639,plain,
( ~ occurrence_of(sK15,tptp0)
| spl18_25 ),
inference(resolution,[],[f627,f154]) ).
fof(f640,plain,
( $false
| spl18_25 ),
inference(forward_subsumption_resolution,[],[f639,f187]) ).
fof(f641,plain,
spl18_25,
inference(avatar_contradiction_clause,[],[f640]) ).
fof(f648,plain,
( ! [X0] : ~ min_precedes(sK14(sK15),X0,sK8(sK14(sK15),sK15))
| ~ spl18_25 ),
inference(resolution,[],[f626,f284]) ).
fof(f652,plain,
( ! [X0] : ~ min_precedes(sK14(sK15),X0,tptp0)
| ~ spl18_25 ),
inference(forward_demodulation,[],[f648,f589]) ).
fof(f677,plain,
( min_precedes(sK14(sK15),sK16(sK14(sK15)),tptp0)
| ~ spl18_12
| ~ spl18_25 ),
inference(resolution,[],[f652,f232]) ).
fof(f683,plain,
( $false
| ~ spl18_12
| ~ spl18_25 ),
inference(forward_subsumption_resolution,[],[f677,f652]) ).
fof(f684,plain,
( ~ spl18_12
| ~ spl18_25 ),
inference(avatar_contradiction_clause,[],[f683]) ).
cnf(s10,plain,
( spl18_5
| spl18_12 ),
inference(sat_conversion,[],[f233]) ).
cnf(s16,plain,
~ spl18_5,
inference(sat_conversion,[],[f272]) ).
cnf(s26,plain,
spl18_25,
inference(sat_conversion,[],[f641]) ).
cnf(s29,plain,
( ~ spl18_12
| ~ spl18_25 ),
inference(sat_conversion,[],[f684]) ).
cnf(s31,plain,
~ spl18_12,
inference(rat,[],[s29,s26]) ).
cnf(s38,plain,
$false,
inference(rat,[],[s10,s31,s16]) ).
fof(f690,plain,
$false,
inference(avatar_sat_refutation,[],[s38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO011+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 22:21:19 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.10/0.45 % (3822294)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (3822303)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=251165487:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (3822300)% WARNING: option uhcvi not known.
% 0.10/0.45 % (3822299)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1307239335_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.45 % (3822304)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3753927454:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.45 % (3822302)dis+10_1_sil=32000:sp=arity:random_seed=891045958:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45 % (3822301)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2189911981:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.45 % (3822305)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1944799829:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.45 % (3822300)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3682365872:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.46 % (3822303) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3822294-3822303"...
% 0.10/0.46 % (3822303)...printing done.
% 0.10/0.46 % Detected minimum model sizes of [4]
% 0.10/0.46 % Detected maximum model sizes of [max]
% 0.10/0.46 % TRYING [4]
% 0.10/0.46 % (3822303)Refutation found. Thanks to Tanya!
% 0.10/0.46 % SZS status Theorem for theBenchmark
% 0.10/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46 % (3822303)------------------------------
% 0.10/0.46 % (3822303)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (3822303)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (3822303)CaDiCaL version: 2.1.3
% 0.10/0.46 % (3822303)Termination reason: Refutation
% 0.10/0.46 % (3822303)Time elapsed: 0.011 s
% 0.10/0.46 % (3822303)Peak memory usage: 13 MB
% 0.10/0.46 % (3822303)Instructions burned: 27 (million)
% 0.10/0.46 % (3822294)Success in time 0.038 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------