%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET578+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:43:59 PM UTC 2026
% Result : Theorem 1.65s 0.75s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 8 unt; 0 def)
% Number of atoms : 87 ( 9 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 70 ( 22 ~; 32 |; 6 &)
% ( 7 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 64 ( 61 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f2,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f3,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f7,conjecture,
! [X0,X1,X2] :
( ! [X3] :
( member(X3,X0)
<=> ( member(X3,X1)
& member(X3,X2) ) )
=> X0 = intersection(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th19) ).
fof(f8,negated_conjecture,
~ ! [X0,X1,X2] :
( ! [X3] :
( member(X3,X0)
<=> ( member(X3,X1)
& member(X3,X2) ) )
=> X0 = intersection(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f10,plain,
? [X0,X1,X2] :
( intersection(X1,X2) != X0
& ! [X3] :
( member(X3,X0)
<=> ( member(X3,X1)
& member(X3,X2) ) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f11,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f12,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f1]) ).
fof(f13,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f16,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f19,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f20,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f26,plain,
! [X3] :
( ~ member(X3,sK2)
| member(X3,sK4) ),
inference(cnf_transformation,[],[f10]) ).
fof(f27,plain,
! [X3] :
( ~ member(X3,sK2)
| member(X3,sK3) ),
inference(cnf_transformation,[],[f10]) ).
fof(f28,plain,
! [X3] :
( ~ member(X3,sK4)
| ~ member(X3,sK3)
| member(X3,sK2) ),
inference(cnf_transformation,[],[f10]) ).
fof(f29,plain,
sK2 != intersection(sK3,sK4),
inference(cnf_transformation,[],[f10]) ).
fof(f38,plain,
! [X0] :
( member(sK0(sK2,X0),sK3)
| subset(sK2,X0) ),
inference(resolution,[],[f19,f27]) ).
fof(f39,plain,
! [X0] :
( member(sK0(sK2,X0),sK4)
| subset(sK2,X0) ),
inference(resolution,[],[f19,f26]) ).
fof(f41,plain,
! [X2,X0,X1] :
( member(sK0(intersection(X0,X1),X2),X0)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[],[f19,f12]) ).
fof(f42,plain,
! [X2,X0,X1] :
( member(sK0(intersection(X0,X1),X2),X1)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[],[f19,f11]) ).
fof(f76,plain,
! [X2,X0,X1] :
( ~ member(sK0(X0,intersection(X1,X2)),X2)
| ~ member(sK0(X0,intersection(X1,X2)),X1)
| subset(X0,intersection(X1,X2)) ),
inference(resolution,[],[f13,f20]) ).
fof(f82,plain,
! [X0,X1] :
( ~ member(sK0(intersection(sK4,X0),X1),sK3)
| subset(intersection(sK4,X0),X1)
| member(sK0(intersection(sK4,X0),X1),sK2) ),
inference(resolution,[],[f41,f28]) ).
fof(f530,plain,
! [X0] :
( ~ member(sK0(sK2,intersection(X0,sK3)),X0)
| subset(sK2,intersection(X0,sK3))
| subset(sK2,intersection(X0,sK3)) ),
inference(resolution,[],[f76,f38]) ).
fof(f546,plain,
! [X0] :
( ~ member(sK0(sK2,intersection(X0,sK3)),X0)
| subset(sK2,intersection(X0,sK3)) ),
inference(duplicate_literal_removal,[],[f530]) ).
fof(f573,plain,
( subset(sK2,intersection(sK4,sK3))
| subset(sK2,intersection(sK4,sK3)) ),
inference(resolution,[],[f546,f39]) ).
fof(f577,plain,
subset(sK2,intersection(sK4,sK3)),
inference(duplicate_literal_removal,[],[f573]) ).
fof(f581,plain,
subset(sK2,intersection(sK3,sK4)),
inference(forward_demodulation,[],[f577,f17]) ).
fof(f688,plain,
( ~ subset(intersection(sK3,sK4),sK2)
| sK2 = intersection(sK3,sK4) ),
inference(resolution,[],[f581,f16]) ).
fof(f689,plain,
~ subset(intersection(sK3,sK4),sK2),
inference(forward_subsumption_resolution,[],[f688,f29]) ).
fof(f2389,plain,
! [X0] :
( subset(intersection(sK4,sK3),X0)
| member(sK0(intersection(sK4,sK3),X0),sK2)
| subset(intersection(sK4,sK3),X0) ),
inference(resolution,[],[f82,f42]) ).
fof(f2392,plain,
! [X0] :
( subset(intersection(sK4,sK3),X0)
| member(sK0(intersection(sK4,sK3),X0),sK2) ),
inference(duplicate_literal_removal,[],[f2389]) ).
fof(f2394,plain,
! [X0] :
( subset(intersection(sK3,sK4),X0)
| member(sK0(intersection(sK4,sK3),X0),sK2) ),
inference(forward_demodulation,[],[f2392,f17]) ).
fof(f2395,plain,
! [X0] :
( member(sK0(intersection(sK3,sK4),X0),sK2)
| subset(intersection(sK3,sK4),X0) ),
inference(forward_demodulation,[],[f2394,f17]) ).
fof(f4122,plain,
( subset(intersection(sK3,sK4),sK2)
| subset(intersection(sK3,sK4),sK2) ),
inference(resolution,[],[f2395,f20]) ).
fof(f4137,plain,
subset(intersection(sK3,sK4),sK2),
inference(duplicate_literal_removal,[],[f4122]) ).
fof(f4144,plain,
$false,
inference(forward_subsumption_resolution,[],[f4137,f689]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET578+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.36 % Computer : n020.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 28 02:13:34 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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
% 1.65/0.74 % (3965904)Will run a generic schedule for satisfiability detection.
% 1.65/0.74 % (3965912)dis+10_1_sil=32000:sp=arity:random_seed=3933663995:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 1.65/0.74 % (3965910)% WARNING: option uhcvi not known.
% 1.65/0.74 % (3965909)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=421785080_3000 on theBenchmark for (3000ds/0Mi)
% 1.65/0.74 % (3965910)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4212909171:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 1.65/0.74 % (3965914)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=215188816:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 1.65/0.74 % (3965913)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=922850548:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 1.65/0.74 % TRYING [1]
% 1.65/0.74 % TRYING [2]
% 1.65/0.74 % TRYING [3]
% 1.65/0.74 % TRYING [4]
% 1.65/0.74 % TRYING [5]
% 1.65/0.74 % (3965912)Instruction limit reached!
% 1.65/0.74 % (3965912)------------------------------
% 1.65/0.74 % (3965912)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.74 % (3965912)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.74 % (3965912)CaDiCaL version: 2.1.3
% 1.65/0.74 % (3965912)Termination reason: Instruction limit
% 1.65/0.74 % (3965912)Termination phase: Saturation
% 1.65/0.74 % (3965912)Time elapsed: 0.044 s
% 1.65/0.74 % (3965912)Peak memory usage: 12 MB
% 1.65/0.74 % (3965912)Instructions burned: 103 (million)
% 1.65/0.74 % (3965911)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3360564498:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 1.65/0.74 % (3965915)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1679647793:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 1.65/0.74 % (3965922)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2280138387:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.65/0.74 % TRYING [1]
% 1.65/0.74 % TRYING [2]
% 1.65/0.74 % TRYING [3]
% 1.65/0.74 % TRYING [6]
% 1.65/0.74 % TRYING [4]
% 1.65/0.74 % TRYING [5]
% 1.65/0.74 % (3965913)Instruction limit reached!
% 1.65/0.74 % (3965913)------------------------------
% 1.65/0.74 % (3965913)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.75 % (3965913)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.75 % (3965913)CaDiCaL version: 2.1.3
% 1.65/0.75 % (3965913)Termination reason: Instruction limit
% 1.65/0.75 % (3965913)Termination phase: Saturation
% 1.65/0.75 % (3965913)Time elapsed: 0.096 s
% 1.65/0.75 % (3965913)Peak memory usage: 12 MB
% 1.65/0.75 % (3965913)Instructions burned: 117 (million)
% 1.65/0.75 % (3965914)Instruction limit reached!
% 1.65/0.75 % (3965914)------------------------------
% 1.65/0.75 % (3965914)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.75 % (3965914)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.75 % (3965914)CaDiCaL version: 2.1.3
% 1.65/0.75 % (3965914)Termination reason: Instruction limit
% 1.65/0.75 % (3965914)Termination phase: Saturation
% 1.65/0.75 % (3965914)Time elapsed: 0.102 s
% 1.65/0.75 % (3965914)Peak memory usage: 12 MB
% 1.65/0.75 % (3965914)Instructions burned: 131 (million)
% 1.65/0.75 % TRYING [6]
% 1.65/0.75 % TRYING [7]
% 1.65/0.75 % (3965927)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1024941793:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.65/0.75 % (3965928)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=672980030:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.65/0.75 % (3965915)Instruction limit reached!
% 1.65/0.75 % (3965915)------------------------------
% 1.65/0.75 % (3965915)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.75 % (3965915)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.75 % (3965915)CaDiCaL version: 2.1.3
% 1.65/0.75 % (3965915)Termination reason: Instruction limit
% 1.65/0.75 % (3965915)Termination phase: Saturation
% 1.65/0.75 % (3965915)Time elapsed: 0.163 s
% 1.65/0.75 % (3965915)Peak memory usage: 13 MB
% 1.65/0.75 % (3965915)Instructions burned: 159 (million)
% 1.65/0.75 % (3965936)ott-21_1_sil=16000:fs=off:random_seed=3946667078:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 1.65/0.75 % TRYING [7]
% 1.65/0.75 % TRYING [8]
% 1.65/0.75 % (3965927)Instruction limit reached!
% 1.65/0.75 % (3965927)------------------------------
% 1.65/0.75 % (3965927)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.75 % (3965927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.75 % (3965927)CaDiCaL version: 2.1.3
% 1.65/0.75 % (3965927)Termination reason: Instruction limit
% 1.65/0.75 % (3965927)Termination phase: Saturation
% 1.65/0.75 % (3965927)Time elapsed: 0.136 s
% 1.65/0.75 % (3965927)Peak memory usage: 12 MB
% 1.65/0.75 % (3965927)Instructions burned: 131 (million)
% 1.65/0.75 % (3965928) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3965904-3965928"...
% 1.65/0.75 % (3965938)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3795980214:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 1.65/0.75 % (3965928)...printing done.
% 1.65/0.75 % (3965928)Refutation found. Thanks to Tanya!
% 1.65/0.75 % SZS status Theorem for theBenchmark
% 1.65/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 1.65/0.75 % (3965928)------------------------------
% 1.65/0.75 % (3965928)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.75 % (3965928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.75 % (3965928)CaDiCaL version: 2.1.3
% 1.65/0.75 % (3965928)Termination reason: Refutation
% 1.65/0.75 % (3965928)Time elapsed: 0.156 s
% 1.65/0.75 % (3965928)Peak memory usage: 13 MB
% 1.65/0.75 % (3965928)Instructions burned: 156 (million)
% 1.65/0.75 % (3965904)Success in time 0.33 s
% 1.65/0.75 % Vampire exiting
%------------------------------------------------------------------------------