%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU139+1 : TPTP v9.3.1. Released v3.3.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 12:52:03 PM UTC 2026
% Result : Theorem 0.15s 15.47s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 29 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 5 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 20 ( 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( proper_subset(X0,X1)
=> ~ proper_subset(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_xboole_0) ).
fof(f3,axiom,
! [X0,X1] :
( proper_subset(X0,X1)
<=> ( subset(X0,X1)
& X0 != X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f4,axiom,
! [X0,X1] : ~ proper_subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_r2_xboole_0) ).
fof(f6,conjecture,
! [X0,X1] :
~ ( subset(X0,X1)
& proper_subset(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_xboole_1) ).
fof(f7,negated_conjecture,
~ ! [X0,X1] :
~ ( subset(X0,X1)
& proper_subset(X1,X0) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,plain,
! [X0] : ~ proper_subset(X0,X0),
inference(rectify,[],[f4]) ).
fof(f10,plain,
! [X0,X1] :
( ~ proper_subset(X1,X0)
| ~ proper_subset(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f11,plain,
? [X0,X1] :
( subset(X0,X1)
& proper_subset(X1,X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f12,plain,
! [X0,X1] :
( ~ proper_subset(X0,X1)
| ~ proper_subset(X1,X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f18,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| X0 = X1
| proper_subset(X0,X1) ),
inference(cnf_transformation,[],[f3]) ).
fof(f19,plain,
! [X0] : ~ proper_subset(X0,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f21,plain,
proper_subset(sK1,sK0),
inference(cnf_transformation,[],[f11]) ).
fof(f22,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f11]) ).
fof(f27,plain,
~ proper_subset(sK0,sK1),
inference(resolution,[],[f12,f21]) ).
fof(f30,plain,
( sK0 = sK1
| proper_subset(sK0,sK1) ),
inference(resolution,[],[f18,f22]) ).
fof(f32,plain,
sK0 = sK1,
inference(forward_subsumption_resolution,[],[f30,f27]) ).
fof(f35,plain,
proper_subset(sK0,sK0),
inference(superposition,[],[f21,f32]) ).
fof(f36,plain,
$false,
inference(forward_subsumption_resolution,[],[f35,f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU139+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/15.39 % Computer : n001.cluster.edu
% 0.10/15.39 % Model : x86_64 x86_64
% 0.10/15.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.39 % Memory : 8046.5625MB
% 0.10/15.39 % OS : Linux 6.8.0-71-generic
% 0.10/15.39 % CPULimit : 300
% 0.10/15.39 % WCLimit : 300
% 0.10/15.39 % DateTime : Mon Sep 28 03:47:48 UTC 2026
% 0.10/15.39 % CPUTime :
% 0.10/15.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/15.42 Running first-order model finding
% 0.15/15.42 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.15/15.47 % (4191853)Will run a generic schedule for satisfiability detection.
% 0.15/15.47 % (4191862)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=726005042:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/15.47 % (4191862) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4191853-4191862"...
% 0.15/15.47 % (4191862)...printing done.
% 0.15/15.47 % (4191862)Refutation found. Thanks to Tanya!
% 0.15/15.47 % SZS status Theorem for theBenchmark
% 0.15/15.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/15.47 % (4191862)------------------------------
% 0.15/15.47 % (4191862)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/15.47 % (4191862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/15.47 % (4191862)CaDiCaL version: 2.1.3
% 0.15/15.47 % (4191862)Termination reason: Refutation
% 0.15/15.47 % (4191862)Time elapsed: 0.001 s
% 0.15/15.47 % (4191862)Peak memory usage: 12 MB
% 0.15/15.47 % (4191862)Instructions burned: 1 (million)
% 0.15/15.47 % (4191853)Success in time 0.033 s
% 0.15/15.47 % Vampire exiting
%------------------------------------------------------------------------------