%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET734+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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:31 PM UTC 2026
% Result : Theorem 0.17s 0.52s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 5 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 100 ( 36 ~; 30 |; 20 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-5 aty)
% Number of variables : 94 ( 80 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( member(X5,X2)
& member(X6,X4) )
=> ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
<=> ? [X7] :
( member(X7,X3)
& apply(X1,X5,X7)
& apply(X0,X7,X6) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',compose_function) ).
fof(f16,axiom,
! [X0,X1] :
( identity(X0,X1)
<=> ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',identity) ).
fof(f18,axiom,
! [X0,X1,X2] :
( surjective(X0,X1,X2)
<=> ! [X3] :
( member(X3,X2)
=> ? [X4] :
( member(X4,X1)
& apply(X0,X4,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',surjective) ).
fof(f29,conjecture,
! [X0,X1,X2,X3] :
( ( maps(X1,X2,X3)
& maps(X0,X3,X2)
& identity(compose_function(X1,X0,X3,X2,X3),X3) )
=> surjective(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thII25) ).
fof(f30,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( maps(X1,X2,X3)
& maps(X0,X3,X2)
& identity(compose_function(X1,X0,X3,X2,X3),X3) )
=> surjective(X1,X2,X3) ),
inference(negated_conjecture,[status(cth)],[f29]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ! [X3] :
( member(X3,X2)
=> ? [X4] :
( member(X4,X1)
& apply(X0,X4,X3) ) )
=> surjective(X0,X1,X2) ),
inference(unused_predicate_definition_removal,[],[f18]) ).
fof(f34,plain,
! [X0,X1] :
( identity(X0,X1)
=> ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f39,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
<=> ? [X7] :
( member(X7,X3)
& apply(X1,X5,X7)
& apply(X0,X7,X6) ) )
| ~ member(X5,X2)
| ~ member(X6,X4) ),
inference(ennf_transformation,[],[f14]) ).
fof(f40,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
<=> ? [X7] :
( member(X7,X3)
& apply(X1,X5,X7)
& apply(X0,X7,X6) ) )
| ~ member(X5,X2)
| ~ member(X6,X4) ),
inference(flattening,[],[f39]) ).
fof(f41,plain,
! [X0,X1] :
( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
| ~ identity(X0,X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f42,plain,
! [X0,X1,X2] :
( surjective(X0,X1,X2)
| ? [X3] :
( ! [X4] :
( ~ member(X4,X1)
| ~ apply(X0,X4,X3) )
& member(X3,X2) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f45,plain,
? [X0,X1,X2,X3] :
( ~ surjective(X1,X2,X3)
& maps(X1,X2,X3)
& maps(X0,X3,X2)
& identity(compose_function(X1,X0,X3,X2,X3),X3) ),
inference(ennf_transformation,[],[f30]) ).
fof(f46,plain,
? [X0,X1,X2,X3] :
( ~ surjective(X1,X2,X3)
& maps(X1,X2,X3)
& maps(X0,X3,X2)
& identity(compose_function(X1,X0,X3,X2,X3),X3) ),
inference(flattening,[],[f45]) ).
fof(f76,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( apply(X0,sK4(X0,X1,X3,X5,X6),X6)
| ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(cnf_transformation,[],[f40]) ).
fof(f78,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
| ~ member(X5,X2)
| member(sK4(X0,X1,X3,X5,X6),X3)
| ~ member(X6,X4) ),
inference(cnf_transformation,[],[f40]) ).
fof(f80,plain,
! [X2,X0,X1] :
( ~ identity(X0,X1)
| ~ member(X2,X1)
| apply(X0,X2,X2) ),
inference(cnf_transformation,[],[f41]) ).
fof(f81,plain,
! [X2,X0,X1,X4] :
( surjective(X0,X1,X2)
| ~ member(X4,X1)
| ~ apply(X0,X4,sK5(X0,X1,X2)) ),
inference(cnf_transformation,[],[f42]) ).
fof(f82,plain,
! [X2,X0,X1] :
( surjective(X0,X1,X2)
| member(sK5(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f42]) ).
fof(f99,plain,
identity(compose_function(sK11,sK10,sK13,sK12,sK13),sK13),
inference(cnf_transformation,[],[f46]) ).
fof(f102,plain,
~ surjective(sK11,sK12,sK13),
inference(cnf_transformation,[],[f46]) ).
fof(f201,plain,
! [X0] :
( apply(compose_function(sK11,sK10,sK13,sK12,sK13),X0,X0)
| ~ member(X0,sK13) ),
inference(resolution,[],[f80,f99]) ).
fof(f202,plain,
member(sK5(sK11,sK12,sK13),sK13),
inference(resolution,[],[f82,f102]) ).
fof(f443,plain,
! [X0] :
( ~ apply(sK11,X0,sK5(sK11,sK12,sK13))
| ~ member(X0,sK12) ),
inference(resolution,[],[f81,f102]) ).
fof(f478,plain,
! [X0] :
( ~ member(X0,sK13)
| member(sK4(sK11,sK10,sK12,X0,X0),sK12)
| ~ member(X0,sK13)
| ~ member(X0,sK13) ),
inference(resolution,[],[f78,f201]) ).
fof(f483,plain,
! [X0] :
( member(sK4(sK11,sK10,sK12,X0,X0),sK12)
| ~ member(X0,sK13) ),
inference(duplicate_literal_removal,[],[f478]) ).
fof(f509,plain,
! [X0] :
( apply(sK11,sK4(sK11,sK10,sK12,X0,X0),X0)
| ~ member(X0,sK13)
| ~ member(X0,sK13)
| ~ member(X0,sK13) ),
inference(resolution,[],[f76,f201]) ).
fof(f513,plain,
! [X0] :
( apply(sK11,sK4(sK11,sK10,sK12,X0,X0),X0)
| ~ member(X0,sK13) ),
inference(duplicate_literal_removal,[],[f509]) ).
fof(f646,plain,
( ~ member(sK5(sK11,sK12,sK13),sK13)
| ~ member(sK4(sK11,sK10,sK12,sK5(sK11,sK12,sK13),sK5(sK11,sK12,sK13)),sK12) ),
inference(resolution,[],[f513,f443]) ).
fof(f659,plain,
~ member(sK5(sK11,sK12,sK13),sK13),
inference(forward_subsumption_resolution,[],[f646,f483]) ).
fof(f660,plain,
$false,
inference(forward_subsumption_resolution,[],[f659,f202]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET734+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 % Computer : n007.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Mon Sep 28 02:38:10 UTC 2026
% 0.12/0.41 % CPUTime :
% 0.12/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.44 Running first-order model finding
% 0.12/0.44 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.17/0.52 % (1975280)Will run a generic schedule for satisfiability detection.
% 0.17/0.52 % (1975288)dis+10_1_sil=32000:sp=arity:random_seed=1566306819:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.52 % (1975286)% WARNING: option uhcvi not known.
% 0.17/0.52 % (1975289)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2613677493:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.52 % (1975285)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=50041819_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.52 % (1975286)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1762752024:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.52 % (1975287)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=603450380:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.52 % (1975290)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2776489857:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.52 % (1975291)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1778150730:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.52 % TRYING [1]
% 0.17/0.52 % TRYING [2]
% 0.17/0.52 % TRYING [3]
% 0.17/0.52 % (1975289) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1975280-1975289"...
% 0.17/0.52 % (1975289)...printing done.
% 0.17/0.52 % (1975288)Instruction limit reached!
% 0.17/0.52 % (1975288)------------------------------
% 0.17/0.52 % (1975288)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.52 % (1975288)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.52 % (1975288)CaDiCaL version: 2.1.3
% 0.17/0.52 % (1975288)Termination reason: Instruction limit
% 0.17/0.52 % (1975288)Termination phase: Saturation
% 0.17/0.52 % (1975288)Time elapsed: 0.035 s
% 0.17/0.52 % (1975288)Peak memory usage: 12 MB
% 0.17/0.52 % (1975288)Instructions burned: 103 (million)
% 0.17/0.52 % (1975289)Refutation found. Thanks to Tanya!
% 0.17/0.52 % SZS status Theorem for theBenchmark
% 0.17/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.52 % (1975289)------------------------------
% 0.17/0.52 % (1975289)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.52 % (1975289)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.52 % (1975289)CaDiCaL version: 2.1.3
% 0.17/0.52 % (1975289)Termination reason: Refutation
% 0.17/0.52 % (1975289)Time elapsed: 0.026 s
% 0.17/0.52 % (1975289)Peak memory usage: 12 MB
% 0.17/0.52 % (1975289)Instructions burned: 39 (million)
% 0.17/0.52 % (1975280)Success in time 0.072 s
% 0.17/0.52 % Vampire exiting
%------------------------------------------------------------------------------