%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PUZ056-2.005 : TPTP v9.3.1. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:31:24 PM UTC 2026
% Result : Unsatisfiable 2.61s 1.30s
% Output : Refutation 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 79
% Number of leaves : 13
% Syntax : Number of formulae : 92 ( 40 unt; 0 def)
% Number of atoms : 231 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 357 ( 218 ~; 139 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-5 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 118 ( 118 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1,X4,X5] :
( p(X5,X1,X2,X3,X4)
| ~ p(X0,X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule1) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X4,X5] :
( p(X0,X5,X2,X3,X4)
| ~ neq(X0,X1)
| ~ neq(X0,X5)
| ~ p(X0,X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule2) ).
fof(f3,axiom,
! [X2,X3,X0,X1,X4,X5] :
( p(X0,X1,X5,X3,X4)
| ~ neq(X0,X2)
| ~ neq(X0,X5)
| ~ neq(X1,X2)
| ~ neq(X1,X5)
| ~ p(X0,X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule3) ).
fof(f4,axiom,
! [X2,X3,X0,X1,X4,X5] :
( p(X0,X1,X2,X5,X4)
| ~ neq(X0,X3)
| ~ neq(X0,X5)
| ~ neq(X1,X3)
| ~ neq(X1,X5)
| ~ neq(X2,X3)
| ~ neq(X2,X5)
| ~ p(X0,X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule4) ).
fof(f5,axiom,
! [X2,X3,X0,X1,X4,X5] :
( p(X0,X1,X2,X3,X5)
| ~ neq(X0,X4)
| ~ neq(X0,X5)
| ~ neq(X1,X4)
| ~ neq(X1,X5)
| ~ neq(X2,X4)
| ~ neq(X2,X5)
| ~ neq(X3,X4)
| ~ neq(X3,X5)
| ~ p(X0,X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule5) ).
fof(f7,axiom,
neq(s0,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq2) ).
fof(f8,axiom,
neq(s0,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq3) ).
fof(f9,axiom,
neq(s1,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq4) ).
fof(f11,axiom,
neq(s1,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq6) ).
fof(f12,axiom,
neq(s2,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq7) ).
fof(f13,axiom,
neq(s2,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq8) ).
fof(f15,axiom,
p(s0,s0,s0,s0,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',init) ).
fof(f16,negated_conjecture,
~ p(s2,s2,s2,s2,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
fof(f17,plain,
! [X0] : ~ p(X0,s2,s2,s2,s2),
inference(resolution,[],[f1,f16]) ).
fof(f20,plain,
! [X0,X1] :
( ~ neq(X0,s2)
| ~ neq(X0,X1)
| ~ p(X0,X1,s2,s2,s2) ),
inference(resolution,[],[f2,f17]) ).
fof(f21,plain,
! [X0] :
( ~ neq(s0,X0)
| ~ p(s0,X0,s2,s2,s2) ),
inference(resolution,[],[f20,f8]) ).
fof(f28,plain,
~ p(s0,s1,s2,s2,s2),
inference(resolution,[],[f21,f7]) ).
fof(f36,plain,
! [X0] : ~ p(X0,s1,s2,s2,s2),
inference(resolution,[],[f28,f1]) ).
fof(f47,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ neq(X0,s2)
| ~ neq(s1,X1)
| ~ neq(s1,s2)
| ~ p(X0,s1,X1,s2,s2) ),
inference(resolution,[],[f36,f3]) ).
fof(f51,plain,
! [X0,X1] :
( ~ neq(s1,X1)
| ~ neq(X0,s2)
| ~ neq(X0,X1)
| ~ p(X0,s1,X1,s2,s2) ),
inference(forward_subsumption_resolution,[],[f47,f11]) ).
fof(f84,plain,
! [X0] :
( ~ neq(s1,X0)
| ~ neq(s1,s2)
| ~ p(s1,s1,X0,s2,s2) ),
inference(factoring,[],[f51]) ).
fof(f87,plain,
! [X0] :
( ~ neq(s1,X0)
| ~ p(s1,s1,X0,s2,s2) ),
inference(forward_subsumption_resolution,[],[f84,f11]) ).
fof(f96,plain,
~ p(s1,s1,s0,s2,s2),
inference(resolution,[],[f87,f9]) ).
fof(f103,plain,
! [X0] : ~ p(X0,s1,s0,s2,s2),
inference(resolution,[],[f96,f1]) ).
fof(f126,plain,
! [X0,X1] :
( ~ neq(X0,s1)
| ~ neq(X0,X1)
| ~ p(X0,X1,s0,s2,s2) ),
inference(resolution,[],[f103,f2]) ).
fof(f143,plain,
! [X0] :
( ~ neq(s2,X0)
| ~ p(s2,X0,s0,s2,s2) ),
inference(resolution,[],[f126,f13]) ).
fof(f149,plain,
~ p(s2,s0,s0,s2,s2),
inference(resolution,[],[f143,f12]) ).
fof(f161,plain,
! [X0] : ~ p(X0,s0,s0,s2,s2),
inference(resolution,[],[f149,f1]) ).
fof(f171,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ neq(X0,s2)
| ~ neq(s0,X1)
| ~ neq(s0,s2)
| ~ neq(s0,X1)
| ~ neq(s0,s2)
| ~ p(X0,s0,s0,X1,s2) ),
inference(resolution,[],[f161,f4]) ).
fof(f175,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ neq(X0,s2)
| ~ neq(s0,X1)
| ~ neq(s0,s2)
| ~ p(X0,s0,s0,X1,s2) ),
inference(duplicate_literal_removal,[],[f171]) ).
fof(f177,plain,
! [X0,X1] :
( ~ neq(s0,X1)
| ~ neq(X0,s2)
| ~ neq(X0,X1)
| ~ p(X0,s0,s0,X1,s2) ),
inference(forward_subsumption_resolution,[],[f175,f8]) ).
fof(f261,plain,
! [X0] :
( ~ neq(s0,X0)
| ~ neq(s0,s2)
| ~ p(s0,s0,s0,X0,s2) ),
inference(factoring,[],[f177]) ).
fof(f264,plain,
! [X0] :
( ~ neq(s0,X0)
| ~ p(s0,s0,s0,X0,s2) ),
inference(forward_subsumption_resolution,[],[f261,f8]) ).
fof(f273,plain,
~ p(s0,s0,s0,s1,s2),
inference(resolution,[],[f264,f7]) ).
fof(f285,plain,
! [X0] : ~ p(X0,s0,s0,s1,s2),
inference(resolution,[],[f273,f1]) ).
fof(f301,plain,
! [X0,X1] :
( ~ neq(X0,s0)
| ~ neq(X0,X1)
| ~ p(X0,X1,s0,s1,s2) ),
inference(resolution,[],[f285,f2]) ).
fof(f337,plain,
! [X0] :
( ~ neq(s1,X0)
| ~ p(s1,X0,s0,s1,s2) ),
inference(resolution,[],[f301,f9]) ).
fof(f380,plain,
~ p(s1,s2,s0,s1,s2),
inference(resolution,[],[f337,f11]) ).
fof(f392,plain,
! [X0] : ~ p(X0,s2,s0,s1,s2),
inference(resolution,[],[f380,f1]) ).
fof(f420,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ neq(X0,s0)
| ~ neq(s2,X1)
| ~ neq(s2,s0)
| ~ p(X0,s2,X1,s1,s2) ),
inference(resolution,[],[f392,f3]) ).
fof(f423,plain,
! [X0,X1] :
( ~ neq(s2,X1)
| ~ neq(X0,s0)
| ~ neq(X0,X1)
| ~ p(X0,s2,X1,s1,s2) ),
inference(forward_subsumption_resolution,[],[f420,f12]) ).
fof(f477,plain,
! [X0] :
( ~ neq(s2,X0)
| ~ neq(s2,s0)
| ~ p(s2,s2,X0,s1,s2) ),
inference(factoring,[],[f423]) ).
fof(f480,plain,
! [X0] :
( ~ neq(s2,X0)
| ~ p(s2,s2,X0,s1,s2) ),
inference(forward_subsumption_resolution,[],[f477,f12]) ).
fof(f520,plain,
~ p(s2,s2,s1,s1,s2),
inference(resolution,[],[f480,f13]) ).
fof(f532,plain,
! [X0] : ~ p(X0,s2,s1,s1,s2),
inference(resolution,[],[f520,f1]) ).
fof(f546,plain,
! [X0,X1] :
( ~ neq(X0,s2)
| ~ neq(X0,X1)
| ~ p(X0,X1,s1,s1,s2) ),
inference(resolution,[],[f532,f2]) ).
fof(f602,plain,
! [X0] :
( ~ neq(s0,X0)
| ~ p(s0,X0,s1,s1,s2) ),
inference(resolution,[],[f546,f8]) ).
fof(f674,plain,
~ p(s0,s1,s1,s1,s2),
inference(resolution,[],[f602,f7]) ).
fof(f681,plain,
! [X0] : ~ p(X0,s1,s1,s1,s2),
inference(resolution,[],[f674,f1]) ).
fof(f739,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ neq(X0,s2)
| ~ neq(s1,X1)
| ~ neq(s1,s2)
| ~ neq(s1,X1)
| ~ neq(s1,s2)
| ~ neq(s1,X1)
| ~ neq(s1,s2)
| ~ p(X0,s1,s1,s1,X1) ),
inference(resolution,[],[f681,f5]) ).
fof(f745,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ neq(X0,s2)
| ~ neq(s1,X1)
| ~ neq(s1,s2)
| ~ p(X0,s1,s1,s1,X1) ),
inference(duplicate_literal_removal,[],[f739]) ).
fof(f746,plain,
! [X0,X1] :
( ~ neq(s1,X1)
| ~ neq(X0,s2)
| ~ neq(X0,X1)
| ~ p(X0,s1,s1,s1,X1) ),
inference(forward_subsumption_resolution,[],[f745,f11]) ).
fof(f856,plain,
! [X0] :
( ~ neq(s1,X0)
| ~ neq(s1,s2)
| ~ p(s1,s1,s1,s1,X0) ),
inference(factoring,[],[f746]) ).
fof(f859,plain,
! [X0] :
( ~ neq(s1,X0)
| ~ p(s1,s1,s1,s1,X0) ),
inference(forward_subsumption_resolution,[],[f856,f11]) ).
fof(f869,plain,
~ p(s1,s1,s1,s1,s0),
inference(resolution,[],[f859,f9]) ).
fof(f881,plain,
! [X0] : ~ p(X0,s1,s1,s1,s0),
inference(resolution,[],[f869,f1]) ).
fof(f894,plain,
! [X0,X1] :
( ~ neq(X0,s1)
| ~ neq(X0,X1)
| ~ p(X0,X1,s1,s1,s0) ),
inference(resolution,[],[f881,f2]) ).
fof(f960,plain,
! [X0] :
( ~ neq(s2,X0)
| ~ p(s2,X0,s1,s1,s0) ),
inference(resolution,[],[f894,f13]) ).
fof(f963,plain,
~ p(s2,s0,s1,s1,s0),
inference(resolution,[],[f960,f12]) ).
fof(f972,plain,
! [X0] : ~ p(X0,s0,s1,s1,s0),
inference(resolution,[],[f963,f1]) ).
fof(f984,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ neq(X0,s1)
| ~ neq(s0,X1)
| ~ neq(s0,s1)
| ~ p(X0,s0,X1,s1,s0) ),
inference(resolution,[],[f972,f3]) ).
fof(f988,plain,
! [X0,X1] :
( ~ neq(s0,X1)
| ~ neq(X0,s1)
| ~ neq(X0,X1)
| ~ p(X0,s0,X1,s1,s0) ),
inference(forward_subsumption_resolution,[],[f984,f7]) ).
fof(f1077,plain,
! [X0] :
( ~ neq(s0,X0)
| ~ neq(s0,s1)
| ~ p(s0,s0,X0,s1,s0) ),
inference(factoring,[],[f988]) ).
fof(f1080,plain,
! [X0] :
( ~ neq(s0,X0)
| ~ p(s0,s0,X0,s1,s0) ),
inference(forward_subsumption_resolution,[],[f1077,f7]) ).
fof(f1088,plain,
~ p(s0,s0,s2,s1,s0),
inference(resolution,[],[f1080,f8]) ).
fof(f1101,plain,
! [X0] : ~ p(X0,s0,s2,s1,s0),
inference(resolution,[],[f1088,f1]) ).
fof(f1117,plain,
! [X0,X1] :
( ~ neq(X0,s0)
| ~ neq(X0,X1)
| ~ p(X0,X1,s2,s1,s0) ),
inference(resolution,[],[f1101,f2]) ).
fof(f1209,plain,
! [X0] :
( ~ neq(s1,X0)
| ~ p(s1,X0,s2,s1,s0) ),
inference(resolution,[],[f1117,f9]) ).
fof(f1246,plain,
~ p(s1,s2,s2,s1,s0),
inference(resolution,[],[f1209,f11]) ).
fof(f1258,plain,
! [X0] : ~ p(X0,s2,s2,s1,s0),
inference(resolution,[],[f1246,f1]) ).
fof(f1270,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ neq(X0,s1)
| ~ neq(s2,X1)
| ~ neq(s2,s1)
| ~ neq(s2,X1)
| ~ neq(s2,s1)
| ~ p(X0,s2,s2,X1,s0) ),
inference(resolution,[],[f1258,f4]) ).
fof(f1274,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ neq(X0,s1)
| ~ neq(s2,X1)
| ~ neq(s2,s1)
| ~ p(X0,s2,s2,X1,s0) ),
inference(duplicate_literal_removal,[],[f1270]) ).
fof(f1276,plain,
! [X0,X1] :
( ~ neq(s2,X1)
| ~ neq(X0,s1)
| ~ neq(X0,X1)
| ~ p(X0,s2,s2,X1,s0) ),
inference(forward_subsumption_resolution,[],[f1274,f13]) ).
fof(f1472,plain,
! [X0] :
( ~ neq(s2,X0)
| ~ neq(s2,s1)
| ~ p(s2,s2,s2,X0,s0) ),
inference(factoring,[],[f1276]) ).
fof(f1475,plain,
! [X0] :
( ~ neq(s2,X0)
| ~ p(s2,s2,s2,X0,s0) ),
inference(forward_subsumption_resolution,[],[f1472,f13]) ).
fof(f1484,plain,
~ p(s2,s2,s2,s0,s0),
inference(resolution,[],[f1475,f12]) ).
fof(f1497,plain,
! [X0] : ~ p(X0,s2,s2,s0,s0),
inference(resolution,[],[f1484,f1]) ).
fof(f1511,plain,
! [X0,X1] :
( ~ neq(X0,s2)
| ~ neq(X0,X1)
| ~ p(X0,X1,s2,s0,s0) ),
inference(resolution,[],[f1497,f2]) ).
fof(f1623,plain,
! [X0] :
( ~ neq(s0,X0)
| ~ p(s0,X0,s2,s0,s0) ),
inference(resolution,[],[f1511,f8]) ).
fof(f1627,plain,
~ p(s0,s1,s2,s0,s0),
inference(resolution,[],[f1623,f7]) ).
fof(f1635,plain,
! [X0] : ~ p(X0,s1,s2,s0,s0),
inference(resolution,[],[f1627,f1]) ).
fof(f1644,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ neq(X0,s2)
| ~ neq(s1,X1)
| ~ neq(s1,s2)
| ~ p(X0,s1,X1,s0,s0) ),
inference(resolution,[],[f1635,f3]) ).
fof(f1647,plain,
! [X0,X1] :
( ~ neq(s1,X1)
| ~ neq(X0,s2)
| ~ neq(X0,X1)
| ~ p(X0,s1,X1,s0,s0) ),
inference(forward_subsumption_resolution,[],[f1644,f11]) ).
fof(f1850,plain,
! [X0] :
( ~ neq(s1,X0)
| ~ neq(s1,s2)
| ~ p(s1,s1,X0,s0,s0) ),
inference(factoring,[],[f1647]) ).
fof(f1853,plain,
! [X0] :
( ~ neq(s1,X0)
| ~ p(s1,s1,X0,s0,s0) ),
inference(forward_subsumption_resolution,[],[f1850,f11]) ).
fof(f1862,plain,
~ p(s1,s1,s0,s0,s0),
inference(resolution,[],[f1853,f9]) ).
fof(f1874,plain,
! [X0] : ~ p(X0,s1,s0,s0,s0),
inference(resolution,[],[f1862,f1]) ).
fof(f1888,plain,
! [X0,X1] :
( ~ neq(X0,s1)
| ~ neq(X0,X1)
| ~ p(X0,X1,s0,s0,s0) ),
inference(resolution,[],[f1874,f2]) ).
fof(f2099,plain,
! [X0] :
( ~ neq(s2,X0)
| ~ p(s2,X0,s0,s0,s0) ),
inference(resolution,[],[f1888,f13]) ).
fof(f2105,plain,
~ p(s2,s0,s0,s0,s0),
inference(resolution,[],[f2099,f12]) ).
fof(f2114,plain,
! [X0] : ~ p(X0,s0,s0,s0,s0),
inference(resolution,[],[f2105,f1]) ).
fof(f2120,plain,
$false,
inference(resolution,[],[f2114,f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ056-2.005 : TPTP v9.3.1. Released v3.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 22:34:45 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.61/1.30 % (1840006)Input is clausal, will run a generic CNF schedule.
% 2.61/1.30 % (1840014)lrs+10_1_sil=8000:sp=occurrence:random_seed=1271303153:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.61/1.30 % (1840014)Instruction limit reached!
% 2.61/1.30 % (1840014)------------------------------
% 2.61/1.30 % (1840014)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.30 % (1840014)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.30 % (1840014)CaDiCaL version: 2.1.3
% 2.61/1.30 % (1840014)Termination reason: Instruction limit
% 2.61/1.30 % (1840014)Termination phase: Saturation
% 2.61/1.30 % (1840014)Time elapsed: 0.029 s
% 2.61/1.30 % (1840014)Peak memory usage: 88 MB
% 2.61/1.30 % (1840014)Instructions burned: 111 (million)
% 2.61/1.30 % (1840015)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1439691207:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.61/1.30 % (1840013)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=234039515:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.61/1.30 % (1840011)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3946797645:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.61/1.30 % (1840012)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1771825655:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.61/1.30 % (1840017)dis-21_1_sil=8000:lcm=predicate:random_seed=2406903836:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.61/1.30 % (1840016)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1476379566:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.61/1.30 % (1840015)Instruction limit reached!
% 2.61/1.30 % (1840015)------------------------------
% 2.61/1.30 % (1840015)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.30 % (1840015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.30 % (1840015)CaDiCaL version: 2.1.3
% 2.61/1.30 % (1840015)Termination reason: Instruction limit
% 2.61/1.30 % (1840015)Termination phase: Saturation
% 2.61/1.30 % (1840015)Time elapsed: 0.048 s
% 2.61/1.30 % (1840015)Peak memory usage: 87 MB
% 2.61/1.30 % (1840015)Instructions burned: 114 (million)
% 2.61/1.30 % (1840016)First to succeed.
% 2.61/1.30 % (1840016)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1840006"
% 2.61/1.30 % (1840017)Instruction limit reached!
% 2.61/1.30 % (1840017)------------------------------
% 2.61/1.30 % (1840017)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.30 % (1840017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.30 % (1840017)CaDiCaL version: 2.1.3
% 2.61/1.30 % (1840017)Termination reason: Instruction limit
% 2.61/1.30 % (1840017)Termination phase: Saturation
% 2.61/1.30 % (1840017)Time elapsed: 0.051 s
% 2.61/1.30 % (1840017)Peak memory usage: 87 MB
% 2.61/1.30 % (1840017)Instructions burned: 118 (million)
% 2.61/1.30 % (1840019)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=2486139734:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 2.61/1.30 % (1840019)Refutation not found, incomplete strategy
% 2.61/1.30 % (1840019)------------------------------
% 2.61/1.30 % (1840019)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.30 % (1840019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.30 % (1840019)CaDiCaL version: 2.1.3
% 2.61/1.30 % (1840019)Termination reason: Refutation not found, incomplete strategy
% 2.61/1.30 % (1840019)Time elapsed: 0.0000 s
% 2.61/1.30 % (1840019)Peak memory usage: 87 MB
% 2.61/1.30 % (1840026)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=502268982:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2998 on theBenchmark for (2998ds/189Mi)
% 2.61/1.30 % (1840026)Also succeeded, but the first one will report.
% 2.61/1.30 % (1840027)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=462739232:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 2.61/1.30 % (1840019)------------------------------
% 2.61/1.30 % (1840019)------------------------------
% 2.61/1.30 % (1840027)Instruction limit reached!
% 2.61/1.30 % (1840027)------------------------------
% 2.61/1.30 % (1840027)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.30 % (1840027)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.30 % (1840027)CaDiCaL version: 2.1.3
% 2.61/1.30 % (1840027)Termination reason: Instruction limit
% 2.61/1.30 % (1840027)Termination phase: Saturation
% 2.61/1.30 % (1840027)Time elapsed: 0.091 s
% 2.61/1.30 % (1840027)Peak memory usage: 88 MB
% 2.61/1.30 % (1840027)Instructions burned: 219 (million)
% 2.61/1.30 % (1840016)Refutation found. Thanks to Tanya!
% 2.61/1.30 % SZS status Unsatisfiable for theBenchmark
% 2.61/1.30 % SZS output start Proof for theBenchmark
% See solution above
% 3.74/1.49 % (1840016)------------------------------
% 3.74/1.49 % (1840016)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/1.49 % (1840016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.49 % (1840016)CaDiCaL version: 2.1.3
% 3.74/1.49 % (1840016)Termination reason: Refutation
% 3.74/1.49 % (1840016)Time elapsed: 0.035 s
% 3.74/1.49 % (1840016)Peak memory usage: 88 MB
% 3.74/1.49 % (1840016)Instructions burned: 55 (million)
% 3.74/1.49 % (1840016)------------------------------
% 3.74/1.49 % (1840016)------------------------------
% 3.74/1.49 % (1840006)Success in time 0.45 s
% 3.74/1.49 % Vampire exiting
%------------------------------------------------------------------------------