%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL664+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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 11:59:33 AM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 144 ( 0 equ)
% Maximal formula atoms : 16 ( 8 avg)
% Number of connectives : 251 ( 124 ~; 121 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 87 ( 73 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,conjecture,
~ ? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p16(X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p12(X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p14(X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p12(X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p15(X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p13(X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p12(X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p11(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p16(X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p12(X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p14(X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p12(X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p15(X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p13(X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p12(X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p11(X1) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p16(X1) )
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X3] :
( ~ r1(X0,X3)
| p14(X3) )
| ~ ! [X4] :
( ~ r1(X0,X4)
| p12(X4) )
| ! [X5] :
( ~ r1(X0,X5)
| p15(X5) )
| ! [X6] :
( ~ r1(X0,X6)
| p13(X6) )
| ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X8] :
( ~ r1(X0,X8)
| p11(X8) ) ),
inference(rectify,[],[f3]) ).
fof(f5,plain,
? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p16(X1) )
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X3] :
( ~ r1(X0,X3)
| p14(X3) )
| ~ ! [X4] :
( ~ r1(X0,X4)
| p12(X4) )
| ! [X5] :
( ~ r1(X0,X5)
| p15(X5) )
| ! [X6] :
( ~ r1(X0,X6)
| p13(X6) )
| ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X8] :
( ~ r1(X0,X8)
| p11(X8) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p16(X1) )
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X3] :
( ~ r1(X0,X3)
| p14(X3) )
| ~ ! [X4] :
( ~ r1(X0,X4)
| p12(X4) )
| ! [X5] :
( ~ r1(X0,X5)
| p15(X5) )
| ! [X6] :
( ~ r1(X0,X6)
| p13(X6) )
| ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X8] : ~ r1(X0,X8) ),
inference(pure_predicate_removal,[],[f5]) ).
fof(f7,plain,
? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p16(X1) )
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X3] :
( ~ r1(X0,X3)
| p14(X3) )
| ~ ! [X4] :
( ~ r1(X0,X4)
| p12(X4) )
| ! [X5] :
( ~ r1(X0,X5)
| p15(X5) )
| ! [X6] : ~ r1(X0,X6)
| ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X8] : ~ r1(X0,X8) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f8,plain,
? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p16(X1) )
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X3] :
( ~ r1(X0,X3)
| p14(X3) )
| ~ ! [X4] :
( ~ r1(X0,X4)
| p12(X4) )
| ! [X5] : ~ r1(X0,X5)
| ! [X6] : ~ r1(X0,X6)
| ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X8] : ~ r1(X0,X8) ),
inference(pure_predicate_removal,[],[f7]) ).
fof(f9,plain,
? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p16(X1) )
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X4] :
( ~ r1(X0,X4)
| p12(X4) )
| ! [X5] : ~ r1(X0,X5)
| ! [X6] : ~ r1(X0,X6)
| ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X8] : ~ r1(X0,X8) ),
inference(pure_predicate_removal,[],[f8]) ).
fof(f10,plain,
? [X0] :
~ ( ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X4] :
( ~ r1(X0,X4)
| p12(X4) )
| ! [X5] : ~ r1(X0,X5)
| ! [X6] : ~ r1(X0,X6)
| ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X8] : ~ r1(X0,X8) ),
inference(pure_predicate_removal,[],[f9]) ).
fof(f11,plain,
? [X0] :
( ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
& ! [X4] :
( ~ r1(X0,X4)
| p12(X4) )
& ? [X5] : r1(X0,X5)
& ? [X6] : r1(X0,X6)
& ? [X7] :
( r1(X0,X7)
& ~ p12(X7) )
& ? [X8] : r1(X0,X8) ),
inference(ennf_transformation,[],[f10]) ).
fof(f14,plain,
! [X4] :
( p12(X4)
| ~ r1(sK0,X4) ),
inference(cnf_transformation,[],[f11]) ).
fof(f15,plain,
~ p12(sK2),
inference(cnf_transformation,[],[f11]) ).
fof(f16,plain,
r1(sK0,sK2),
inference(cnf_transformation,[],[f11]) ).
fof(f20,plain,
p12(sK2),
inference(consistent_polarity_flipping,[],[f15]) ).
fof(f21,plain,
! [X4] :
( ~ r1(sK0,X4)
| ~ p12(X4) ),
inference(consistent_polarity_flipping,[],[f14]) ).
fof(f24,plain,
~ p12(sK2),
inference(resolution,[],[f21,f16]) ).
fof(f27,plain,
$false,
inference(forward_subsumption_resolution,[],[f24,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL664+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n002.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 : Sun Sep 27 16:27:52 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/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.12/0.45 % (3717682)Will run a generic schedule for satisfiability detection.
% 0.12/0.45 % (3717688)% WARNING: option uhcvi not known.
% 0.12/0.45 % (3717688)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2140818971:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.45 % (3717688) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3717682-3717688"...
% 0.12/0.45 % (3717688)...printing done.
% 0.12/0.45 % (3717688)Refutation found. Thanks to Tanya!
% 0.12/0.45 % SZS status Theorem for theBenchmark
% 0.12/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.45 % (3717688)------------------------------
% 0.12/0.45 % (3717688)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45 % (3717688)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45 % (3717688)CaDiCaL version: 2.1.3
% 0.12/0.45 % (3717688)Termination reason: Refutation
% 0.12/0.45 % (3717688)Time elapsed: 0.001 s
% 0.12/0.45 % (3717688)Peak memory usage: 11 MB
% 0.12/0.45 % (3717688)Instructions burned: 1 (million)
% 0.12/0.45 % (3717682)Success in time 0.029 s
% 0.12/0.45 % Vampire exiting
%------------------------------------------------------------------------------