%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL686+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 : n012.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:00:17 PM UTC 2026
% Result : Theorem 0.09s 0.36s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 144 ( 0 equ)
% Maximal formula atoms : 20 ( 7 avg)
% Number of connectives : 245 ( 121 ~; 95 |; 29 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 66 ( 55 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ~ p3(X1)
| ! [X0] :
( ~ r1(X1,X0)
| ~ p1(X0) ) )
| ! [X1] :
( ~ r1(X0,X1)
| ~ ! [X0] :
( ~ r1(X1,X0)
| ~ ( ! [X1] :
( ~ r1(X0,X1)
| $false )
| ~ ! [X1] :
( ~ r1(X0,X1)
| ~ ( ( p2(X1)
& ~ p1(X1) )
| ( ~ p2(X1)
& p1(X1) ) ) )
| ! [X1] :
( ~ r1(X0,X1)
| p3(X1) )
| ! [X1] :
( ~ r1(X0,X1)
| ( ~ p1(X1)
& ~ p2(X1) )
| ( p2(X1)
& p1(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ~ p3(X1)
| ! [X0] :
( ~ r1(X1,X0)
| ~ p1(X0) ) )
| ! [X1] :
( ~ r1(X0,X1)
| ~ ! [X0] :
( ~ r1(X1,X0)
| ~ ( ! [X1] :
( ~ r1(X0,X1)
| $false )
| ~ ! [X1] :
( ~ r1(X0,X1)
| ~ ( ( p2(X1)
& ~ p1(X1) )
| ( ~ p2(X1)
& p1(X1) ) ) )
| ! [X1] :
( ~ r1(X0,X1)
| p3(X1) )
| ! [X1] :
( ~ r1(X0,X1)
| ( ~ p1(X1)
& ~ p2(X1) )
| ( p2(X1)
& p1(X1) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ~ p3(X1)
| ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
| ! [X3] :
( ~ r1(X0,X3)
| ~ ! [X4] :
( ~ r1(X3,X4)
| ~ ( ! [X5] :
( ~ r1(X4,X5)
| $false )
| ~ ! [X6] :
( ~ r1(X4,X6)
| ~ ( ( p2(X6)
& ~ p1(X6) )
| ( ~ p2(X6)
& p1(X6) ) ) )
| ! [X7] :
( ~ r1(X4,X7)
| p3(X7) )
| ! [X8] :
( ~ r1(X4,X8)
| ( ~ p1(X8)
& ~ p2(X8) )
| ( p2(X8)
& p1(X8) ) ) ) ) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ~ p3(X1)
| ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
| ! [X3] :
( ~ r1(X0,X3)
| ~ ! [X4] :
( ~ r1(X3,X4)
| ~ ( ! [X5] :
( ~ r1(X4,X5)
| $false )
| ~ ! [X6] :
( ~ r1(X4,X6)
| ~ ( ( p2(X6)
& ~ p1(X6) )
| ( ~ p2(X6)
& p1(X6) ) ) )
| ! [X7] :
( ~ r1(X4,X7)
| p3(X7) )
| ! [X8] :
( ~ r1(X4,X8)
| ( ~ p1(X8)
& ~ p2(X8) )
| ( p2(X8)
& p1(X8) ) ) ) ) ) ),
inference(flattening,[],[f5]) ).
fof(f9,plain,
? [X0] :
( ? [X1] :
( r1(X0,X1)
& p3(X1)
& ? [X2] :
( r1(X1,X2)
& p1(X2) ) )
& ? [X3] :
( r1(X0,X3)
& ! [X4] :
( ~ r1(X3,X4)
| ( ? [X5] :
( r1(X4,X5)
& $true )
& ! [X6] :
( ~ r1(X4,X6)
| ( ( ~ p2(X6)
| p1(X6) )
& ( p2(X6)
| ~ p1(X6) ) ) )
& ? [X7] :
( r1(X4,X7)
& ~ p3(X7) )
& ? [X8] :
( r1(X4,X8)
& ( p1(X8)
| p2(X8) )
& ( ~ p2(X8)
| ~ p1(X8) ) ) ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f10,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f12,plain,
! [X6,X4] :
( ~ p2(X6)
| p1(X6)
| ~ r1(X4,X6)
| ~ r1(sK1,X4) ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
! [X6,X4] :
( p2(X6)
| ~ p1(X6)
| ~ r1(X4,X6)
| ~ r1(sK1,X4) ),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
! [X4] :
( p2(sK4(X4))
| p1(sK4(X4))
| ~ r1(sK1,X4) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X4] :
( ~ p2(sK4(X4))
| ~ p1(sK4(X4))
| ~ r1(sK1,X4) ),
inference(cnf_transformation,[],[f9]) ).
fof(f19,plain,
! [X4] :
( r1(X4,sK4(X4))
| ~ r1(sK1,X4) ),
inference(cnf_transformation,[],[f9]) ).
fof(f27,plain,
! [X0,X1] :
( p1(sK4(X0))
| ~ r1(X1,sK4(X0))
| ~ r1(sK1,X1)
| p1(sK4(X0))
| ~ r1(sK1,X0) ),
inference(resolution,[],[f12,f14]) ).
fof(f28,plain,
! [X0,X1] :
( p1(sK4(X0))
| ~ r1(X1,sK4(X0))
| ~ r1(sK1,X1)
| ~ r1(sK1,X0) ),
inference(duplicate_literal_removal,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ~ p1(sK4(X0))
| ~ r1(X1,sK4(X0))
| ~ r1(sK1,X1)
| ~ p1(sK4(X0))
| ~ r1(sK1,X0) ),
inference(resolution,[],[f13,f15]) ).
fof(f31,plain,
! [X0,X1] :
( ~ p1(sK4(X0))
| ~ r1(X1,sK4(X0))
| ~ r1(sK1,X1)
| ~ r1(sK1,X0) ),
inference(duplicate_literal_removal,[],[f29]) ).
fof(f32,plain,
! [X0,X1] :
( ~ r1(X1,sK4(X0))
| ~ r1(sK1,X1)
| ~ r1(sK1,X0) ),
inference(forward_subsumption_resolution,[],[f31,f28]) ).
fof(f33,plain,
! [X0] :
( ~ r1(sK1,X0)
| ~ r1(sK1,X0)
| ~ r1(sK1,X0) ),
inference(resolution,[],[f32,f19]) ).
fof(f35,plain,
! [X0] : ~ r1(sK1,X0),
inference(duplicate_literal_removal,[],[f33]) ).
fof(f53,plain,
$false,
inference(resolution,[],[f35,f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL686+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.05/0.31 % Computer : n012.cluster.edu
% 0.05/0.31 % Model : x86_64 x86_64
% 0.05/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31 % Memory : 8046.5625MB
% 0.05/0.31 % OS : Linux 6.8.0-71-generic
% 0.05/0.31 % CPULimit : 300
% 0.05/0.31 % WCLimit : 300
% 0.05/0.31 % DateTime : Sun Sep 27 16:38:05 UTC 2026
% 0.05/0.31 % CPUTime :
% 0.05/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.33 Running first-order model finding
% 0.09/0.33 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.09/0.36 % (2575839)Will run a generic schedule for satisfiability detection.
% 0.09/0.36 % (2575845)% WARNING: option uhcvi not known.
% 0.09/0.36 % (2575844)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3706804461_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.36 % (2575845)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2036355199:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.36 % (2575848)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3970860274:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.36 % (2575847)dis+10_1_sil=32000:sp=arity:random_seed=3873840450:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.36 % (2575846)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4270942643:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.36 % (2575849)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=332110989:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.36 % (2575850)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3096238601:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.36 % TRYING [1]
% 0.09/0.36 % TRYING [2]
% 0.09/0.36 % TRYING [3]
% 0.09/0.36 % (2575845) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2575839-2575845"...
% 0.09/0.36 % (2575848) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2575839-2575848"...
% 0.09/0.36 % (2575847) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2575839-2575847"...
% 0.09/0.36 % TRYING [4]
% 0.09/0.36 % (2575849) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2575839-2575849"...
% 0.09/0.36 % (2575848)...printing done.
% 0.09/0.36 % (2575845)...printing done.
% 0.09/0.36 % (2575850) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2575839-2575850"...
% 0.09/0.36 % (2575847)...printing done.
% 0.09/0.36 % TRYING [5]
% 0.09/0.36 % (2575848)Refutation found. Thanks to Tanya!
% 0.09/0.36 % SZS status Theorem for theBenchmark
% 0.09/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.37 % (2575848)------------------------------
% 0.09/0.37 % (2575848)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.37 % (2575848)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.37 % (2575848)CaDiCaL version: 2.1.3
% 0.09/0.37 % (2575848)Termination reason: Refutation
% 0.09/0.37 % (2575848)Time elapsed: 0.001 s
% 0.09/0.37 % (2575848)Peak memory usage: 11 MB
% 0.09/0.37 % (2575848)Instructions burned: 2 (million)
% 0.09/0.37 % (2575839)Success in time 0.028 s
% 0.09/0.37 % Vampire exiting
%------------------------------------------------------------------------------