%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PRO010+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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 12:30:37 PM UTC 2026
% Result : Theorem 0.07s 0.36s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 13 unt; 2 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 105 ( 37 ~; 30 |; 25 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 3 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 56 ( 0 sgn 39 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
fof(f47,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> arboreal(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_46) ).
fof(f50,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/sandbox/benchmark/theBenchmark.p',sos_49) ).
fof(f52,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_51) ).
fof(f63,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f64,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f75,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f131,plain,
! [X0,X1,X2] :
( arboreal(X0)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f136,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,[],[f50]) ).
fof(f137,plain,
? [X0] :
( ! [X1,X2] :
( ~ leaf_occ(X2,X0)
| ( ? [X3] :
( occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| ( ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) ) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f64]) ).
fof(f148,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| atomic(X1)
| ~ arboreal(X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f217,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| arboreal(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f221,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK18(X0),X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f228,plain,
~ atomic(tptp0),
inference(cnf_transformation,[],[f52]) ).
fof(f243,plain,
! [X2,X1] :
( min_precedes(X1,sK20(X1),tptp0)
| min_precedes(X1,sK21(X1),tptp0)
| ~ leaf_occ(X2,sK19) ),
inference(cnf_transformation,[],[f137]) ).
fof(f248,plain,
occurrence_of(sK19,tptp0),
inference(cnf_transformation,[],[f137]) ).
fof(f254,plain,
! [X0,X1] :
( ~ atomic(X1)
| occurrence_of(X0,X1)
| arboreal(X0) ),
inference(consistent_polarity_flipping,[],[f148]) ).
fof(f322,plain,
! [X2,X0,X1] :
( ~ arboreal(X0)
| min_precedes(X0,X1,X2) ),
inference(consistent_polarity_flipping,[],[f217]) ).
fof(f330,plain,
! [X0] :
( ~ leaf_occ(sK18(X0),X0)
| occurrence_of(X0,tptp0) ),
inference(consistent_polarity_flipping,[],[f221]) ).
fof(f332,plain,
atomic(tptp0),
inference(consistent_polarity_flipping,[],[f228]) ).
fof(f337,plain,
~ occurrence_of(sK19,tptp0),
inference(consistent_polarity_flipping,[],[f248]) ).
fof(f342,plain,
! [X2,X1] :
( ~ min_precedes(X1,sK20(X1),tptp0)
| ~ min_precedes(X1,sK21(X1),tptp0)
| leaf_occ(X2,sK19) ),
inference(consistent_polarity_flipping,[],[f243]) ).
fof(f359,definition,
( spl22_4
<=> ! [X2] : leaf_occ(X2,sK19) ),
introduced(definition,[new_symbols(definition,[spl22_4])],[avatar_definition]) ).
fof(f360,plain,
( ! [X2] : leaf_occ(X2,sK19)
| ~ spl22_4 ),
inference(avatar_component_clause,[],[f359]) ).
fof(f370,definition,
( spl22_7
<=> ! [X1] :
( ~ min_precedes(X1,sK20(X1),tptp0)
| ~ min_precedes(X1,sK21(X1),tptp0) ) ),
introduced(definition,[new_symbols(definition,[spl22_7])],[avatar_definition]) ).
fof(f371,plain,
( ! [X1] :
( ~ min_precedes(X1,sK21(X1),tptp0)
| ~ min_precedes(X1,sK20(X1),tptp0) )
| ~ spl22_7 ),
inference(avatar_component_clause,[],[f370]) ).
fof(f372,plain,
( spl22_4
| spl22_7 ),
inference(avatar_split_clause,[],[f342,f370,f359]) ).
fof(f392,plain,
! [X0] :
( occurrence_of(X0,tptp0)
| arboreal(X0) ),
inference(resolution,[],[f254,f332]) ).
fof(f393,plain,
arboreal(sK19),
inference(resolution,[],[f392,f337]) ).
fof(f405,plain,
! [X0,X1] : min_precedes(sK19,X0,X1),
inference(resolution,[],[f393,f322]) ).
fof(f420,plain,
( occurrence_of(sK19,tptp0)
| ~ spl22_4 ),
inference(resolution,[],[f330,f360]) ).
fof(f422,plain,
( $false
| ~ spl22_4 ),
inference(forward_subsumption_resolution,[],[f420,f337]) ).
fof(f423,plain,
~ spl22_4,
inference(avatar_contradiction_clause,[],[f422]) ).
fof(f446,plain,
( ~ min_precedes(sK19,sK20(sK19),tptp0)
| ~ spl22_7 ),
inference(resolution,[],[f371,f405]) ).
fof(f447,plain,
( $false
| ~ spl22_7 ),
inference(forward_subsumption_resolution,[],[f446,f405]) ).
fof(f448,plain,
~ spl22_7,
inference(avatar_contradiction_clause,[],[f447]) ).
cnf(s5,plain,
( spl22_4
| spl22_7 ),
inference(sat_conversion,[],[f372]) ).
cnf(s11,plain,
~ spl22_4,
inference(sat_conversion,[],[f423]) ).
cnf(s14,plain,
~ spl22_7,
inference(sat_conversion,[],[f448]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s5,s14,s11]) ).
fof(f450,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : PRO010+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Sun Sep 27 22:19:19 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.32 Running first-order model finding
% 0.04/0.32 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.07/0.36 % (2812246)Will run a generic schedule for satisfiability detection.
% 0.07/0.36 % (2812252)% WARNING: option uhcvi not known.
% 0.07/0.36 % (2812251)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1178877001_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.36 % (2812252)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=299286631:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.36 % (2812253)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3340538822:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.36 % (2812254)dis+10_1_sil=32000:sp=arity:random_seed=3402260233:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.36 % (2812255)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1454108403:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.36 % (2812256)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3574901325:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.36 % (2812257)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=427065314:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.36 % (2812254) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2812246-2812254"...
% 0.07/0.36 % (2812252) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2812246-2812252"...
% 0.07/0.36 % Detected minimum model sizes of [4]
% 0.07/0.36 % Detected maximum model sizes of [max]
% 0.07/0.36 % TRYING [4]
% 0.07/0.36 % (2812257) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2812246-2812257"...
% 0.07/0.36 % (2812252)...printing done.
% 0.07/0.36 % (2812254)...printing done.
% 0.07/0.36 % (2812252)Refutation found. Thanks to Tanya!
% 0.07/0.36 % SZS status Theorem for theBenchmark
% 0.07/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.36 % (2812252)------------------------------
% 0.07/0.36 % (2812252)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.36 % (2812252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.36 % (2812252)CaDiCaL version: 2.1.3
% 0.07/0.36 % (2812252)Termination reason: Refutation
% 0.07/0.36 % (2812252)Time elapsed: 0.003 s
% 0.07/0.36 % (2812252)Peak memory usage: 12 MB
% 0.07/0.36 % (2812252)Instructions burned: 6 (million)
% 0.07/0.36 % (2812246)Success in time 0.031 s
% 0.07/0.36 % Vampire exiting
%------------------------------------------------------------------------------