%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU130+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 : n003.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:01 PM UTC 2026
% Result : Theorem 0.15s 0.47s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 121 ( 25 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 143 ( 51 ~; 56 |; 29 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 63 ( 56 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f14,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f24,plain,
? [X0,X1] :
( set_intersection2(X0,X1) != X0
& subset(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f30,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f31,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f30]) ).
fof(f32,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f31]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f34]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK1(X0,X1,X2),X0)
| ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X2) )
& ( ( in(sK1(X0,X1,X2),X0)
& in(sK1(X0,X1,X2),X1) )
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f35]) ).
fof(f39,plain,
( sK4 != set_intersection2(sK4,sK5)
& subset(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X0,sK4),skolemize(X1,sK5)],[f24]) ).
fof(f41,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f45,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f51,plain,
! [X2,X0,X1] :
( in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X2)
| set_intersection2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f36]) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ in(sK1(X0,X1,X2),X0)
| set_intersection2(X0,X1) = X2
| ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f36]) ).
fof(f60,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f39]) ).
fof(f61,plain,
sK4 != set_intersection2(sK4,sK5),
inference(cnf_transformation,[],[f39]) ).
fof(f114,plain,
! [X0] :
( ~ in(X0,sK4)
| in(X0,sK5) ),
inference(resolution,[],[f45,f60]) ).
fof(f132,plain,
! [X0,X1] :
( in(sK1(X0,X1,X1),X1)
| set_intersection2(X0,X1) = X1 ),
inference(factoring,[],[f51]) ).
fof(f243,plain,
! [X0] :
( in(sK1(X0,sK4,sK4),sK5)
| sK4 = set_intersection2(X0,sK4) ),
inference(resolution,[],[f132,f114]) ).
fof(f333,plain,
( sK4 = set_intersection2(sK5,sK4)
| sK4 = set_intersection2(sK5,sK4)
| ~ in(sK1(sK5,sK4,sK4),sK4)
| ~ in(sK1(sK5,sK4,sK4),sK4) ),
inference(resolution,[],[f243,f53]) ).
fof(f339,plain,
( sK4 = set_intersection2(sK5,sK4)
| ~ in(sK1(sK5,sK4,sK4),sK4) ),
inference(duplicate_literal_removal,[],[f333]) ).
fof(f340,plain,
sK4 = set_intersection2(sK5,sK4),
inference(forward_subsumption_resolution,[],[f339,f132]) ).
fof(f341,plain,
sK4 = set_intersection2(sK4,sK5),
inference(forward_demodulation,[],[f340,f41]) ).
fof(f342,plain,
$false,
inference(forward_subsumption_resolution,[],[f341,f61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU130+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 : n003.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:41:27 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.15/0.47 % (1162349)Will run a generic schedule for satisfiability detection.
% 0.15/0.47 % (1162360)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3807092751:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.47 % (1162355)% WARNING: option uhcvi not known.
% 0.15/0.47 % (1162354)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2098603465_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.47 % (1162358)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2376498876:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.47 % (1162359)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3798693469:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.47 % (1162356)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3095075803:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.47 % (1162355)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=639568665:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.47 % (1162357)dis+10_1_sil=32000:sp=arity:random_seed=3736383184:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.47 % TRYING [1]
% 0.15/0.47 % TRYING [2]
% 0.15/0.47 % TRYING [3]
% 0.15/0.47 % TRYING [4]
% 0.15/0.47 % (1162359) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1162349-1162359"...
% 0.15/0.47 % (1162359)...printing done.
% 0.15/0.47 % (1162359)Refutation found. Thanks to Tanya!
% 0.15/0.47 % SZS status Theorem for theBenchmark
% 0.15/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47 % (1162359)------------------------------
% 0.15/0.47 % (1162359)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.47 % (1162359)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.47 % (1162359)CaDiCaL version: 2.1.3
% 0.15/0.47 % (1162359)Termination reason: Refutation
% 0.15/0.47 % (1162359)Time elapsed: 0.020 s
% 0.15/0.47 % (1162359)Peak memory usage: 11 MB
% 0.15/0.47 % (1162359)Instructions burned: 16 (million)
% 0.15/0.47 % (1162349)Success in time 0.053 s
% 0.15/0.47 % Vampire exiting
%------------------------------------------------------------------------------