%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM016+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 : n001.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 09:40:08 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 82 ( 4 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 84 ( 22 ~; 27 |; 35 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 12 ( 4 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
( aElement0(xa)
& aElement0(xb)
& aElement0(xc) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__731) ).
fof(f19,axiom,
( ( aReductOfIn0(xb,xa,xR)
| ? [X0] :
( aElement0(X0)
& aReductOfIn0(X0,xa,xR)
& sdtmndtplgtdt0(X0,xR,xb) ) )
& sdtmndtplgtdt0(xa,xR,xb)
& ( aReductOfIn0(xc,xa,xR)
| ? [X0] :
( aElement0(X0)
& aReductOfIn0(X0,xa,xR)
& sdtmndtplgtdt0(X0,xR,xc) ) )
& sdtmndtplgtdt0(xa,xR,xc) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__731_02) ).
fof(f20,conjecture,
? [X0] :
( aElement0(X0)
& aReductOfIn0(X0,xa,xR)
& ( X0 = xb
| aReductOfIn0(xb,X0,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,X0,xR)
& sdtmndtplgtdt0(X1,xR,xb) )
| sdtmndtplgtdt0(X0,xR,xb)
| sdtmndtasgtdt0(X0,xR,xb) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f21,negated_conjecture,
~ ? [X0] :
( aElement0(X0)
& aReductOfIn0(X0,xa,xR)
& ( X0 = xb
| aReductOfIn0(xb,X0,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,X0,xR)
& sdtmndtplgtdt0(X1,xR,xb) )
| sdtmndtplgtdt0(X0,xR,xb)
| sdtmndtasgtdt0(X0,xR,xb) ) ),
inference(negated_conjecture,[status(cth)],[f20]) ).
fof(f28,plain,
( ( aReductOfIn0(xb,xa,xR)
| ? [X0] :
( aElement0(X0)
& aReductOfIn0(X0,xa,xR)
& sdtmndtplgtdt0(X0,xR,xb) ) )
& sdtmndtplgtdt0(xa,xR,xb)
& ( aReductOfIn0(xc,xa,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& sdtmndtplgtdt0(X1,xR,xc) ) )
& sdtmndtplgtdt0(xa,xR,xc) ),
inference(rectify,[],[f19]) ).
fof(f53,plain,
! [X0] :
( ~ aElement0(X0)
| ~ aReductOfIn0(X0,xa,xR)
| ( xb != X0
& ~ aReductOfIn0(xb,X0,xR)
& ! [X1] :
( ~ aElement0(X1)
| ~ aReductOfIn0(X1,X0,xR)
| ~ sdtmndtplgtdt0(X1,xR,xb) )
& ~ sdtmndtplgtdt0(X0,xR,xb)
& ~ sdtmndtasgtdt0(X0,xR,xb) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f101,plain,
( ( aReductOfIn0(xb,xa,xR)
| ( aElement0(sK27)
& aReductOfIn0(sK27,xa,xR)
& sdtmndtplgtdt0(sK27,xR,xb) ) )
& sdtmndtplgtdt0(xa,xR,xb)
& ( aReductOfIn0(xc,xa,xR)
| ( aElement0(sK28)
& aReductOfIn0(sK28,xa,xR)
& sdtmndtplgtdt0(sK28,xR,xc) ) )
& sdtmndtplgtdt0(xa,xR,xc) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK27,sK28]),skolemize(X0,sK27),skolemize(X1,sK28)],[f28]) ).
fof(f166,plain,
aElement0(xb),
inference(cnf_transformation,[],[f17]) ).
fof(f195,plain,
( aReductOfIn0(xb,xa,xR)
| sdtmndtplgtdt0(sK27,xR,xb) ),
inference(cnf_transformation,[],[f101]) ).
fof(f196,plain,
( aReductOfIn0(xb,xa,xR)
| aReductOfIn0(sK27,xa,xR) ),
inference(cnf_transformation,[],[f101]) ).
fof(f197,plain,
( aReductOfIn0(xb,xa,xR)
| aElement0(sK27) ),
inference(cnf_transformation,[],[f101]) ).
fof(f199,plain,
! [X0] :
( ~ sdtmndtplgtdt0(X0,xR,xb)
| ~ aReductOfIn0(X0,xa,xR)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f202,plain,
! [X0] :
( ~ aElement0(X0)
| ~ aReductOfIn0(X0,xa,xR)
| xb != X0 ),
inference(cnf_transformation,[],[f53]) ).
fof(f206,plain,
( ~ aElement0(xb)
| ~ aReductOfIn0(xb,xa,xR) ),
inference(equality_resolution,[],[f202]) ).
fof(f209,plain,
~ aReductOfIn0(xb,xa,xR),
inference(global_subsumption,[],[f206,f166]) ).
fof(f243,plain,
aElement0(sK27),
inference(forward_subsumption_resolution,[],[f197,f209]) ).
fof(f308,plain,
sdtmndtplgtdt0(sK27,xR,xb),
inference(forward_subsumption_resolution,[],[f195,f209]) ).
fof(f310,plain,
( ~ aReductOfIn0(sK27,xa,xR)
| ~ aElement0(sK27) ),
inference(resolution,[],[f308,f199]) ).
fof(f311,plain,
~ aReductOfIn0(sK27,xa,xR),
inference(forward_subsumption_resolution,[],[f310,f243]) ).
fof(f313,plain,
$false,
inference(global_subsumption,[],[f311,f209,f196]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM016+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n001.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.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 21:51:34 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.20/0.27 % (784902)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (784909)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1463004899:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (784909) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-784902-784909"...
% 0.20/0.27 % (784908)% WARNING: option uhcvi not known.
% 0.20/0.27 % (784909)...printing done.
% 0.20/0.27 % (784909)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (784909)------------------------------
% 0.20/0.27 % (784909)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (784909)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (784909)CaDiCaL version: 2.1.3
% 0.20/0.27 % (784909)Termination reason: Refutation
% 0.20/0.27 % (784909)Time elapsed: 0.004 s
% 0.20/0.27 % (784909)Peak memory usage: 12 MB
% 0.20/0.27 % (784909)Instructions burned: 9 (million)
% 0.20/0.27 % (784902)Success in time 0.034 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------