%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET798+4 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:44:38 PM UTC 2026
% Result : Theorem 0.08s 0.44s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 52 ( 16 ~; 10 |; 14 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 49 ( 39 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(f15,axiom,
! [X0,X1,X2] :
( lower_bound(X2,X0,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X0,X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',lower_bound) ).
fof(f22,conjecture,
! [X0,X1] :
( order(X0,X1)
=> ! [X2,X3] :
( ( subset(X2,X1)
& subset(X3,X1)
& subset(X2,X3) )
=> ! [X4] :
( lower_bound(X4,X0,X3)
=> lower_bound(X4,X0,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV10) ).
fof(f23,negated_conjecture,
~ ! [X0,X1] :
( order(X0,X1)
=> ! [X2,X3] :
( ( subset(X2,X1)
& subset(X3,X1)
& subset(X2,X3) )
=> ! [X4] :
( lower_bound(X4,X0,X3)
=> lower_bound(X4,X0,X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f26,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f30,plain,
! [X0,X1,X2] :
( lower_bound(X2,X0,X1)
<=> ! [X3] :
( apply(X0,X2,X3)
| ~ member(X3,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f31,plain,
? [X0,X1] :
( ? [X2,X3] :
( ? [X4] :
( ~ lower_bound(X4,X0,X2)
& lower_bound(X4,X0,X3) )
& subset(X2,X1)
& subset(X3,X1)
& subset(X2,X3) )
& order(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f32,plain,
? [X0,X1] :
( ? [X2,X3] :
( ? [X4] :
( ~ lower_bound(X4,X0,X2)
& lower_bound(X4,X0,X3) )
& subset(X2,X1)
& subset(X3,X1)
& subset(X2,X3) )
& order(X0,X1) ),
inference(flattening,[],[f31]) ).
fof(f33,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f62,plain,
! [X2,X3,X0,X1] :
( ~ lower_bound(X2,X0,X1)
| apply(X0,X2,X3)
| ~ member(X3,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f63,plain,
! [X2,X0,X1] :
( lower_bound(X2,X0,X1)
| member(sK3(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f64,plain,
! [X2,X0,X1] :
( lower_bound(X2,X0,X1)
| ~ apply(X0,X2,sK3(X0,X1,X2)) ),
inference(cnf_transformation,[],[f30]) ).
fof(f65,plain,
lower_bound(sK8,sK4,sK7),
inference(cnf_transformation,[],[f32]) ).
fof(f66,plain,
~ lower_bound(sK8,sK4,sK6),
inference(cnf_transformation,[],[f32]) ).
fof(f67,plain,
subset(sK6,sK7),
inference(cnf_transformation,[],[f32]) ).
fof(f81,plain,
! [X0] :
( member(X0,sK7)
| ~ member(X0,sK6) ),
inference(resolution,[],[f33,f67]) ).
fof(f156,plain,
member(sK3(sK4,sK6,sK8),sK6),
inference(resolution,[],[f63,f66]) ).
fof(f202,plain,
! [X0] :
( apply(sK4,sK8,X0)
| ~ member(X0,sK7) ),
inference(resolution,[],[f62,f65]) ).
fof(f204,plain,
~ apply(sK4,sK8,sK3(sK4,sK6,sK8)),
inference(resolution,[],[f64,f66]) ).
fof(f206,plain,
~ member(sK3(sK4,sK6,sK8),sK7),
inference(resolution,[],[f204,f202]) ).
fof(f208,plain,
~ member(sK3(sK4,sK6,sK8),sK6),
inference(resolution,[],[f206,f81]) ).
fof(f209,plain,
$false,
inference(forward_subsumption_resolution,[],[f208,f156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET798+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.37 % Computer : n004.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Mon Sep 28 02:49:52 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.39 Running first-order model finding
% 0.08/0.39 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.08/0.44 % (4102006)Will run a generic schedule for satisfiability detection.
% 0.08/0.44 % (4102013)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2098772906:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.44 % (4102012)% WARNING: option uhcvi not known.
% 0.08/0.44 % (4102015)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=639561395:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.44 % (4102011)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2157869644_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.44 % (4102017)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3882001347:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.44 % (4102014)dis+10_1_sil=32000:sp=arity:random_seed=3932267380:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.44 % (4102016)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=101006539:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.44 % (4102012)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2915605240:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.44 % TRYING [1]
% 0.08/0.44 % TRYING [2]
% 0.08/0.44 % TRYING [3]
% 0.08/0.44 % TRYING [4]
% 0.08/0.44 % (4102015) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4102006-4102015"...
% 0.08/0.44 % (4102015)...printing done.
% 0.08/0.44 % (4102015)Refutation found. Thanks to Tanya!
% 0.08/0.44 % SZS status Theorem for theBenchmark
% 0.08/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.44 % (4102015)------------------------------
% 0.08/0.44 % (4102015)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.44 % (4102015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.44 % (4102015)CaDiCaL version: 2.1.3
% 0.08/0.44 % (4102015)Termination reason: Refutation
% 0.08/0.44 % (4102015)Time elapsed: 0.008 s
% 0.08/0.44 % (4102015)Peak memory usage: 12 MB
% 0.08/0.44 % (4102015)Instructions burned: 10 (million)
% 0.08/0.44 % (4102006)Success in time 0.042 s
% 0.08/0.44 % Vampire exiting
%------------------------------------------------------------------------------