%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET789+4 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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:37 PM UTC 2026
% Result : Theorem 0.12s 0.47s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 10 unt; 0 def)
% Number of atoms : 149 ( 17 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 173 ( 57 ~; 54 |; 36 &)
% ( 3 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 90 ( 82 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( order(X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X2,X3] :
( ( member(X2,X1)
& member(X3,X1) )
=> ( ( apply(X0,X2,X3)
& apply(X0,X3,X2) )
=> X2 = X3 ) )
& ! [X2,X3,X4] :
( ( member(X2,X1)
& member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X2,X3)
& apply(X0,X3,X4) )
=> apply(X0,X2,X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',order) ).
fof(f5,axiom,
! [X0,X1,X2] :
( greatest(X2,X0,X1)
<=> ( member(X2,X1)
& ! [X3] :
( member(X3,X1)
=> apply(X0,X3,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',greatest) ).
fof(f11,conjecture,
! [X0,X1,X2] :
( ( order(X0,X1)
& greatest(X2,X0,X1) )
=> ! [X3] :
( greatest(X3,X0,X1)
=> X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV1) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2] :
( ( order(X0,X1)
& greatest(X2,X0,X1) )
=> ! [X3] :
( greatest(X3,X0,X1)
=> X2 = X3 ) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,plain,
! [X0,X1] :
( order(X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X3,X4] :
( ( member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X4,X3) )
=> X3 = X4 ) )
& ! [X5,X6,X7] :
( ( member(X5,X1)
& member(X6,X1)
& member(X7,X1) )
=> ( ( apply(X0,X5,X6)
& apply(X0,X6,X7) )
=> apply(X0,X5,X7) ) ) ) ),
inference(rectify,[],[f1]) ).
fof(f14,plain,
! [X0,X1,X2] :
( greatest(X2,X0,X1)
=> ( member(X2,X1)
& ! [X3] :
( member(X3,X1)
=> apply(X0,X3,X2) ) ) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f15,plain,
! [X0,X1] :
( order(X0,X1)
=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X3,X4] :
( ( member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X4,X3) )
=> X3 = X4 ) )
& ! [X5,X6,X7] :
( ( member(X5,X1)
& member(X6,X1)
& member(X7,X1) )
=> ( ( apply(X0,X5,X6)
& apply(X0,X6,X7) )
=> apply(X0,X5,X7) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f16,plain,
! [X0,X1] :
( ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& ! [X3,X4] :
( X3 = X4
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X3)
| ~ member(X3,X1)
| ~ member(X4,X1) )
& ! [X5,X6,X7] :
( apply(X0,X5,X7)
| ~ apply(X0,X5,X6)
| ~ apply(X0,X6,X7)
| ~ member(X5,X1)
| ~ member(X6,X1)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& ! [X3,X4] :
( X3 = X4
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X3)
| ~ member(X3,X1)
| ~ member(X4,X1) )
& ! [X5,X6,X7] :
( apply(X0,X5,X7)
| ~ apply(X0,X5,X6)
| ~ apply(X0,X6,X7)
| ~ member(X5,X1)
| ~ member(X6,X1)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( member(X2,X1)
& ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) ) )
| ~ greatest(X2,X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f19,plain,
? [X0,X1,X2] :
( ? [X3] :
( X2 != X3
& greatest(X3,X0,X1) )
& order(X0,X1)
& greatest(X2,X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f20,plain,
? [X0,X1,X2] :
( ? [X3] :
( X2 != X3
& greatest(X3,X0,X1) )
& order(X0,X1)
& greatest(X2,X0,X1) ),
inference(flattening,[],[f19]) ).
fof(f22,plain,
! [X3,X0,X1,X4] :
( ~ order(X0,X1)
| ~ member(X4,X1)
| ~ member(X3,X1)
| ~ apply(X0,X4,X3)
| ~ apply(X0,X3,X4)
| X3 = X4 ),
inference(cnf_transformation,[],[f17]) ).
fof(f24,plain,
! [X2,X3,X0,X1] :
( ~ greatest(X2,X0,X1)
| ~ member(X3,X1)
| apply(X0,X3,X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ greatest(X2,X0,X1)
| member(X2,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f26,plain,
greatest(sK3,sK0,sK1),
inference(cnf_transformation,[],[f20]) ).
fof(f27,plain,
sK2 != sK3,
inference(cnf_transformation,[],[f20]) ).
fof(f28,plain,
greatest(sK2,sK0,sK1),
inference(cnf_transformation,[],[f20]) ).
fof(f29,plain,
order(sK0,sK1),
inference(cnf_transformation,[],[f20]) ).
fof(f31,plain,
! [X3,X0,X1,X4] :
( ~ apply(X0,X4,X3)
| ~ member(X4,X1)
| ~ member(X3,X1)
| order(X0,X1)
| ~ apply(X0,X3,X4)
| X3 = X4 ),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f33,plain,
~ order(sK0,sK1),
inference(consistent_polarity_flipping,[],[f29]) ).
fof(f34,plain,
member(sK3,sK1),
inference(resolution,[],[f25,f26]) ).
fof(f35,plain,
member(sK2,sK1),
inference(resolution,[],[f25,f28]) ).
fof(f36,plain,
! [X0] :
( apply(sK0,X0,sK3)
| ~ member(X0,sK1) ),
inference(resolution,[],[f24,f26]) ).
fof(f37,plain,
! [X0] :
( apply(sK0,X0,sK2)
| ~ member(X0,sK1) ),
inference(resolution,[],[f24,f28]) ).
fof(f41,plain,
! [X0,X1] :
( ~ member(sK3,X1)
| ~ member(X0,X1)
| ~ member(X0,sK1)
| order(sK0,X1)
| ~ apply(sK0,sK3,X0)
| sK3 = X0 ),
inference(resolution,[],[f36,f31]) ).
fof(f52,plain,
! [X0] :
( ~ member(X0,sK1)
| ~ member(X0,sK1)
| order(sK0,sK1)
| ~ apply(sK0,sK3,X0)
| sK3 = X0 ),
inference(resolution,[],[f41,f34]) ).
fof(f53,plain,
! [X0] :
( ~ member(X0,sK1)
| order(sK0,sK1)
| ~ apply(sK0,sK3,X0)
| sK3 = X0 ),
inference(duplicate_literal_removal,[],[f52]) ).
fof(f54,plain,
! [X0] :
( ~ member(X0,sK1)
| ~ apply(sK0,sK3,X0)
| sK3 = X0 ),
inference(forward_subsumption_resolution,[],[f53,f33]) ).
fof(f63,plain,
( ~ apply(sK0,sK3,sK2)
| sK2 = sK3 ),
inference(resolution,[],[f54,f35]) ).
fof(f64,plain,
~ apply(sK0,sK3,sK2),
inference(forward_subsumption_resolution,[],[f63,f27]) ).
fof(f68,plain,
~ member(sK3,sK1),
inference(resolution,[],[f64,f37]) ).
fof(f69,plain,
$false,
inference(forward_subsumption_resolution,[],[f68,f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET789+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n017.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 02:45:06 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.44 Running first-order model finding
% 0.12/0.44 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.47 % (3166948)Will run a generic schedule for satisfiability detection.
% 0.12/0.47 % (3166954)% WARNING: option uhcvi not known.
% 0.12/0.47 % (3166954)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1186534188:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.47 % (3166954) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3166948-3166954"...
% 0.12/0.47 % (3166954)...printing done.
% 0.12/0.47 % (3166954)Refutation found. Thanks to Tanya!
% 0.12/0.47 % SZS status Theorem for theBenchmark
% 0.12/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.48 % (3166954)------------------------------
% 0.12/0.48 % (3166954)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.48 % (3166954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.48 % (3166954)CaDiCaL version: 2.1.3
% 0.12/0.48 % (3166954)Termination reason: Refutation
% 0.12/0.48 % (3166954)Time elapsed: 0.003 s
% 0.12/0.48 % (3166954)Peak memory usage: 12 MB
% 0.12/0.48 % (3166954)Instructions burned: 3 (million)
% 0.12/0.48 % (3166948)Success in time 0.026 s
% 0.12/0.48 % Vampire exiting
%------------------------------------------------------------------------------