%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU172+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:14 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 34 ( 6 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 29 ( 12 ~; 5 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 23 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f20,axiom,
! [X0,X1] :
( element(X1,powerset(X0))
=> subset_complement(X0,X1) = set_difference(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_subset_1) ).
fof(f21,conjecture,
! [X0,X1,X2] :
( element(X2,powerset(X0))
=> ~ ( in(X1,subset_complement(X0,X2))
& in(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t54_subset_1) ).
fof(f22,negated_conjecture,
~ ! [X0,X1,X2] :
( element(X2,powerset(X0))
=> ~ ( in(X1,subset_complement(X0,X2))
& in(X1,X2) ) ),
inference(negated_conjecture,[status(cth)],[f21]) ).
fof(f23,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& ~ in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f31,plain,
! [X0,X1] :
( subset_complement(X0,X1) = set_difference(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f20]) ).
fof(f32,plain,
? [X0,X1,X2] :
( in(X1,subset_complement(X0,X2))
& in(X1,X2)
& element(X2,powerset(X0)) ),
inference(ennf_transformation,[],[f22]) ).
fof(f33,plain,
? [X0,X1,X2] :
( in(X1,subset_complement(X0,X2))
& in(X1,X2)
& element(X2,powerset(X0)) ),
inference(flattening,[],[f32]) ).
fof(f51,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| subset_complement(X0,X1) = set_difference(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f52,plain,
element(sK7,powerset(sK5)),
inference(cnf_transformation,[],[f33]) ).
fof(f53,plain,
in(sK6,sK7),
inference(cnf_transformation,[],[f33]) ).
fof(f54,plain,
in(sK6,subset_complement(sK5,sK7)),
inference(cnf_transformation,[],[f33]) ).
fof(f58,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X1)
| ~ in(X3,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f23]) ).
fof(f63,plain,
! [X3,X0,X1] :
( ~ in(X3,set_difference(X0,X1))
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f58]) ).
fof(f103,plain,
subset_complement(sK5,sK7) = set_difference(sK5,sK7),
inference(resolution,[],[f51,f52]) ).
fof(f115,plain,
in(sK6,set_difference(sK5,sK7)),
inference(superposition,[],[f54,f103]) ).
fof(f124,plain,
~ in(sK6,sK7),
inference(resolution,[],[f115,f63]) ).
fof(f126,plain,
$false,
inference(forward_subsumption_resolution,[],[f124,f53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU172+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n019.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 03:52:33 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.42 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.11/0.46 % (3644414)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (3644423)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2232379661:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46 % (3644423) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3644414-3644423"...
% 0.11/0.46 % (3644423)...printing done.
% 0.11/0.46 % (3644420)% WARNING: option uhcvi not known.
% 0.11/0.46 % (3644423)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Theorem for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (3644423)------------------------------
% 0.11/0.46 % (3644423)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (3644423)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (3644423)CaDiCaL version: 2.1.3
% 0.11/0.46 % (3644423)Termination reason: Refutation
% 0.11/0.46 % (3644423)Time elapsed: 0.002 s
% 0.11/0.46 % (3644423)Peak memory usage: 12 MB
% 0.11/0.46 % (3644423)Instructions burned: 4 (million)
% 0.11/0.46 % (3644414)Success in time 0.038 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------