%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET002-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:42:30 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 10 unt; 1 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 41 ( 18 ~; 22 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( member(member_of_1_not_of_2(X0,X1),X0)
| subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',subsets_axiom1) ).
fof(f3,axiom,
! [X0,X1] :
( ~ member(member_of_1_not_of_2(X0,X1),X1)
| subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',subsets_axiom2) ).
fof(f6,axiom,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_sets(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',subsets_are_set_equal_sets) ).
fof(f7,axiom,
! [X2,X3,X0,X1] :
( ~ union(X0,X1,X2)
| ~ member(X3,X2)
| member(X3,X0)
| member(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-1.ax',member_of_union_is_member_of_one_set) ).
fof(f8,axiom,
! [X2,X3,X0,X1] :
( ~ union(X0,X1,X2)
| ~ member(X3,X0)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-1.ax',member_of_set1_is_member_of_union) ).
fof(f13,axiom,
union(a,a,aUa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_union_a_is_aUa) ).
fof(f14,negated_conjecture,
~ equal_sets(aUa,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_equals_aUa) ).
fof(f20,plain,
! [X0] :
( ~ member(X0,a)
| member(X0,aUa) ),
inference(resolution,[],[f8,f13]) ).
fof(f24,plain,
! [X0] :
( member(member_of_1_not_of_2(a,X0),aUa)
| subset(a,X0) ),
inference(resolution,[],[f20,f2]) ).
fof(f25,plain,
! [X0] :
( ~ member(X0,aUa)
| member(X0,a)
| member(X0,a) ),
inference(resolution,[],[f7,f13]) ).
fof(f26,plain,
! [X0] :
( ~ member(X0,aUa)
| member(X0,a) ),
inference(duplicate_literal_removal,[],[f25]) ).
fof(f27,plain,
! [X0] :
( member(member_of_1_not_of_2(aUa,X0),a)
| subset(aUa,X0) ),
inference(resolution,[],[f26,f2]) ).
fof(f28,plain,
( subset(a,aUa)
| subset(a,aUa) ),
inference(resolution,[],[f24,f3]) ).
fof(f30,plain,
subset(a,aUa),
inference(duplicate_literal_removal,[],[f28]) ).
fof(f51,definition,
( spl0_2
<=> subset(aUa,a) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f52,plain,
( subset(aUa,a)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f75,plain,
( subset(aUa,a)
| subset(aUa,a) ),
inference(resolution,[],[f27,f3]) ).
fof(f77,plain,
subset(aUa,a),
inference(duplicate_literal_removal,[],[f75]) ).
fof(f80,plain,
spl0_2,
inference(avatar_split_clause,[],[f77,f51]) ).
fof(f119,plain,
( ~ subset(a,aUa)
| equal_sets(aUa,a)
| ~ spl0_2 ),
inference(resolution,[],[f52,f6]) ).
fof(f121,plain,
( equal_sets(aUa,a)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f119,f30]) ).
fof(f122,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f121,f14]) ).
fof(f123,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f122]) ).
cnf(s3,plain,
spl0_2,
inference(sat_conversion,[],[f80]) ).
cnf(s7,plain,
~ spl0_2,
inference(sat_conversion,[],[f123]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s3,s7]) ).
fof(f124,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n006.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 00:02:26 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 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.16/0.47 % (3468448)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (3468456)dis+10_1_sil=32000:sp=arity:random_seed=2346649380:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (3468456) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3468448-3468456"...
% 0.16/0.47 % (3468456)...printing done.
% 0.16/0.47 % (3468456)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (3468456)------------------------------
% 0.16/0.47 % (3468456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (3468456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (3468456)CaDiCaL version: 2.1.3
% 0.16/0.47 % (3468456)Termination reason: Refutation
% 0.16/0.47 % (3468456)Time elapsed: 0.002 s
% 0.16/0.47 % (3468456)Peak memory usage: 12 MB
% 0.16/0.47 % (3468456)Instructions burned: 3 (million)
% 0.16/0.47 % (3468448)Success in time 0.036 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------