0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.12	% Command    : run_vampire %s %d THM
0.11/0.32	% Computer   : n003.cluster.edu
0.11/0.32	% Model      : x86_64 x86_64
0.11/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory     : 8042.1875MB
0.11/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1920
0.11/0.32	% WCLimit    : 240
0.11/0.32	% DateTime   : Wed Jul 30 02:00:34 EDT 2025
0.11/0.32	% CPUTime    : 
0.18/0.34	This is a FOF_ problem
0.18/0.34	Running first-order theorem proving
0.18/0.34	Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 240 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.18/0.39	% (2590)Running in auto input_syntax mode. Trying TPTP
0.18/0.39	% (2598)dis+1011_1_slsqr=8,1:sil=2000:spb=units:fd=off:kmz=on:flr=on:sac=on:slsq=on:random_seed=3641118345:st=2:i=121:sd=30:afp=100000:aac=none:ep=RS:ss=axioms:sgt=10_2399 on theBenchmark for (2399ds/121Mi)
0.18/0.39	% (2598)First to succeed.
0.18/0.40	% (2598)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2590"
0.18/0.40	% (2590)Running in auto input_syntax mode. Trying TPTP
0.18/0.40	% (2598)Refutation found. Thanks to Tanya!
0.18/0.40	% SZS status Theorem for theBenchmark
0.18/0.40	% SZS output start Proof for theBenchmark
0.18/0.40	fof(f422,plain,(
0.18/0.40	  $false),
0.18/0.40	  inference(subsumption_resolution,[],[f421,f246])).
0.18/0.40	fof(f246,plain,(
0.18/0.40	  occurrence_of(sK2,tptp0)),
0.18/0.40	  inference(cnf_transformation,[],[f196])).
0.18/0.40	fof(f196,plain,(
0.18/0.40	  ! [X1,X2] : (~leaf_occ(X2,sK2) | ((occurrence_of(sK3(X1),tptp2) & min_precedes(X1,sK3(X1),tptp0)) & occurrence_of(X2,tptp1)) | sP0(X1,X2)) & occurrence_of(sK2,tptp0)),
0.18/0.40	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f189,f195,f194])).
0.18/0.40	fof(f194,plain,(
0.18/0.40	  ? [X0] : (! [X1,X2] : (~leaf_occ(X2,X0) | (? [X3] : (occurrence_of(X3,tptp2) & min_precedes(X1,X3,tptp0)) & occurrence_of(X2,tptp1)) | sP0(X1,X2)) & occurrence_of(X0,tptp0)) => (! [X2,X1] : (~leaf_occ(X2,sK2) | (? [X3] : (occurrence_of(X3,tptp2) & min_precedes(X1,X3,tptp0)) & occurrence_of(X2,tptp1)) | sP0(X1,X2)) & occurrence_of(sK2,tptp0))),
0.18/0.40	  introduced(definition,[],[choice_axiom])).
0.18/0.40	fof(f195,plain,(
0.18/0.40	  ! [X1] : (? [X3] : (occurrence_of(X3,tptp2) & min_precedes(X1,X3,tptp0)) => (occurrence_of(sK3(X1),tptp2) & min_precedes(X1,sK3(X1),tptp0)))),
0.18/0.40	  introduced(definition,[],[choice_axiom])).
0.18/0.40	fof(f189,plain,(
0.18/0.40	  ? [X0] : (! [X1,X2] : (~leaf_occ(X2,X0) | (? [X3] : (occurrence_of(X3,tptp2) & min_precedes(X1,X3,tptp0)) & occurrence_of(X2,tptp1)) | sP0(X1,X2)) & occurrence_of(X0,tptp0))),
0.18/0.40	  inference(definition_folding,[],[f115,f188])).
0.18/0.40	fof(f188,plain,(
0.18/0.40	  ! [X1,X2] : ((? [X4] : (min_precedes(X1,X4,tptp0) & occurrence_of(X4,tptp1)) & occurrence_of(X2,tptp2)) | ~sP0(X1,X2))),
0.18/0.40	  introduced(definition,[new_symbols(naming,[sP0])],[predicate_definition_introduction])).
0.18/0.40	fof(f115,plain,(
0.18/0.40	  ? [X0] : (! [X1,X2] : (~leaf_occ(X2,X0) | (? [X3] : (occurrence_of(X3,tptp2) & min_precedes(X1,X3,tptp0)) & occurrence_of(X2,tptp1)) | (? [X4] : (min_precedes(X1,X4,tptp0) & occurrence_of(X4,tptp1)) & occurrence_of(X2,tptp2))) & occurrence_of(X0,tptp0))),
0.18/0.40	  inference(ennf_transformation,[],[f65])).
0.18/0.40	fof(f65,plain,(
0.18/0.40	  ~! [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] : (min_precedes(X1,X4,tptp0) & occurrence_of(X4,tptp1)))))),
0.18/0.40	  inference(rectify,[],[f15])).
0.18/0.40	fof(f15,negated_conjecture,(
0.18/0.40	  ~! [X35] : (occurrence_of(X35,tptp0) => ? [X36,X37] : (leaf_occ(X37,X35) & (occurrence_of(X37,tptp1) => ~? [X39] : (occurrence_of(X39,tptp2) & min_precedes(X36,X39,tptp0))) & (occurrence_of(X37,tptp2) => ~? [X38] : (min_precedes(X36,X38,tptp0) & occurrence_of(X38,tptp1)))))),
0.18/0.40	  inference(negated_conjecture,[status(cth)],[f14])).
0.18/0.40	fof(f14,conjecture,(
0.18/0.40	  ! [X35] : (occurrence_of(X35,tptp0) => ? [X36,X37] : (leaf_occ(X37,X35) & (occurrence_of(X37,tptp1) => ~? [X39] : (occurrence_of(X39,tptp2) & min_precedes(X36,X39,tptp0))) & (occurrence_of(X37,tptp2) => ~? [X38] : (min_precedes(X36,X38,tptp0) & occurrence_of(X38,tptp1)))))),
0.18/0.40	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
0.18/0.40	fof(f421,plain,(
0.18/0.40	  ~occurrence_of(sK2,tptp0)),
0.18/0.40	  inference(resolution,[],[f418,f253])).
0.18/0.40	fof(f253,plain,(
0.18/0.40	  ( ! [X0] : (leaf_occ(sK6(X0),X0) | ~occurrence_of(X0,tptp0)) )),
0.18/0.40	  inference(cnf_transformation,[],[f198])).
0.18/0.40	fof(f198,plain,(
0.18/0.40	  ! [X0] : ((occurrence_of(sK4(X0),tptp3) & occurrence_of(sK5(X0),tptp4) & next_subocc(sK4(X0),sK5(X0),tptp0) & next_subocc(sK5(X0),sK6(X0),tptp0) & leaf_occ(sK6(X0),X0) & (occurrence_of(sK6(X0),tptp2) | occurrence_of(sK6(X0),tptp1)) & root_occ(sK4(X0),X0)) | ~occurrence_of(X0,tptp0))),
0.18/0.40	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f116,f197])).
0.18/0.40	fof(f197,plain,(
0.18/0.40	  ! [X0] : (? [X1,X2,X3] : (occurrence_of(X1,tptp3) & occurrence_of(X2,tptp4) & next_subocc(X1,X2,tptp0) & next_subocc(X2,X3,tptp0) & leaf_occ(X3,X0) & (occurrence_of(X3,tptp2) | occurrence_of(X3,tptp1)) & root_occ(X1,X0)) => (occurrence_of(sK4(X0),tptp3) & occurrence_of(sK5(X0),tptp4) & next_subocc(sK4(X0),sK5(X0),tptp0) & next_subocc(sK5(X0),sK6(X0),tptp0) & leaf_occ(sK6(X0),X0) & (occurrence_of(sK6(X0),tptp2) | occurrence_of(sK6(X0),tptp1)) & root_occ(sK4(X0),X0)))),
0.18/0.40	  introduced(definition,[],[choice_axiom])).
0.18/0.40	fof(f116,plain,(
0.18/0.40	  ! [X0] : (? [X1,X2,X3] : (occurrence_of(X1,tptp3) & occurrence_of(X2,tptp4) & next_subocc(X1,X2,tptp0) & next_subocc(X2,X3,tptp0) & leaf_occ(X3,X0) & (occurrence_of(X3,tptp2) | occurrence_of(X3,tptp1)) & root_occ(X1,X0)) | ~occurrence_of(X0,tptp0))),
0.18/0.40	  inference(ennf_transformation,[],[f66])).
0.18/0.40	fof(f66,plain,(
0.18/0.40	  ! [X0] : (occurrence_of(X0,tptp0) => ? [X1,X2,X3] : (occurrence_of(X1,tptp3) & occurrence_of(X2,tptp4) & next_subocc(X1,X2,tptp0) & next_subocc(X2,X3,tptp0) & leaf_occ(X3,X0) & (occurrence_of(X3,tptp2) | occurrence_of(X3,tptp1)) & root_occ(X1,X0)))),
0.18/0.40	  inference(rectify,[],[f34])).
0.18/0.40	fof(f34,axiom,(
0.18/0.40	  ! [X86] : (occurrence_of(X86,tptp0) => ? [X87,X88,X89] : (occurrence_of(X87,tptp3) & occurrence_of(X88,tptp4) & next_subocc(X87,X88,tptp0) & next_subocc(X88,X89,tptp0) & leaf_occ(X89,X86) & (occurrence_of(X89,tptp2) | occurrence_of(X89,tptp1)) & root_occ(X87,X86)))),
0.18/0.40	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
0.18/0.40	fof(f418,plain,(
0.18/0.40	  ( ! [X0] : (~leaf_occ(X0,sK2)) )),
0.18/0.40	  inference(subsumption_resolution,[],[f416,f377])).
0.18/0.40	fof(f377,plain,(
0.18/0.40	  ( ! [X0,X1] : (~min_precedes(sK2,X0,X1)) )),
0.18/0.40	  inference(resolution,[],[f376,f313])).
0.18/0.40	fof(f313,plain,(
0.18/0.40	  ( ! [X2,X0,X1] : (arboreal(X0) | ~min_precedes(X0,X1,X2)) )),
0.18/0.40	  inference(cnf_transformation,[],[f157])).
0.18/0.40	fof(f157,plain,(
0.18/0.40	  ! [X0,X1,X2] : (arboreal(X0) | ~min_precedes(X0,X1,X2))),
0.18/0.40	  inference(ennf_transformation,[],[f92])).
0.18/0.40	fof(f92,plain,(
0.18/0.40	  ! [X0,X1,X2] : (min_precedes(X0,X1,X2) => arboreal(X0))),
0.18/0.40	  inference(rectify,[],[f44])).
0.18/0.40	fof(f44,axiom,(
0.18/0.40	  ! [X107,X108,X109] : (min_precedes(X107,X108,X109) => arboreal(X107))),
0.18/0.40	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
0.18/0.40	fof(f376,plain,(
0.18/0.40	  ~arboreal(sK2)),
0.18/0.40	  inference(resolution,[],[f375,f246])).
0.18/0.40	fof(f375,plain,(
0.18/0.40	  ( ! [X0] : (~occurrence_of(X0,tptp0) | ~arboreal(X0)) )),
0.18/0.40	  inference(resolution,[],[f304,f276])).
0.18/0.40	fof(f276,plain,(
0.18/0.40	  ~atomic(tptp0)),
0.18/0.40	  inference(cnf_transformation,[],[f62])).
0.18/0.40	fof(f62,axiom,(
0.18/0.40	  ~atomic(tptp0)),
0.18/0.40	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
0.18/0.40	fof(f304,plain,(
0.18/0.40	  ( ! [X0,X1] : (atomic(X1) | ~arboreal(X0) | ~occurrence_of(X0,X1)) )),
0.18/0.40	  inference(cnf_transformation,[],[f218])).
0.18/0.40	fof(f218,plain,(
0.18/0.40	  ! [X0,X1] : (((arboreal(X0) | ~atomic(X1)) & (atomic(X1) | ~arboreal(X0))) | ~occurrence_of(X0,X1))),
0.18/0.40	  inference(nnf_transformation,[],[f151])).
0.18/0.40	fof(f151,plain,(
0.18/0.40	  ! [X0,X1] : ((arboreal(X0) <=> atomic(X1)) | ~occurrence_of(X0,X1))),
0.18/0.40	  inference(ennf_transformation,[],[f88])).
0.18/0.40	fof(f88,plain,(
0.18/0.40	  ! [X0,X1] : (occurrence_of(X0,X1) => (arboreal(X0) <=> atomic(X1)))),
0.18/0.40	  inference(rectify,[],[f40])).
0.18/0.40	fof(f40,axiom,(
0.18/0.40	  ! [X98,X99] : (occurrence_of(X98,X99) => (arboreal(X98) <=> atomic(X99)))),
0.18/0.40	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
0.18/0.40	fof(f416,plain,(
0.18/0.40	  ( ! [X0] : (min_precedes(sK2,sK1(sK2),tptp0) | ~leaf_occ(X0,sK2)) )),
0.18/0.40	  inference(resolution,[],[f245,f384])).
0.18/0.40	fof(f384,plain,(
0.18/0.40	  ( ! [X0] : (sP0(sK2,X0) | ~leaf_occ(X0,sK2)) )),
0.18/0.40	  inference(resolution,[],[f377,f248])).
0.18/0.40	fof(f248,plain,(
0.18/0.40	  ( ! [X2,X1] : (min_precedes(X1,sK3(X1),tptp0) | ~leaf_occ(X2,sK2) | sP0(X1,X2)) )),
0.18/0.40	  inference(cnf_transformation,[],[f196])).
0.18/0.40	fof(f245,plain,(
0.18/0.40	  ( ! [X0,X1] : (~sP0(X0,X1) | min_precedes(X0,sK1(X0),tptp0)) )),
0.18/0.40	  inference(cnf_transformation,[],[f193])).
0.18/0.40	fof(f193,plain,(
0.18/0.40	  ! [X0,X1] : (((min_precedes(X0,sK1(X0),tptp0) & occurrence_of(sK1(X0),tptp1)) & occurrence_of(X1,tptp2)) | ~sP0(X0,X1))),
0.18/0.40	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f191,f192])).
0.18/0.40	fof(f192,plain,(
0.18/0.40	  ! [X0] : (? [X2] : (min_precedes(X0,X2,tptp0) & occurrence_of(X2,tptp1)) => (min_precedes(X0,sK1(X0),tptp0) & occurrence_of(sK1(X0),tptp1)))),
0.18/0.40	  introduced(definition,[],[choice_axiom])).
0.18/0.40	fof(f191,plain,(
0.18/0.40	  ! [X0,X1] : ((? [X2] : (min_precedes(X0,X2,tptp0) & occurrence_of(X2,tptp1)) & occurrence_of(X1,tptp2)) | ~sP0(X0,X1))),
0.18/0.40	  inference(rectify,[],[f190])).
0.18/0.40	fof(f190,plain,(
0.18/0.40	  ! [X1,X2] : ((? [X4] : (min_precedes(X1,X4,tptp0) & occurrence_of(X4,tptp1)) & occurrence_of(X2,tptp2)) | ~sP0(X1,X2))),
0.18/0.40	  inference(nnf_transformation,[],[f188])).
0.18/0.40	% SZS output end Proof for theBenchmark
0.18/0.40	% (2598)------------------------------
0.18/0.40	% (2598)Version: Vampire 5.0.0 (Release build, commit 3ce9b74f2 on 2025-07-14 12:22:21 +0200)
0.18/0.40	% (2598)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
0.18/0.40	% (2598)Termination reason: Refutation
0.18/0.40	
0.18/0.40	% (2598)Time elapsed: 0.004 s
0.18/0.40	% (2598)Peak memory usage: 8 MB
0.18/0.40	% (2598)Instructions burned: 8 (million)
0.18/0.40	% (2598)------------------------------
0.18/0.40	% (2598)------------------------------
0.18/0.40	% (2590)Success in time 0.051 s
0.18/0.40	EOF